{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s506385618", "group_id": "codeNet:p00009", "input_text": "let for_range s e step f =\n  let rec loop i =\n    if i <= e then begin f i;loop (i + step) end\n  in loop s;;\n\nlet sieve num =\n  let p = Array.make (num+1) 1 in\n  let rec loop i m =\n    if i*i < num then\n      begin\n        if p.(i) = 1 then for_range (i*i) num (i*2) (fun x -> p.(x) <- 0);\n        loop (i+m) (if m = 2 then 4 else 2)\n      end\n  in\n  p.(0) <- 0; p.(1)<-(0);\n  for_range 4 num 2 (fun x -> p.(x) <- 0);\n  for_range 9 num 6 (fun x -> p.(x) <- 0);\n  loop 5 2;\n  for i = 3 to num-1 do\n    p.(i) <- p.(i) + p.(i-1);\n  done;\n  p\n;;\n\nlet _ =\n  let p = sieve 1000000 in\n  let rec read () =\n    try let n = read_int () in\n        Printf.printf \"%d\\n\" p.(n);\n        read ()\n    with End_of_file -> ()\n  in read ()\n;;", "language": "OCaml", "metadata": {"date": 1474308521, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p00009.html", "problem_id": "p00009", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p00009/input.txt", "sample_output_relpath": "derived/input_output/data/p00009/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00009/OCaml/s506385618.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s506385618", "user_id": "u935184340"}, "prompt_components": {"gold_output": "4\n2\n5\n", "input_to_evaluate": "let for_range s e step f =\n  let rec loop i =\n    if i <= e then begin f i;loop (i + step) end\n  in loop s;;\n\nlet sieve num =\n  let p = Array.make (num+1) 1 in\n  let rec loop i m =\n    if i*i < num then\n      begin\n        if p.(i) = 1 then for_range (i*i) num (i*2) (fun x -> p.(x) <- 0);\n        loop (i+m) (if m = 2 then 4 else 2)\n      end\n  in\n  p.(0) <- 0; p.(1)<-(0);\n  for_range 4 num 2 (fun x -> p.(x) <- 0);\n  for_range 9 num 6 (fun x -> p.(x) <- 0);\n  loop 5 2;\n  for i = 3 to num-1 do\n    p.(i) <- p.(i) + p.(i-1);\n  done;\n  p\n;;\n\nlet _ =\n  let p = sieve 1000000 in\n  let rec read () =\n    try let n = read_int () in\n        Printf.printf \"%d\\n\" p.(n);\n        read ()\n    with End_of_file -> ()\n  in read ()\n;;", "problem_context": "Prime Number\n\nWrite a program which reads an integer n and prints the number of prime numbers which are less than or equal to n. A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.\n\nInput\n\nInput consists of several datasets. Each dataset has an integer n (1 ≤ n ≤ 999,999) in a line.\n\nThe number of datasets is less than or equal to 30.\n\nOutput\n\nFor each dataset, prints the number of prime numbers.\n\nSample Input\n\n10\n3\n11\n\nOutput for the Sample Input\n\n4\n2\n5", "sample_input": "10\n3\n11\n"}, "reference_outputs": ["4\n2\n5\n"], "source_document_id": "p00009", "source_text": "Prime Number\n\nWrite a program which reads an integer n and prints the number of prime numbers which are less than or equal to n. A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.\n\nInput\n\nInput consists of several datasets. Each dataset has an integer n (1 ≤ n ≤ 999,999) in a line.\n\nThe number of datasets is less than or equal to 30.\n\nOutput\n\nFor each dataset, prints the number of prime numbers.\n\nSample Input\n\n10\n3\n11\n\nOutput for the Sample Input\n\n4\n2\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 723, "cpu_time_ms": 10, "memory_kb": 10336}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s442028564", "group_id": "codeNet:p00009", "input_text": "let mod_exp x n m =\n  let rec aux acc x = function\n      0 -> acc\n    | n ->\n      aux\n        (match n land 1 with\n         | 1 -> (acc * x) mod m\n         | _ -> acc)\n        ((x * x) mod m)\n        (n asr 1)\n  in\n  aux 1 x n\n \nlet div_pow_2 n =\n  let rec aux s d = match d mod 2 with\n      0 -> aux (s+1) (d/2)\n    | _ -> s,d\n  in aux 0 n\n \nlet miller_rabin n a =\n  let s,d = div_pow_2 (n-1) in\n  let a_exp_d = mod_exp a d n in\n  let double x = mod_exp x 2 n in\n  let rec loop e = function\n      0 -> false\n    | i ->\n      match e with\n        r when r = n - 1 -> true\n      | r -> loop (double e) (i-1)\n  in\n  a_exp_d = 1 || loop a_exp_d s\n\nlet miller_rabin_test n k =\n  let rec loop = function\n      0 -> true\n    | i ->\n      let a = Random.int (n-1) |> (+) 1 in\n      match miller_rabin n a with\n        true -> loop (i-1)\n      | false -> false\n  in loop k\n\nlet count_primes n =\n  let count = ref 0 in\n  for x = 2 to n do\n    match miller_rabin_test x 20 with\n      true -> count := !count + 1\n    | false -> ()\n  done;\n  !count\n  \nlet () =\n  try\n    while true do\n      let n = read_int () in\n      Printf.printf \"%d\\n\" (count_primes n)\n    done\n  with\n    End_of_file -> ()", "language": "OCaml", "metadata": {"date": 1512127177, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p00009.html", "problem_id": "p00009", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p00009/input.txt", "sample_output_relpath": "derived/input_output/data/p00009/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00009/OCaml/s442028564.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s442028564", "user_id": "u995793569"}, "prompt_components": {"gold_output": "4\n2\n5\n", "input_to_evaluate": "let mod_exp x n m =\n  let rec aux acc x = function\n      0 -> acc\n    | n ->\n      aux\n        (match n land 1 with\n         | 1 -> (acc * x) mod m\n         | _ -> acc)\n        ((x * x) mod m)\n        (n asr 1)\n  in\n  aux 1 x n\n \nlet div_pow_2 n =\n  let rec aux s d = match d mod 2 with\n      0 -> aux (s+1) (d/2)\n    | _ -> s,d\n  in aux 0 n\n \nlet miller_rabin n a =\n  let s,d = div_pow_2 (n-1) in\n  let a_exp_d = mod_exp a d n in\n  let double x = mod_exp x 2 n in\n  let rec loop e = function\n      0 -> false\n    | i ->\n      match e with\n        r when r = n - 1 -> true\n      | r -> loop (double e) (i-1)\n  in\n  a_exp_d = 1 || loop a_exp_d s\n\nlet miller_rabin_test n k =\n  let rec loop = function\n      0 -> true\n    | i ->\n      let a = Random.int (n-1) |> (+) 1 in\n      match miller_rabin n a with\n        true -> loop (i-1)\n      | false -> false\n  in loop k\n\nlet count_primes n =\n  let count = ref 0 in\n  for x = 2 to n do\n    match miller_rabin_test x 20 with\n      true -> count := !count + 1\n    | false -> ()\n  done;\n  !count\n  \nlet () =\n  try\n    while true do\n      let n = read_int () in\n      Printf.printf \"%d\\n\" (count_primes n)\n    done\n  with\n    End_of_file -> ()", "problem_context": "Prime Number\n\nWrite a program which reads an integer n and prints the number of prime numbers which are less than or equal to n. A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.\n\nInput\n\nInput consists of several datasets. Each dataset has an integer n (1 ≤ n ≤ 999,999) in a line.\n\nThe number of datasets is less than or equal to 30.\n\nOutput\n\nFor each dataset, prints the number of prime numbers.\n\nSample Input\n\n10\n3\n11\n\nOutput for the Sample Input\n\n4\n2\n5", "sample_input": "10\n3\n11\n"}, "reference_outputs": ["4\n2\n5\n"], "source_document_id": "p00009", "source_text": "Prime Number\n\nWrite a program which reads an integer n and prints the number of prime numbers which are less than or equal to n. A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.\n\nInput\n\nInput consists of several datasets. Each dataset has an integer n (1 ≤ n ≤ 999,999) in a line.\n\nThe number of datasets is less than or equal to 30.\n\nOutput\n\nFor each dataset, prints the number of prime numbers.\n\nSample Input\n\n10\n3\n11\n\nOutput for the Sample Input\n\n4\n2\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1184, "cpu_time_ms": 10950, "memory_kb": 4296}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s856477806", "group_id": "codeNet:p02235", "input_text": "let lcs x y =\n  let m = String.length x in\n  let n = String.length y in\n  let dp = Array.make_matrix (m+1) (n+1) 0 in\n  for i = 1 to m do\n    for j = 1 to n do\n      dp.(i).(j) <-\n        if x.[i-1] = y.[j-1] then dp.(i-1).(j-1) + 1\n        else if dp.(i-1).(j) > dp.(i).(j-1) then dp.(i-1).(j)\n        else dp.(i).(j-1)\n    done\n  done;\n  dp.(m).(n)\n\nlet () =\n  let q = read_int () in\n  let rec doit i =\n    if i < q then begin\n      let x = read_line () in\n      let y = read_line () in\n      Printf.printf \"%d\\n\" (lcs x y);\n      doit (i + 1)\n    end in\n  doit 0", "language": "OCaml", "metadata": {"date": 1479563419, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02235.html", "problem_id": "p02235", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02235/input.txt", "sample_output_relpath": "derived/input_output/data/p02235/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02235/OCaml/s856477806.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s856477806", "user_id": "u809138450"}, "prompt_components": {"gold_output": "4\n3\n2\n", "input_to_evaluate": "let lcs x y =\n  let m = String.length x in\n  let n = String.length y in\n  let dp = Array.make_matrix (m+1) (n+1) 0 in\n  for i = 1 to m do\n    for j = 1 to n do\n      dp.(i).(j) <-\n        if x.[i-1] = y.[j-1] then dp.(i-1).(j-1) + 1\n        else if dp.(i-1).(j) > dp.(i).(j-1) then dp.(i-1).(j)\n        else dp.(i).(j-1)\n    done\n  done;\n  dp.(m).(n)\n\nlet () =\n  let q = read_int () in\n  let rec doit i =\n    if i < q then begin\n      let x = read_line () in\n      let y = read_line () in\n      Printf.printf \"%d\\n\" (lcs x y);\n      doit (i + 1)\n    end in\n  doit 0", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nLongest Common Subsequence\n\nFor given two sequences $X$ and $Y$, a sequence $Z$ is a common subsequence of $X$ and $Y$ if $Z$ is a subsequence of both $X$ and $Y$. For example, if $X = \\{a,b,c,b,d,a,b\\}$ and $Y = \\{b,d,c,a,b,a\\}$, the sequence $\\{b,c,a\\}$ is a common subsequence of both $X$ and $Y$. On the other hand, the sequence $\\{b,c,a\\}$ is not a longest common subsequence (LCS) of $X$ and $Y$, since it has length 3 and the sequence $\\{b,c,b,a\\}$, which is also common to both $X$ and $Y$, has length 4. The sequence $\\{b,c,b,a\\}$ is an LCS of $X$ and $Y$, since there is no common subsequence of length 5 or greater.\n\nWrite a program which finds the length of LCS of given two sequences $X$ and $Y$. The sequence consists of alphabetical characters.\n\nInput\n\nThe input consists of multiple datasets. In the first line, an integer $q$ which is the number of datasets is given. In the following $2 \\times q$ lines, each dataset which consists of the two sequences $X$ and $Y$ are given.\n\nOutput\n\nFor each dataset, print the length of LCS of $X$ and $Y$ in a line.\n\nConstraints\n\n$1 \\leq q \\leq 150$\n\n$1 \\leq$ length of $X$ and $Y$ $\\leq 1,000$\n\n$q \\leq 20$ if the dataset includes a sequence whose length is more than 100\n\nSample Input 1\n\n3\nabcbdab\nbdcaba\nabc\nabc\nabc\nbc\n\nSample Output 1\n\n4\n3\n2\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "3\nabcbdab\nbdcaba\nabc\nabc\nabc\nbc\n"}, "reference_outputs": ["4\n3\n2\n"], "source_document_id": "p02235", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nLongest Common Subsequence\n\nFor given two sequences $X$ and $Y$, a sequence $Z$ is a common subsequence of $X$ and $Y$ if $Z$ is a subsequence of both $X$ and $Y$. For example, if $X = \\{a,b,c,b,d,a,b\\}$ and $Y = \\{b,d,c,a,b,a\\}$, the sequence $\\{b,c,a\\}$ is a common subsequence of both $X$ and $Y$. On the other hand, the sequence $\\{b,c,a\\}$ is not a longest common subsequence (LCS) of $X$ and $Y$, since it has length 3 and the sequence $\\{b,c,b,a\\}$, which is also common to both $X$ and $Y$, has length 4. The sequence $\\{b,c,b,a\\}$ is an LCS of $X$ and $Y$, since there is no common subsequence of length 5 or greater.\n\nWrite a program which finds the length of LCS of given two sequences $X$ and $Y$. The sequence consists of alphabetical characters.\n\nInput\n\nThe input consists of multiple datasets. In the first line, an integer $q$ which is the number of datasets is given. In the following $2 \\times q$ lines, each dataset which consists of the two sequences $X$ and $Y$ are given.\n\nOutput\n\nFor each dataset, print the length of LCS of $X$ and $Y$ in a line.\n\nConstraints\n\n$1 \\leq q \\leq 150$\n\n$1 \\leq$ length of $X$ and $Y$ $\\leq 1,000$\n\n$q \\leq 20$ if the dataset includes a sequence whose length is more than 100\n\nSample Input 1\n\n3\nabcbdab\nbdcaba\nabc\nabc\nabc\nbc\n\nSample Output 1\n\n4\n3\n2\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 565, "cpu_time_ms": 180, "memory_kb": 18596}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s624311847", "group_id": "codeNet:p02235", "input_text": "let lcs x y =\n  let m = String.length x in\n  let n = String.length y in\n  let dp = Array.make_matrix (m + 1) (n + 1) 0 in\n  for i = 1 to m do\n    for j = 1 to n do\n      dp.(i).(j) <-\n        if x.[i-1] = y.[j-1] then dp.(i-1).(j-1) + 1\n        else\n          let x = dp.(i-1).(j) in\n          let y = dp.(i).(j-1) in\n          max x y;\n    done\n  done;\n  dp.(m).(n)\n\nlet () =\n  let q = read_int () in\n  for _ = 0 to q - 1 do\n    let x = read_line () in\n    let y = read_line () in\n    lcs x y |> Printf.printf \"%d\\n\"\n  done", "language": "OCaml", "metadata": {"date": 1500197422, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02235.html", "problem_id": "p02235", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02235/input.txt", "sample_output_relpath": "derived/input_output/data/p02235/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02235/OCaml/s624311847.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s624311847", "user_id": "u809138450"}, "prompt_components": {"gold_output": "4\n3\n2\n", "input_to_evaluate": "let lcs x y =\n  let m = String.length x in\n  let n = String.length y in\n  let dp = Array.make_matrix (m + 1) (n + 1) 0 in\n  for i = 1 to m do\n    for j = 1 to n do\n      dp.(i).(j) <-\n        if x.[i-1] = y.[j-1] then dp.(i-1).(j-1) + 1\n        else\n          let x = dp.(i-1).(j) in\n          let y = dp.(i).(j-1) in\n          max x y;\n    done\n  done;\n  dp.(m).(n)\n\nlet () =\n  let q = read_int () in\n  for _ = 0 to q - 1 do\n    let x = read_line () in\n    let y = read_line () in\n    lcs x y |> Printf.printf \"%d\\n\"\n  done", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nLongest Common Subsequence\n\nFor given two sequences $X$ and $Y$, a sequence $Z$ is a common subsequence of $X$ and $Y$ if $Z$ is a subsequence of both $X$ and $Y$. For example, if $X = \\{a,b,c,b,d,a,b\\}$ and $Y = \\{b,d,c,a,b,a\\}$, the sequence $\\{b,c,a\\}$ is a common subsequence of both $X$ and $Y$. On the other hand, the sequence $\\{b,c,a\\}$ is not a longest common subsequence (LCS) of $X$ and $Y$, since it has length 3 and the sequence $\\{b,c,b,a\\}$, which is also common to both $X$ and $Y$, has length 4. The sequence $\\{b,c,b,a\\}$ is an LCS of $X$ and $Y$, since there is no common subsequence of length 5 or greater.\n\nWrite a program which finds the length of LCS of given two sequences $X$ and $Y$. The sequence consists of alphabetical characters.\n\nInput\n\nThe input consists of multiple datasets. In the first line, an integer $q$ which is the number of datasets is given. In the following $2 \\times q$ lines, each dataset which consists of the two sequences $X$ and $Y$ are given.\n\nOutput\n\nFor each dataset, print the length of LCS of $X$ and $Y$ in a line.\n\nConstraints\n\n$1 \\leq q \\leq 150$\n\n$1 \\leq$ length of $X$ and $Y$ $\\leq 1,000$\n\n$q \\leq 20$ if the dataset includes a sequence whose length is more than 100\n\nSample Input 1\n\n3\nabcbdab\nbdcaba\nabc\nabc\nabc\nbc\n\nSample Output 1\n\n4\n3\n2\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "3\nabcbdab\nbdcaba\nabc\nabc\nabc\nbc\n"}, "reference_outputs": ["4\n3\n2\n"], "source_document_id": "p02235", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nLongest Common Subsequence\n\nFor given two sequences $X$ and $Y$, a sequence $Z$ is a common subsequence of $X$ and $Y$ if $Z$ is a subsequence of both $X$ and $Y$. For example, if $X = \\{a,b,c,b,d,a,b\\}$ and $Y = \\{b,d,c,a,b,a\\}$, the sequence $\\{b,c,a\\}$ is a common subsequence of both $X$ and $Y$. On the other hand, the sequence $\\{b,c,a\\}$ is not a longest common subsequence (LCS) of $X$ and $Y$, since it has length 3 and the sequence $\\{b,c,b,a\\}$, which is also common to both $X$ and $Y$, has length 4. The sequence $\\{b,c,b,a\\}$ is an LCS of $X$ and $Y$, since there is no common subsequence of length 5 or greater.\n\nWrite a program which finds the length of LCS of given two sequences $X$ and $Y$. The sequence consists of alphabetical characters.\n\nInput\n\nThe input consists of multiple datasets. In the first line, an integer $q$ which is the number of datasets is given. In the following $2 \\times q$ lines, each dataset which consists of the two sequences $X$ and $Y$ are given.\n\nOutput\n\nFor each dataset, print the length of LCS of $X$ and $Y$ in a line.\n\nConstraints\n\n$1 \\leq q \\leq 150$\n\n$1 \\leq$ length of $X$ and $Y$ $\\leq 1,000$\n\n$q \\leq 20$ if the dataset includes a sequence whose length is more than 100\n\nSample Input 1\n\n3\nabcbdab\nbdcaba\nabc\nabc\nabc\nbc\n\nSample Output 1\n\n4\n3\n2\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 524, "cpu_time_ms": 290, "memory_kb": 18552}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s998659382", "group_id": "codeNet:p02235", "input_text": "let lcs s1 s2 =\n  let l1 = String.length s1 in\n  let l2 = String.length s2 in\n  let dp = Array.make_matrix (l1+1) (l2+1) 0 in\n  let rec iter i j =\n    if i = l1 + 1 then dp.(l1).(l2)\n    else if j = l2 + 1 then iter (i+1) 1\n    else begin\n        if s1.[i-1] = s2.[j-1] then\n          dp.(i).(j) <- dp.(i-1).(j-1) + 1\n        else\n          dp.(i).(j) <- max dp.(i-1).(j) dp.(i).(j-1);\n        iter i (j+1)\n      end\n  in iter 1 1\n                \nlet () =\n  let n = read_int () in\n  let rec iter i =\n    if i = 0 then ()\n    else\n      let s1 = read_line () in\n      let s2 = read_line () in\n      lcs s1 s2 |> string_of_int |> print_endline;\n      iter (i-1)\n  in iter n", "language": "OCaml", "metadata": {"date": 1500596772, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02235.html", "problem_id": "p02235", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02235/input.txt", "sample_output_relpath": "derived/input_output/data/p02235/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02235/OCaml/s998659382.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s998659382", "user_id": "u049242937"}, "prompt_components": {"gold_output": "4\n3\n2\n", "input_to_evaluate": "let lcs s1 s2 =\n  let l1 = String.length s1 in\n  let l2 = String.length s2 in\n  let dp = Array.make_matrix (l1+1) (l2+1) 0 in\n  let rec iter i j =\n    if i = l1 + 1 then dp.(l1).(l2)\n    else if j = l2 + 1 then iter (i+1) 1\n    else begin\n        if s1.[i-1] = s2.[j-1] then\n          dp.(i).(j) <- dp.(i-1).(j-1) + 1\n        else\n          dp.(i).(j) <- max dp.(i-1).(j) dp.(i).(j-1);\n        iter i (j+1)\n      end\n  in iter 1 1\n                \nlet () =\n  let n = read_int () in\n  let rec iter i =\n    if i = 0 then ()\n    else\n      let s1 = read_line () in\n      let s2 = read_line () in\n      lcs s1 s2 |> string_of_int |> print_endline;\n      iter (i-1)\n  in iter n", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nLongest Common Subsequence\n\nFor given two sequences $X$ and $Y$, a sequence $Z$ is a common subsequence of $X$ and $Y$ if $Z$ is a subsequence of both $X$ and $Y$. For example, if $X = \\{a,b,c,b,d,a,b\\}$ and $Y = \\{b,d,c,a,b,a\\}$, the sequence $\\{b,c,a\\}$ is a common subsequence of both $X$ and $Y$. On the other hand, the sequence $\\{b,c,a\\}$ is not a longest common subsequence (LCS) of $X$ and $Y$, since it has length 3 and the sequence $\\{b,c,b,a\\}$, which is also common to both $X$ and $Y$, has length 4. The sequence $\\{b,c,b,a\\}$ is an LCS of $X$ and $Y$, since there is no common subsequence of length 5 or greater.\n\nWrite a program which finds the length of LCS of given two sequences $X$ and $Y$. The sequence consists of alphabetical characters.\n\nInput\n\nThe input consists of multiple datasets. In the first line, an integer $q$ which is the number of datasets is given. In the following $2 \\times q$ lines, each dataset which consists of the two sequences $X$ and $Y$ are given.\n\nOutput\n\nFor each dataset, print the length of LCS of $X$ and $Y$ in a line.\n\nConstraints\n\n$1 \\leq q \\leq 150$\n\n$1 \\leq$ length of $X$ and $Y$ $\\leq 1,000$\n\n$q \\leq 20$ if the dataset includes a sequence whose length is more than 100\n\nSample Input 1\n\n3\nabcbdab\nbdcaba\nabc\nabc\nabc\nbc\n\nSample Output 1\n\n4\n3\n2\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "3\nabcbdab\nbdcaba\nabc\nabc\nabc\nbc\n"}, "reference_outputs": ["4\n3\n2\n"], "source_document_id": "p02235", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nLongest Common Subsequence\n\nFor given two sequences $X$ and $Y$, a sequence $Z$ is a common subsequence of $X$ and $Y$ if $Z$ is a subsequence of both $X$ and $Y$. For example, if $X = \\{a,b,c,b,d,a,b\\}$ and $Y = \\{b,d,c,a,b,a\\}$, the sequence $\\{b,c,a\\}$ is a common subsequence of both $X$ and $Y$. On the other hand, the sequence $\\{b,c,a\\}$ is not a longest common subsequence (LCS) of $X$ and $Y$, since it has length 3 and the sequence $\\{b,c,b,a\\}$, which is also common to both $X$ and $Y$, has length 4. The sequence $\\{b,c,b,a\\}$ is an LCS of $X$ and $Y$, since there is no common subsequence of length 5 or greater.\n\nWrite a program which finds the length of LCS of given two sequences $X$ and $Y$. The sequence consists of alphabetical characters.\n\nInput\n\nThe input consists of multiple datasets. In the first line, an integer $q$ which is the number of datasets is given. In the following $2 \\times q$ lines, each dataset which consists of the two sequences $X$ and $Y$ are given.\n\nOutput\n\nFor each dataset, print the length of LCS of $X$ and $Y$ in a line.\n\nConstraints\n\n$1 \\leq q \\leq 150$\n\n$1 \\leq$ length of $X$ and $Y$ $\\leq 1,000$\n\n$q \\leq 20$ if the dataset includes a sequence whose length is more than 100\n\nSample Input 1\n\n3\nabcbdab\nbdcaba\nabc\nabc\nabc\nbc\n\nSample Output 1\n\n4\n3\n2\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 672, "cpu_time_ms": 310, "memory_kb": 18444}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s110874770", "group_id": "codeNet:p02240", "input_text": "let split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet dfs vs n =\n  let d = Array.make n (-1) in\n  let rec doit i j =\n    d.(i) <- j;\n    List.iter (fun v -> if d.(v) = (-1) then doit v j) vs.(i) in\n  Array.iteri (fun i e -> if e = (-1) then doit i i) d;\n  d\n\nlet () =\n  let read_ints () = read_line () |> split_on_char ' ' |>  List.map int_of_string in\n  let (n, m) = match read_ints () with\n    | [n; m] -> (n, m)\n    | _ -> assert false in\n  let vs = Array.make n [] in\n  for _ = 0 to m - 1 do\n    match read_ints () with\n    | [s; t] ->\n      vs.(s) <- t :: vs.(s);\n      vs.(t) <- s :: vs.(t);\n    | _ -> assert false\n  done;\n  let d = dfs vs n in\n  let q = read_int () in\n  for _ = 0 to q - 1 do\n    match read_ints () with\n    | [s; t] -> Printf.printf (if d.(s) = d.(t) then \"yes\\n\" else \"no\\n\")\n    | _ -> assert false\n  done", "language": "OCaml", "metadata": {"date": 1500269350, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02240.html", "problem_id": "p02240", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02240/input.txt", "sample_output_relpath": "derived/input_output/data/p02240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02240/OCaml/s110874770.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s110874770", "user_id": "u809138450"}, "prompt_components": {"gold_output": "yes\nyes\nno\n", "input_to_evaluate": "let split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet dfs vs n =\n  let d = Array.make n (-1) in\n  let rec doit i j =\n    d.(i) <- j;\n    List.iter (fun v -> if d.(v) = (-1) then doit v j) vs.(i) in\n  Array.iteri (fun i e -> if e = (-1) then doit i i) d;\n  d\n\nlet () =\n  let read_ints () = read_line () |> split_on_char ' ' |>  List.map int_of_string in\n  let (n, m) = match read_ints () with\n    | [n; m] -> (n, m)\n    | _ -> assert false in\n  let vs = Array.make n [] in\n  for _ = 0 to m - 1 do\n    match read_ints () with\n    | [s; t] ->\n      vs.(s) <- t :: vs.(s);\n      vs.(t) <- s :: vs.(t);\n    | _ -> assert false\n  done;\n  let d = dfs vs n in\n  let q = read_int () in\n  for _ = 0 to q - 1 do\n    match read_ints () with\n    | [s; t] -> Printf.printf (if d.(s) = d.(t) then \"yes\\n\" else \"no\\n\")\n    | _ -> assert false\n  done", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nConnected Components\n\nWrite a program which reads relations in a SNS (Social Network Service), and judges that given pairs of users are reachable each other through the network.\n\nInput\n\nIn the first line, two integer $n$ and $m$ are given. $n$ is the number of users in the SNS and $m$ is the number of relations in the SNS. The users in the SNS are identified by IDs $0, 1, ..., n-1$.\n\nIn the following $m$ lines, the relations are given. Each relation is given by two integers $s$ and $t$ that represents $s$ and $t$ are friends (and reachable each other).\n\nIn the next line, the number of queries $q$ is given. In the following $q$ lines, $q$ queries are given respectively. Each query consists of two integers $s$ and $t$ separated by a space character.\n\nOutput\n\nFor each query, print \"yes\" if $t$ is reachable from $s$ through the social network, \"no\" otherwise.\n\nConstraints\n\n$2 \\leq n \\leq 100,000$\n\n$0 \\leq m \\leq 100,000$\n\n$1 \\leq q \\leq 10,000$\n\nSample Input\n\n10 9\n0 1\n0 2\n3 4\n5 7\n5 6\n6 7\n6 8\n7 8\n8 9\n3\n0 1\n5 9\n1 3\n\nSample Output\n\nyes\nyes\nno", "sample_input": "10 9\n0 1\n0 2\n3 4\n5 7\n5 6\n6 7\n6 8\n7 8\n8 9\n3\n0 1\n5 9\n1 3\n"}, "reference_outputs": ["yes\nyes\nno\n"], "source_document_id": "p02240", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nConnected Components\n\nWrite a program which reads relations in a SNS (Social Network Service), and judges that given pairs of users are reachable each other through the network.\n\nInput\n\nIn the first line, two integer $n$ and $m$ are given. $n$ is the number of users in the SNS and $m$ is the number of relations in the SNS. The users in the SNS are identified by IDs $0, 1, ..., n-1$.\n\nIn the following $m$ lines, the relations are given. Each relation is given by two integers $s$ and $t$ that represents $s$ and $t$ are friends (and reachable each other).\n\nIn the next line, the number of queries $q$ is given. In the following $q$ lines, $q$ queries are given respectively. Each query consists of two integers $s$ and $t$ separated by a space character.\n\nOutput\n\nFor each query, print \"yes\" if $t$ is reachable from $s$ through the social network, \"no\" otherwise.\n\nConstraints\n\n$2 \\leq n \\leq 100,000$\n\n$0 \\leq m \\leq 100,000$\n\n$1 \\leq q \\leq 10,000$\n\nSample Input\n\n10 9\n0 1\n0 2\n3 4\n5 7\n5 6\n6 7\n6 8\n7 8\n8 9\n3\n0 1\n5 9\n1 3\n\nSample Output\n\nyes\nyes\nno", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1039, "cpu_time_ms": 40, "memory_kb": 19128}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s451867176", "group_id": "codeNet:p02240", "input_text": "open Printf\nopen Scanf\n\nlet () =\n  let n, m = scanf \"%d %d \" (fun x y -> (x, y)) in\n  let g = Array.make n [] in\n  let rec set_graph x =\n    if x = 0 then ()\n    else begin\n        let u, v = scanf \"%d %d \" (fun x y -> (x, y)) in\n        g.(u) <- v :: g.(u);\n        g.(v) <- u :: g.(v);\n        set_graph (x-1)\n      end\n  in\n  let friend u v =\n    let que = Queue.create () in\n    let vt = Array.make n true in\n    let rec loop () =\n      if Queue.is_empty que then false\n      else let i = Queue.pop que in\n           if i = v then true\n           else begin\n               List.iter (fun j ->\n                          if vt.(j) then begin\n                              Queue.push j que; \n                              vt.(j) <- false\n                            end) g.(i);\n               loop ()\n             end\n    in\n    Queue.push u que;\n    vt.(u) <- false;\n    loop ()\n  in\n  let rec iter x =\n    if x = 0 then ()\n    else begin\n        let u, v = scanf \"%d %d \" (fun x y -> (x, y)) in\n        printf \"%s\\n\" (if friend u v then \"yes\" else \"no\");\n        iter (x-1)\n      end\n  in\n  set_graph m;\n  let q = scanf \"%d \" (fun x -> x) in\n  iter q", "language": "OCaml", "metadata": {"date": 1500862421, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02240.html", "problem_id": "p02240", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02240/input.txt", "sample_output_relpath": "derived/input_output/data/p02240/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02240/OCaml/s451867176.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s451867176", "user_id": "u049242937"}, "prompt_components": {"gold_output": "yes\nyes\nno\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet () =\n  let n, m = scanf \"%d %d \" (fun x y -> (x, y)) in\n  let g = Array.make n [] in\n  let rec set_graph x =\n    if x = 0 then ()\n    else begin\n        let u, v = scanf \"%d %d \" (fun x y -> (x, y)) in\n        g.(u) <- v :: g.(u);\n        g.(v) <- u :: g.(v);\n        set_graph (x-1)\n      end\n  in\n  let friend u v =\n    let que = Queue.create () in\n    let vt = Array.make n true in\n    let rec loop () =\n      if Queue.is_empty que then false\n      else let i = Queue.pop que in\n           if i = v then true\n           else begin\n               List.iter (fun j ->\n                          if vt.(j) then begin\n                              Queue.push j que; \n                              vt.(j) <- false\n                            end) g.(i);\n               loop ()\n             end\n    in\n    Queue.push u que;\n    vt.(u) <- false;\n    loop ()\n  in\n  let rec iter x =\n    if x = 0 then ()\n    else begin\n        let u, v = scanf \"%d %d \" (fun x y -> (x, y)) in\n        printf \"%s\\n\" (if friend u v then \"yes\" else \"no\");\n        iter (x-1)\n      end\n  in\n  set_graph m;\n  let q = scanf \"%d \" (fun x -> x) in\n  iter q", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nConnected Components\n\nWrite a program which reads relations in a SNS (Social Network Service), and judges that given pairs of users are reachable each other through the network.\n\nInput\n\nIn the first line, two integer $n$ and $m$ are given. $n$ is the number of users in the SNS and $m$ is the number of relations in the SNS. The users in the SNS are identified by IDs $0, 1, ..., n-1$.\n\nIn the following $m$ lines, the relations are given. Each relation is given by two integers $s$ and $t$ that represents $s$ and $t$ are friends (and reachable each other).\n\nIn the next line, the number of queries $q$ is given. In the following $q$ lines, $q$ queries are given respectively. Each query consists of two integers $s$ and $t$ separated by a space character.\n\nOutput\n\nFor each query, print \"yes\" if $t$ is reachable from $s$ through the social network, \"no\" otherwise.\n\nConstraints\n\n$2 \\leq n \\leq 100,000$\n\n$0 \\leq m \\leq 100,000$\n\n$1 \\leq q \\leq 10,000$\n\nSample Input\n\n10 9\n0 1\n0 2\n3 4\n5 7\n5 6\n6 7\n6 8\n7 8\n8 9\n3\n0 1\n5 9\n1 3\n\nSample Output\n\nyes\nyes\nno", "sample_input": "10 9\n0 1\n0 2\n3 4\n5 7\n5 6\n6 7\n6 8\n7 8\n8 9\n3\n0 1\n5 9\n1 3\n"}, "reference_outputs": ["yes\nyes\nno\n"], "source_document_id": "p02240", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nConnected Components\n\nWrite a program which reads relations in a SNS (Social Network Service), and judges that given pairs of users are reachable each other through the network.\n\nInput\n\nIn the first line, two integer $n$ and $m$ are given. $n$ is the number of users in the SNS and $m$ is the number of relations in the SNS. The users in the SNS are identified by IDs $0, 1, ..., n-1$.\n\nIn the following $m$ lines, the relations are given. Each relation is given by two integers $s$ and $t$ that represents $s$ and $t$ are friends (and reachable each other).\n\nIn the next line, the number of queries $q$ is given. In the following $q$ lines, $q$ queries are given respectively. Each query consists of two integers $s$ and $t$ separated by a space character.\n\nOutput\n\nFor each query, print \"yes\" if $t$ is reachable from $s$ through the social network, \"no\" otherwise.\n\nConstraints\n\n$2 \\leq n \\leq 100,000$\n\n$0 \\leq m \\leq 100,000$\n\n$1 \\leq q \\leq 10,000$\n\nSample Input\n\n10 9\n0 1\n0 2\n3 4\n5 7\n5 6\n6 7\n6 8\n7 8\n8 9\n3\n0 1\n5 9\n1 3\n\nSample Output\n\nyes\nyes\nno", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1153, "cpu_time_ms": 20000, "memory_kb": 28480}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s571722766", "group_id": "codeNet:p02243", "input_text": "module MakeBinaryHeap (M : sig type t val compare : t -> t -> int end) = struct\n\n  type t = { node : M.t array; mutable size : int }\n\n  let make n (init : M.t) = { node = Array.make n init; size = 0 }\n\n  let empty_p t = if t.size = 0 then true else false\n\n  let pop t =\n    if t.size <= 0 then failwith \"out of size\" else\n    let rec max_heapify i =\n      let l = 2*i in\n      let r = 2*i + 1 in\n      let m = if l <= t.size && M.compare t.node.(l) t.node.(i) > 0 then l else i in\n      let m = if r <= t.size && M.compare t.node.(r) t.node.(m) > 0 then r else m in\n      if m = i then ()\n      else begin\n        let tmp = t.node.(i) in\n        t.node.(i) <- t.node.(m);\n        t.node.(m) <- tmp;\n        max_heapify m\n      end in\n    let ret = t.node.(1) in\n    t.node.(1) <- t.node.(t.size);\n    t.size <- t.size - 1;\n    max_heapify 1;\n    ret\n\n  let push x t =\n    let parent i = int_of_float (floor (float_of_int i) /. 2.) in\n    let rec doit i =\n      let p = parent i in\n      if i <= 1 || M.compare t.node.(p) t.node.(i) >= 0 then ()\n      else begin\n        let tmp = t.node.(i) in\n        t.node.(i) <- t.node.(p);\n        t.node.(p) <- tmp;\n        doit p\n      end in\n    t.size <- t.size + 1;\n    t.node.(t.size) <- x;\n    doit t.size\n\nend\n\nmodule H = MakeBinaryHeap(struct type t = (int * int) let compare (_, x) (_, y) = y - x end)\n\nlet dijkstra g n =\n  let reached_p = Array.make n false in\n  let min_costs = Array.make n max_int in\n  min_costs.(0) <- 0;\n  let h = H.make 100000 (0, 0) in\n  H.push (0, 0) h;\n  while not (H.empty_p h) do\n    let (u, x) = H.pop h in\n    reached_p.(u) <- true;\n    if x > min_costs.(u) then ()\n    else\n      List.iter (fun (v, c) ->\n        let x = min_costs.(u) + c in\n        if not reached_p.(v) && x < min_costs.(v) then begin\n          min_costs.(v) <- x;\n          H.push (v, x) h;\n        end) g.(u);\n  done;\n  min_costs\n\nlet rec make_pair acc = function\n  | [] -> acc\n  | v :: c :: tl -> make_pair ((v, c) :: acc) tl\n  | _ -> assert false\n\nlet make_pair lst = make_pair [] lst\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let n = read_int () in\n  let g = Array.make n [] in\n  for _ = 0 to n - 1 do\n    match read_line () |> split_on_char ' ' |> List.map int_of_string with\n    | u :: _ :: l -> g.(u) <- make_pair l\n    | _ -> assert false\n  done;\n  dijkstra g n |> Array.iteri (fun i e -> Printf.printf \"%d %d\\n\" i e)", "language": "OCaml", "metadata": {"date": 1500426358, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02243.html", "problem_id": "p02243", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02243/input.txt", "sample_output_relpath": "derived/input_output/data/p02243/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02243/OCaml/s571722766.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s571722766", "user_id": "u809138450"}, "prompt_components": {"gold_output": "0 0\n1 2\n2 2\n3 1\n4 3\n", "input_to_evaluate": "module MakeBinaryHeap (M : sig type t val compare : t -> t -> int end) = struct\n\n  type t = { node : M.t array; mutable size : int }\n\n  let make n (init : M.t) = { node = Array.make n init; size = 0 }\n\n  let empty_p t = if t.size = 0 then true else false\n\n  let pop t =\n    if t.size <= 0 then failwith \"out of size\" else\n    let rec max_heapify i =\n      let l = 2*i in\n      let r = 2*i + 1 in\n      let m = if l <= t.size && M.compare t.node.(l) t.node.(i) > 0 then l else i in\n      let m = if r <= t.size && M.compare t.node.(r) t.node.(m) > 0 then r else m in\n      if m = i then ()\n      else begin\n        let tmp = t.node.(i) in\n        t.node.(i) <- t.node.(m);\n        t.node.(m) <- tmp;\n        max_heapify m\n      end in\n    let ret = t.node.(1) in\n    t.node.(1) <- t.node.(t.size);\n    t.size <- t.size - 1;\n    max_heapify 1;\n    ret\n\n  let push x t =\n    let parent i = int_of_float (floor (float_of_int i) /. 2.) in\n    let rec doit i =\n      let p = parent i in\n      if i <= 1 || M.compare t.node.(p) t.node.(i) >= 0 then ()\n      else begin\n        let tmp = t.node.(i) in\n        t.node.(i) <- t.node.(p);\n        t.node.(p) <- tmp;\n        doit p\n      end in\n    t.size <- t.size + 1;\n    t.node.(t.size) <- x;\n    doit t.size\n\nend\n\nmodule H = MakeBinaryHeap(struct type t = (int * int) let compare (_, x) (_, y) = y - x end)\n\nlet dijkstra g n =\n  let reached_p = Array.make n false in\n  let min_costs = Array.make n max_int in\n  min_costs.(0) <- 0;\n  let h = H.make 100000 (0, 0) in\n  H.push (0, 0) h;\n  while not (H.empty_p h) do\n    let (u, x) = H.pop h in\n    reached_p.(u) <- true;\n    if x > min_costs.(u) then ()\n    else\n      List.iter (fun (v, c) ->\n        let x = min_costs.(u) + c in\n        if not reached_p.(v) && x < min_costs.(v) then begin\n          min_costs.(v) <- x;\n          H.push (v, x) h;\n        end) g.(u);\n  done;\n  min_costs\n\nlet rec make_pair acc = function\n  | [] -> acc\n  | v :: c :: tl -> make_pair ((v, c) :: acc) tl\n  | _ -> assert false\n\nlet make_pair lst = make_pair [] lst\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let n = read_int () in\n  let g = Array.make n [] in\n  for _ = 0 to n - 1 do\n    match read_line () |> split_on_char ' ' |> List.map int_of_string with\n    | u :: _ :: l -> g.(u) <- make_pair l\n    | _ -> assert false\n  done;\n  dijkstra g n |> Array.iteri (fun i e -> Printf.printf \"%d %d\\n\" i e)", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nSingle Source Shortest Path II\n\nFor a given weighted graph $G = (V, E)$, find the shortest path from a source to each vertex. For each vertex $u$, print the total weight of edges on the shortest path from vertex $0$ to $u$.\n\nInput\n\nIn the first line, an integer $n$ denoting the number of vertices in $G$ is given. In the following $n$ lines, adjacency lists for each vertex $u$ are respectively given in the following format:\n\n$u$ $k$ $v_1$ $c_1$ $v_2$ $c_2$ ... $v_k$ $c_k$\n\nVertices in $G$ are named with IDs $0, 1, ..., n-1$. $u$ is ID of the target vertex and $k$ denotes its degree. $v_i (i = 1, 2, ... k)$ denote IDs of vertices adjacent to $u$ and $c_i$ denotes the weight of a directed edge connecting $u$ and $v_i$ (from $u$ to $v_i$).\n\nOutput\n\nFor each vertex, print its ID and the distance separated by a space character in a line respectively. Print in order of vertex IDs.\n\nConstraints\n\n$1 \\leq n \\leq 10,000$\n\n$0 \\leq c_i \\leq 100,000$\n\n$|E| < 500,000$\n\nAll vertices are reachable from vertex $0$\n\nSample Input 1\n\n5\n0 3 2 3 3 1 1 2\n1 2 0 2 3 4\n2 3 0 3 3 1 4 1\n3 4 2 1 0 1 1 4 4 3\n4 2 2 1 3 3\n\nSample Output 1\n\n0 0\n1 2\n2 2\n3 1\n4 3\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "5\n0 3 2 3 3 1 1 2\n1 2 0 2 3 4\n2 3 0 3 3 1 4 1\n3 4 2 1 0 1 1 4 4 3\n4 2 2 1 3 3\n"}, "reference_outputs": ["0 0\n1 2\n2 2\n3 1\n4 3\n"], "source_document_id": "p02243", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nSingle Source Shortest Path II\n\nFor a given weighted graph $G = (V, E)$, find the shortest path from a source to each vertex. For each vertex $u$, print the total weight of edges on the shortest path from vertex $0$ to $u$.\n\nInput\n\nIn the first line, an integer $n$ denoting the number of vertices in $G$ is given. In the following $n$ lines, adjacency lists for each vertex $u$ are respectively given in the following format:\n\n$u$ $k$ $v_1$ $c_1$ $v_2$ $c_2$ ... $v_k$ $c_k$\n\nVertices in $G$ are named with IDs $0, 1, ..., n-1$. $u$ is ID of the target vertex and $k$ denotes its degree. $v_i (i = 1, 2, ... k)$ denote IDs of vertices adjacent to $u$ and $c_i$ denotes the weight of a directed edge connecting $u$ and $v_i$ (from $u$ to $v_i$).\n\nOutput\n\nFor each vertex, print its ID and the distance separated by a space character in a line respectively. Print in order of vertex IDs.\n\nConstraints\n\n$1 \\leq n \\leq 10,000$\n\n$0 \\leq c_i \\leq 100,000$\n\n$|E| < 500,000$\n\nAll vertices are reachable from vertex $0$\n\nSample Input 1\n\n5\n0 3 2 3 3 1 1 2\n1 2 0 2 3 4\n2 3 0 3 3 1 4 1\n3 4 2 1 0 1 1 4 4 3\n4 2 2 1 3 3\n\nSample Output 1\n\n0 0\n1 2\n2 2\n3 1\n4 3\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2599, "cpu_time_ms": 80, "memory_kb": 30604}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s342923519", "group_id": "codeNet:p02243", "input_text": "module MakeBinaryHeap (M : sig type t val compare : t -> t -> int end) = struct\n\n  type t = { node : M.t array; mutable size : int }\n\n  let make n (init : M.t) = { node = Array.make n init; size = 0 }\n\n  let empty_p t = if t.size = 0 then true else false\n\n  let pop t =\n    let rec max_heapify i =\n      let l = 2*i in\n      let r = 2*i + 1 in\n      let m = if l <= t.size && M.compare t.node.(l) t.node.(i) > 0 then l else i in\n      let m = if r <= t.size && M.compare t.node.(r) t.node.(m) > 0 then r else m in\n      if m = i then ()\n      else begin\n        let tmp = t.node.(i) in\n        t.node.(i) <- t.node.(m);\n        t.node.(m) <- tmp;\n        max_heapify m\n      end in\n    let ret = t.node.(1) in\n    t.node.(1) <- t.node.(t.size);\n    t.size <- t.size - 1;\n    max_heapify 1;\n    ret\n\n  let push x t =\n    let parent i = int_of_float (floor (float_of_int i) /. 2.) in\n    let rec doit i =\n      let p = parent i in\n      if i <= 1 || M.compare t.node.(p) t.node.(i) >= 0 then ()\n      else begin\n        let tmp = t.node.(i) in\n        t.node.(i) <- t.node.(p);\n        t.node.(p) <- tmp;\n        doit p\n      end in\n    t.size <- t.size + 1;\n    t.node.(t.size) <- x;\n    doit t.size\n\nend\n\nmodule H = MakeBinaryHeap(struct type t = (int * int) let compare (_, x) (_, y) = y - x end)\n\nlet dijkstra g n =\n  let reached_p = Array.make n false in\n  let d = Array.make n max_int in\n  d.(0) <- 0;\n  let h = H.make 50000 (0, 0) in\n  H.push (0, 0) h;\n  while not (H.empty_p h) do\n    let (u, x) = H.pop h in\n    reached_p.(u) <- true;\n    if x > d.(u) then ()\n    else\n      List.iter (fun (v, c) ->\n        let x = d.(u) + c in\n        if not reached_p.(v) && x < d.(v) then begin\n          d.(v) <- x;\n          H.push (v, x) h;\n        end) g.(u)\n  done;\n  d\n\nlet rec make_pair acc = function\n  | [] -> acc\n  | v :: c :: tl -> make_pair ((v, c) :: acc) tl\n  | _ -> assert false\n\nlet make_pair lst = make_pair [] lst\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let n = read_int () in\n  let g = Array.make n [] in\n  for _ = 0 to n - 1 do\n    match read_line () |> split_on_char ' ' |> List.map int_of_string with\n    | u :: _ :: l -> g.(u) <- make_pair l\n    | _ -> assert false\n  done;\n  dijkstra g n |> Array.iteri (fun i e -> Printf.printf \"%d %d\\n\" i e)", "language": "OCaml", "metadata": {"date": 1500465586, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02243.html", "problem_id": "p02243", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02243/input.txt", "sample_output_relpath": "derived/input_output/data/p02243/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02243/OCaml/s342923519.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s342923519", "user_id": "u809138450"}, "prompt_components": {"gold_output": "0 0\n1 2\n2 2\n3 1\n4 3\n", "input_to_evaluate": "module MakeBinaryHeap (M : sig type t val compare : t -> t -> int end) = struct\n\n  type t = { node : M.t array; mutable size : int }\n\n  let make n (init : M.t) = { node = Array.make n init; size = 0 }\n\n  let empty_p t = if t.size = 0 then true else false\n\n  let pop t =\n    let rec max_heapify i =\n      let l = 2*i in\n      let r = 2*i + 1 in\n      let m = if l <= t.size && M.compare t.node.(l) t.node.(i) > 0 then l else i in\n      let m = if r <= t.size && M.compare t.node.(r) t.node.(m) > 0 then r else m in\n      if m = i then ()\n      else begin\n        let tmp = t.node.(i) in\n        t.node.(i) <- t.node.(m);\n        t.node.(m) <- tmp;\n        max_heapify m\n      end in\n    let ret = t.node.(1) in\n    t.node.(1) <- t.node.(t.size);\n    t.size <- t.size - 1;\n    max_heapify 1;\n    ret\n\n  let push x t =\n    let parent i = int_of_float (floor (float_of_int i) /. 2.) in\n    let rec doit i =\n      let p = parent i in\n      if i <= 1 || M.compare t.node.(p) t.node.(i) >= 0 then ()\n      else begin\n        let tmp = t.node.(i) in\n        t.node.(i) <- t.node.(p);\n        t.node.(p) <- tmp;\n        doit p\n      end in\n    t.size <- t.size + 1;\n    t.node.(t.size) <- x;\n    doit t.size\n\nend\n\nmodule H = MakeBinaryHeap(struct type t = (int * int) let compare (_, x) (_, y) = y - x end)\n\nlet dijkstra g n =\n  let reached_p = Array.make n false in\n  let d = Array.make n max_int in\n  d.(0) <- 0;\n  let h = H.make 50000 (0, 0) in\n  H.push (0, 0) h;\n  while not (H.empty_p h) do\n    let (u, x) = H.pop h in\n    reached_p.(u) <- true;\n    if x > d.(u) then ()\n    else\n      List.iter (fun (v, c) ->\n        let x = d.(u) + c in\n        if not reached_p.(v) && x < d.(v) then begin\n          d.(v) <- x;\n          H.push (v, x) h;\n        end) g.(u)\n  done;\n  d\n\nlet rec make_pair acc = function\n  | [] -> acc\n  | v :: c :: tl -> make_pair ((v, c) :: acc) tl\n  | _ -> assert false\n\nlet make_pair lst = make_pair [] lst\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let n = read_int () in\n  let g = Array.make n [] in\n  for _ = 0 to n - 1 do\n    match read_line () |> split_on_char ' ' |> List.map int_of_string with\n    | u :: _ :: l -> g.(u) <- make_pair l\n    | _ -> assert false\n  done;\n  dijkstra g n |> Array.iteri (fun i e -> Printf.printf \"%d %d\\n\" i e)", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nSingle Source Shortest Path II\n\nFor a given weighted graph $G = (V, E)$, find the shortest path from a source to each vertex. For each vertex $u$, print the total weight of edges on the shortest path from vertex $0$ to $u$.\n\nInput\n\nIn the first line, an integer $n$ denoting the number of vertices in $G$ is given. In the following $n$ lines, adjacency lists for each vertex $u$ are respectively given in the following format:\n\n$u$ $k$ $v_1$ $c_1$ $v_2$ $c_2$ ... $v_k$ $c_k$\n\nVertices in $G$ are named with IDs $0, 1, ..., n-1$. $u$ is ID of the target vertex and $k$ denotes its degree. $v_i (i = 1, 2, ... k)$ denote IDs of vertices adjacent to $u$ and $c_i$ denotes the weight of a directed edge connecting $u$ and $v_i$ (from $u$ to $v_i$).\n\nOutput\n\nFor each vertex, print its ID and the distance separated by a space character in a line respectively. Print in order of vertex IDs.\n\nConstraints\n\n$1 \\leq n \\leq 10,000$\n\n$0 \\leq c_i \\leq 100,000$\n\n$|E| < 500,000$\n\nAll vertices are reachable from vertex $0$\n\nSample Input 1\n\n5\n0 3 2 3 3 1 1 2\n1 2 0 2 3 4\n2 3 0 3 3 1 4 1\n3 4 2 1 0 1 1 4 4 3\n4 2 2 1 3 3\n\nSample Output 1\n\n0 0\n1 2\n2 2\n3 1\n4 3\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "5\n0 3 2 3 3 1 1 2\n1 2 0 2 3 4\n2 3 0 3 3 1 4 1\n3 4 2 1 0 1 1 4 4 3\n4 2 2 1 3 3\n"}, "reference_outputs": ["0 0\n1 2\n2 2\n3 1\n4 3\n"], "source_document_id": "p02243", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nSingle Source Shortest Path II\n\nFor a given weighted graph $G = (V, E)$, find the shortest path from a source to each vertex. For each vertex $u$, print the total weight of edges on the shortest path from vertex $0$ to $u$.\n\nInput\n\nIn the first line, an integer $n$ denoting the number of vertices in $G$ is given. In the following $n$ lines, adjacency lists for each vertex $u$ are respectively given in the following format:\n\n$u$ $k$ $v_1$ $c_1$ $v_2$ $c_2$ ... $v_k$ $c_k$\n\nVertices in $G$ are named with IDs $0, 1, ..., n-1$. $u$ is ID of the target vertex and $k$ denotes its degree. $v_i (i = 1, 2, ... k)$ denote IDs of vertices adjacent to $u$ and $c_i$ denotes the weight of a directed edge connecting $u$ and $v_i$ (from $u$ to $v_i$).\n\nOutput\n\nFor each vertex, print its ID and the distance separated by a space character in a line respectively. Print in order of vertex IDs.\n\nConstraints\n\n$1 \\leq n \\leq 10,000$\n\n$0 \\leq c_i \\leq 100,000$\n\n$|E| < 500,000$\n\nAll vertices are reachable from vertex $0$\n\nSample Input 1\n\n5\n0 3 2 3 3 1 1 2\n1 2 0 2 3 4\n2 3 0 3 3 1 4 1\n3 4 2 1 0 1 1 4 4 3\n4 2 2 1 3 3\n\nSample Output 1\n\n0 0\n1 2\n2 2\n3 1\n4 3\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2489, "cpu_time_ms": 80, "memory_kb": 30168}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s696898907", "group_id": "codeNet:p02248", "input_text": "let pn = 1000000007\n\nlet pow m n =\n  let rec doit m n acc =\n    if n = 0 then acc\n    else if n mod 2 = 0 then doit (m * m) (n / 2) acc\n    else doit m (n - 1) (acc * m) in\n  doit m n 1\n\nlet str_fold_left f init s =\n  let n = String.length s in\n  let rec doit i acc =\n    if i = n then acc\n    else doit (i + 1) (f acc s.[i]) in\n  doit 0 init\n\nlet () =\n  let p = read_line () in\n  let t = read_line () in\n  let n = String.length p in\n  let m = String.length t in\n  let h = Array.make (n + 1) 0 in\n  String.iteri (fun i c -> h.(i+1) <- h.(i)*pn + Char.code c) p;\n  let ht = str_fold_left (fun acc c -> acc*pn + Char.code c) 0 t in\n  let x = pow pn m in\n  for i = m to n do\n    if h.(i) - h.(i-m)*x = ht then Printf.printf \"%d\\n\" (i - m);\n  done", "language": "OCaml", "metadata": {"date": 1500790216, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02248.html", "problem_id": "p02248", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02248/input.txt", "sample_output_relpath": "derived/input_output/data/p02248/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02248/OCaml/s696898907.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s696898907", "user_id": "u809138450"}, "prompt_components": {"gold_output": "0\n3\n4\n", "input_to_evaluate": "let pn = 1000000007\n\nlet pow m n =\n  let rec doit m n acc =\n    if n = 0 then acc\n    else if n mod 2 = 0 then doit (m * m) (n / 2) acc\n    else doit m (n - 1) (acc * m) in\n  doit m n 1\n\nlet str_fold_left f init s =\n  let n = String.length s in\n  let rec doit i acc =\n    if i = n then acc\n    else doit (i + 1) (f acc s.[i]) in\n  doit 0 init\n\nlet () =\n  let p = read_line () in\n  let t = read_line () in\n  let n = String.length p in\n  let m = String.length t in\n  let h = Array.make (n + 1) 0 in\n  String.iteri (fun i c -> h.(i+1) <- h.(i)*pn + Char.code c) p;\n  let ht = str_fold_left (fun acc c -> acc*pn + Char.code c) 0 t in\n  let x = pow pn m in\n  for i = m to n do\n    if h.(i) - h.(i-m)*x = ht then Printf.printf \"%d\\n\" (i - m);\n  done", "problem_context": "String Search\n\nFind places where a string P is found within a text T.\nPrint all indices of T where P found. The indices of T start with 0.\n\nInput\n\nIn the first line, a text T is given. In the second line, a string P is given.\n\nOutput\n\nPrint an index of T where P found in a line. Print the indices in ascending order.\n\nConstraints\n\n1 ≤ length of T ≤ 1000000\n\n1 ≤ length of P ≤ 10000\n\nThe input consists of alphabetical characters and digits\n\nSample Input 1\n\naabaaa\naa\n\nSample Output 1\n\n0\n3\n4\n\nSample Input 2\n\nxyzz\nyz\n\nSample Output 2\n\n1\n\nSample Input 3\n\nabc\nxyz\n\nSample Output 3\n\nThe output should be empty.", "sample_input": "aabaaa\naa\n"}, "reference_outputs": ["0\n3\n4\n"], "source_document_id": "p02248", "source_text": "String Search\n\nFind places where a string P is found within a text T.\nPrint all indices of T where P found. The indices of T start with 0.\n\nInput\n\nIn the first line, a text T is given. In the second line, a string P is given.\n\nOutput\n\nPrint an index of T where P found in a line. Print the indices in ascending order.\n\nConstraints\n\n1 ≤ length of T ≤ 1000000\n\n1 ≤ length of P ≤ 10000\n\nThe input consists of alphabetical characters and digits\n\nSample Input 1\n\naabaaa\naa\n\nSample Output 1\n\n0\n3\n4\n\nSample Input 2\n\nxyzz\nyz\n\nSample Output 2\n\n1\n\nSample Input 3\n\nabc\nxyz\n\nSample Output 3\n\nThe output should be empty.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 743, "cpu_time_ms": 120, "memory_kb": 14372}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s636289056", "group_id": "codeNet:p02248", "input_text": "let quick_search s p f =\n  let sl = String.length s in\n  let pl = String.length p in\n  let tbl = Hashtbl.create pl in\n  let set_tbl () =\n    String.iteri (fun i c -> Hashtbl.replace tbl c (pl - i)) p in\n  let jump c =\n    try Hashtbl.find tbl c with _ -> pl + 1 in\n  let rec loopi i =\n    if i > sl - pl then ()\n    else\n      let rec loopj j =\n        if j = pl then begin\n            f i;\n            loopi (i+1)\n          end\n        else\n          if s.[i+j] = p.[j] then loopj (j+1)\n          else\n            let i' = i + pl in\n            if i' >= sl then loopi i'\n            else loopi (jump s.[i'] + i)\n      in\n      loopj 0\n  in\n  set_tbl ();\n  loopi 0\n\nlet () =\n  let t = read_line () in\n  let p = read_line () in\n  let f x = string_of_int x |> print_endline in\n  quick_search t p f", "language": "OCaml", "metadata": {"date": 1501594322, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02248.html", "problem_id": "p02248", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02248/input.txt", "sample_output_relpath": "derived/input_output/data/p02248/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02248/OCaml/s636289056.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s636289056", "user_id": "u049242937"}, "prompt_components": {"gold_output": "0\n3\n4\n", "input_to_evaluate": "let quick_search s p f =\n  let sl = String.length s in\n  let pl = String.length p in\n  let tbl = Hashtbl.create pl in\n  let set_tbl () =\n    String.iteri (fun i c -> Hashtbl.replace tbl c (pl - i)) p in\n  let jump c =\n    try Hashtbl.find tbl c with _ -> pl + 1 in\n  let rec loopi i =\n    if i > sl - pl then ()\n    else\n      let rec loopj j =\n        if j = pl then begin\n            f i;\n            loopi (i+1)\n          end\n        else\n          if s.[i+j] = p.[j] then loopj (j+1)\n          else\n            let i' = i + pl in\n            if i' >= sl then loopi i'\n            else loopi (jump s.[i'] + i)\n      in\n      loopj 0\n  in\n  set_tbl ();\n  loopi 0\n\nlet () =\n  let t = read_line () in\n  let p = read_line () in\n  let f x = string_of_int x |> print_endline in\n  quick_search t p f", "problem_context": "String Search\n\nFind places where a string P is found within a text T.\nPrint all indices of T where P found. The indices of T start with 0.\n\nInput\n\nIn the first line, a text T is given. In the second line, a string P is given.\n\nOutput\n\nPrint an index of T where P found in a line. Print the indices in ascending order.\n\nConstraints\n\n1 ≤ length of T ≤ 1000000\n\n1 ≤ length of P ≤ 10000\n\nThe input consists of alphabetical characters and digits\n\nSample Input 1\n\naabaaa\naa\n\nSample Output 1\n\n0\n3\n4\n\nSample Input 2\n\nxyzz\nyz\n\nSample Output 2\n\n1\n\nSample Input 3\n\nabc\nxyz\n\nSample Output 3\n\nThe output should be empty.", "sample_input": "aabaaa\naa\n"}, "reference_outputs": ["0\n3\n4\n"], "source_document_id": "p02248", "source_text": "String Search\n\nFind places where a string P is found within a text T.\nPrint all indices of T where P found. The indices of T start with 0.\n\nInput\n\nIn the first line, a text T is given. In the second line, a string P is given.\n\nOutput\n\nPrint an index of T where P found in a line. Print the indices in ascending order.\n\nConstraints\n\n1 ≤ length of T ≤ 1000000\n\n1 ≤ length of P ≤ 10000\n\nThe input consists of alphabetical characters and digits\n\nSample Input 1\n\naabaaa\naa\n\nSample Output 1\n\n0\n3\n4\n\nSample Input 2\n\nxyzz\nyz\n\nSample Output 2\n\n1\n\nSample Input 3\n\nabc\nxyz\n\nSample Output 3\n\nThe output should be empty.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 795, "cpu_time_ms": 6830, "memory_kb": 6392}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s856857183", "group_id": "codeNet:p02249", "input_text": "let (p1, p2, p3) = (257, 251, 1000000007)\n\nlet pow x n =\n  let rec doit i acc =\n    if i = n then acc\n    else doit (i + 1) (acc*x mod p3) in\n  doit 0 1\n\nlet solve a (h, w) b (r, c) =\n  let make_hash v (y, x) =\n    let h1 = Array.make_matrix y x 0 in\n    let c1 = pow p1 c in\n    let rec duduwa i =\n      if i < y then begin\n        let rec calc_z j acc =\n          if j = c then acc\n          else calc_z (j + 1) ((acc*p1 + Char.code (v.(i).(j))) mod p3) in\n        let rec aux j z =\n          if j = x - c then h1.(i).(j) <- z\n          else begin\n            h1.(i).(j) <- z;\n            let new_z = (z*p1 - (Char.code v.(i).(j))*c1 + Char.code v.(i).(j+c)) mod p3 in\n            aux (j + 1) (if new_z < 0 then new_z + p3 else new_z)\n          end in\n        aux 0 (calc_z 0 0);\n        duduwa (i + 1)\n      end in\n    duduwa 0;\n    let h2 = Array.make_matrix y x 0 in\n    let c2 = pow p2 r in\n    let rec doit j =\n      if j < x then begin\n        let rec calc_z i acc =\n          if i = r then acc\n          else calc_z (i + 1) ((acc*p2 + h1.(i).(j)) mod p3) in\n        let rec aux i z =\n          if i = y - r then h2.(i).(j) <- z\n          else begin\n            h2.(i).(j) <- z;\n            let new_z = (z*p2 - h1.(i).(j)*c2 + h1.(i+r).(j)) mod p3 in\n            aux (i + 1) (if new_z < 0 then new_z + p3 else new_z)\n          end in\n        aux 0 (calc_z 0 0);\n        doit (j + 1)\n      end in\n    doit 0;\n    h2 in\n  let s = make_hash a (h, w) in\n  let t = make_hash b (r, c) in\n  let rec doit = function\n    | (i, _) when i > h - r -> ()\n    | (i, j) when j > w - c -> doit (i + 1, 0)\n    | (i, j) ->\n      if s.(i).(j) = t.(0).(0) then Printf.printf \"%d %d\\n\" i j;\n      doit (i, j + 1) in\n  doit (0, 0)\n\nlet split str delim =\n  let open String in\n  let rec doit s acc =\n    match\n      try Some (rindex s delim) with _ -> None\n    with\n    | None -> s :: acc\n    | Some i -> doit (sub s 0 i) (sub s (i + 1) (length s - i - 1) :: acc) in\n  doit str []\n\nlet str_to_list str =\n  let rec doit i acc =\n    if i < 0 then acc\n    else doit (i - 1) (String.get str i :: acc) in\n  doit (String.length str - 1) []\n\nlet input_array y x =\n  let a = Array.make_matrix y x '\\000' in\n  let rec doit i =\n    if i = y then a\n    else begin\n      let rec aux j = function\n        | [] -> ()\n        | c :: cs -> a.(i).(j) <- c; aux (j + 1) cs in\n      aux 0 (str_to_list (read_line ()));\n      doit (i + 1)\n    end in\n  doit 0\n\nlet () =\n  match List.map int_of_string (split (read_line ()) ' ') with\n  | [h; w] ->\n    begin\n      let a = input_array h w in\n      match List.map int_of_string (split (read_line ()) ' ') with\n      | [r; c] ->\n        let b = input_array r c in\n        solve a (h, w) b (r, c)\n      | _ -> exit 1\n    end\n  | _ -> exit 1", "language": "OCaml", "metadata": {"date": 1476123680, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02249.html", "problem_id": "p02249", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02249/input.txt", "sample_output_relpath": "derived/input_output/data/p02249/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02249/OCaml/s856857183.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s856857183", "user_id": "u809138450"}, "prompt_components": {"gold_output": "0 3\n1 2\n", "input_to_evaluate": "let (p1, p2, p3) = (257, 251, 1000000007)\n\nlet pow x n =\n  let rec doit i acc =\n    if i = n then acc\n    else doit (i + 1) (acc*x mod p3) in\n  doit 0 1\n\nlet solve a (h, w) b (r, c) =\n  let make_hash v (y, x) =\n    let h1 = Array.make_matrix y x 0 in\n    let c1 = pow p1 c in\n    let rec duduwa i =\n      if i < y then begin\n        let rec calc_z j acc =\n          if j = c then acc\n          else calc_z (j + 1) ((acc*p1 + Char.code (v.(i).(j))) mod p3) in\n        let rec aux j z =\n          if j = x - c then h1.(i).(j) <- z\n          else begin\n            h1.(i).(j) <- z;\n            let new_z = (z*p1 - (Char.code v.(i).(j))*c1 + Char.code v.(i).(j+c)) mod p3 in\n            aux (j + 1) (if new_z < 0 then new_z + p3 else new_z)\n          end in\n        aux 0 (calc_z 0 0);\n        duduwa (i + 1)\n      end in\n    duduwa 0;\n    let h2 = Array.make_matrix y x 0 in\n    let c2 = pow p2 r in\n    let rec doit j =\n      if j < x then begin\n        let rec calc_z i acc =\n          if i = r then acc\n          else calc_z (i + 1) ((acc*p2 + h1.(i).(j)) mod p3) in\n        let rec aux i z =\n          if i = y - r then h2.(i).(j) <- z\n          else begin\n            h2.(i).(j) <- z;\n            let new_z = (z*p2 - h1.(i).(j)*c2 + h1.(i+r).(j)) mod p3 in\n            aux (i + 1) (if new_z < 0 then new_z + p3 else new_z)\n          end in\n        aux 0 (calc_z 0 0);\n        doit (j + 1)\n      end in\n    doit 0;\n    h2 in\n  let s = make_hash a (h, w) in\n  let t = make_hash b (r, c) in\n  let rec doit = function\n    | (i, _) when i > h - r -> ()\n    | (i, j) when j > w - c -> doit (i + 1, 0)\n    | (i, j) ->\n      if s.(i).(j) = t.(0).(0) then Printf.printf \"%d %d\\n\" i j;\n      doit (i, j + 1) in\n  doit (0, 0)\n\nlet split str delim =\n  let open String in\n  let rec doit s acc =\n    match\n      try Some (rindex s delim) with _ -> None\n    with\n    | None -> s :: acc\n    | Some i -> doit (sub s 0 i) (sub s (i + 1) (length s - i - 1) :: acc) in\n  doit str []\n\nlet str_to_list str =\n  let rec doit i acc =\n    if i < 0 then acc\n    else doit (i - 1) (String.get str i :: acc) in\n  doit (String.length str - 1) []\n\nlet input_array y x =\n  let a = Array.make_matrix y x '\\000' in\n  let rec doit i =\n    if i = y then a\n    else begin\n      let rec aux j = function\n        | [] -> ()\n        | c :: cs -> a.(i).(j) <- c; aux (j + 1) cs in\n      aux 0 (str_to_list (read_line ()));\n      doit (i + 1)\n    end in\n  doit 0\n\nlet () =\n  match List.map int_of_string (split (read_line ()) ' ') with\n  | [h; w] ->\n    begin\n      let a = input_array h w in\n      match List.map int_of_string (split (read_line ()) ' ') with\n      | [r; c] ->\n        let b = input_array r c in\n        solve a (h, w) b (r, c)\n      | _ -> exit 1\n    end\n  | _ -> exit 1", "problem_context": "Pattern Search\n\nFind places where a R × C pattern is found within a H × W region. Print top-left coordinates (i, j) of sub-regions where the pattern found. The top-left and bottom-right coordinates of the region is (0, 0) and (H-1, W-1) respectively.\n\nInput\n\nIn the first line, two integers H and W are given. In the following H lines, i-th lines of the region are given.\n\nIn the next line, two integers R and C are given. In the following R lines, i-th lines of the pattern are given.\n\noutput\n\nFor each sub-region found, print a coordinate i and j separated by a space character in a line. Print the coordinates in ascending order of the row numbers (i), or the column numbers (j) in case of a tie.\n\nConstraints\n\n1 ≤ H, W ≤ 1000\n\n1 ≤ R, C ≤ 1000\n\nThe input consists of alphabetical characters and digits\n\nSample Input 1\n\n4 5\n00010\n00101\n00010\n00100\n3 2\n10\n01\n10\n\nSample Output 1\n\n0 3\n1 2", "sample_input": "4 5\n00010\n00101\n00010\n00100\n3 2\n10\n01\n10\n"}, "reference_outputs": ["0 3\n1 2\n"], "source_document_id": "p02249", "source_text": "Pattern Search\n\nFind places where a R × C pattern is found within a H × W region. Print top-left coordinates (i, j) of sub-regions where the pattern found. The top-left and bottom-right coordinates of the region is (0, 0) and (H-1, W-1) respectively.\n\nInput\n\nIn the first line, two integers H and W are given. In the following H lines, i-th lines of the region are given.\n\nIn the next line, two integers R and C are given. In the following R lines, i-th lines of the pattern are given.\n\noutput\n\nFor each sub-region found, print a coordinate i and j separated by a space character in a line. Print the coordinates in ascending order of the row numbers (i), or the column numbers (j) in case of a tie.\n\nConstraints\n\n1 ≤ H, W ≤ 1000\n\n1 ≤ R, C ≤ 1000\n\nThe input consists of alphabetical characters and digits\n\nSample Input 1\n\n4 5\n00010\n00101\n00010\n00100\n3 2\n10\n01\n10\n\nSample Output 1\n\n0 3\n1 2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2748, "cpu_time_ms": 150, "memory_kb": 46332}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s810253572", "group_id": "codeNet:p02249", "input_text": "let (p1, p2, p3) = (257, 251, 1000000007)\n\nlet pow x n =\n  let rec doit i acc =\n    if i = n then acc\n    else doit (i + 1) (acc*x mod p3) in\n  doit 0 1\n\nlet solve a (h, w) b (r, c) =\n  let make_hash v (y, x) =\n    let h1 = Array.make_matrix y x 0 in\n    let c1 = pow p1 c in\n    let rec duduwa i =\n      if i < y then begin\n        let rec calc_z j acc =\n          if j = c then acc\n          else calc_z (j + 1) ((acc*p1 + Char.code v.(i).(j)) mod p3) in\n        let rec aux j z =\n          if j = x - c then h1.(i).(j) <- z\n          else begin\n            h1.(i).(j) <- z;\n            let new_z = (z*p1 - (Char.code v.(i).(j))*c1 + Char.code v.(i).(j+c)) mod p3 in\n            aux (j + 1) (if new_z < 0 then new_z + p3 else new_z)\n          end in\n        aux 0 (calc_z 0 0);\n        duduwa (i + 1)\n      end in\n    duduwa 0;\n    let h2 = Array.make_matrix y x 0 in\n    let c2 = pow p2 r in\n    let rec doit j =\n      if j < x then begin\n        let rec calc_z i acc =\n          if i = r then acc\n          else calc_z (i + 1) ((acc*p2 + h1.(i).(j)) mod p3) in\n        let rec aux i z =\n          if i = y - r then h2.(i).(j) <- z\n          else begin\n            h2.(i).(j) <- z;\n            let new_z = (z*p2 - h1.(i).(j)*c2 + h1.(i+r).(j)) mod p3 in\n            aux (i + 1) (if new_z < 0 then new_z + p3 else new_z)\n          end in\n        aux 0 (calc_z 0 0);\n        doit (j + 1)\n      end in\n    doit 0;\n    h2 in\n  let s = make_hash a (h, w) in\n  let t = make_hash b (r, c) in\n  let rec doit = function\n    | (i, _) when i > h - r -> ()\n    | (i, j) when j > w - c -> doit (i + 1, 0)\n    | (i, j) ->\n      if s.(i).(j) = t.(0).(0) then Printf.printf \"%d %d\\n\" i j;\n      doit (i, j + 1) in\n  doit (0, 0)\n\nlet input_array y x =\n  let a = Array.make_matrix y x '\\000' in\n  let rec doit = function\n    | (i, _) when i = y -> a\n    | (i, j) when j = x -> doit (i + 1, 0)\n    | (i, j) ->\n      a.(i).(j) <- Scanf.scanf \"%c \" (fun c -> c);\n      doit (i, j + 1) in\n  doit (0, 0)\n\nlet () =\n  let (h, w) = Scanf.scanf \"%d %d\\n\" (fun h w -> (h, w)) in\n  let a = input_array h w in\n  let (r, c) = Scanf.scanf \"%d %d\\n\" (fun r c -> (r, c)) in\n  let b = input_array r c in\n  if h >= r && w >= c then solve a (h, w) b (r, c)", "language": "OCaml", "metadata": {"date": 1476128980, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02249.html", "problem_id": "p02249", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02249/input.txt", "sample_output_relpath": "derived/input_output/data/p02249/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02249/OCaml/s810253572.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s810253572", "user_id": "u809138450"}, "prompt_components": {"gold_output": "0 3\n1 2\n", "input_to_evaluate": "let (p1, p2, p3) = (257, 251, 1000000007)\n\nlet pow x n =\n  let rec doit i acc =\n    if i = n then acc\n    else doit (i + 1) (acc*x mod p3) in\n  doit 0 1\n\nlet solve a (h, w) b (r, c) =\n  let make_hash v (y, x) =\n    let h1 = Array.make_matrix y x 0 in\n    let c1 = pow p1 c in\n    let rec duduwa i =\n      if i < y then begin\n        let rec calc_z j acc =\n          if j = c then acc\n          else calc_z (j + 1) ((acc*p1 + Char.code v.(i).(j)) mod p3) in\n        let rec aux j z =\n          if j = x - c then h1.(i).(j) <- z\n          else begin\n            h1.(i).(j) <- z;\n            let new_z = (z*p1 - (Char.code v.(i).(j))*c1 + Char.code v.(i).(j+c)) mod p3 in\n            aux (j + 1) (if new_z < 0 then new_z + p3 else new_z)\n          end in\n        aux 0 (calc_z 0 0);\n        duduwa (i + 1)\n      end in\n    duduwa 0;\n    let h2 = Array.make_matrix y x 0 in\n    let c2 = pow p2 r in\n    let rec doit j =\n      if j < x then begin\n        let rec calc_z i acc =\n          if i = r then acc\n          else calc_z (i + 1) ((acc*p2 + h1.(i).(j)) mod p3) in\n        let rec aux i z =\n          if i = y - r then h2.(i).(j) <- z\n          else begin\n            h2.(i).(j) <- z;\n            let new_z = (z*p2 - h1.(i).(j)*c2 + h1.(i+r).(j)) mod p3 in\n            aux (i + 1) (if new_z < 0 then new_z + p3 else new_z)\n          end in\n        aux 0 (calc_z 0 0);\n        doit (j + 1)\n      end in\n    doit 0;\n    h2 in\n  let s = make_hash a (h, w) in\n  let t = make_hash b (r, c) in\n  let rec doit = function\n    | (i, _) when i > h - r -> ()\n    | (i, j) when j > w - c -> doit (i + 1, 0)\n    | (i, j) ->\n      if s.(i).(j) = t.(0).(0) then Printf.printf \"%d %d\\n\" i j;\n      doit (i, j + 1) in\n  doit (0, 0)\n\nlet input_array y x =\n  let a = Array.make_matrix y x '\\000' in\n  let rec doit = function\n    | (i, _) when i = y -> a\n    | (i, j) when j = x -> doit (i + 1, 0)\n    | (i, j) ->\n      a.(i).(j) <- Scanf.scanf \"%c \" (fun c -> c);\n      doit (i, j + 1) in\n  doit (0, 0)\n\nlet () =\n  let (h, w) = Scanf.scanf \"%d %d\\n\" (fun h w -> (h, w)) in\n  let a = input_array h w in\n  let (r, c) = Scanf.scanf \"%d %d\\n\" (fun r c -> (r, c)) in\n  let b = input_array r c in\n  if h >= r && w >= c then solve a (h, w) b (r, c)", "problem_context": "Pattern Search\n\nFind places where a R × C pattern is found within a H × W region. Print top-left coordinates (i, j) of sub-regions where the pattern found. The top-left and bottom-right coordinates of the region is (0, 0) and (H-1, W-1) respectively.\n\nInput\n\nIn the first line, two integers H and W are given. In the following H lines, i-th lines of the region are given.\n\nIn the next line, two integers R and C are given. In the following R lines, i-th lines of the pattern are given.\n\noutput\n\nFor each sub-region found, print a coordinate i and j separated by a space character in a line. Print the coordinates in ascending order of the row numbers (i), or the column numbers (j) in case of a tie.\n\nConstraints\n\n1 ≤ H, W ≤ 1000\n\n1 ≤ R, C ≤ 1000\n\nThe input consists of alphabetical characters and digits\n\nSample Input 1\n\n4 5\n00010\n00101\n00010\n00100\n3 2\n10\n01\n10\n\nSample Output 1\n\n0 3\n1 2", "sample_input": "4 5\n00010\n00101\n00010\n00100\n3 2\n10\n01\n10\n"}, "reference_outputs": ["0 3\n1 2\n"], "source_document_id": "p02249", "source_text": "Pattern Search\n\nFind places where a R × C pattern is found within a H × W region. Print top-left coordinates (i, j) of sub-regions where the pattern found. The top-left and bottom-right coordinates of the region is (0, 0) and (H-1, W-1) respectively.\n\nInput\n\nIn the first line, two integers H and W are given. In the following H lines, i-th lines of the region are given.\n\nIn the next line, two integers R and C are given. In the following R lines, i-th lines of the pattern are given.\n\noutput\n\nFor each sub-region found, print a coordinate i and j separated by a space character in a line. Print the coordinates in ascending order of the row numbers (i), or the column numbers (j) in case of a tie.\n\nConstraints\n\n1 ≤ H, W ≤ 1000\n\n1 ≤ R, C ≤ 1000\n\nThe input consists of alphabetical characters and digits\n\nSample Input 1\n\n4 5\n00010\n00101\n00010\n00100\n3 2\n10\n01\n10\n\nSample Output 1\n\n0 3\n1 2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2222, "cpu_time_ms": 220, "memory_kb": 46392}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s597586573", "group_id": "codeNet:p02249", "input_text": "open Scanf\nopen Printf\n       \nlet id x = x\nlet tuple x y = (x, y)\n             \nlet calc_rh a h w r c =\n  let bh = 10007 in\n  let bv = 999983 in\n  let rec pow x n =\n    if n = 0 then 1\n    else if n mod 2 = 0 then let y = pow x (n / 2) in y * y\n    else x * pow x (n-1) in\n  let rh a b i j =\n    let rec iter r k =\n      if k = j then r\n      else iter (r * b + a.(k)) (k+1) in\n    iter 0 i\n  in\n  let bh' = pow bh c in\n  let ta = Array.make_matrix h (w - c + 1) 0 in\n  let rec set_ta i j =\n    if i = h then ()\n    else if j = w - c + 1 then set_ta (i+1) 0\n    else begin\n        if j = 0 then ta.(i).(j) <- rh a.(i) bh 0 c\n        else ta.(i).(j) <- ta.(i).(j-1) * bh + a.(i).(j+c-1) - a.(i).(j-1) * bh';\n        set_ta i (j+1)\n      end\n  in\n  let bv' = pow bv r in\n  let rht = Array.make_matrix (h - r + 1) (w - c + 1) 0 in\n  let rec set_rht i j =\n    if j = w - c + 1 then ()\n    else if i = h - r + 1 then set_rht 0 (j+1)\n    else begin\n        if i = 0 then rht.(i).(j) <- rh (Array.init r (fun k -> ta.(k).(j))) bv 0 r\n        else rht.(i).(j) <- rht.(i-1).(j) * bv + ta.(i+r-1).(j) - ta.(i-1).(j) * bv';\n        set_rht (i+1) j\n      end\n  in\n  set_ta 0 0;\n  set_rht 0 0;\n  rht\n    \nlet () =\n  let h, w = scanf \"%d %d \" tuple in\n  let fld = Array.init h (fun _ ->\n                          let s = scanf \"%s \" id in\n                          Array.init w (fun i -> \n                                        Char.code s.[i]\n                                     )\n                         ) in\n  let r, c = scanf \"%d %d \" tuple in\n  let ptn = Array.init r (fun _ ->\n                          let s = scanf \"%s \" id in\n                          Array.init c (fun i -> \n                                        Char.code s.[i]\n                                       )\n                         ) in\n  let ft = calc_rh fld h w r c in\n  let pt = calc_rh ptn r c r c in\n  let rec loop i j =\n    if i = h - r + 1 then ()\n    else if j = w - c + 1 then loop (i+1) 0\n    else begin\n        if ft.(i).(j) = pt.(0).(0) then printf \"%d %d\\n\" i j;\n        loop i (j+1)\n      end\n  in\n  loop 0 0", "language": "OCaml", "metadata": {"date": 1501738972, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02249.html", "problem_id": "p02249", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02249/input.txt", "sample_output_relpath": "derived/input_output/data/p02249/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02249/OCaml/s597586573.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s597586573", "user_id": "u049242937"}, "prompt_components": {"gold_output": "0 3\n1 2\n", "input_to_evaluate": "open Scanf\nopen Printf\n       \nlet id x = x\nlet tuple x y = (x, y)\n             \nlet calc_rh a h w r c =\n  let bh = 10007 in\n  let bv = 999983 in\n  let rec pow x n =\n    if n = 0 then 1\n    else if n mod 2 = 0 then let y = pow x (n / 2) in y * y\n    else x * pow x (n-1) in\n  let rh a b i j =\n    let rec iter r k =\n      if k = j then r\n      else iter (r * b + a.(k)) (k+1) in\n    iter 0 i\n  in\n  let bh' = pow bh c in\n  let ta = Array.make_matrix h (w - c + 1) 0 in\n  let rec set_ta i j =\n    if i = h then ()\n    else if j = w - c + 1 then set_ta (i+1) 0\n    else begin\n        if j = 0 then ta.(i).(j) <- rh a.(i) bh 0 c\n        else ta.(i).(j) <- ta.(i).(j-1) * bh + a.(i).(j+c-1) - a.(i).(j-1) * bh';\n        set_ta i (j+1)\n      end\n  in\n  let bv' = pow bv r in\n  let rht = Array.make_matrix (h - r + 1) (w - c + 1) 0 in\n  let rec set_rht i j =\n    if j = w - c + 1 then ()\n    else if i = h - r + 1 then set_rht 0 (j+1)\n    else begin\n        if i = 0 then rht.(i).(j) <- rh (Array.init r (fun k -> ta.(k).(j))) bv 0 r\n        else rht.(i).(j) <- rht.(i-1).(j) * bv + ta.(i+r-1).(j) - ta.(i-1).(j) * bv';\n        set_rht (i+1) j\n      end\n  in\n  set_ta 0 0;\n  set_rht 0 0;\n  rht\n    \nlet () =\n  let h, w = scanf \"%d %d \" tuple in\n  let fld = Array.init h (fun _ ->\n                          let s = scanf \"%s \" id in\n                          Array.init w (fun i -> \n                                        Char.code s.[i]\n                                     )\n                         ) in\n  let r, c = scanf \"%d %d \" tuple in\n  let ptn = Array.init r (fun _ ->\n                          let s = scanf \"%s \" id in\n                          Array.init c (fun i -> \n                                        Char.code s.[i]\n                                       )\n                         ) in\n  let ft = calc_rh fld h w r c in\n  let pt = calc_rh ptn r c r c in\n  let rec loop i j =\n    if i = h - r + 1 then ()\n    else if j = w - c + 1 then loop (i+1) 0\n    else begin\n        if ft.(i).(j) = pt.(0).(0) then printf \"%d %d\\n\" i j;\n        loop i (j+1)\n      end\n  in\n  loop 0 0", "problem_context": "Pattern Search\n\nFind places where a R × C pattern is found within a H × W region. Print top-left coordinates (i, j) of sub-regions where the pattern found. The top-left and bottom-right coordinates of the region is (0, 0) and (H-1, W-1) respectively.\n\nInput\n\nIn the first line, two integers H and W are given. In the following H lines, i-th lines of the region are given.\n\nIn the next line, two integers R and C are given. In the following R lines, i-th lines of the pattern are given.\n\noutput\n\nFor each sub-region found, print a coordinate i and j separated by a space character in a line. Print the coordinates in ascending order of the row numbers (i), or the column numbers (j) in case of a tie.\n\nConstraints\n\n1 ≤ H, W ≤ 1000\n\n1 ≤ R, C ≤ 1000\n\nThe input consists of alphabetical characters and digits\n\nSample Input 1\n\n4 5\n00010\n00101\n00010\n00100\n3 2\n10\n01\n10\n\nSample Output 1\n\n0 3\n1 2", "sample_input": "4 5\n00010\n00101\n00010\n00100\n3 2\n10\n01\n10\n"}, "reference_outputs": ["0 3\n1 2\n"], "source_document_id": "p02249", "source_text": "Pattern Search\n\nFind places where a R × C pattern is found within a H × W region. Print top-left coordinates (i, j) of sub-regions where the pattern found. The top-left and bottom-right coordinates of the region is (0, 0) and (H-1, W-1) respectively.\n\nInput\n\nIn the first line, two integers H and W are given. In the following H lines, i-th lines of the region are given.\n\nIn the next line, two integers R and C are given. In the following R lines, i-th lines of the pattern are given.\n\noutput\n\nFor each sub-region found, print a coordinate i and j separated by a space character in a line. Print the coordinates in ascending order of the row numbers (i), or the column numbers (j) in case of a tie.\n\nConstraints\n\n1 ≤ H, W ≤ 1000\n\n1 ≤ R, C ≤ 1000\n\nThe input consists of alphabetical characters and digits\n\nSample Input 1\n\n4 5\n00010\n00101\n00010\n00100\n3 2\n10\n01\n10\n\nSample Output 1\n\n0 3\n1 2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2087, "cpu_time_ms": 150, "memory_kb": 28396}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s192966304", "group_id": "codeNet:p02250", "input_text": "let pn = 1000000007\n\nlet make_suffix_array t n =\n  let ord = Array.make (n + 1) (-1) in\n  String.iteri (fun i e -> ord.(i) <- Char.code e) t;\n  let sa = Array.init (n + 1) (fun i -> i) in\n  let rec doit k =\n    if k > n then sa\n    else begin\n      let cmp a b =\n        if ord.(a) <> ord.(b) then ord.(a) - ord.(b)\n        else (if a + k <= n then ord.(a+k) else 0) - (if b + k <= n then ord.(b+k) else 0) in\n      Array.sort cmp sa;\n      let tmp = Array.make (n + 1) 0 in\n      let rec aux i =\n        if i <= n then begin\n          tmp.(sa.(i)) <- tmp.(sa.(i-1)) + (if cmp sa.(i-1) sa.(i) < 0 then 1 else 0);\n          aux (i + 1)\n        end in\n      aux 1;\n      Array.iteri (fun i e -> ord.(i) <- e) tmp;\n      doit (k * 2)\n    end in\n  doit 1\n\nlet pow x n =\n  let rec doit i acc =\n    if i = n then acc\n    else doit (i + 1) (acc*x) in\n  doit 0 1\n\nlet str_fold_left f init s =\n  let n = String.length s in\n  let rec doit i acc =\n    if i = n then acc\n    else doit (i + 1) (f acc s.[i]) in\n  doit 0 init\n\nlet contain_p x y =\n  let n = String.length x in\n  let m = String.length y in\n  let h = Array.make (n + 1) 0 in\n  String.iteri (fun i c -> h.(i+1) <- h.(i)*pn + Char.code c) x;\n  let ht = str_fold_left (fun acc c -> acc*pn + Char.code c) 0 y in\n  let x = pow pn m in\n  let rec doit i =\n    if i > n then false\n    else if h.(i) - h.(i-m)*x = ht then true\n    else doit (i + 1) in\n  doit m\n\nlet () =\n  let t = read_line () in\n  let n = String.length t in\n  let sa = make_suffix_array t n in\n  let q = read_int () in\n  let rec doit i =\n    if i < q then begin\n      let p = read_line () in\n      let rec aux l r =\n        if l >= r then r\n        else begin\n          let m = (l + r) / 2 in\n          if compare (String.sub t sa.(m) (n - sa.(m))) p < 0 then aux (m + 1) r\n          else aux l m\n        end in\n      let r = aux 0 n in\n      Printf.printf \"%d\\n\" (if contain_p (String.sub t sa.(r) (if n - sa.(r) - (String.length p) >= 0 then String.length p else n - sa.(r))) p then 1 else 0);\n      doit (i + 1)\n    end in\n  doit 0", "language": "OCaml", "metadata": {"date": 1476178739, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02250.html", "problem_id": "p02250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02250/input.txt", "sample_output_relpath": "derived/input_output/data/p02250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02250/OCaml/s192966304.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s192966304", "user_id": "u809138450"}, "prompt_components": {"gold_output": "1\n1\n0\n0\n", "input_to_evaluate": "let pn = 1000000007\n\nlet make_suffix_array t n =\n  let ord = Array.make (n + 1) (-1) in\n  String.iteri (fun i e -> ord.(i) <- Char.code e) t;\n  let sa = Array.init (n + 1) (fun i -> i) in\n  let rec doit k =\n    if k > n then sa\n    else begin\n      let cmp a b =\n        if ord.(a) <> ord.(b) then ord.(a) - ord.(b)\n        else (if a + k <= n then ord.(a+k) else 0) - (if b + k <= n then ord.(b+k) else 0) in\n      Array.sort cmp sa;\n      let tmp = Array.make (n + 1) 0 in\n      let rec aux i =\n        if i <= n then begin\n          tmp.(sa.(i)) <- tmp.(sa.(i-1)) + (if cmp sa.(i-1) sa.(i) < 0 then 1 else 0);\n          aux (i + 1)\n        end in\n      aux 1;\n      Array.iteri (fun i e -> ord.(i) <- e) tmp;\n      doit (k * 2)\n    end in\n  doit 1\n\nlet pow x n =\n  let rec doit i acc =\n    if i = n then acc\n    else doit (i + 1) (acc*x) in\n  doit 0 1\n\nlet str_fold_left f init s =\n  let n = String.length s in\n  let rec doit i acc =\n    if i = n then acc\n    else doit (i + 1) (f acc s.[i]) in\n  doit 0 init\n\nlet contain_p x y =\n  let n = String.length x in\n  let m = String.length y in\n  let h = Array.make (n + 1) 0 in\n  String.iteri (fun i c -> h.(i+1) <- h.(i)*pn + Char.code c) x;\n  let ht = str_fold_left (fun acc c -> acc*pn + Char.code c) 0 y in\n  let x = pow pn m in\n  let rec doit i =\n    if i > n then false\n    else if h.(i) - h.(i-m)*x = ht then true\n    else doit (i + 1) in\n  doit m\n\nlet () =\n  let t = read_line () in\n  let n = String.length t in\n  let sa = make_suffix_array t n in\n  let q = read_int () in\n  let rec doit i =\n    if i < q then begin\n      let p = read_line () in\n      let rec aux l r =\n        if l >= r then r\n        else begin\n          let m = (l + r) / 2 in\n          if compare (String.sub t sa.(m) (n - sa.(m))) p < 0 then aux (m + 1) r\n          else aux l m\n        end in\n      let r = aux 0 n in\n      Printf.printf \"%d\\n\" (if contain_p (String.sub t sa.(r) (if n - sa.(r) - (String.length p) >= 0 then String.length p else n - sa.(r))) p then 1 else 0);\n      doit (i + 1)\n    end in\n  doit 0", "problem_context": "String Search\n\nDetermine whether a text T includes a pattern P. Your program should answer for given queries consisting of P_i.\n\nInput\n\nIn the first line, a text T is given. In the second line, an integer Q denoting the number of queries is given. In the following Q lines, the patterns P_i are given respectively.\n\nOutput\n\nFor each question, print 1 if the text includes P_i, or print 0 otherwise.\n\nConstraints\n\n1 ≤ length of T ≤ 1000000\n\n1 ≤ length of P_i ≤ 1000\n\n1 ≤ Q ≤ 10000\n\nThe input consists of alphabetical characters and digits\n\nSample Input 1\n\naabaaa\n4\naa\nba\nbb\nxyz\n\nSample Output 1\n\n1\n1\n0\n0", "sample_input": "aabaaa\n4\naa\nba\nbb\nxyz\n"}, "reference_outputs": ["1\n1\n0\n0\n"], "source_document_id": "p02250", "source_text": "String Search\n\nDetermine whether a text T includes a pattern P. Your program should answer for given queries consisting of P_i.\n\nInput\n\nIn the first line, a text T is given. In the second line, an integer Q denoting the number of queries is given. In the following Q lines, the patterns P_i are given respectively.\n\nOutput\n\nFor each question, print 1 if the text includes P_i, or print 0 otherwise.\n\nConstraints\n\n1 ≤ length of T ≤ 1000000\n\n1 ≤ length of P_i ≤ 1000\n\n1 ≤ Q ≤ 10000\n\nThe input consists of alphabetical characters and digits\n\nSample Input 1\n\naabaaa\n4\naa\nba\nbb\nxyz\n\nSample Output 1\n\n1\n1\n0\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2043, "cpu_time_ms": 20000, "memory_kb": 84448}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s166052896", "group_id": "codeNet:p02250", "input_text": "exception Not_equal of int\n\nlet rank = Array.make 1000000 0\nlet tmp = Array.make 1000000 0\n\nlet cmp_sa rank a b n k =\n  if rank.(a) <> rank.(b) then compare rank.(a) rank.(b)\n  else\n    compare\n      (if a + k <= n then rank.(a+k) else (-1))\n      (if b + k <= n then rank.(b+k) else (-1))\n\nlet construct_sa t n =\n  let sa = Array.make (n + 1) 0 in\n  for i = 0 to n - 1 do\n    sa.(i) <- i;\n    rank.(i) <- Char.code t.[i];\n  done;\n  sa.(n) <- n;\n  rank.(n) <- (-1);\n  let k = ref 1 in\n  while !k <= n do\n    Array.sort (fun a b -> cmp_sa rank a b n !k) sa;\n    tmp.(sa.(0)) <- 0;\n    for i = 1 to n do\n      tmp.(sa.(i)) <-\n        tmp.(sa.(i-1)) + (if cmp_sa rank sa.(i-1) sa.(i) n !k = (-1) then 1 else 0);\n    done;\n    for i = 0 to n do rank.(i) <- tmp.(i) done;\n    k := !k * 2;\n  done;\n  sa\n\nlet range_cmp t n offset p k =\n  let m = n - offset in\n  let m = if m < k then m else k in\n  try\n    for i = 0 to m - 1 do\n      if t.[i+offset] <> p.[i] then\n        raise (Not_equal (compare t.[i+offset] p.[i]));\n    done;\n    if m = k then 0\n    else (-1)\n  with Not_equal i -> i\n\nlet () =\n  let t = read_line () in\n  let n = String.length t in\n  let sa = construct_sa t n in\n  let q = read_int () in\n  for _ = 0 to q - 1 do\n    let p = read_line () in\n    let k = String.length p in\n    let l = ref 0 in\n    let r = ref (n + 1) in\n    while !l + 1 < !r do\n      let m = (!l + !r) / 2 in\n      let ret = range_cmp t n sa.(m) p k in\n      if ret <= 0 then l := m\n      else r := m;\n    done;\n    Printf.printf \"%d\\n\" (if range_cmp t n sa.(!l) p k = 0 then 1 else 0);\n  done", "language": "OCaml", "metadata": {"date": 1500885047, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02250.html", "problem_id": "p02250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02250/input.txt", "sample_output_relpath": "derived/input_output/data/p02250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02250/OCaml/s166052896.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s166052896", "user_id": "u809138450"}, "prompt_components": {"gold_output": "1\n1\n0\n0\n", "input_to_evaluate": "exception Not_equal of int\n\nlet rank = Array.make 1000000 0\nlet tmp = Array.make 1000000 0\n\nlet cmp_sa rank a b n k =\n  if rank.(a) <> rank.(b) then compare rank.(a) rank.(b)\n  else\n    compare\n      (if a + k <= n then rank.(a+k) else (-1))\n      (if b + k <= n then rank.(b+k) else (-1))\n\nlet construct_sa t n =\n  let sa = Array.make (n + 1) 0 in\n  for i = 0 to n - 1 do\n    sa.(i) <- i;\n    rank.(i) <- Char.code t.[i];\n  done;\n  sa.(n) <- n;\n  rank.(n) <- (-1);\n  let k = ref 1 in\n  while !k <= n do\n    Array.sort (fun a b -> cmp_sa rank a b n !k) sa;\n    tmp.(sa.(0)) <- 0;\n    for i = 1 to n do\n      tmp.(sa.(i)) <-\n        tmp.(sa.(i-1)) + (if cmp_sa rank sa.(i-1) sa.(i) n !k = (-1) then 1 else 0);\n    done;\n    for i = 0 to n do rank.(i) <- tmp.(i) done;\n    k := !k * 2;\n  done;\n  sa\n\nlet range_cmp t n offset p k =\n  let m = n - offset in\n  let m = if m < k then m else k in\n  try\n    for i = 0 to m - 1 do\n      if t.[i+offset] <> p.[i] then\n        raise (Not_equal (compare t.[i+offset] p.[i]));\n    done;\n    if m = k then 0\n    else (-1)\n  with Not_equal i -> i\n\nlet () =\n  let t = read_line () in\n  let n = String.length t in\n  let sa = construct_sa t n in\n  let q = read_int () in\n  for _ = 0 to q - 1 do\n    let p = read_line () in\n    let k = String.length p in\n    let l = ref 0 in\n    let r = ref (n + 1) in\n    while !l + 1 < !r do\n      let m = (!l + !r) / 2 in\n      let ret = range_cmp t n sa.(m) p k in\n      if ret <= 0 then l := m\n      else r := m;\n    done;\n    Printf.printf \"%d\\n\" (if range_cmp t n sa.(!l) p k = 0 then 1 else 0);\n  done", "problem_context": "String Search\n\nDetermine whether a text T includes a pattern P. Your program should answer for given queries consisting of P_i.\n\nInput\n\nIn the first line, a text T is given. In the second line, an integer Q denoting the number of queries is given. In the following Q lines, the patterns P_i are given respectively.\n\nOutput\n\nFor each question, print 1 if the text includes P_i, or print 0 otherwise.\n\nConstraints\n\n1 ≤ length of T ≤ 1000000\n\n1 ≤ length of P_i ≤ 1000\n\n1 ≤ Q ≤ 10000\n\nThe input consists of alphabetical characters and digits\n\nSample Input 1\n\naabaaa\n4\naa\nba\nbb\nxyz\n\nSample Output 1\n\n1\n1\n0\n0", "sample_input": "aabaaa\n4\naa\nba\nbb\nxyz\n"}, "reference_outputs": ["1\n1\n0\n0\n"], "source_document_id": "p02250", "source_text": "String Search\n\nDetermine whether a text T includes a pattern P. Your program should answer for given queries consisting of P_i.\n\nInput\n\nIn the first line, a text T is given. In the second line, an integer Q denoting the number of queries is given. In the following Q lines, the patterns P_i are given respectively.\n\nOutput\n\nFor each question, print 1 if the text includes P_i, or print 0 otherwise.\n\nConstraints\n\n1 ≤ length of T ≤ 1000000\n\n1 ≤ length of P_i ≤ 1000\n\n1 ≤ Q ≤ 10000\n\nThe input consists of alphabetical characters and digits\n\nSample Input 1\n\naabaaa\n4\naa\nba\nbb\nxyz\n\nSample Output 1\n\n1\n1\n0\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1573, "cpu_time_ms": 430, "memory_kb": 21340}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s043016273", "group_id": "codeNet:p02250", "input_text": "exception Not_equal of int\n\nlet cmp_sa rank a b n k =\n  if rank.(a) <> rank.(b) then compare rank.(a) rank.(b)\n  else\n    compare\n      (if a + k <= n then rank.(a+k) else (-1))\n      (if b + k <= n then rank.(b+k) else (-1))\n\nlet construct_sa t n =\n  let sa = Array.make (n + 1) 0 in\n  let rank = Array.make (n + 1) 0 in\n  let tmp = Array.make (n + 1) 0 in\n  for i = 0 to n - 1 do\n    sa.(i) <- i;\n    rank.(i) <- Char.code t.[i];\n  done;\n  sa.(n) <- n;\n  rank.(n) <- (-1);\n  let k = ref 1 in\n  while !k <= n do\n    Array.sort (fun a b -> cmp_sa rank a b n !k) sa;\n    tmp.(sa.(0)) <- 0;\n    for i = 1 to n do\n      tmp.(sa.(i)) <-\n        tmp.(sa.(i-1)) + (if cmp_sa rank sa.(i-1) sa.(i) n !k = (-1) then 1 else 0);\n    done;\n    for i = 0 to n do rank.(i) <- tmp.(i) done;\n    k := !k * 2;\n  done;\n  sa\n\nlet range_cmp t n offset p k =\n  let m = n - offset in\n  let m = if m < k then m else k in\n  try\n    for i = 0 to m - 1 do\n      if t.[i+offset] <> p.[i] then\n        raise (Not_equal (compare t.[i+offset] p.[i]));\n    done;\n    if m = k then 0\n    else (-1)\n  with Not_equal i -> i\n\nlet () =\n  let t = read_line () in\n  let n = String.length t in\n  let sa = construct_sa t n in\n  let q = read_int () in\n  for _ = 0 to q - 1 do\n    let p = read_line () in\n    let k = String.length p in\n    let l = ref 0 in\n    let r = ref (n + 1) in\n    while !l + 1 < !r do\n      let m = (!l + !r) / 2 in\n      let ret = range_cmp t n sa.(m) p k in\n      if ret <= 0 then l := m\n      else r := m;\n    done;\n    Printf.printf \"%d\\n\" (if range_cmp t n sa.(!l) p k = 0 then 1 else 0);\n  done", "language": "OCaml", "metadata": {"date": 1500885085, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02250.html", "problem_id": "p02250", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02250/input.txt", "sample_output_relpath": "derived/input_output/data/p02250/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02250/OCaml/s043016273.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s043016273", "user_id": "u809138450"}, "prompt_components": {"gold_output": "1\n1\n0\n0\n", "input_to_evaluate": "exception Not_equal of int\n\nlet cmp_sa rank a b n k =\n  if rank.(a) <> rank.(b) then compare rank.(a) rank.(b)\n  else\n    compare\n      (if a + k <= n then rank.(a+k) else (-1))\n      (if b + k <= n then rank.(b+k) else (-1))\n\nlet construct_sa t n =\n  let sa = Array.make (n + 1) 0 in\n  let rank = Array.make (n + 1) 0 in\n  let tmp = Array.make (n + 1) 0 in\n  for i = 0 to n - 1 do\n    sa.(i) <- i;\n    rank.(i) <- Char.code t.[i];\n  done;\n  sa.(n) <- n;\n  rank.(n) <- (-1);\n  let k = ref 1 in\n  while !k <= n do\n    Array.sort (fun a b -> cmp_sa rank a b n !k) sa;\n    tmp.(sa.(0)) <- 0;\n    for i = 1 to n do\n      tmp.(sa.(i)) <-\n        tmp.(sa.(i-1)) + (if cmp_sa rank sa.(i-1) sa.(i) n !k = (-1) then 1 else 0);\n    done;\n    for i = 0 to n do rank.(i) <- tmp.(i) done;\n    k := !k * 2;\n  done;\n  sa\n\nlet range_cmp t n offset p k =\n  let m = n - offset in\n  let m = if m < k then m else k in\n  try\n    for i = 0 to m - 1 do\n      if t.[i+offset] <> p.[i] then\n        raise (Not_equal (compare t.[i+offset] p.[i]));\n    done;\n    if m = k then 0\n    else (-1)\n  with Not_equal i -> i\n\nlet () =\n  let t = read_line () in\n  let n = String.length t in\n  let sa = construct_sa t n in\n  let q = read_int () in\n  for _ = 0 to q - 1 do\n    let p = read_line () in\n    let k = String.length p in\n    let l = ref 0 in\n    let r = ref (n + 1) in\n    while !l + 1 < !r do\n      let m = (!l + !r) / 2 in\n      let ret = range_cmp t n sa.(m) p k in\n      if ret <= 0 then l := m\n      else r := m;\n    done;\n    Printf.printf \"%d\\n\" (if range_cmp t n sa.(!l) p k = 0 then 1 else 0);\n  done", "problem_context": "String Search\n\nDetermine whether a text T includes a pattern P. Your program should answer for given queries consisting of P_i.\n\nInput\n\nIn the first line, a text T is given. In the second line, an integer Q denoting the number of queries is given. In the following Q lines, the patterns P_i are given respectively.\n\nOutput\n\nFor each question, print 1 if the text includes P_i, or print 0 otherwise.\n\nConstraints\n\n1 ≤ length of T ≤ 1000000\n\n1 ≤ length of P_i ≤ 1000\n\n1 ≤ Q ≤ 10000\n\nThe input consists of alphabetical characters and digits\n\nSample Input 1\n\naabaaa\n4\naa\nba\nbb\nxyz\n\nSample Output 1\n\n1\n1\n0\n0", "sample_input": "aabaaa\n4\naa\nba\nbb\nxyz\n"}, "reference_outputs": ["1\n1\n0\n0\n"], "source_document_id": "p02250", "source_text": "String Search\n\nDetermine whether a text T includes a pattern P. Your program should answer for given queries consisting of P_i.\n\nInput\n\nIn the first line, a text T is given. In the second line, an integer Q denoting the number of queries is given. In the following Q lines, the patterns P_i are given respectively.\n\nOutput\n\nFor each question, print 1 if the text includes P_i, or print 0 otherwise.\n\nConstraints\n\n1 ≤ length of T ≤ 1000000\n\n1 ≤ length of P_i ≤ 1000\n\n1 ≤ Q ≤ 10000\n\nThe input consists of alphabetical characters and digits\n\nSample Input 1\n\naabaaa\n4\naa\nba\nbb\nxyz\n\nSample Output 1\n\n1\n1\n0\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1582, "cpu_time_ms": 7250, "memory_kb": 30044}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s774690922", "group_id": "codeNet:p02257", "input_text": "let is_prime n = match n with\n    2|3|5|7 -> true\n    | n when n mod 2 = 0 -> false\n    | n ->\n       let rec loop i =\n         if i*i > n then true\n         else if n mod i = 0 then false\n         else loop (i+2);\n       in loop 3\n\nlet () =\n  let n = read_int () in\n  let rec read ct = function\n      0 -> ct\n    | i ->\n       let m = read_int () in\n       read (if is_prime m then ct+1 else ct) (i-1)\n  in\n  Printf.printf \"%d\\n\" (read 0 n)", "language": "OCaml", "metadata": {"date": 1467039090, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02257.html", "problem_id": "p02257", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02257/input.txt", "sample_output_relpath": "derived/input_output/data/p02257/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02257/OCaml/s774690922.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s774690922", "user_id": "u935184340"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let is_prime n = match n with\n    2|3|5|7 -> true\n    | n when n mod 2 = 0 -> false\n    | n ->\n       let rec loop i =\n         if i*i > n then true\n         else if n mod i = 0 then false\n         else loop (i+2);\n       in loop 3\n\nlet () =\n  let n = read_int () in\n  let rec read ct = function\n      0 -> ct\n    | i ->\n       let m = read_int () in\n       read (if is_prime m then ct+1 else ct) (i-1)\n  in\n  Printf.printf \"%d\\n\" (read 0 n)", "problem_context": "Prime Numbers\n\nA prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.\n\nWrite a program which reads a list of N integers and prints the number of prime numbers in the list.\n\nInput\n\nThe first line contains an integer N, the number of elements in the list.\n\nN numbers are given in the following lines.\n\nOutput\n\nPrint the number of prime numbers in the given list.\n\nConstraints\n\n1 ≤ N ≤ 10000\n\n2 ≤ an element of the list ≤ 108\n\nSample Input 1\n\n5\n2\n3\n4\n5\n6\n\nSample Output 1\n\n3\n\nSample Input 2\n\n11\n7\n8\n9\n10\n11\n12\n13\n14\n15\n16\n17\n\nSample Output 2\n\n4", "sample_input": "5\n2\n3\n4\n5\n6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02257", "source_text": "Prime Numbers\n\nA prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.\n\nWrite a program which reads a list of N integers and prints the number of prime numbers in the list.\n\nInput\n\nThe first line contains an integer N, the number of elements in the list.\n\nN numbers are given in the following lines.\n\nOutput\n\nPrint the number of prime numbers in the given list.\n\nConstraints\n\n1 ≤ N ≤ 10000\n\n2 ≤ an element of the list ≤ 108\n\nSample Input 1\n\n5\n2\n3\n4\n5\n6\n\nSample Output 1\n\n3\n\nSample Input 2\n\n11\n7\n8\n9\n10\n11\n12\n13\n14\n15\n16\n17\n\nSample Output 2\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 441, "cpu_time_ms": 10, "memory_kb": 3080}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s226899321", "group_id": "codeNet:p02257", "input_text": "let is_prime n =\n  if n = 2 || n = 3 || n = 5 then true\n  else if n mod 2 = 0 || n mod 3 = 0 || n mod 5 = 0 then false\n  else\n    let rec loop i =\n      if i*i > n then true\n      else if n mod i = 0 then false\n      else if n mod (i+2) = 0 then false\n      else loop (i+6);\n    in loop 5\n\nlet () =\n  let n = read_int () in\n  let rec read ct = function\n      0 -> ct\n    | i ->\n       let m = read_int () in\n       read (if is_prime m then ct+1 else ct) (i-1)\n  in\n  Printf.printf \"%d\\n\" (read 0 n)", "language": "OCaml", "metadata": {"date": 1467040391, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02257.html", "problem_id": "p02257", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02257/input.txt", "sample_output_relpath": "derived/input_output/data/p02257/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02257/OCaml/s226899321.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s226899321", "user_id": "u935184340"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let is_prime n =\n  if n = 2 || n = 3 || n = 5 then true\n  else if n mod 2 = 0 || n mod 3 = 0 || n mod 5 = 0 then false\n  else\n    let rec loop i =\n      if i*i > n then true\n      else if n mod i = 0 then false\n      else if n mod (i+2) = 0 then false\n      else loop (i+6);\n    in loop 5\n\nlet () =\n  let n = read_int () in\n  let rec read ct = function\n      0 -> ct\n    | i ->\n       let m = read_int () in\n       read (if is_prime m then ct+1 else ct) (i-1)\n  in\n  Printf.printf \"%d\\n\" (read 0 n)", "problem_context": "Prime Numbers\n\nA prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.\n\nWrite a program which reads a list of N integers and prints the number of prime numbers in the list.\n\nInput\n\nThe first line contains an integer N, the number of elements in the list.\n\nN numbers are given in the following lines.\n\nOutput\n\nPrint the number of prime numbers in the given list.\n\nConstraints\n\n1 ≤ N ≤ 10000\n\n2 ≤ an element of the list ≤ 108\n\nSample Input 1\n\n5\n2\n3\n4\n5\n6\n\nSample Output 1\n\n3\n\nSample Input 2\n\n11\n7\n8\n9\n10\n11\n12\n13\n14\n15\n16\n17\n\nSample Output 2\n\n4", "sample_input": "5\n2\n3\n4\n5\n6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02257", "source_text": "Prime Numbers\n\nA prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.\n\nWrite a program which reads a list of N integers and prints the number of prime numbers in the list.\n\nInput\n\nThe first line contains an integer N, the number of elements in the list.\n\nN numbers are given in the following lines.\n\nOutput\n\nPrint the number of prime numbers in the given list.\n\nConstraints\n\n1 ≤ N ≤ 10000\n\n2 ≤ an element of the list ≤ 108\n\nSample Input 1\n\n5\n2\n3\n4\n5\n6\n\nSample Output 1\n\n3\n\nSample Input 2\n\n11\n7\n8\n9\n10\n11\n12\n13\n14\n15\n16\n17\n\nSample Output 2\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 498, "cpu_time_ms": 10, "memory_kb": 3092}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s032498133", "group_id": "codeNet:p02258", "input_text": "let () =\n  let n = read_int () in\n  let rec doit i m ans =\n    if i >= n then ans\n    else let r = read_int () in let x = r - m in doit (i + 1) (if m < r then m else r) (if x > ans then x else ans)\n  in\n  Printf.printf \"%d\\n\" (doit 1 (read_int ()) min_int)", "language": "OCaml", "metadata": {"date": 1473950329, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02258.html", "problem_id": "p02258", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02258/input.txt", "sample_output_relpath": "derived/input_output/data/p02258/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02258/OCaml/s032498133.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s032498133", "user_id": "u809138450"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let () =\n  let n = read_int () in\n  let rec doit i m ans =\n    if i >= n then ans\n    else let r = read_int () in let x = r - m in doit (i + 1) (if m < r then m else r) (if x > ans then x else ans)\n  in\n  Printf.printf \"%d\\n\" (doit 1 (read_int ()) min_int)", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nMaximum Profit\n\nYou can obtain profits from foreign exchange margin transactions. For example, if you buy 1000 dollar at a rate of 100 yen per dollar, and sell them at a rate of 108 yen per dollar, you can obtain (108 - 100) × 1000 = 8000 yen.\n\nWrite a program which reads values of a currency $R_t$ at a certain time $t$ ($t = 0, 1, 2, ... n-1$), and reports the maximum value of $R_j - R_i$ where $j > i$ .\n\nInput\n\nThe first line contains an integer $n$. In the following $n$ lines, $R_t$ ($t = 0, 1, 2, ... n-1$) are given in order.\n\nOutput\n\nPrint the maximum value in a line.\n\nConstraints\n\n$2 \\leq n \\leq 200,000$\n\n$1 \\leq R_t \\leq 10^9$\n\nSample Input 1\n\n6\n5\n3\n1\n3\n4\n3\n\nSample Output 1\n\n3\n\nSample Input 2\n\n3\n4\n3\n2\n\nSample Output 2\n\n-1", "sample_input": "6\n5\n3\n1\n3\n4\n3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02258", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nMaximum Profit\n\nYou can obtain profits from foreign exchange margin transactions. For example, if you buy 1000 dollar at a rate of 100 yen per dollar, and sell them at a rate of 108 yen per dollar, you can obtain (108 - 100) × 1000 = 8000 yen.\n\nWrite a program which reads values of a currency $R_t$ at a certain time $t$ ($t = 0, 1, 2, ... n-1$), and reports the maximum value of $R_j - R_i$ where $j > i$ .\n\nInput\n\nThe first line contains an integer $n$. In the following $n$ lines, $R_t$ ($t = 0, 1, 2, ... n-1$) are given in order.\n\nOutput\n\nPrint the maximum value in a line.\n\nConstraints\n\n$2 \\leq n \\leq 200,000$\n\n$1 \\leq R_t \\leq 10^9$\n\nSample Input 1\n\n6\n5\n3\n1\n3\n4\n3\n\nSample Output 1\n\n3\n\nSample Input 2\n\n3\n4\n3\n2\n\nSample Output 2\n\n-1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 256, "cpu_time_ms": 10, "memory_kb": 4480}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s663747591", "group_id": "codeNet:p02264", "input_text": "let split str delim =\n  let rec doit s acc =\n    match\n      try Some (String.rindex s delim) with _ -> None\n    with\n    | None -> s :: acc\n    | Some i ->\n        let s1 = String.sub s 0 i in\n        let s2 = String.sub s (i + 1) (String.length s - String.length s1 - 1) in\n        doit s1 (s2 :: acc)\n  in\n  doit str []\n\nlet () =\n  let open Queue in\n  let (que : (string * int) Queue.t) = create () in\n  match List.map int_of_string (split (read_line ()) ' ') with\n  | [n; q] -> begin\n      let rec read i =\n        if i < n then begin\n          match split (read_line ()) ' ' with\n          | [s; t] -> (add (s, int_of_string t) que; read (i + 1))\n          | _ -> exit 1\n        end\n      in\n      read 0;\n      let rec doit cnt =\n        if not (is_empty que) then begin\n          let s, t = take que in\n          let rest = t - q in\n          if rest <= 0 then (let x = cnt + t in print_string s; print_char ' '; print_int x; print_char '\\n'; doit x)\n          else (add (s, rest) que; doit (cnt + q))\n        end\n      in\n      doit 0\n    end\n  | _ -> exit 1", "language": "OCaml", "metadata": {"date": 1474800218, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02264.html", "problem_id": "p02264", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02264/input.txt", "sample_output_relpath": "derived/input_output/data/p02264/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02264/OCaml/s663747591.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s663747591", "user_id": "u809138450"}, "prompt_components": {"gold_output": "p2 180\np5 400\np1 450\np3 550\np4 800\n", "input_to_evaluate": "let split str delim =\n  let rec doit s acc =\n    match\n      try Some (String.rindex s delim) with _ -> None\n    with\n    | None -> s :: acc\n    | Some i ->\n        let s1 = String.sub s 0 i in\n        let s2 = String.sub s (i + 1) (String.length s - String.length s1 - 1) in\n        doit s1 (s2 :: acc)\n  in\n  doit str []\n\nlet () =\n  let open Queue in\n  let (que : (string * int) Queue.t) = create () in\n  match List.map int_of_string (split (read_line ()) ' ') with\n  | [n; q] -> begin\n      let rec read i =\n        if i < n then begin\n          match split (read_line ()) ' ' with\n          | [s; t] -> (add (s, int_of_string t) que; read (i + 1))\n          | _ -> exit 1\n        end\n      in\n      read 0;\n      let rec doit cnt =\n        if not (is_empty que) then begin\n          let s, t = take que in\n          let rest = t - q in\n          if rest <= 0 then (let x = cnt + t in print_string s; print_char ' '; print_int x; print_char '\\n'; doit x)\n          else (add (s, rest) que; doit (cnt + q))\n        end\n      in\n      doit 0\n    end\n  | _ -> exit 1", "problem_context": "There are n processes in a queue. Each process has namei and timei. The round-robin scheduling handles the processes in order. A round-robin scheduler gives each process a quantum (a time slot) and interrupts the process if it is not completed by then. The process is resumed and moved to the end of the queue, then the scheduler handles the next process in the queue.\n\nFor example, we have the following queue with the quantum of 100ms.\n\nA(150) - B(80) - C(200) - D(200)\n\nFirst, process A is handled for 100ms, then the process is moved to the end of the queue with the remaining time (50ms).\n\nB(80) - C(200) - D(200) - A(50)\n\nNext, process B is handled for 80ms. The process is completed with the time stamp of 180ms and removed from the queue.\n\nC(200) - D(200) - A(50)\n\nYour task is to write a program which simulates the round-robin scheduling.\n\nInput\n\nn q\n\nname1 time1\n\nname2 time2\n\n...\n\nnamen timen\n\nIn the first line the number of processes n and the quantum q are given separated by a single space.\n\nIn the following n lines, names and times for the n processes are given. namei and timei are separated by a single space.\n\nOutput\n\nFor each process, prints its name and the time the process finished in order.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 1000\n\n1 ≤ timei ≤ 50000\n\n1 ≤ length of namei ≤ 10\n\n1 ≤ Sum of timei ≤ 1000000\n\nSample Input 1\n\n5 100\np1 150\np2 80\np3 200\np4 350\np5 20\n\nSample Output 1\n\np2 180\np5 400\np1 450\np3 550\np4 800\n\nNotes\n\nTemplate in C", "sample_input": "5 100\np1 150\np2 80\np3 200\np4 350\np5 20\n"}, "reference_outputs": ["p2 180\np5 400\np1 450\np3 550\np4 800\n"], "source_document_id": "p02264", "source_text": "There are n processes in a queue. Each process has namei and timei. The round-robin scheduling handles the processes in order. A round-robin scheduler gives each process a quantum (a time slot) and interrupts the process if it is not completed by then. The process is resumed and moved to the end of the queue, then the scheduler handles the next process in the queue.\n\nFor example, we have the following queue with the quantum of 100ms.\n\nA(150) - B(80) - C(200) - D(200)\n\nFirst, process A is handled for 100ms, then the process is moved to the end of the queue with the remaining time (50ms).\n\nB(80) - C(200) - D(200) - A(50)\n\nNext, process B is handled for 80ms. The process is completed with the time stamp of 180ms and removed from the queue.\n\nC(200) - D(200) - A(50)\n\nYour task is to write a program which simulates the round-robin scheduling.\n\nInput\n\nn q\n\nname1 time1\n\nname2 time2\n\n...\n\nnamen timen\n\nIn the first line the number of processes n and the quantum q are given separated by a single space.\n\nIn the following n lines, names and times for the n processes are given. namei and timei are separated by a single space.\n\nOutput\n\nFor each process, prints its name and the time the process finished in order.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 1000\n\n1 ≤ timei ≤ 50000\n\n1 ≤ length of namei ≤ 10\n\n1 ≤ Sum of timei ≤ 1000000\n\nSample Input 1\n\n5 100\np1 150\np2 80\np3 200\np4 350\np5 20\n\nSample Output 1\n\np2 180\np5 400\np1 450\np3 550\np4 800\n\nNotes\n\nTemplate in C", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1066, "cpu_time_ms": 20, "memory_kb": 10684}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s089621959", "group_id": "codeNet:p02264", "input_text": "let () =\n  let open Queue in\n  let (n:int),(quantum:int) = Scanf.scanf \"%d %d\\n\" (fun a b -> a,b) in\n  let (q:(string * int) t) = create () in\n  try\n    while true do\n      add (Scanf.scanf \"%s %d\\n\" (fun a b -> a,b)) q\n    done;\n  with _ ->\n    let (sum:int ref) = ref 0 in\n    try\n      while true do\n        let (p:string),(t:int) = take q in\n        if t <= quantum then (sum := !sum+t; Printf.printf \"%s %d\\n\" p !sum)\n        else (add (p,t-quantum) q; sum := !sum+quantum)\n      done;\n    with _ -> ()", "language": "OCaml", "metadata": {"date": 1477218804, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02264.html", "problem_id": "p02264", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02264/input.txt", "sample_output_relpath": "derived/input_output/data/p02264/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02264/OCaml/s089621959.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s089621959", "user_id": "u995793569"}, "prompt_components": {"gold_output": "p2 180\np5 400\np1 450\np3 550\np4 800\n", "input_to_evaluate": "let () =\n  let open Queue in\n  let (n:int),(quantum:int) = Scanf.scanf \"%d %d\\n\" (fun a b -> a,b) in\n  let (q:(string * int) t) = create () in\n  try\n    while true do\n      add (Scanf.scanf \"%s %d\\n\" (fun a b -> a,b)) q\n    done;\n  with _ ->\n    let (sum:int ref) = ref 0 in\n    try\n      while true do\n        let (p:string),(t:int) = take q in\n        if t <= quantum then (sum := !sum+t; Printf.printf \"%s %d\\n\" p !sum)\n        else (add (p,t-quantum) q; sum := !sum+quantum)\n      done;\n    with _ -> ()", "problem_context": "There are n processes in a queue. Each process has namei and timei. The round-robin scheduling handles the processes in order. A round-robin scheduler gives each process a quantum (a time slot) and interrupts the process if it is not completed by then. The process is resumed and moved to the end of the queue, then the scheduler handles the next process in the queue.\n\nFor example, we have the following queue with the quantum of 100ms.\n\nA(150) - B(80) - C(200) - D(200)\n\nFirst, process A is handled for 100ms, then the process is moved to the end of the queue with the remaining time (50ms).\n\nB(80) - C(200) - D(200) - A(50)\n\nNext, process B is handled for 80ms. The process is completed with the time stamp of 180ms and removed from the queue.\n\nC(200) - D(200) - A(50)\n\nYour task is to write a program which simulates the round-robin scheduling.\n\nInput\n\nn q\n\nname1 time1\n\nname2 time2\n\n...\n\nnamen timen\n\nIn the first line the number of processes n and the quantum q are given separated by a single space.\n\nIn the following n lines, names and times for the n processes are given. namei and timei are separated by a single space.\n\nOutput\n\nFor each process, prints its name and the time the process finished in order.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 1000\n\n1 ≤ timei ≤ 50000\n\n1 ≤ length of namei ≤ 10\n\n1 ≤ Sum of timei ≤ 1000000\n\nSample Input 1\n\n5 100\np1 150\np2 80\np3 200\np4 350\np5 20\n\nSample Output 1\n\np2 180\np5 400\np1 450\np3 550\np4 800\n\nNotes\n\nTemplate in C", "sample_input": "5 100\np1 150\np2 80\np3 200\np4 350\np5 20\n"}, "reference_outputs": ["p2 180\np5 400\np1 450\np3 550\np4 800\n"], "source_document_id": "p02264", "source_text": "There are n processes in a queue. Each process has namei and timei. The round-robin scheduling handles the processes in order. A round-robin scheduler gives each process a quantum (a time slot) and interrupts the process if it is not completed by then. The process is resumed and moved to the end of the queue, then the scheduler handles the next process in the queue.\n\nFor example, we have the following queue with the quantum of 100ms.\n\nA(150) - B(80) - C(200) - D(200)\n\nFirst, process A is handled for 100ms, then the process is moved to the end of the queue with the remaining time (50ms).\n\nB(80) - C(200) - D(200) - A(50)\n\nNext, process B is handled for 80ms. The process is completed with the time stamp of 180ms and removed from the queue.\n\nC(200) - D(200) - A(50)\n\nYour task is to write a program which simulates the round-robin scheduling.\n\nInput\n\nn q\n\nname1 time1\n\nname2 time2\n\n...\n\nnamen timen\n\nIn the first line the number of processes n and the quantum q are given separated by a single space.\n\nIn the following n lines, names and times for the n processes are given. namei and timei are separated by a single space.\n\nOutput\n\nFor each process, prints its name and the time the process finished in order.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 1000\n\n1 ≤ timei ≤ 50000\n\n1 ≤ length of namei ≤ 10\n\n1 ≤ Sum of timei ≤ 1000000\n\nSample Input 1\n\n5 100\np1 150\np2 80\np3 200\np4 350\np5 20\n\nSample Output 1\n\np2 180\np5 400\np1 450\np3 550\np4 800\n\nNotes\n\nTemplate in C", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 507, "cpu_time_ms": 40, "memory_kb": 12740}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s938085011", "group_id": "codeNet:p02264", "input_text": "let () =\n  let open Queue in\n  let (n:int),(quantum:int) = Scanf.scanf \"%d %d\\n\" (fun a b -> a,b) in\n  let (q:(string * int) t) = create () in\n  for i=1 to n do\n    add (Scanf.scanf \"%s %d\\n\" (fun a b -> a,b)) q\n  done;\n  let (sum:int ref) = ref 0 in\n  while not (is_empty q) do\n    let (p:string),(t:int) = take q in\n    if t <= quantum then begin sum := !sum+t; Printf.printf \"%s %d\\n\" p !sum end\n    else begin add (p,t-quantum) q; sum := !sum+quantum end\n  done", "language": "OCaml", "metadata": {"date": 1477218953, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02264.html", "problem_id": "p02264", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02264/input.txt", "sample_output_relpath": "derived/input_output/data/p02264/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02264/OCaml/s938085011.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s938085011", "user_id": "u995793569"}, "prompt_components": {"gold_output": "p2 180\np5 400\np1 450\np3 550\np4 800\n", "input_to_evaluate": "let () =\n  let open Queue in\n  let (n:int),(quantum:int) = Scanf.scanf \"%d %d\\n\" (fun a b -> a,b) in\n  let (q:(string * int) t) = create () in\n  for i=1 to n do\n    add (Scanf.scanf \"%s %d\\n\" (fun a b -> a,b)) q\n  done;\n  let (sum:int ref) = ref 0 in\n  while not (is_empty q) do\n    let (p:string),(t:int) = take q in\n    if t <= quantum then begin sum := !sum+t; Printf.printf \"%s %d\\n\" p !sum end\n    else begin add (p,t-quantum) q; sum := !sum+quantum end\n  done", "problem_context": "There are n processes in a queue. Each process has namei and timei. The round-robin scheduling handles the processes in order. A round-robin scheduler gives each process a quantum (a time slot) and interrupts the process if it is not completed by then. The process is resumed and moved to the end of the queue, then the scheduler handles the next process in the queue.\n\nFor example, we have the following queue with the quantum of 100ms.\n\nA(150) - B(80) - C(200) - D(200)\n\nFirst, process A is handled for 100ms, then the process is moved to the end of the queue with the remaining time (50ms).\n\nB(80) - C(200) - D(200) - A(50)\n\nNext, process B is handled for 80ms. The process is completed with the time stamp of 180ms and removed from the queue.\n\nC(200) - D(200) - A(50)\n\nYour task is to write a program which simulates the round-robin scheduling.\n\nInput\n\nn q\n\nname1 time1\n\nname2 time2\n\n...\n\nnamen timen\n\nIn the first line the number of processes n and the quantum q are given separated by a single space.\n\nIn the following n lines, names and times for the n processes are given. namei and timei are separated by a single space.\n\nOutput\n\nFor each process, prints its name and the time the process finished in order.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 1000\n\n1 ≤ timei ≤ 50000\n\n1 ≤ length of namei ≤ 10\n\n1 ≤ Sum of timei ≤ 1000000\n\nSample Input 1\n\n5 100\np1 150\np2 80\np3 200\np4 350\np5 20\n\nSample Output 1\n\np2 180\np5 400\np1 450\np3 550\np4 800\n\nNotes\n\nTemplate in C", "sample_input": "5 100\np1 150\np2 80\np3 200\np4 350\np5 20\n"}, "reference_outputs": ["p2 180\np5 400\np1 450\np3 550\np4 800\n"], "source_document_id": "p02264", "source_text": "There are n processes in a queue. Each process has namei and timei. The round-robin scheduling handles the processes in order. A round-robin scheduler gives each process a quantum (a time slot) and interrupts the process if it is not completed by then. The process is resumed and moved to the end of the queue, then the scheduler handles the next process in the queue.\n\nFor example, we have the following queue with the quantum of 100ms.\n\nA(150) - B(80) - C(200) - D(200)\n\nFirst, process A is handled for 100ms, then the process is moved to the end of the queue with the remaining time (50ms).\n\nB(80) - C(200) - D(200) - A(50)\n\nNext, process B is handled for 80ms. The process is completed with the time stamp of 180ms and removed from the queue.\n\nC(200) - D(200) - A(50)\n\nYour task is to write a program which simulates the round-robin scheduling.\n\nInput\n\nn q\n\nname1 time1\n\nname2 time2\n\n...\n\nnamen timen\n\nIn the first line the number of processes n and the quantum q are given separated by a single space.\n\nIn the following n lines, names and times for the n processes are given. namei and timei are separated by a single space.\n\nOutput\n\nFor each process, prints its name and the time the process finished in order.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 1000\n\n1 ≤ timei ≤ 50000\n\n1 ≤ length of namei ≤ 10\n\n1 ≤ Sum of timei ≤ 1000000\n\nSample Input 1\n\n5 100\np1 150\np2 80\np3 200\np4 350\np5 20\n\nSample Output 1\n\np2 180\np5 400\np1 450\np3 550\np4 800\n\nNotes\n\nTemplate in C", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 465, "cpu_time_ms": 40, "memory_kb": 12588}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s655323976", "group_id": "codeNet:p02264", "input_text": "module Queue' = struct\n  type 'a t = {\n    mutable front : int;\n    mutable mask  : int;\n    mutable index : int;\n    mutable length : int;\n    mutable elems : 'a option array\n  }\n\n  let capacity t = t.mask + 1\n\n  let is_empty t = t.length = 0\n\n  let create ?(capacity=1) () =\n    { front = 0;\n      mask  = capacity - 1;\n      index = 0;\n      length = 0;\n      elems = Array.make capacity None}\n\n  let enq t a =\n    let elems = t.elems in\n    elems.(t.index) <- (Some a);\n    t.length <- t.length + 1;\n    t.index <- (t.index + 1) mod (capacity t)\n\n  let deq t =\n    let elems = t.elems in\n    let front = t.front in\n    let res = elems.(front) in\n    t.front <- (t.front + 1) mod (capacity t);\n    t.length <- t.length - 1;\n    res\n\n  let get_elems t = t.elems\n  let get_index t = t.index\nend\n\nlet () =\n  let open Queue' in\n  let (n:int),(quantum:int) = Scanf.scanf \"%d %d\\n\" (fun a b -> a,b) in\n  let (q:(string * int) t) = create ~capacity:n () in\n  for i=1 to n do\n    enq q (Scanf.scanf \"%s %d\\n\" (fun a b -> a,b));\n  done;\n  let (sum:int ref) = ref 0 in\n  while not (is_empty q) do\n    let (p:string),(t:int) = match deq q with None -> \"\",0 | Some x -> x in\n    if t <= quantum then (sum := !sum+t; Printf.printf \"%s %d\\n\" p !sum)\n    else (enq q (p,t-quantum); sum := !sum+quantum)\n  done", "language": "OCaml", "metadata": {"date": 1477241906, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02264.html", "problem_id": "p02264", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02264/input.txt", "sample_output_relpath": "derived/input_output/data/p02264/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02264/OCaml/s655323976.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s655323976", "user_id": "u995793569"}, "prompt_components": {"gold_output": "p2 180\np5 400\np1 450\np3 550\np4 800\n", "input_to_evaluate": "module Queue' = struct\n  type 'a t = {\n    mutable front : int;\n    mutable mask  : int;\n    mutable index : int;\n    mutable length : int;\n    mutable elems : 'a option array\n  }\n\n  let capacity t = t.mask + 1\n\n  let is_empty t = t.length = 0\n\n  let create ?(capacity=1) () =\n    { front = 0;\n      mask  = capacity - 1;\n      index = 0;\n      length = 0;\n      elems = Array.make capacity None}\n\n  let enq t a =\n    let elems = t.elems in\n    elems.(t.index) <- (Some a);\n    t.length <- t.length + 1;\n    t.index <- (t.index + 1) mod (capacity t)\n\n  let deq t =\n    let elems = t.elems in\n    let front = t.front in\n    let res = elems.(front) in\n    t.front <- (t.front + 1) mod (capacity t);\n    t.length <- t.length - 1;\n    res\n\n  let get_elems t = t.elems\n  let get_index t = t.index\nend\n\nlet () =\n  let open Queue' in\n  let (n:int),(quantum:int) = Scanf.scanf \"%d %d\\n\" (fun a b -> a,b) in\n  let (q:(string * int) t) = create ~capacity:n () in\n  for i=1 to n do\n    enq q (Scanf.scanf \"%s %d\\n\" (fun a b -> a,b));\n  done;\n  let (sum:int ref) = ref 0 in\n  while not (is_empty q) do\n    let (p:string),(t:int) = match deq q with None -> \"\",0 | Some x -> x in\n    if t <= quantum then (sum := !sum+t; Printf.printf \"%s %d\\n\" p !sum)\n    else (enq q (p,t-quantum); sum := !sum+quantum)\n  done", "problem_context": "There are n processes in a queue. Each process has namei and timei. The round-robin scheduling handles the processes in order. A round-robin scheduler gives each process a quantum (a time slot) and interrupts the process if it is not completed by then. The process is resumed and moved to the end of the queue, then the scheduler handles the next process in the queue.\n\nFor example, we have the following queue with the quantum of 100ms.\n\nA(150) - B(80) - C(200) - D(200)\n\nFirst, process A is handled for 100ms, then the process is moved to the end of the queue with the remaining time (50ms).\n\nB(80) - C(200) - D(200) - A(50)\n\nNext, process B is handled for 80ms. The process is completed with the time stamp of 180ms and removed from the queue.\n\nC(200) - D(200) - A(50)\n\nYour task is to write a program which simulates the round-robin scheduling.\n\nInput\n\nn q\n\nname1 time1\n\nname2 time2\n\n...\n\nnamen timen\n\nIn the first line the number of processes n and the quantum q are given separated by a single space.\n\nIn the following n lines, names and times for the n processes are given. namei and timei are separated by a single space.\n\nOutput\n\nFor each process, prints its name and the time the process finished in order.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 1000\n\n1 ≤ timei ≤ 50000\n\n1 ≤ length of namei ≤ 10\n\n1 ≤ Sum of timei ≤ 1000000\n\nSample Input 1\n\n5 100\np1 150\np2 80\np3 200\np4 350\np5 20\n\nSample Output 1\n\np2 180\np5 400\np1 450\np3 550\np4 800\n\nNotes\n\nTemplate in C", "sample_input": "5 100\np1 150\np2 80\np3 200\np4 350\np5 20\n"}, "reference_outputs": ["p2 180\np5 400\np1 450\np3 550\np4 800\n"], "source_document_id": "p02264", "source_text": "There are n processes in a queue. Each process has namei and timei. The round-robin scheduling handles the processes in order. A round-robin scheduler gives each process a quantum (a time slot) and interrupts the process if it is not completed by then. The process is resumed and moved to the end of the queue, then the scheduler handles the next process in the queue.\n\nFor example, we have the following queue with the quantum of 100ms.\n\nA(150) - B(80) - C(200) - D(200)\n\nFirst, process A is handled for 100ms, then the process is moved to the end of the queue with the remaining time (50ms).\n\nB(80) - C(200) - D(200) - A(50)\n\nNext, process B is handled for 80ms. The process is completed with the time stamp of 180ms and removed from the queue.\n\nC(200) - D(200) - A(50)\n\nYour task is to write a program which simulates the round-robin scheduling.\n\nInput\n\nn q\n\nname1 time1\n\nname2 time2\n\n...\n\nnamen timen\n\nIn the first line the number of processes n and the quantum q are given separated by a single space.\n\nIn the following n lines, names and times for the n processes are given. namei and timei are separated by a single space.\n\nOutput\n\nFor each process, prints its name and the time the process finished in order.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 1000\n\n1 ≤ timei ≤ 50000\n\n1 ≤ length of namei ≤ 10\n\n1 ≤ Sum of timei ≤ 1000000\n\nSample Input 1\n\n5 100\np1 150\np2 80\np3 200\np4 350\np5 20\n\nSample Output 1\n\np2 180\np5 400\np1 450\np3 550\np4 800\n\nNotes\n\nTemplate in C", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1297, "cpu_time_ms": 40, "memory_kb": 11996}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s701513630", "group_id": "codeNet:p02264", "input_text": "let () =\n  let open Queue in\n  let (n:int),(quantum:int) = Scanf.scanf \"%d %d\\n\" (fun a b -> a,b) in\n  let (q:(string * int) t) = create () in\n  for i=1 to n do\n    add (Scanf.scanf \"%s %d\\n\" (fun a b -> a,b)) q\n  done;\n  let (sum:int ref) = ref 0 in\n  while not (is_empty q) do\n    match take q with\n      p,t when t <= quantum ->\n      sum := !sum + t;\n      Printf.printf \"%s %d\\n\" p !sum\n    | p,t ->\n      add (p,t-quantum) q;\n      sum := !sum+quantum\n  done", "language": "OCaml", "metadata": {"date": 1477359689, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02264.html", "problem_id": "p02264", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02264/input.txt", "sample_output_relpath": "derived/input_output/data/p02264/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02264/OCaml/s701513630.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s701513630", "user_id": "u995793569"}, "prompt_components": {"gold_output": "p2 180\np5 400\np1 450\np3 550\np4 800\n", "input_to_evaluate": "let () =\n  let open Queue in\n  let (n:int),(quantum:int) = Scanf.scanf \"%d %d\\n\" (fun a b -> a,b) in\n  let (q:(string * int) t) = create () in\n  for i=1 to n do\n    add (Scanf.scanf \"%s %d\\n\" (fun a b -> a,b)) q\n  done;\n  let (sum:int ref) = ref 0 in\n  while not (is_empty q) do\n    match take q with\n      p,t when t <= quantum ->\n      sum := !sum + t;\n      Printf.printf \"%s %d\\n\" p !sum\n    | p,t ->\n      add (p,t-quantum) q;\n      sum := !sum+quantum\n  done", "problem_context": "There are n processes in a queue. Each process has namei and timei. The round-robin scheduling handles the processes in order. A round-robin scheduler gives each process a quantum (a time slot) and interrupts the process if it is not completed by then. The process is resumed and moved to the end of the queue, then the scheduler handles the next process in the queue.\n\nFor example, we have the following queue with the quantum of 100ms.\n\nA(150) - B(80) - C(200) - D(200)\n\nFirst, process A is handled for 100ms, then the process is moved to the end of the queue with the remaining time (50ms).\n\nB(80) - C(200) - D(200) - A(50)\n\nNext, process B is handled for 80ms. The process is completed with the time stamp of 180ms and removed from the queue.\n\nC(200) - D(200) - A(50)\n\nYour task is to write a program which simulates the round-robin scheduling.\n\nInput\n\nn q\n\nname1 time1\n\nname2 time2\n\n...\n\nnamen timen\n\nIn the first line the number of processes n and the quantum q are given separated by a single space.\n\nIn the following n lines, names and times for the n processes are given. namei and timei are separated by a single space.\n\nOutput\n\nFor each process, prints its name and the time the process finished in order.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 1000\n\n1 ≤ timei ≤ 50000\n\n1 ≤ length of namei ≤ 10\n\n1 ≤ Sum of timei ≤ 1000000\n\nSample Input 1\n\n5 100\np1 150\np2 80\np3 200\np4 350\np5 20\n\nSample Output 1\n\np2 180\np5 400\np1 450\np3 550\np4 800\n\nNotes\n\nTemplate in C", "sample_input": "5 100\np1 150\np2 80\np3 200\np4 350\np5 20\n"}, "reference_outputs": ["p2 180\np5 400\np1 450\np3 550\np4 800\n"], "source_document_id": "p02264", "source_text": "There are n processes in a queue. Each process has namei and timei. The round-robin scheduling handles the processes in order. A round-robin scheduler gives each process a quantum (a time slot) and interrupts the process if it is not completed by then. The process is resumed and moved to the end of the queue, then the scheduler handles the next process in the queue.\n\nFor example, we have the following queue with the quantum of 100ms.\n\nA(150) - B(80) - C(200) - D(200)\n\nFirst, process A is handled for 100ms, then the process is moved to the end of the queue with the remaining time (50ms).\n\nB(80) - C(200) - D(200) - A(50)\n\nNext, process B is handled for 80ms. The process is completed with the time stamp of 180ms and removed from the queue.\n\nC(200) - D(200) - A(50)\n\nYour task is to write a program which simulates the round-robin scheduling.\n\nInput\n\nn q\n\nname1 time1\n\nname2 time2\n\n...\n\nnamen timen\n\nIn the first line the number of processes n and the quantum q are given separated by a single space.\n\nIn the following n lines, names and times for the n processes are given. namei and timei are separated by a single space.\n\nOutput\n\nFor each process, prints its name and the time the process finished in order.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 1000\n\n1 ≤ timei ≤ 50000\n\n1 ≤ length of namei ≤ 10\n\n1 ≤ Sum of timei ≤ 1000000\n\nSample Input 1\n\n5 100\np1 150\np2 80\np3 200\np4 350\np5 20\n\nSample Output 1\n\np2 180\np5 400\np1 450\np3 550\np4 800\n\nNotes\n\nTemplate in C", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 464, "cpu_time_ms": 30, "memory_kb": 12680}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s420583065", "group_id": "codeNet:p02265", "input_text": "module DoublyLinkedList = struct\n  type t = {\n    mutable data : int;\n    mutable next : t;\n    mutable prev : t;\n  }\n\n  let make () =\n    let rec head = { data = 0; next = head; prev = head } in\n    head\n\n  let insert data head =\n    let x = { data = data; next = head.next; prev = head } in\n    head.next.prev <- x;\n    head.next <- x\n\n  let delete x =\n    x.next.prev <- x.prev;\n    x.prev.next <- x.next\n\n  let delete_first head = delete head.next\n\n  let delete_last head = delete head.prev\n\n  let delete_node data head =\n    let rec doit ite =\n      if ite == head || ite.data = data then ite\n      else doit ite.next\n    in\n    delete (doit head.next)\n\n  let iteri head ~f =\n    let rec doit i ite =\n      if ite == head then ()\n      else (f i ite.data; doit (i + 1) ite.next)\n    in\n    doit 0 head.next\nend\n\nmodule L = DoublyLinkedList\n\nlet split str delim =\n  let rec doit s acc =\n    match\n      try Some (String.index s delim)\n      with _ -> None\n    with\n    | None -> List.rev (s :: acc)\n    | Some i ->\n        let s1 = String.sub s 0 i in\n        let s2 = String.sub s (i + 1) (String.length s - String.length s1 - 1) in\n        doit s2 (s1 :: acc)\n  in\n  doit str []\n\nlet _ =\n  let n = read_int () in\n  let head = L.make () in\n  let rec read i =\n    if i >= n then ()\n    else begin\n      match split (read_line ()) ' ' with\n      | \"insert\" :: n :: _ -> (L.insert (int_of_string n) head; read (i + 1))\n      | \"delete\" :: n :: _ -> (L.delete_node (int_of_string n) head; read (i + 1))\n      | \"deleteFirst\" :: _ -> (L.delete_first head; read (i + 1))\n      | \"deleteLast\" :: _ -> (L.delete_last head; read (i + 1))\n      | _ -> exit 1\n    end\n  in\n  read 0;\n  L.iteri head ~f:(fun i n -> Printf.printf (if i = 0 then \"%d\" else \" %d\") n);\n  print_newline ()", "language": "OCaml", "metadata": {"date": 1473144995, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02265.html", "problem_id": "p02265", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02265/input.txt", "sample_output_relpath": "derived/input_output/data/p02265/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02265/OCaml/s420583065.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s420583065", "user_id": "u809138450"}, "prompt_components": {"gold_output": "6 1 2\n", "input_to_evaluate": "module DoublyLinkedList = struct\n  type t = {\n    mutable data : int;\n    mutable next : t;\n    mutable prev : t;\n  }\n\n  let make () =\n    let rec head = { data = 0; next = head; prev = head } in\n    head\n\n  let insert data head =\n    let x = { data = data; next = head.next; prev = head } in\n    head.next.prev <- x;\n    head.next <- x\n\n  let delete x =\n    x.next.prev <- x.prev;\n    x.prev.next <- x.next\n\n  let delete_first head = delete head.next\n\n  let delete_last head = delete head.prev\n\n  let delete_node data head =\n    let rec doit ite =\n      if ite == head || ite.data = data then ite\n      else doit ite.next\n    in\n    delete (doit head.next)\n\n  let iteri head ~f =\n    let rec doit i ite =\n      if ite == head then ()\n      else (f i ite.data; doit (i + 1) ite.next)\n    in\n    doit 0 head.next\nend\n\nmodule L = DoublyLinkedList\n\nlet split str delim =\n  let rec doit s acc =\n    match\n      try Some (String.index s delim)\n      with _ -> None\n    with\n    | None -> List.rev (s :: acc)\n    | Some i ->\n        let s1 = String.sub s 0 i in\n        let s2 = String.sub s (i + 1) (String.length s - String.length s1 - 1) in\n        doit s2 (s1 :: acc)\n  in\n  doit str []\n\nlet _ =\n  let n = read_int () in\n  let head = L.make () in\n  let rec read i =\n    if i >= n then ()\n    else begin\n      match split (read_line ()) ' ' with\n      | \"insert\" :: n :: _ -> (L.insert (int_of_string n) head; read (i + 1))\n      | \"delete\" :: n :: _ -> (L.delete_node (int_of_string n) head; read (i + 1))\n      | \"deleteFirst\" :: _ -> (L.delete_first head; read (i + 1))\n      | \"deleteLast\" :: _ -> (L.delete_last head; read (i + 1))\n      | _ -> exit 1\n    end\n  in\n  read 0;\n  L.iteri head ~f:(fun i n -> Printf.printf (if i = 0 then \"%d\" else \" %d\") n);\n  print_newline ()", "problem_context": "Doubly Linked List\n\nYour task is to implement a double linked list.\n\nWrite a program which performs the following operations:\n\ninsert x: insert an element with key x into the front of the list.\n\ndelete x: delete the first element which has the key of x from the list. If there is not such element, you need not do anything.\n\ndeleteFirst: delete the first element from the list.\n\ndeleteLast: delete the last element from the list.\n\nInput\n\nThe input is given in the following format:\n\nn\n\ncommand1\n\ncommand2\n\n...\n\ncommandn\n\nIn the first line, the number of operations n is given. In the following n lines, the above mentioned operations are given in the following format:\n\ninsert x\n\ndelete x\n\ndeleteFirst\n\ndeleteLast\n\nOutput\n\nPrint all the element (key) in the list after the given operations. Two consequtive keys should be separated by a single space.\n\nConstraints\n\nThe number of operations ≤ 2,000,000\n\nThe number of delete operations ≤ 20\n\n0 ≤ value of a key ≤ 109\n\nThe number of elements in the list does not exceed 106\n\nFor a delete, deleteFirst or deleteLast operation, there is at least one element in the list.\n\nSample Input 1\n\n7\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\n\nSample Output 1\n\n6 1 2\n\nSample Input 2\n\n9\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\ndeleteFirst\ndeleteLast\n\nSample Output 2\n\n1", "sample_input": "7\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\n"}, "reference_outputs": ["6 1 2\n"], "source_document_id": "p02265", "source_text": "Doubly Linked List\n\nYour task is to implement a double linked list.\n\nWrite a program which performs the following operations:\n\ninsert x: insert an element with key x into the front of the list.\n\ndelete x: delete the first element which has the key of x from the list. If there is not such element, you need not do anything.\n\ndeleteFirst: delete the first element from the list.\n\ndeleteLast: delete the last element from the list.\n\nInput\n\nThe input is given in the following format:\n\nn\n\ncommand1\n\ncommand2\n\n...\n\ncommandn\n\nIn the first line, the number of operations n is given. In the following n lines, the above mentioned operations are given in the following format:\n\ninsert x\n\ndelete x\n\ndeleteFirst\n\ndeleteLast\n\nOutput\n\nPrint all the element (key) in the list after the given operations. Two consequtive keys should be separated by a single space.\n\nConstraints\n\nThe number of operations ≤ 2,000,000\n\nThe number of delete operations ≤ 20\n\n0 ≤ value of a key ≤ 109\n\nThe number of elements in the list does not exceed 106\n\nFor a delete, deleteFirst or deleteLast operation, there is at least one element in the list.\n\nSample Input 1\n\n7\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\n\nSample Output 1\n\n6 1 2\n\nSample Input 2\n\n9\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\ndeleteFirst\ndeleteLast\n\nSample Output 2\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1775, "cpu_time_ms": 20000, "memory_kb": 4284}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s255578897", "group_id": "codeNet:p02265", "input_text": "module DoublyLinkedList = struct\n  type t = {\n    mutable data : int;\n    mutable next : t;\n    mutable prev : t;\n  }\n\n  let make () =\n    let rec head = { data = 0; next = head; prev = head } in\n    head\n\n  let insert data head =\n    let x = { data = data; next = head.next; prev = head } in\n    head.next.prev <- x;\n    head.next <- x\n\n  let delete x =\n    x.next.prev <- x.prev;\n    x.prev.next <- x.next\n\n  let delete_first head = delete head.next\n\n  let delete_last head = delete head.prev\n\n  let delete_node data head =\n    let rec doit ite =\n      if ite == head then None\n      else if ite.data = data then Some ite\n      else doit ite.next\n    in\n    match doit head.next with\n    | None -> ()\n    | Some ite -> delete ite\n\n  let iteri head ~f =\n    let rec doit i ite =\n      if ite == head then ()\n      else (f i ite.data; doit (i + 1) ite.next)\n    in\n    doit 0 head.next\nend\n\nmodule L = DoublyLinkedList\n\nlet () =\n  let n = read_int () in\n  let head = L.make () in\n  let rec read i =\n    if i >= n then ()\n    else begin\n      match Str.split (Str.regexp \" \") (read_line ()) with\n      | [\"insert\"; n] -> (L.insert (int_of_string n) head; read (i + 1))\n      | [\"delete\"; n] -> (L.delete_node (int_of_string n) head; read (i + 1))\n      | [\"deleteFirst\"] -> (L.delete_first head; read (i + 1))\n      | [\"deleteLast\"] -> (L.delete_last head; read (i + 1))\n      | _ -> exit 1\n    end\n  in\n  read 0;\n  L.iteri head ~f:(fun i n -> Printf.printf (if i = 0 then \"%d\" else \" %d\") n);\n  print_newline ()", "language": "OCaml", "metadata": {"date": 1474037332, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02265.html", "problem_id": "p02265", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02265/input.txt", "sample_output_relpath": "derived/input_output/data/p02265/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02265/OCaml/s255578897.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s255578897", "user_id": "u809138450"}, "prompt_components": {"gold_output": "6 1 2\n", "input_to_evaluate": "module DoublyLinkedList = struct\n  type t = {\n    mutable data : int;\n    mutable next : t;\n    mutable prev : t;\n  }\n\n  let make () =\n    let rec head = { data = 0; next = head; prev = head } in\n    head\n\n  let insert data head =\n    let x = { data = data; next = head.next; prev = head } in\n    head.next.prev <- x;\n    head.next <- x\n\n  let delete x =\n    x.next.prev <- x.prev;\n    x.prev.next <- x.next\n\n  let delete_first head = delete head.next\n\n  let delete_last head = delete head.prev\n\n  let delete_node data head =\n    let rec doit ite =\n      if ite == head then None\n      else if ite.data = data then Some ite\n      else doit ite.next\n    in\n    match doit head.next with\n    | None -> ()\n    | Some ite -> delete ite\n\n  let iteri head ~f =\n    let rec doit i ite =\n      if ite == head then ()\n      else (f i ite.data; doit (i + 1) ite.next)\n    in\n    doit 0 head.next\nend\n\nmodule L = DoublyLinkedList\n\nlet () =\n  let n = read_int () in\n  let head = L.make () in\n  let rec read i =\n    if i >= n then ()\n    else begin\n      match Str.split (Str.regexp \" \") (read_line ()) with\n      | [\"insert\"; n] -> (L.insert (int_of_string n) head; read (i + 1))\n      | [\"delete\"; n] -> (L.delete_node (int_of_string n) head; read (i + 1))\n      | [\"deleteFirst\"] -> (L.delete_first head; read (i + 1))\n      | [\"deleteLast\"] -> (L.delete_last head; read (i + 1))\n      | _ -> exit 1\n    end\n  in\n  read 0;\n  L.iteri head ~f:(fun i n -> Printf.printf (if i = 0 then \"%d\" else \" %d\") n);\n  print_newline ()", "problem_context": "Doubly Linked List\n\nYour task is to implement a double linked list.\n\nWrite a program which performs the following operations:\n\ninsert x: insert an element with key x into the front of the list.\n\ndelete x: delete the first element which has the key of x from the list. If there is not such element, you need not do anything.\n\ndeleteFirst: delete the first element from the list.\n\ndeleteLast: delete the last element from the list.\n\nInput\n\nThe input is given in the following format:\n\nn\n\ncommand1\n\ncommand2\n\n...\n\ncommandn\n\nIn the first line, the number of operations n is given. In the following n lines, the above mentioned operations are given in the following format:\n\ninsert x\n\ndelete x\n\ndeleteFirst\n\ndeleteLast\n\nOutput\n\nPrint all the element (key) in the list after the given operations. Two consequtive keys should be separated by a single space.\n\nConstraints\n\nThe number of operations ≤ 2,000,000\n\nThe number of delete operations ≤ 20\n\n0 ≤ value of a key ≤ 109\n\nThe number of elements in the list does not exceed 106\n\nFor a delete, deleteFirst or deleteLast operation, there is at least one element in the list.\n\nSample Input 1\n\n7\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\n\nSample Output 1\n\n6 1 2\n\nSample Input 2\n\n9\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\ndeleteFirst\ndeleteLast\n\nSample Output 2\n\n1", "sample_input": "7\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\n"}, "reference_outputs": ["6 1 2\n"], "source_document_id": "p02265", "source_text": "Doubly Linked List\n\nYour task is to implement a double linked list.\n\nWrite a program which performs the following operations:\n\ninsert x: insert an element with key x into the front of the list.\n\ndelete x: delete the first element which has the key of x from the list. If there is not such element, you need not do anything.\n\ndeleteFirst: delete the first element from the list.\n\ndeleteLast: delete the last element from the list.\n\nInput\n\nThe input is given in the following format:\n\nn\n\ncommand1\n\ncommand2\n\n...\n\ncommandn\n\nIn the first line, the number of operations n is given. In the following n lines, the above mentioned operations are given in the following format:\n\ninsert x\n\ndelete x\n\ndeleteFirst\n\ndeleteLast\n\nOutput\n\nPrint all the element (key) in the list after the given operations. Two consequtive keys should be separated by a single space.\n\nConstraints\n\nThe number of operations ≤ 2,000,000\n\nThe number of delete operations ≤ 20\n\n0 ≤ value of a key ≤ 109\n\nThe number of elements in the list does not exceed 106\n\nFor a delete, deleteFirst or deleteLast operation, there is at least one element in the list.\n\nSample Input 1\n\n7\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\n\nSample Output 1\n\n6 1 2\n\nSample Input 2\n\n9\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\ndeleteFirst\ndeleteLast\n\nSample Output 2\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1511, "cpu_time_ms": 1260, "memory_kb": 40068}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s669769284", "group_id": "codeNet:p02265", "input_text": "module DoublyLinkedList = struct\n  type t = {\n    mutable data : int;\n    mutable next : t;\n    mutable prev : t;\n  }\n\n  let make () =\n    let rec head = { data = 0; next = head; prev = head } in\n    head\n\n  let insert data head =\n    let x = { data = data; next = head.next; prev = head } in\n    head.next.prev <- x;\n    head.next <- x\n\n  let delete x =\n    x.next.prev <- x.prev;\n    x.prev.next <- x.next\n\n  let delete_first head = delete head.next\n\n  let delete_last head = delete head.prev\n\n  let delete_node data head =\n    let rec doit ite =\n      if ite == head then None\n      else if ite.data = data then Some ite\n      else doit ite.next\n    in\n    match doit head.next with\n    | None -> ()\n    | Some ite -> delete ite\n\n  let iteri head ~f =\n    let rec doit i ite =\n      if ite == head then ()\n      else (f i ite.data; doit (i + 1) ite.next)\n    in\n    doit 0 head.next\nend\n\nmodule L = DoublyLinkedList\n\nlet () =\n  let n = read_int () in\n  let head = L.make () in\n  let rec read i =\n    if i >= n then ()\n    else begin\n      match Str.split (Str.regexp \" \") (read_line ()) with\n      | [\"insert\"; n] -> (L.insert (int_of_string n) head; read (i + 1))\n      | [\"delete\"; n] -> (L.delete_node (int_of_string n) head; read (i + 1))\n      | [\"deleteFirst\"] -> (L.delete_first head; read (i + 1))\n      | [\"deleteLast\"] -> (L.delete_last head; read (i + 1))\n      | _ -> exit 1\n    end\n  in\n  read 0;\n  L.iteri head ~f:(fun i n -> Printf.printf (if i = 0 then \"%d\" else \" %d\") n);\n  print_newline ()", "language": "OCaml", "metadata": {"date": 1474037404, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02265.html", "problem_id": "p02265", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02265/input.txt", "sample_output_relpath": "derived/input_output/data/p02265/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02265/OCaml/s669769284.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s669769284", "user_id": "u809138450"}, "prompt_components": {"gold_output": "6 1 2\n", "input_to_evaluate": "module DoublyLinkedList = struct\n  type t = {\n    mutable data : int;\n    mutable next : t;\n    mutable prev : t;\n  }\n\n  let make () =\n    let rec head = { data = 0; next = head; prev = head } in\n    head\n\n  let insert data head =\n    let x = { data = data; next = head.next; prev = head } in\n    head.next.prev <- x;\n    head.next <- x\n\n  let delete x =\n    x.next.prev <- x.prev;\n    x.prev.next <- x.next\n\n  let delete_first head = delete head.next\n\n  let delete_last head = delete head.prev\n\n  let delete_node data head =\n    let rec doit ite =\n      if ite == head then None\n      else if ite.data = data then Some ite\n      else doit ite.next\n    in\n    match doit head.next with\n    | None -> ()\n    | Some ite -> delete ite\n\n  let iteri head ~f =\n    let rec doit i ite =\n      if ite == head then ()\n      else (f i ite.data; doit (i + 1) ite.next)\n    in\n    doit 0 head.next\nend\n\nmodule L = DoublyLinkedList\n\nlet () =\n  let n = read_int () in\n  let head = L.make () in\n  let rec read i =\n    if i >= n then ()\n    else begin\n      match Str.split (Str.regexp \" \") (read_line ()) with\n      | [\"insert\"; n] -> (L.insert (int_of_string n) head; read (i + 1))\n      | [\"delete\"; n] -> (L.delete_node (int_of_string n) head; read (i + 1))\n      | [\"deleteFirst\"] -> (L.delete_first head; read (i + 1))\n      | [\"deleteLast\"] -> (L.delete_last head; read (i + 1))\n      | _ -> exit 1\n    end\n  in\n  read 0;\n  L.iteri head ~f:(fun i n -> Printf.printf (if i = 0 then \"%d\" else \" %d\") n);\n  print_newline ()", "problem_context": "Doubly Linked List\n\nYour task is to implement a double linked list.\n\nWrite a program which performs the following operations:\n\ninsert x: insert an element with key x into the front of the list.\n\ndelete x: delete the first element which has the key of x from the list. If there is not such element, you need not do anything.\n\ndeleteFirst: delete the first element from the list.\n\ndeleteLast: delete the last element from the list.\n\nInput\n\nThe input is given in the following format:\n\nn\n\ncommand1\n\ncommand2\n\n...\n\ncommandn\n\nIn the first line, the number of operations n is given. In the following n lines, the above mentioned operations are given in the following format:\n\ninsert x\n\ndelete x\n\ndeleteFirst\n\ndeleteLast\n\nOutput\n\nPrint all the element (key) in the list after the given operations. Two consequtive keys should be separated by a single space.\n\nConstraints\n\nThe number of operations ≤ 2,000,000\n\nThe number of delete operations ≤ 20\n\n0 ≤ value of a key ≤ 109\n\nThe number of elements in the list does not exceed 106\n\nFor a delete, deleteFirst or deleteLast operation, there is at least one element in the list.\n\nSample Input 1\n\n7\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\n\nSample Output 1\n\n6 1 2\n\nSample Input 2\n\n9\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\ndeleteFirst\ndeleteLast\n\nSample Output 2\n\n1", "sample_input": "7\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\n"}, "reference_outputs": ["6 1 2\n"], "source_document_id": "p02265", "source_text": "Doubly Linked List\n\nYour task is to implement a double linked list.\n\nWrite a program which performs the following operations:\n\ninsert x: insert an element with key x into the front of the list.\n\ndelete x: delete the first element which has the key of x from the list. If there is not such element, you need not do anything.\n\ndeleteFirst: delete the first element from the list.\n\ndeleteLast: delete the last element from the list.\n\nInput\n\nThe input is given in the following format:\n\nn\n\ncommand1\n\ncommand2\n\n...\n\ncommandn\n\nIn the first line, the number of operations n is given. In the following n lines, the above mentioned operations are given in the following format:\n\ninsert x\n\ndelete x\n\ndeleteFirst\n\ndeleteLast\n\nOutput\n\nPrint all the element (key) in the list after the given operations. Two consequtive keys should be separated by a single space.\n\nConstraints\n\nThe number of operations ≤ 2,000,000\n\nThe number of delete operations ≤ 20\n\n0 ≤ value of a key ≤ 109\n\nThe number of elements in the list does not exceed 106\n\nFor a delete, deleteFirst or deleteLast operation, there is at least one element in the list.\n\nSample Input 1\n\n7\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\n\nSample Output 1\n\n6 1 2\n\nSample Input 2\n\n9\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\ndeleteFirst\ndeleteLast\n\nSample Output 2\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1511, "cpu_time_ms": 1130, "memory_kb": 40076}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s579851857", "group_id": "codeNet:p02265", "input_text": "module DoublyLinkedList = struct\n  type t = {\n    mutable data : int;\n    mutable next : t;\n    mutable prev : t;\n  }\n\n  let make () =\n    let rec head = { data = 0; next = head; prev = head } in\n    head\n\n  let insert data head =\n    let x = { data = data; next = head.next; prev = head } in\n    head.next.prev <- x;\n    head.next <- x\n\n  let delete x =\n    x.next.prev <- x.prev;\n    x.prev.next <- x.next\n\n  let delete_first head = delete head.next\n\n  let delete_last head = delete head.prev\n\n  let delete_node data head =\n    let rec doit ite =\n      if ite == head then None\n      else if ite.data = data then Some ite\n      else doit ite.next in\n    match doit head.next with\n    | None -> ()\n    | Some ite -> delete ite\n\n  let iteri f head =\n    let rec doit i ite =\n      if ite == head then ()\n      else begin\n        f i ite.data;\n        doit (i + 1) ite.next\n      end in\n    doit 0 head.next\nend\n\nmodule L = DoublyLinkedList\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let n = read_int () in\n  let head = L.make () in\n  for _ = 0 to n - 1 do\n    match split_on_char ' ' (read_line ()) with\n    | [\"insert\"; n] -> L.insert (int_of_string n) head\n    | [\"delete\"; n] -> L.delete_node (int_of_string n) head\n    | [\"deleteFirst\"] -> L.delete_first head\n    | _ -> L.delete_last head\n  done;\n  L.iteri (fun i n -> if i <> 0 then print_string \" \"; print_int n) head;\n  print_newline ()", "language": "OCaml", "metadata": {"date": 1499332002, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02265.html", "problem_id": "p02265", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02265/input.txt", "sample_output_relpath": "derived/input_output/data/p02265/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02265/OCaml/s579851857.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s579851857", "user_id": "u809138450"}, "prompt_components": {"gold_output": "6 1 2\n", "input_to_evaluate": "module DoublyLinkedList = struct\n  type t = {\n    mutable data : int;\n    mutable next : t;\n    mutable prev : t;\n  }\n\n  let make () =\n    let rec head = { data = 0; next = head; prev = head } in\n    head\n\n  let insert data head =\n    let x = { data = data; next = head.next; prev = head } in\n    head.next.prev <- x;\n    head.next <- x\n\n  let delete x =\n    x.next.prev <- x.prev;\n    x.prev.next <- x.next\n\n  let delete_first head = delete head.next\n\n  let delete_last head = delete head.prev\n\n  let delete_node data head =\n    let rec doit ite =\n      if ite == head then None\n      else if ite.data = data then Some ite\n      else doit ite.next in\n    match doit head.next with\n    | None -> ()\n    | Some ite -> delete ite\n\n  let iteri f head =\n    let rec doit i ite =\n      if ite == head then ()\n      else begin\n        f i ite.data;\n        doit (i + 1) ite.next\n      end in\n    doit 0 head.next\nend\n\nmodule L = DoublyLinkedList\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let n = read_int () in\n  let head = L.make () in\n  for _ = 0 to n - 1 do\n    match split_on_char ' ' (read_line ()) with\n    | [\"insert\"; n] -> L.insert (int_of_string n) head\n    | [\"delete\"; n] -> L.delete_node (int_of_string n) head\n    | [\"deleteFirst\"] -> L.delete_first head\n    | _ -> L.delete_last head\n  done;\n  L.iteri (fun i n -> if i <> 0 then print_string \" \"; print_int n) head;\n  print_newline ()", "problem_context": "Doubly Linked List\n\nYour task is to implement a double linked list.\n\nWrite a program which performs the following operations:\n\ninsert x: insert an element with key x into the front of the list.\n\ndelete x: delete the first element which has the key of x from the list. If there is not such element, you need not do anything.\n\ndeleteFirst: delete the first element from the list.\n\ndeleteLast: delete the last element from the list.\n\nInput\n\nThe input is given in the following format:\n\nn\n\ncommand1\n\ncommand2\n\n...\n\ncommandn\n\nIn the first line, the number of operations n is given. In the following n lines, the above mentioned operations are given in the following format:\n\ninsert x\n\ndelete x\n\ndeleteFirst\n\ndeleteLast\n\nOutput\n\nPrint all the element (key) in the list after the given operations. Two consequtive keys should be separated by a single space.\n\nConstraints\n\nThe number of operations ≤ 2,000,000\n\nThe number of delete operations ≤ 20\n\n0 ≤ value of a key ≤ 109\n\nThe number of elements in the list does not exceed 106\n\nFor a delete, deleteFirst or deleteLast operation, there is at least one element in the list.\n\nSample Input 1\n\n7\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\n\nSample Output 1\n\n6 1 2\n\nSample Input 2\n\n9\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\ndeleteFirst\ndeleteLast\n\nSample Output 2\n\n1", "sample_input": "7\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\n"}, "reference_outputs": ["6 1 2\n"], "source_document_id": "p02265", "source_text": "Doubly Linked List\n\nYour task is to implement a double linked list.\n\nWrite a program which performs the following operations:\n\ninsert x: insert an element with key x into the front of the list.\n\ndelete x: delete the first element which has the key of x from the list. If there is not such element, you need not do anything.\n\ndeleteFirst: delete the first element from the list.\n\ndeleteLast: delete the last element from the list.\n\nInput\n\nThe input is given in the following format:\n\nn\n\ncommand1\n\ncommand2\n\n...\n\ncommandn\n\nIn the first line, the number of operations n is given. In the following n lines, the above mentioned operations are given in the following format:\n\ninsert x\n\ndelete x\n\ndeleteFirst\n\ndeleteLast\n\nOutput\n\nPrint all the element (key) in the list after the given operations. Two consequtive keys should be separated by a single space.\n\nConstraints\n\nThe number of operations ≤ 2,000,000\n\nThe number of delete operations ≤ 20\n\n0 ≤ value of a key ≤ 109\n\nThe number of elements in the list does not exceed 106\n\nFor a delete, deleteFirst or deleteLast operation, there is at least one element in the list.\n\nSample Input 1\n\n7\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\n\nSample Output 1\n\n6 1 2\n\nSample Input 2\n\n9\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\ndeleteFirst\ndeleteLast\n\nSample Output 2\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1619, "cpu_time_ms": 260, "memory_kb": 41056}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s135537255", "group_id": "codeNet:p02265", "input_text": "module DoublyLinkedList = struct\n\n  type t = {\n    mutable data : int;\n    mutable next : t;\n    mutable prev : t;\n  }\n\n  let make () =\n    let rec head = { data = 0; next = head; prev = head } in\n    head\n\n  let insert data head =\n    let x = { data = data; next = head.next; prev = head } in\n    head.next.prev <- x;\n    head.next <- x\n\n  let delete x =\n    x.next.prev <- x.prev;\n    x.prev.next <- x.next\n\n  let delete_first head = delete head.next\n\n  let delete_last head = delete head.prev\n\n  let delete_node data head =\n    let rec doit ite =\n      if ite == head then None\n      else if ite.data = data then Some ite\n      else doit ite.next in\n    match doit head.next with\n    | None -> ()\n    | Some ite -> delete ite\n\n  let iteri f head =\n    let rec doit i ite =\n      if ite == head then ()\n      else begin\n        f i ite.data;\n        doit (i + 1) ite.next\n      end in\n    doit 0 head.next\n\nend\n\nmodule L = DoublyLinkedList\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let n = read_int () in\n  let head = L.make () in\n  for _ = 0 to n - 1 do\n    match split_on_char ' ' (read_line ()) with\n    | [\"insert\"; n] -> L.insert (int_of_string n) head\n    | [\"delete\"; n] -> L.delete_node (int_of_string n) head\n    | [\"deleteFirst\"] -> L.delete_first head\n    | _ -> L.delete_last head\n  done;\n  L.iteri (fun i n -> if i <> 0 then print_string \" \"; print_int n) head;\n  print_newline ()", "language": "OCaml", "metadata": {"date": 1499847807, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02265.html", "problem_id": "p02265", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02265/input.txt", "sample_output_relpath": "derived/input_output/data/p02265/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02265/OCaml/s135537255.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s135537255", "user_id": "u809138450"}, "prompt_components": {"gold_output": "6 1 2\n", "input_to_evaluate": "module DoublyLinkedList = struct\n\n  type t = {\n    mutable data : int;\n    mutable next : t;\n    mutable prev : t;\n  }\n\n  let make () =\n    let rec head = { data = 0; next = head; prev = head } in\n    head\n\n  let insert data head =\n    let x = { data = data; next = head.next; prev = head } in\n    head.next.prev <- x;\n    head.next <- x\n\n  let delete x =\n    x.next.prev <- x.prev;\n    x.prev.next <- x.next\n\n  let delete_first head = delete head.next\n\n  let delete_last head = delete head.prev\n\n  let delete_node data head =\n    let rec doit ite =\n      if ite == head then None\n      else if ite.data = data then Some ite\n      else doit ite.next in\n    match doit head.next with\n    | None -> ()\n    | Some ite -> delete ite\n\n  let iteri f head =\n    let rec doit i ite =\n      if ite == head then ()\n      else begin\n        f i ite.data;\n        doit (i + 1) ite.next\n      end in\n    doit 0 head.next\n\nend\n\nmodule L = DoublyLinkedList\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let n = read_int () in\n  let head = L.make () in\n  for _ = 0 to n - 1 do\n    match split_on_char ' ' (read_line ()) with\n    | [\"insert\"; n] -> L.insert (int_of_string n) head\n    | [\"delete\"; n] -> L.delete_node (int_of_string n) head\n    | [\"deleteFirst\"] -> L.delete_first head\n    | _ -> L.delete_last head\n  done;\n  L.iteri (fun i n -> if i <> 0 then print_string \" \"; print_int n) head;\n  print_newline ()", "problem_context": "Doubly Linked List\n\nYour task is to implement a double linked list.\n\nWrite a program which performs the following operations:\n\ninsert x: insert an element with key x into the front of the list.\n\ndelete x: delete the first element which has the key of x from the list. If there is not such element, you need not do anything.\n\ndeleteFirst: delete the first element from the list.\n\ndeleteLast: delete the last element from the list.\n\nInput\n\nThe input is given in the following format:\n\nn\n\ncommand1\n\ncommand2\n\n...\n\ncommandn\n\nIn the first line, the number of operations n is given. In the following n lines, the above mentioned operations are given in the following format:\n\ninsert x\n\ndelete x\n\ndeleteFirst\n\ndeleteLast\n\nOutput\n\nPrint all the element (key) in the list after the given operations. Two consequtive keys should be separated by a single space.\n\nConstraints\n\nThe number of operations ≤ 2,000,000\n\nThe number of delete operations ≤ 20\n\n0 ≤ value of a key ≤ 109\n\nThe number of elements in the list does not exceed 106\n\nFor a delete, deleteFirst or deleteLast operation, there is at least one element in the list.\n\nSample Input 1\n\n7\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\n\nSample Output 1\n\n6 1 2\n\nSample Input 2\n\n9\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\ndeleteFirst\ndeleteLast\n\nSample Output 2\n\n1", "sample_input": "7\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\n"}, "reference_outputs": ["6 1 2\n"], "source_document_id": "p02265", "source_text": "Doubly Linked List\n\nYour task is to implement a double linked list.\n\nWrite a program which performs the following operations:\n\ninsert x: insert an element with key x into the front of the list.\n\ndelete x: delete the first element which has the key of x from the list. If there is not such element, you need not do anything.\n\ndeleteFirst: delete the first element from the list.\n\ndeleteLast: delete the last element from the list.\n\nInput\n\nThe input is given in the following format:\n\nn\n\ncommand1\n\ncommand2\n\n...\n\ncommandn\n\nIn the first line, the number of operations n is given. In the following n lines, the above mentioned operations are given in the following format:\n\ninsert x\n\ndelete x\n\ndeleteFirst\n\ndeleteLast\n\nOutput\n\nPrint all the element (key) in the list after the given operations. Two consequtive keys should be separated by a single space.\n\nConstraints\n\nThe number of operations ≤ 2,000,000\n\nThe number of delete operations ≤ 20\n\n0 ≤ value of a key ≤ 109\n\nThe number of elements in the list does not exceed 106\n\nFor a delete, deleteFirst or deleteLast operation, there is at least one element in the list.\n\nSample Input 1\n\n7\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\n\nSample Output 1\n\n6 1 2\n\nSample Input 2\n\n9\ninsert 5\ninsert 2\ninsert 3\ninsert 1\ndelete 3\ninsert 6\ndelete 5\ndeleteFirst\ndeleteLast\n\nSample Output 2\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1621, "cpu_time_ms": 250, "memory_kb": 41148}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s554478092", "group_id": "codeNet:p02266", "input_text": "let analysis (area:string) =\n  let len = String.length area in\n  let stack = Stack.create () in\n  let rec loop acc = function\n      i when i = len -> acc\n    | i ->\n      match area.[i] with\n      | '\\\\' -> Stack.push i stack; loop acc (i+1)\n      | '/' -> loop\n                 (match Stack.length stack with\n                    0 -> acc\n                  | _ -> let j = Stack.pop stack in\n                    (((j,i),i-j)::acc))\n                 (i+1)\n      | _ -> loop acc (i+1)\n  in loop [] 0\n\nlet summarize lst =\n  let rec loop acc cnt sum = function\n      []  -> acc,cnt,sum\n    | [x] -> x::acc,cnt+1,sum+(snd x)\n    | ((s1,e1),v1)::((s2,e2),v2)::r when s1 < s2 && e1 > e2 ->\n      loop acc cnt sum (((s1,e1), v1+v2)::r)\n    | (_,v) as a::(b::r as rest) -> loop (a::acc) (cnt+1) (sum+v) rest\n  in loop [] 0 0 lst\n\nlet () =\n  let line = read_line () in\n  let part,cnt,sum = analysis line |> summarize in\n  Printf.printf \"%d\\n%d\" sum cnt;\n  List.iter (fun (_,v) -> Printf.printf \" %d\" v) part;\n  print_newline ()", "language": "OCaml", "metadata": {"date": 1477898068, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02266.html", "problem_id": "p02266", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02266/input.txt", "sample_output_relpath": "derived/input_output/data/p02266/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02266/OCaml/s554478092.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s554478092", "user_id": "u995793569"}, "prompt_components": {"gold_output": "4\n1 4\n", "input_to_evaluate": "let analysis (area:string) =\n  let len = String.length area in\n  let stack = Stack.create () in\n  let rec loop acc = function\n      i when i = len -> acc\n    | i ->\n      match area.[i] with\n      | '\\\\' -> Stack.push i stack; loop acc (i+1)\n      | '/' -> loop\n                 (match Stack.length stack with\n                    0 -> acc\n                  | _ -> let j = Stack.pop stack in\n                    (((j,i),i-j)::acc))\n                 (i+1)\n      | _ -> loop acc (i+1)\n  in loop [] 0\n\nlet summarize lst =\n  let rec loop acc cnt sum = function\n      []  -> acc,cnt,sum\n    | [x] -> x::acc,cnt+1,sum+(snd x)\n    | ((s1,e1),v1)::((s2,e2),v2)::r when s1 < s2 && e1 > e2 ->\n      loop acc cnt sum (((s1,e1), v1+v2)::r)\n    | (_,v) as a::(b::r as rest) -> loop (a::acc) (cnt+1) (sum+v) rest\n  in loop [] 0 0 lst\n\nlet () =\n  let line = read_line () in\n  let part,cnt,sum = analysis line |> summarize in\n  Printf.printf \"%d\\n%d\" sum cnt;\n  List.iter (fun (_,v) -> Printf.printf \" %d\" v) part;\n  print_newline ()", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nAreas on the Cross-Section Diagram\n\nYour task is to simulate a flood damage.\n\nFor a given cross-section diagram, reports areas of flooded sections.\n\nAssume that rain is falling endlessly in the region and the water overflowing from the region is falling in the sea at the both sides.\nFor example, for the above cross-section diagram, the rain will create floods which have areas of 4, 2, 1, 19 and 9 respectively.\n\nInput\n\nA string, which represents slopes and flatlands by '/', '\\' and '_' respectively, is given in a line. For example, the region of the above example is given by a string \"\\\\///\\_/\\/\\\\\\\\/_/\\\\///__\\\\\\_\\\\/_\\/_/\\\".\n\noutput\n\nReport the areas of floods in the following format:\n\n$A$\n\n$k$ $L_1$ $L_2$ ... $L_k$\n\nIn the first line, print the total area $A$ of created floods.\n\nIn the second line, print the number of floods $k$ and areas $L_i (i = 1, 2, ..., k)$ for each flood from the left side of the cross-section diagram. Print a space character before $L_i$.\n\nConstraints\n\n$1 \\leq$ length of the string $\\leq 20,000$\n\nSample Input 1\n\n\\\\//\n\nSample Output 1\n\n4\n1 4\n\nSample Input 2\n\n\\\\///\\_/\\/\\\\\\\\/_/\\\\///__\\\\\\_\\\\/_\\/_/\\\n\nSample Output 2\n\n35\n5 4 2 1 19 9", "sample_input": "\\\\//\n"}, "reference_outputs": ["4\n1 4\n"], "source_document_id": "p02266", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nAreas on the Cross-Section Diagram\n\nYour task is to simulate a flood damage.\n\nFor a given cross-section diagram, reports areas of flooded sections.\n\nAssume that rain is falling endlessly in the region and the water overflowing from the region is falling in the sea at the both sides.\nFor example, for the above cross-section diagram, the rain will create floods which have areas of 4, 2, 1, 19 and 9 respectively.\n\nInput\n\nA string, which represents slopes and flatlands by '/', '\\' and '_' respectively, is given in a line. For example, the region of the above example is given by a string \"\\\\///\\_/\\/\\\\\\\\/_/\\\\///__\\\\\\_\\\\/_\\/_/\\\".\n\noutput\n\nReport the areas of floods in the following format:\n\n$A$\n\n$k$ $L_1$ $L_2$ ... $L_k$\n\nIn the first line, print the total area $A$ of created floods.\n\nIn the second line, print the number of floods $k$ and areas $L_i (i = 1, 2, ..., k)$ for each flood from the left side of the cross-section diagram. Print a space character before $L_i$.\n\nConstraints\n\n$1 \\leq$ length of the string $\\leq 20,000$\n\nSample Input 1\n\n\\\\//\n\nSample Output 1\n\n4\n1 4\n\nSample Input 2\n\n\\\\///\\_/\\/\\\\\\\\/_/\\\\///__\\\\\\_\\\\/_\\/_/\\\n\nSample Output 2\n\n35\n5 4 2 1 19 9", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1016, "cpu_time_ms": 40, "memory_kb": 3808}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s441609120", "group_id": "codeNet:p02268", "input_text": "let to_array s =\n  Str.split (Str.regexp_string \" \") s\n  |> List.map int_of_string\n  |> Array.of_list;;\n\nlet binary_search l value index =\n  let rec loop left right =\n    let mid = (left+right)/2 in\n    if mid = left then\n      if l.(left) = value then (true, left)\n      else if l.(right) = value then (true, right)\n      else (false, left)\n    else\n      let (left_new, right_new) =\n        if l.(mid) > value then (left,mid-1)\n        else if l.(mid) < value then (mid+1, right)\n        else (-1,-1)\n      in\n      if left_new = -1 && right_new = -1 then (true, mid)\n      else loop left_new right_new\n  in loop index ((Array.length l)-1)\n;;\n\nlet _ = read_int () and\n    s = read_line () |> to_array and\n    _ = read_int () and\n    t = read_line () |> to_array  in\n    Array.sort compare t;\n    let f x y =\n      let (count, index) = x in\n      let (found, index_new) = binary_search s y index in\n      if found then (count+1, index_new) else (count, index_new)\n    in\n    let (count, _) = Array.fold_left f (0,0) t in\n    Printf.printf \"%d\\n\" count\n;;", "language": "OCaml", "metadata": {"date": 1468590458, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02268.html", "problem_id": "p02268", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02268/input.txt", "sample_output_relpath": "derived/input_output/data/p02268/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02268/OCaml/s441609120.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s441609120", "user_id": "u935184340"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let to_array s =\n  Str.split (Str.regexp_string \" \") s\n  |> List.map int_of_string\n  |> Array.of_list;;\n\nlet binary_search l value index =\n  let rec loop left right =\n    let mid = (left+right)/2 in\n    if mid = left then\n      if l.(left) = value then (true, left)\n      else if l.(right) = value then (true, right)\n      else (false, left)\n    else\n      let (left_new, right_new) =\n        if l.(mid) > value then (left,mid-1)\n        else if l.(mid) < value then (mid+1, right)\n        else (-1,-1)\n      in\n      if left_new = -1 && right_new = -1 then (true, mid)\n      else loop left_new right_new\n  in loop index ((Array.length l)-1)\n;;\n\nlet _ = read_int () and\n    s = read_line () |> to_array and\n    _ = read_int () and\n    t = read_line () |> to_array  in\n    Array.sort compare t;\n    let f x y =\n      let (count, index) = x in\n      let (found, index_new) = binary_search s y index in\n      if found then (count+1, index_new) else (count, index_new)\n    in\n    let (count, _) = Array.fold_left f (0,0) t in\n    Printf.printf \"%d\\n\" count\n;;", "problem_context": "Search II\n\nYou are given a sequence of n integers S and a sequence of different q integers T. Write a program which outputs C, the number of integers in T which are also in the set S.\n\nInput\n\nIn the first line n is given. In the second line, n integers are given. In the third line q is given. Then, in the fourth line, q integers are given.\n\nOutput\n\nPrint C in a line.\n\nConstraints\n\nElements in S is sorted in ascending order\n\nn ≤ 100000\n\nq ≤ 50000\n\n0 ≤ an element in S ≤ 109\n\n0 ≤ an element in T ≤ 109\n\nSample Input 1\n\n5\n1 2 3 4 5\n3\n3 4 1\n\nSample Output 1\n\n3\n\nSample Input 2\n\n3\n1 2 3\n1\n5\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5\n1 1 2 2 3\n2\n1 2\n\nSample Output 3\n\n2\n\nNotes", "sample_input": "5\n1 2 3 4 5\n3\n3 4 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02268", "source_text": "Search II\n\nYou are given a sequence of n integers S and a sequence of different q integers T. Write a program which outputs C, the number of integers in T which are also in the set S.\n\nInput\n\nIn the first line n is given. In the second line, n integers are given. In the third line q is given. Then, in the fourth line, q integers are given.\n\nOutput\n\nPrint C in a line.\n\nConstraints\n\nElements in S is sorted in ascending order\n\nn ≤ 100000\n\nq ≤ 50000\n\n0 ≤ an element in S ≤ 109\n\n0 ≤ an element in T ≤ 109\n\nSample Input 1\n\n5\n1 2 3 4 5\n3\n3 4 1\n\nSample Output 1\n\n3\n\nSample Input 2\n\n3\n1 2 3\n1\n5\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5\n1 1 2 2 3\n2\n1 2\n\nSample Output 3\n\n2\n\nNotes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1055, "cpu_time_ms": 50, "memory_kb": 16196}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s805191735", "group_id": "codeNet:p02268", "input_text": "let bin_search x (a : int array) =\n  let rec doit l r =\n    if l >= r then false\n    else\n      let m = (l + r) / 2 in\n      if x = a.(m) then true\n      else if x < a.(m) then doit l m\n      else doit (m + 1) r in\n  doit 0 (Array.length a)\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let read_seq () = List.map int_of_string (split_on_char ' ' (read_line ())) in\n  let _ = read_int () in\n  let s = Array.of_list (read_seq ()) in\n  let _ = read_int () in\n  let t = read_seq () in\n  Printf.printf \"%d\\n\" (List.fold_left (fun acc e -> acc + (if bin_search e s then 1 else 0)) 0 t)", "language": "OCaml", "metadata": {"date": 1479565120, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02268.html", "problem_id": "p02268", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02268/input.txt", "sample_output_relpath": "derived/input_output/data/p02268/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02268/OCaml/s805191735.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s805191735", "user_id": "u809138450"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let bin_search x (a : int array) =\n  let rec doit l r =\n    if l >= r then false\n    else\n      let m = (l + r) / 2 in\n      if x = a.(m) then true\n      else if x < a.(m) then doit l m\n      else doit (m + 1) r in\n  doit 0 (Array.length a)\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let read_seq () = List.map int_of_string (split_on_char ' ' (read_line ())) in\n  let _ = read_int () in\n  let s = Array.of_list (read_seq ()) in\n  let _ = read_int () in\n  let t = read_seq () in\n  Printf.printf \"%d\\n\" (List.fold_left (fun acc e -> acc + (if bin_search e s then 1 else 0)) 0 t)", "problem_context": "Search II\n\nYou are given a sequence of n integers S and a sequence of different q integers T. Write a program which outputs C, the number of integers in T which are also in the set S.\n\nInput\n\nIn the first line n is given. In the second line, n integers are given. In the third line q is given. Then, in the fourth line, q integers are given.\n\nOutput\n\nPrint C in a line.\n\nConstraints\n\nElements in S is sorted in ascending order\n\nn ≤ 100000\n\nq ≤ 50000\n\n0 ≤ an element in S ≤ 109\n\n0 ≤ an element in T ≤ 109\n\nSample Input 1\n\n5\n1 2 3 4 5\n3\n3 4 1\n\nSample Output 1\n\n3\n\nSample Input 2\n\n3\n1 2 3\n1\n5\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5\n1 1 2 2 3\n2\n1 2\n\nSample Output 3\n\n2\n\nNotes", "sample_input": "5\n1 2 3 4 5\n3\n3 4 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02268", "source_text": "Search II\n\nYou are given a sequence of n integers S and a sequence of different q integers T. Write a program which outputs C, the number of integers in T which are also in the set S.\n\nInput\n\nIn the first line n is given. In the second line, n integers are given. In the third line q is given. Then, in the fourth line, q integers are given.\n\nOutput\n\nPrint C in a line.\n\nConstraints\n\nElements in S is sorted in ascending order\n\nn ≤ 100000\n\nq ≤ 50000\n\n0 ≤ an element in S ≤ 109\n\n0 ≤ an element in T ≤ 109\n\nSample Input 1\n\n5\n1 2 3 4 5\n3\n3 4 1\n\nSample Output 1\n\n3\n\nSample Input 2\n\n3\n1 2 3\n1\n5\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5\n1 1 2 2 3\n2\n1 2\n\nSample Output 3\n\n2\n\nNotes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 802, "cpu_time_ms": 10, "memory_kb": 17004}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s067962460", "group_id": "codeNet:p02270", "input_text": "let () =\n  let (n, k) = Scanf.scanf \"%d %d\\n\" (fun n k -> (n, k)) in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d\\n\" (fun i -> i)) in\n  let check p =\n    let rec doit i j s =\n      if i = n then n\n      else if j >= k then i\n      else\n        let x = s + a.(i) in\n        if x > p then doit i (j + 1) 0\n        else doit (i + 1) j x\n    in\n    doit 0 0 0\n  in\n  let rec bin_search l r =\n    if r < l then l\n    else\n      let m = (l + r) / 2 in\n      if check m >= n then bin_search l (m - 1)\n      else bin_search (m + 1) r\n  in\n  Printf.printf \"%d\\n\" (bin_search 0 (100000 * 10000))", "language": "OCaml", "metadata": {"date": 1474606375, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02270.html", "problem_id": "p02270", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02270/input.txt", "sample_output_relpath": "derived/input_output/data/p02270/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02270/OCaml/s067962460.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s067962460", "user_id": "u809138450"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let () =\n  let (n, k) = Scanf.scanf \"%d %d\\n\" (fun n k -> (n, k)) in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d\\n\" (fun i -> i)) in\n  let check p =\n    let rec doit i j s =\n      if i = n then n\n      else if j >= k then i\n      else\n        let x = s + a.(i) in\n        if x > p then doit i (j + 1) 0\n        else doit (i + 1) j x\n    in\n    doit 0 0 0\n  in\n  let rec bin_search l r =\n    if r < l then l\n    else\n      let m = (l + r) / 2 in\n      if check m >= n then bin_search l (m - 1)\n      else bin_search (m + 1) r\n  in\n  Printf.printf \"%d\\n\" (bin_search 0 (100000 * 10000))", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nYou are given $n$ packages of $w_i$ kg from a belt conveyor in order ($i = 0, 1, ... n-1$). You should load all packages onto $k$ trucks which have the common maximum load $P$. Each truck can load consecutive packages (more than or equals to zero) from the belt conveyor unless the total weights of the packages in the sequence does not exceed the maximum load $P$.\n\nWrite a program which reads $n$, $k$ and $w_i$, and reports the minimum value of the maximum load $P$ to load all packages from the belt conveyor.\n\nInput\n\nIn the first line, two integers $n$ and $k$ are given separated by a space character. In the following $n$ lines, $w_i$ are given respectively.\n\nOutput\n\nPrint the minimum value of $P$ in a line.\n\nConstraints\n\n$1 \\leq n \\leq 100,000$\n\n$1 \\leq k \\leq 100,000$\n\n$1 \\leq w_i \\leq 10,000$\n\nSample Input 1\n\n5 3\n8\n1\n7\n3\n9\n\nSample Output 1\n\n10\n\nIf the first truck loads two packages of $\\{8, 1\\}$, the second truck loads two packages of $\\{7, 3\\}$ and the third truck loads a package of $\\{9\\}$, then the minimum value of the maximum load $P$ shall be 10.\n\nSample Input 2\n\n4 2\n1\n2\n2\n6\n\nSample Output 2\n\n6\n\nIf the first truck loads three packages of $\\{1, 2, 2\\}$ and the second truck loads a package of $\\{6\\}$, then the minimum value of the maximum load $P$ shall be 6.", "sample_input": "5 3\n8\n1\n7\n3\n9\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02270", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nYou are given $n$ packages of $w_i$ kg from a belt conveyor in order ($i = 0, 1, ... n-1$). You should load all packages onto $k$ trucks which have the common maximum load $P$. Each truck can load consecutive packages (more than or equals to zero) from the belt conveyor unless the total weights of the packages in the sequence does not exceed the maximum load $P$.\n\nWrite a program which reads $n$, $k$ and $w_i$, and reports the minimum value of the maximum load $P$ to load all packages from the belt conveyor.\n\nInput\n\nIn the first line, two integers $n$ and $k$ are given separated by a space character. In the following $n$ lines, $w_i$ are given respectively.\n\nOutput\n\nPrint the minimum value of $P$ in a line.\n\nConstraints\n\n$1 \\leq n \\leq 100,000$\n\n$1 \\leq k \\leq 100,000$\n\n$1 \\leq w_i \\leq 10,000$\n\nSample Input 1\n\n5 3\n8\n1\n7\n3\n9\n\nSample Output 1\n\n10\n\nIf the first truck loads two packages of $\\{8, 1\\}$, the second truck loads two packages of $\\{7, 3\\}$ and the third truck loads a package of $\\{9\\}$, then the minimum value of the maximum load $P$ shall be 10.\n\nSample Input 2\n\n4 2\n1\n2\n2\n6\n\nSample Output 2\n\n6\n\nIf the first truck loads three packages of $\\{1, 2, 2\\}$ and the second truck loads a package of $\\{6\\}$, then the minimum value of the maximum load $P$ shall be 6.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 589, "cpu_time_ms": 10, "memory_kb": 5324}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s517360424", "group_id": "codeNet:p02270", "input_text": "let () =\n  let (n, k) = Scanf.scanf \"%d %d \" (fun n k -> (n, k)) in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  let check p =\n    let rec doit i j s =\n      if i = n then n\n      else if j >= k then i\n      else\n        let x = s + a.(i) in\n        if x > p then doit i (j + 1) 0\n        else doit (i + 1) j x\n    in\n    doit 0 0 0\n  in\n  let rec bin_search l r =\n    if r < l then l\n    else\n      let m = (l + r) / 2 in\n      if check m >= n then bin_search l (m - 1)\n      else bin_search (m + 1) r\n  in\n  Printf.printf \"%d\\n\" (bin_search 0 (100000 * 10000))", "language": "OCaml", "metadata": {"date": 1474606465, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02270.html", "problem_id": "p02270", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02270/input.txt", "sample_output_relpath": "derived/input_output/data/p02270/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02270/OCaml/s517360424.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s517360424", "user_id": "u809138450"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let () =\n  let (n, k) = Scanf.scanf \"%d %d \" (fun n k -> (n, k)) in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  let check p =\n    let rec doit i j s =\n      if i = n then n\n      else if j >= k then i\n      else\n        let x = s + a.(i) in\n        if x > p then doit i (j + 1) 0\n        else doit (i + 1) j x\n    in\n    doit 0 0 0\n  in\n  let rec bin_search l r =\n    if r < l then l\n    else\n      let m = (l + r) / 2 in\n      if check m >= n then bin_search l (m - 1)\n      else bin_search (m + 1) r\n  in\n  Printf.printf \"%d\\n\" (bin_search 0 (100000 * 10000))", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nYou are given $n$ packages of $w_i$ kg from a belt conveyor in order ($i = 0, 1, ... n-1$). You should load all packages onto $k$ trucks which have the common maximum load $P$. Each truck can load consecutive packages (more than or equals to zero) from the belt conveyor unless the total weights of the packages in the sequence does not exceed the maximum load $P$.\n\nWrite a program which reads $n$, $k$ and $w_i$, and reports the minimum value of the maximum load $P$ to load all packages from the belt conveyor.\n\nInput\n\nIn the first line, two integers $n$ and $k$ are given separated by a space character. In the following $n$ lines, $w_i$ are given respectively.\n\nOutput\n\nPrint the minimum value of $P$ in a line.\n\nConstraints\n\n$1 \\leq n \\leq 100,000$\n\n$1 \\leq k \\leq 100,000$\n\n$1 \\leq w_i \\leq 10,000$\n\nSample Input 1\n\n5 3\n8\n1\n7\n3\n9\n\nSample Output 1\n\n10\n\nIf the first truck loads two packages of $\\{8, 1\\}$, the second truck loads two packages of $\\{7, 3\\}$ and the third truck loads a package of $\\{9\\}$, then the minimum value of the maximum load $P$ shall be 10.\n\nSample Input 2\n\n4 2\n1\n2\n2\n6\n\nSample Output 2\n\n6\n\nIf the first truck loads three packages of $\\{1, 2, 2\\}$ and the second truck loads a package of $\\{6\\}$, then the minimum value of the maximum load $P$ shall be 6.", "sample_input": "5 3\n8\n1\n7\n3\n9\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02270", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nYou are given $n$ packages of $w_i$ kg from a belt conveyor in order ($i = 0, 1, ... n-1$). You should load all packages onto $k$ trucks which have the common maximum load $P$. Each truck can load consecutive packages (more than or equals to zero) from the belt conveyor unless the total weights of the packages in the sequence does not exceed the maximum load $P$.\n\nWrite a program which reads $n$, $k$ and $w_i$, and reports the minimum value of the maximum load $P$ to load all packages from the belt conveyor.\n\nInput\n\nIn the first line, two integers $n$ and $k$ are given separated by a space character. In the following $n$ lines, $w_i$ are given respectively.\n\nOutput\n\nPrint the minimum value of $P$ in a line.\n\nConstraints\n\n$1 \\leq n \\leq 100,000$\n\n$1 \\leq k \\leq 100,000$\n\n$1 \\leq w_i \\leq 10,000$\n\nSample Input 1\n\n5 3\n8\n1\n7\n3\n9\n\nSample Output 1\n\n10\n\nIf the first truck loads two packages of $\\{8, 1\\}$, the second truck loads two packages of $\\{7, 3\\}$ and the third truck loads a package of $\\{9\\}$, then the minimum value of the maximum load $P$ shall be 10.\n\nSample Input 2\n\n4 2\n1\n2\n2\n6\n\nSample Output 2\n\n6\n\nIf the first truck loads three packages of $\\{1, 2, 2\\}$ and the second truck loads a package of $\\{6\\}$, then the minimum value of the maximum load $P$ shall be 6.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 587, "cpu_time_ms": 10, "memory_kb": 5332}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s144532682", "group_id": "codeNet:p02270", "input_text": "let split str delim =\n  let open String in\n  let rec doit s acc =\n    match\n      try Some (rindex s delim) with _ -> None\n    with\n    | None -> s :: acc\n    | Some i -> doit (sub s 0 i) (sub s (i + 1) (length s - i - 1) :: acc)\n  in doit str []\n\nlet () =\n  match List.map int_of_string (split (read_line ()) ' ') with\n  | [n; k] -> begin\n      let a = Array.init n (fun _ -> read_int ()) in\n      let rec check p =\n        let rec doit i j s =\n          if i = n then n\n          else if j >= k then i\n          else\n            let x = s + a.(i) in\n            if x > p then doit i (j + 1) 0\n            else doit (i + 1) j x\n        in doit 0 0 0\n      and bin_search l r =\n        if r < l then l\n        else\n          let m = (l + r) / 2 in\n          if check m >= n then bin_search l (m - 1)\n          else bin_search (m + 1) r\n      in Printf.printf \"%d\\n\" (bin_search 0 (100000 * 10000))\n    end\n  | _ -> exit 1", "language": "OCaml", "metadata": {"date": 1475771637, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02270.html", "problem_id": "p02270", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02270/input.txt", "sample_output_relpath": "derived/input_output/data/p02270/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02270/OCaml/s144532682.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s144532682", "user_id": "u809138450"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let split str delim =\n  let open String in\n  let rec doit s acc =\n    match\n      try Some (rindex s delim) with _ -> None\n    with\n    | None -> s :: acc\n    | Some i -> doit (sub s 0 i) (sub s (i + 1) (length s - i - 1) :: acc)\n  in doit str []\n\nlet () =\n  match List.map int_of_string (split (read_line ()) ' ') with\n  | [n; k] -> begin\n      let a = Array.init n (fun _ -> read_int ()) in\n      let rec check p =\n        let rec doit i j s =\n          if i = n then n\n          else if j >= k then i\n          else\n            let x = s + a.(i) in\n            if x > p then doit i (j + 1) 0\n            else doit (i + 1) j x\n        in doit 0 0 0\n      and bin_search l r =\n        if r < l then l\n        else\n          let m = (l + r) / 2 in\n          if check m >= n then bin_search l (m - 1)\n          else bin_search (m + 1) r\n      in Printf.printf \"%d\\n\" (bin_search 0 (100000 * 10000))\n    end\n  | _ -> exit 1", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nYou are given $n$ packages of $w_i$ kg from a belt conveyor in order ($i = 0, 1, ... n-1$). You should load all packages onto $k$ trucks which have the common maximum load $P$. Each truck can load consecutive packages (more than or equals to zero) from the belt conveyor unless the total weights of the packages in the sequence does not exceed the maximum load $P$.\n\nWrite a program which reads $n$, $k$ and $w_i$, and reports the minimum value of the maximum load $P$ to load all packages from the belt conveyor.\n\nInput\n\nIn the first line, two integers $n$ and $k$ are given separated by a space character. In the following $n$ lines, $w_i$ are given respectively.\n\nOutput\n\nPrint the minimum value of $P$ in a line.\n\nConstraints\n\n$1 \\leq n \\leq 100,000$\n\n$1 \\leq k \\leq 100,000$\n\n$1 \\leq w_i \\leq 10,000$\n\nSample Input 1\n\n5 3\n8\n1\n7\n3\n9\n\nSample Output 1\n\n10\n\nIf the first truck loads two packages of $\\{8, 1\\}$, the second truck loads two packages of $\\{7, 3\\}$ and the third truck loads a package of $\\{9\\}$, then the minimum value of the maximum load $P$ shall be 10.\n\nSample Input 2\n\n4 2\n1\n2\n2\n6\n\nSample Output 2\n\n6\n\nIf the first truck loads three packages of $\\{1, 2, 2\\}$ and the second truck loads a package of $\\{6\\}$, then the minimum value of the maximum load $P$ shall be 6.", "sample_input": "5 3\n8\n1\n7\n3\n9\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02270", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nYou are given $n$ packages of $w_i$ kg from a belt conveyor in order ($i = 0, 1, ... n-1$). You should load all packages onto $k$ trucks which have the common maximum load $P$. Each truck can load consecutive packages (more than or equals to zero) from the belt conveyor unless the total weights of the packages in the sequence does not exceed the maximum load $P$.\n\nWrite a program which reads $n$, $k$ and $w_i$, and reports the minimum value of the maximum load $P$ to load all packages from the belt conveyor.\n\nInput\n\nIn the first line, two integers $n$ and $k$ are given separated by a space character. In the following $n$ lines, $w_i$ are given respectively.\n\nOutput\n\nPrint the minimum value of $P$ in a line.\n\nConstraints\n\n$1 \\leq n \\leq 100,000$\n\n$1 \\leq k \\leq 100,000$\n\n$1 \\leq w_i \\leq 10,000$\n\nSample Input 1\n\n5 3\n8\n1\n7\n3\n9\n\nSample Output 1\n\n10\n\nIf the first truck loads two packages of $\\{8, 1\\}$, the second truck loads two packages of $\\{7, 3\\}$ and the third truck loads a package of $\\{9\\}$, then the minimum value of the maximum load $P$ shall be 10.\n\nSample Input 2\n\n4 2\n1\n2\n2\n6\n\nSample Output 2\n\n6\n\nIf the first truck loads three packages of $\\{1, 2, 2\\}$ and the second truck loads a package of $\\{6\\}$, then the minimum value of the maximum load $P$ shall be 6.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 921, "cpu_time_ms": 10, "memory_kb": 5236}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s942137575", "group_id": "codeNet:p02270", "input_text": "let () =\n  let (n,k) = Scanf.scanf \"%d %d\\n\" (fun x y->(x,y)) in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d\\n\" (fun x->x)) in\n  let l = Array.fold_left (fun x y -> max x y) 0 a and\n      r = 100000*100000 in\n  let rec load ((i,j,s,p):int*int*int*int):bool =\n    if i=n then true\n    else if j=k then false\n    else\n      if s+a.(i) <= p then load ((i+1), j, (s+a.(i)), p) else load (i,(j+1),0,p)\n  in\n  let rec loop (left:int) (right:int):int =\n    if left < right then\n      let mid = (left+right)/2 in\n      if load (0,0,0,mid) then loop left mid\n      else loop (mid+1) right\n    else right\n  in\n  Printf.printf \"%d\\n\" (loop l r)\n;;", "language": "OCaml", "metadata": {"date": 1480855074, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02270.html", "problem_id": "p02270", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02270/input.txt", "sample_output_relpath": "derived/input_output/data/p02270/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02270/OCaml/s942137575.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s942137575", "user_id": "u508732591"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let () =\n  let (n,k) = Scanf.scanf \"%d %d\\n\" (fun x y->(x,y)) in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d\\n\" (fun x->x)) in\n  let l = Array.fold_left (fun x y -> max x y) 0 a and\n      r = 100000*100000 in\n  let rec load ((i,j,s,p):int*int*int*int):bool =\n    if i=n then true\n    else if j=k then false\n    else\n      if s+a.(i) <= p then load ((i+1), j, (s+a.(i)), p) else load (i,(j+1),0,p)\n  in\n  let rec loop (left:int) (right:int):int =\n    if left < right then\n      let mid = (left+right)/2 in\n      if load (0,0,0,mid) then loop left mid\n      else loop (mid+1) right\n    else right\n  in\n  Printf.printf \"%d\\n\" (loop l r)\n;;", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nYou are given $n$ packages of $w_i$ kg from a belt conveyor in order ($i = 0, 1, ... n-1$). You should load all packages onto $k$ trucks which have the common maximum load $P$. Each truck can load consecutive packages (more than or equals to zero) from the belt conveyor unless the total weights of the packages in the sequence does not exceed the maximum load $P$.\n\nWrite a program which reads $n$, $k$ and $w_i$, and reports the minimum value of the maximum load $P$ to load all packages from the belt conveyor.\n\nInput\n\nIn the first line, two integers $n$ and $k$ are given separated by a space character. In the following $n$ lines, $w_i$ are given respectively.\n\nOutput\n\nPrint the minimum value of $P$ in a line.\n\nConstraints\n\n$1 \\leq n \\leq 100,000$\n\n$1 \\leq k \\leq 100,000$\n\n$1 \\leq w_i \\leq 10,000$\n\nSample Input 1\n\n5 3\n8\n1\n7\n3\n9\n\nSample Output 1\n\n10\n\nIf the first truck loads two packages of $\\{8, 1\\}$, the second truck loads two packages of $\\{7, 3\\}$ and the third truck loads a package of $\\{9\\}$, then the minimum value of the maximum load $P$ shall be 10.\n\nSample Input 2\n\n4 2\n1\n2\n2\n6\n\nSample Output 2\n\n6\n\nIf the first truck loads three packages of $\\{1, 2, 2\\}$ and the second truck loads a package of $\\{6\\}$, then the minimum value of the maximum load $P$ shall be 6.", "sample_input": "5 3\n8\n1\n7\n3\n9\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02270", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nYou are given $n$ packages of $w_i$ kg from a belt conveyor in order ($i = 0, 1, ... n-1$). You should load all packages onto $k$ trucks which have the common maximum load $P$. Each truck can load consecutive packages (more than or equals to zero) from the belt conveyor unless the total weights of the packages in the sequence does not exceed the maximum load $P$.\n\nWrite a program which reads $n$, $k$ and $w_i$, and reports the minimum value of the maximum load $P$ to load all packages from the belt conveyor.\n\nInput\n\nIn the first line, two integers $n$ and $k$ are given separated by a space character. In the following $n$ lines, $w_i$ are given respectively.\n\nOutput\n\nPrint the minimum value of $P$ in a line.\n\nConstraints\n\n$1 \\leq n \\leq 100,000$\n\n$1 \\leq k \\leq 100,000$\n\n$1 \\leq w_i \\leq 10,000$\n\nSample Input 1\n\n5 3\n8\n1\n7\n3\n9\n\nSample Output 1\n\n10\n\nIf the first truck loads two packages of $\\{8, 1\\}$, the second truck loads two packages of $\\{7, 3\\}$ and the third truck loads a package of $\\{9\\}$, then the minimum value of the maximum load $P$ shall be 10.\n\nSample Input 2\n\n4 2\n1\n2\n2\n6\n\nSample Output 2\n\n6\n\nIf the first truck loads three packages of $\\{1, 2, 2\\}$ and the second truck loads a package of $\\{6\\}$, then the minimum value of the maximum load $P$ shall be 6.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 641, "cpu_time_ms": 20, "memory_kb": 5372}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s673077098", "group_id": "codeNet:p02270", "input_text": "let split str =\n  let rec split_inner ct b=\n    if String.length str = ct then [(int_of_string b)]\n    else\n      match str.[ct] with\n        ' ' -> (int_of_string b)::split_inner (ct+1) \"\"\n      | c -> split_inner (ct+1) (b^(Char.escaped c))\n  in split_inner 0 \"\";;\n\nlet () =\n  let (n,k) = match split (read_line ()) with\n        [n;k] -> (n,k)\n      | _ -> raise Not_found\n  in\n  let ws = Array.init n (fun _ -> read_int ()) and\n       l = 0 and\n       r = 100000*100000\n  in\n  let rec search ((i,j,s,p):int*int*int*int) =\n    if i=n || j=k then i\n    else\n      if s+ws.(i) <= p then\n        search ((i+1), j, (s+ws.(i)), p)\n      else\n        search (i,(j+1),0,p)\n  in\n  let rec loop (left:int) (right:int) =\n    if left < right then\n      let mid = (left+right)/2 in\n      if search (0,0,0,mid) >= n then loop left mid\n      else loop (mid+1) right\n    else right\n  in\n  Printf.printf \"%d\\n\" (loop l r)\n;;", "language": "OCaml", "metadata": {"date": 1480856944, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02270.html", "problem_id": "p02270", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02270/input.txt", "sample_output_relpath": "derived/input_output/data/p02270/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02270/OCaml/s673077098.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s673077098", "user_id": "u935184340"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let split str =\n  let rec split_inner ct b=\n    if String.length str = ct then [(int_of_string b)]\n    else\n      match str.[ct] with\n        ' ' -> (int_of_string b)::split_inner (ct+1) \"\"\n      | c -> split_inner (ct+1) (b^(Char.escaped c))\n  in split_inner 0 \"\";;\n\nlet () =\n  let (n,k) = match split (read_line ()) with\n        [n;k] -> (n,k)\n      | _ -> raise Not_found\n  in\n  let ws = Array.init n (fun _ -> read_int ()) and\n       l = 0 and\n       r = 100000*100000\n  in\n  let rec search ((i,j,s,p):int*int*int*int) =\n    if i=n || j=k then i\n    else\n      if s+ws.(i) <= p then\n        search ((i+1), j, (s+ws.(i)), p)\n      else\n        search (i,(j+1),0,p)\n  in\n  let rec loop (left:int) (right:int) =\n    if left < right then\n      let mid = (left+right)/2 in\n      if search (0,0,0,mid) >= n then loop left mid\n      else loop (mid+1) right\n    else right\n  in\n  Printf.printf \"%d\\n\" (loop l r)\n;;", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nYou are given $n$ packages of $w_i$ kg from a belt conveyor in order ($i = 0, 1, ... n-1$). You should load all packages onto $k$ trucks which have the common maximum load $P$. Each truck can load consecutive packages (more than or equals to zero) from the belt conveyor unless the total weights of the packages in the sequence does not exceed the maximum load $P$.\n\nWrite a program which reads $n$, $k$ and $w_i$, and reports the minimum value of the maximum load $P$ to load all packages from the belt conveyor.\n\nInput\n\nIn the first line, two integers $n$ and $k$ are given separated by a space character. In the following $n$ lines, $w_i$ are given respectively.\n\nOutput\n\nPrint the minimum value of $P$ in a line.\n\nConstraints\n\n$1 \\leq n \\leq 100,000$\n\n$1 \\leq k \\leq 100,000$\n\n$1 \\leq w_i \\leq 10,000$\n\nSample Input 1\n\n5 3\n8\n1\n7\n3\n9\n\nSample Output 1\n\n10\n\nIf the first truck loads two packages of $\\{8, 1\\}$, the second truck loads two packages of $\\{7, 3\\}$ and the third truck loads a package of $\\{9\\}$, then the minimum value of the maximum load $P$ shall be 10.\n\nSample Input 2\n\n4 2\n1\n2\n2\n6\n\nSample Output 2\n\n6\n\nIf the first truck loads three packages of $\\{1, 2, 2\\}$ and the second truck loads a package of $\\{6\\}$, then the minimum value of the maximum load $P$ shall be 6.", "sample_input": "5 3\n8\n1\n7\n3\n9\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02270", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nYou are given $n$ packages of $w_i$ kg from a belt conveyor in order ($i = 0, 1, ... n-1$). You should load all packages onto $k$ trucks which have the common maximum load $P$. Each truck can load consecutive packages (more than or equals to zero) from the belt conveyor unless the total weights of the packages in the sequence does not exceed the maximum load $P$.\n\nWrite a program which reads $n$, $k$ and $w_i$, and reports the minimum value of the maximum load $P$ to load all packages from the belt conveyor.\n\nInput\n\nIn the first line, two integers $n$ and $k$ are given separated by a space character. In the following $n$ lines, $w_i$ are given respectively.\n\nOutput\n\nPrint the minimum value of $P$ in a line.\n\nConstraints\n\n$1 \\leq n \\leq 100,000$\n\n$1 \\leq k \\leq 100,000$\n\n$1 \\leq w_i \\leq 10,000$\n\nSample Input 1\n\n5 3\n8\n1\n7\n3\n9\n\nSample Output 1\n\n10\n\nIf the first truck loads two packages of $\\{8, 1\\}$, the second truck loads two packages of $\\{7, 3\\}$ and the third truck loads a package of $\\{9\\}$, then the minimum value of the maximum load $P$ shall be 10.\n\nSample Input 2\n\n4 2\n1\n2\n2\n6\n\nSample Output 2\n\n6\n\nIf the first truck loads three packages of $\\{1, 2, 2\\}$ and the second truck loads a package of $\\{6\\}$, then the minimum value of the maximum load $P$ shall be 6.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 910, "cpu_time_ms": 10, "memory_kb": 5644}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s568589093", "group_id": "codeNet:p02270", "input_text": "open String\nlet f s=let r=ref[]and j=ref(length s)in for i=length s-1downto 0do if s.[i]=' 'then(r:=sub s(i+1)(!j-i-1)::!r;j:=i)done;sub s 0!j::!r\nand g n k a=let rec($)l r=if r<l then l else if h(0,0,0,(l+r)/2)<n then((l+r)/2+1)$r else l$((l+r)/2-1)and h=function(i,j,x,p)->if i=n||j=k then i else if x+a.(i)<=p then h(i+1,j,x+a.(i),p)else h(i,j+1,0,p)in 0$1000000000;;match List.map int_of_string(f(read_line()))with[n;k]->Printf.printf\"%d\n\"(g n k(Array.init n(fun _->read_int())))|_->()", "language": "OCaml", "metadata": {"date": 1499681012, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02270.html", "problem_id": "p02270", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02270/input.txt", "sample_output_relpath": "derived/input_output/data/p02270/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02270/OCaml/s568589093.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s568589093", "user_id": "u809138450"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "open String\nlet f s=let r=ref[]and j=ref(length s)in for i=length s-1downto 0do if s.[i]=' 'then(r:=sub s(i+1)(!j-i-1)::!r;j:=i)done;sub s 0!j::!r\nand g n k a=let rec($)l r=if r<l then l else if h(0,0,0,(l+r)/2)<n then((l+r)/2+1)$r else l$((l+r)/2-1)and h=function(i,j,x,p)->if i=n||j=k then i else if x+a.(i)<=p then h(i+1,j,x+a.(i),p)else h(i,j+1,0,p)in 0$1000000000;;match List.map int_of_string(f(read_line()))with[n;k]->Printf.printf\"%d\n\"(g n k(Array.init n(fun _->read_int())))|_->()", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nYou are given $n$ packages of $w_i$ kg from a belt conveyor in order ($i = 0, 1, ... n-1$). You should load all packages onto $k$ trucks which have the common maximum load $P$. Each truck can load consecutive packages (more than or equals to zero) from the belt conveyor unless the total weights of the packages in the sequence does not exceed the maximum load $P$.\n\nWrite a program which reads $n$, $k$ and $w_i$, and reports the minimum value of the maximum load $P$ to load all packages from the belt conveyor.\n\nInput\n\nIn the first line, two integers $n$ and $k$ are given separated by a space character. In the following $n$ lines, $w_i$ are given respectively.\n\nOutput\n\nPrint the minimum value of $P$ in a line.\n\nConstraints\n\n$1 \\leq n \\leq 100,000$\n\n$1 \\leq k \\leq 100,000$\n\n$1 \\leq w_i \\leq 10,000$\n\nSample Input 1\n\n5 3\n8\n1\n7\n3\n9\n\nSample Output 1\n\n10\n\nIf the first truck loads two packages of $\\{8, 1\\}$, the second truck loads two packages of $\\{7, 3\\}$ and the third truck loads a package of $\\{9\\}$, then the minimum value of the maximum load $P$ shall be 10.\n\nSample Input 2\n\n4 2\n1\n2\n2\n6\n\nSample Output 2\n\n6\n\nIf the first truck loads three packages of $\\{1, 2, 2\\}$ and the second truck loads a package of $\\{6\\}$, then the minimum value of the maximum load $P$ shall be 6.", "sample_input": "5 3\n8\n1\n7\n3\n9\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02270", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nYou are given $n$ packages of $w_i$ kg from a belt conveyor in order ($i = 0, 1, ... n-1$). You should load all packages onto $k$ trucks which have the common maximum load $P$. Each truck can load consecutive packages (more than or equals to zero) from the belt conveyor unless the total weights of the packages in the sequence does not exceed the maximum load $P$.\n\nWrite a program which reads $n$, $k$ and $w_i$, and reports the minimum value of the maximum load $P$ to load all packages from the belt conveyor.\n\nInput\n\nIn the first line, two integers $n$ and $k$ are given separated by a space character. In the following $n$ lines, $w_i$ are given respectively.\n\nOutput\n\nPrint the minimum value of $P$ in a line.\n\nConstraints\n\n$1 \\leq n \\leq 100,000$\n\n$1 \\leq k \\leq 100,000$\n\n$1 \\leq w_i \\leq 10,000$\n\nSample Input 1\n\n5 3\n8\n1\n7\n3\n9\n\nSample Output 1\n\n10\n\nIf the first truck loads two packages of $\\{8, 1\\}$, the second truck loads two packages of $\\{7, 3\\}$ and the third truck loads a package of $\\{9\\}$, then the minimum value of the maximum load $P$ shall be 10.\n\nSample Input 2\n\n4 2\n1\n2\n2\n6\n\nSample Output 2\n\n6\n\nIf the first truck loads three packages of $\\{1, 2, 2\\}$ and the second truck loads a package of $\\{6\\}$, then the minimum value of the maximum load $P$ shall be 6.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 489, "cpu_time_ms": 10, "memory_kb": 5284}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s334117104", "group_id": "codeNet:p02271", "input_text": "let words str =\n  let len = String.length str in\n  let buf = Buffer.create 10 in\n  let rec loop cont = function\n      i when i = len -> cont [Buffer.contents buf |> int_of_string]\n    | i ->\n      loop\n        (match str.[i] with\n         | ' ' ->\n           let v = Buffer.contents buf |> int_of_string in\n           Buffer.clear buf; (fun x -> cont (v::x))\n         | c ->\n           Buffer.add_char buf c; cont)\n        (i+1)\n  in loop (fun x -> x) 0\n\nlet check n seq =\n  let filtered = List.filter (fun x -> x <= n) seq in\n  let rec loop l results = match l with\n      [] -> if List.mem n results then \"yes\" else \"no\"\n    | h::t -> List.append results (List.map (fun v -> v+h) results)\n              |> loop t\n  in\n  loop filtered [0]\n\nlet () =\n  let _ = read_int () in\n  let an = read_line () |> words in\n  let _ = read_int () in\n  let mi = read_line () |> words in\n  List.iter (fun x -> check x an |> Printf.printf \"%s\\n\") mi", "language": "OCaml", "metadata": {"date": 1487429660, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02271.html", "problem_id": "p02271", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02271/input.txt", "sample_output_relpath": "derived/input_output/data/p02271/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02271/OCaml/s334117104.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s334117104", "user_id": "u995793569"}, "prompt_components": {"gold_output": "no\nno\nyes\nyes\nyes\nyes\nno\nno\n", "input_to_evaluate": "let words str =\n  let len = String.length str in\n  let buf = Buffer.create 10 in\n  let rec loop cont = function\n      i when i = len -> cont [Buffer.contents buf |> int_of_string]\n    | i ->\n      loop\n        (match str.[i] with\n         | ' ' ->\n           let v = Buffer.contents buf |> int_of_string in\n           Buffer.clear buf; (fun x -> cont (v::x))\n         | c ->\n           Buffer.add_char buf c; cont)\n        (i+1)\n  in loop (fun x -> x) 0\n\nlet check n seq =\n  let filtered = List.filter (fun x -> x <= n) seq in\n  let rec loop l results = match l with\n      [] -> if List.mem n results then \"yes\" else \"no\"\n    | h::t -> List.append results (List.map (fun v -> v+h) results)\n              |> loop t\n  in\n  loop filtered [0]\n\nlet () =\n  let _ = read_int () in\n  let an = read_line () |> words in\n  let _ = read_int () in\n  let mi = read_line () |> words in\n  List.iter (fun x -> check x an |> Printf.printf \"%s\\n\") mi", "problem_context": "Exhaustive Search\n\nWrite a program which reads a sequence A of n elements and an integer M, and outputs \"yes\" if you can make M by adding elements in A, otherwise \"no\". You can use an element only once.\n\nYou are given the sequence A and q questions where each question contains Mi.\n\nInput\n\nIn the first line n is given. In the second line, n integers are given. In the third line q is given. Then, in the fourth line, q integers (Mi) are given.\n\nOutput\n\nFor each question Mi, print yes or no.\n\nConstraints\n\nn ≤ 20\n\nq ≤ 200\n\n1 ≤ elements in A ≤ 2000\n\n1 ≤ Mi ≤ 2000\n\nSample Input 1\n\n5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n\nSample Output 1\n\nno\nno\nyes\nyes\nyes\nyes\nno\nno\n\nNotes\n\nYou can solve this problem by a Burte Force approach. Suppose solve(p, t) is a function which checkes whether you can make t by selecting elements after p-th element (inclusive). Then you can recursively call the following functions:\n\nsolve(0, M)\n\nsolve(1, M-{sum created from elements before 1st element})\n\nsolve(2, M-{sum created from elements before 2nd element})\n\n...\n\nThe recursive function has two choices: you selected p-th element and not. So, you can check solve(p+1, t-A[p]) and solve(p+1, t) in solve(p, t) to check the all combinations.\n\nFor example, the following figure shows that 8 can be made by A[0] + A[2].", "sample_input": "5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n"}, "reference_outputs": ["no\nno\nyes\nyes\nyes\nyes\nno\nno\n"], "source_document_id": "p02271", "source_text": "Exhaustive Search\n\nWrite a program which reads a sequence A of n elements and an integer M, and outputs \"yes\" if you can make M by adding elements in A, otherwise \"no\". You can use an element only once.\n\nYou are given the sequence A and q questions where each question contains Mi.\n\nInput\n\nIn the first line n is given. In the second line, n integers are given. In the third line q is given. Then, in the fourth line, q integers (Mi) are given.\n\nOutput\n\nFor each question Mi, print yes or no.\n\nConstraints\n\nn ≤ 20\n\nq ≤ 200\n\n1 ≤ elements in A ≤ 2000\n\n1 ≤ Mi ≤ 2000\n\nSample Input 1\n\n5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n\nSample Output 1\n\nno\nno\nyes\nyes\nyes\nyes\nno\nno\n\nNotes\n\nYou can solve this problem by a Burte Force approach. Suppose solve(p, t) is a function which checkes whether you can make t by selecting elements after p-th element (inclusive). Then you can recursively call the following functions:\n\nsolve(0, M)\n\nsolve(1, M-{sum created from elements before 1st element})\n\nsolve(2, M-{sum created from elements before 2nd element})\n\n...\n\nThe recursive function has two choices: you selected p-th element and not. So, you can check solve(p+1, t-A[p]) and solve(p+1, t) in solve(p, t) to check the all combinations.\n\nFor example, the following figure shows that 8 can be made by A[0] + A[2].", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 931, "cpu_time_ms": 2940, "memory_kb": 26972}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s078488807", "group_id": "codeNet:p02272", "input_text": "let cnt = ref 0\n\nlet merge a l m r =\n  let init_ary n p = Array.init (n + 1) (fun i -> if i = n then max_int else a.(p + i)) in\n  let ai = init_ary (m - l) l in\n  let aj = init_ary (r - m) m in\n  let rec doit = function\n    | (_, _, k) when k = r -> ()\n    | (i, j, k) ->\n      incr cnt;\n      if ai.(i) <= aj.(j) then begin\n        a.(k) <- ai.(i);\n        doit (i + 1, j, k + 1)\n      end else begin\n        a.(k) <- aj.(j);\n        doit (i, j + 1, k + 1)\n      end in\n  doit (0, 0, l)\n\nlet rec merge_sort a l r =\n  if (l + 1) < r then begin\n    let m = (l + r) / 2 in\n    merge_sort a l m;\n    merge_sort a m r;\n    merge a l m r\n  end\n\nlet () =\n  let n = read_int () in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  merge_sort a 0 n;\n  print_int a.(0);\n  for i = 1 to n - 1 do\n    Printf.printf \" %d\" a.(i);\n  done;\n  print_newline ();\n  Printf.printf \"%d\\n\" !cnt", "language": "OCaml", "metadata": {"date": 1499843409, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02272.html", "problem_id": "p02272", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02272/input.txt", "sample_output_relpath": "derived/input_output/data/p02272/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02272/OCaml/s078488807.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s078488807", "user_id": "u809138450"}, "prompt_components": {"gold_output": "1 2 3 4 5 6 7 8 9 10\n34\n", "input_to_evaluate": "let cnt = ref 0\n\nlet merge a l m r =\n  let init_ary n p = Array.init (n + 1) (fun i -> if i = n then max_int else a.(p + i)) in\n  let ai = init_ary (m - l) l in\n  let aj = init_ary (r - m) m in\n  let rec doit = function\n    | (_, _, k) when k = r -> ()\n    | (i, j, k) ->\n      incr cnt;\n      if ai.(i) <= aj.(j) then begin\n        a.(k) <- ai.(i);\n        doit (i + 1, j, k + 1)\n      end else begin\n        a.(k) <- aj.(j);\n        doit (i, j + 1, k + 1)\n      end in\n  doit (0, 0, l)\n\nlet rec merge_sort a l r =\n  if (l + 1) < r then begin\n    let m = (l + r) / 2 in\n    merge_sort a l m;\n    merge_sort a m r;\n    merge a l m r\n  end\n\nlet () =\n  let n = read_int () in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  merge_sort a 0 n;\n  print_int a.(0);\n  for i = 1 to n - 1 do\n    Printf.printf \" %d\" a.(i);\n  done;\n  print_newline ();\n  Printf.printf \"%d\\n\" !cnt", "problem_context": "Merge Sort\n\nWrite a program of a Merge Sort algorithm implemented by the following pseudocode. You should also report the number of comparisons in the Merge function.\n\nMerge(A, left, mid, right)\nn1 = mid - left;\nn2 = right - mid;\ncreate array L[0...n1], R[0...n2]\nfor i = 0 to n1-1\ndo L[i] = A[left + i]\nfor i = 0 to n2-1\ndo R[i] = A[mid + i]\nL[n1] = SENTINEL\nR[n2] = SENTINEL\ni = 0;\nj = 0;\nfor k = left to right-1\nif L[i] <= R[j]\nthen A[k] = L[i]\ni = i + 1\nelse A[k] = R[j]\nj = j + 1\n\nMerge-Sort(A, left, right){\nif left+1 < right\nthen mid = (left + right)/2;\ncall Merge-Sort(A, left, mid)\ncall Merge-Sort(A, mid, right)\ncall Merge(A, left, mid, right)\n\nInput\n\nIn the first line n is given. In the second line, n integers are given.\n\nOutput\n\nIn the first line, print the sequence S. Two consequtive elements should be separated by a space character.\n\nIn the second line, print the number of comparisons.\n\nConstraints\n\nn ≤ 500000\n\n0 ≤ an element in S ≤ 109\n\nSample Input 1\n\n10\n8 5 9 2 6 3 7 1 10 4\n\nSample Output 1\n\n1 2 3 4 5 6 7 8 9 10\n34\n\nNotes", "sample_input": "10\n8 5 9 2 6 3 7 1 10 4\n"}, "reference_outputs": ["1 2 3 4 5 6 7 8 9 10\n34\n"], "source_document_id": "p02272", "source_text": "Merge Sort\n\nWrite a program of a Merge Sort algorithm implemented by the following pseudocode. You should also report the number of comparisons in the Merge function.\n\nMerge(A, left, mid, right)\nn1 = mid - left;\nn2 = right - mid;\ncreate array L[0...n1], R[0...n2]\nfor i = 0 to n1-1\ndo L[i] = A[left + i]\nfor i = 0 to n2-1\ndo R[i] = A[mid + i]\nL[n1] = SENTINEL\nR[n2] = SENTINEL\ni = 0;\nj = 0;\nfor k = left to right-1\nif L[i] <= R[j]\nthen A[k] = L[i]\ni = i + 1\nelse A[k] = R[j]\nj = j + 1\n\nMerge-Sort(A, left, right){\nif left+1 < right\nthen mid = (left + right)/2;\ncall Merge-Sort(A, left, mid)\ncall Merge-Sort(A, mid, right)\ncall Merge(A, left, mid, right)\n\nInput\n\nIn the first line n is given. In the second line, n integers are given.\n\nOutput\n\nIn the first line, print the sequence S. Two consequtive elements should be separated by a space character.\n\nIn the second line, print the number of comparisons.\n\nConstraints\n\nn ≤ 500000\n\n0 ≤ an element in S ≤ 109\n\nSample Input 1\n\n10\n8 5 9 2 6 3 7 1 10 4\n\nSample Output 1\n\n1 2 3 4 5 6 7 8 9 10\n34\n\nNotes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 891, "cpu_time_ms": 260, "memory_kb": 19580}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s574512303", "group_id": "codeNet:p02272", "input_text": "let cnt = ref 0\n\nlet merge a l m r =\n  let ai = Array.make (m - l + 1) max_int in\n  for i = 0 to m - l - 1 do\n    ai.(i) <- a.(l + i)\n  done;\n  let aj = Array.make (r - m + 1) max_int in\n  for i = 0 to r - m - 1 do\n    aj.(i) <- a.(m + i)\n  done;\n  let i = ref 0 in\n  let j = ref 0 in\n  for k = l to r - 1 do\n    incr cnt;\n    if ai.(!i) <= aj.(!j) then begin\n      a.(k) <- ai.(!i);\n      incr i;\n    end else begin\n      a.(k) <- aj.(!j);\n      incr j;\n    end\n  done\n\nlet rec merge_sort a l r =\n  if (l + 1) < r then begin\n    let m = (l + r) / 2 in\n    merge_sort a l m;\n    merge_sort a m r;\n    merge a l m r\n  end\n\nlet () =\n  let n = read_int () in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  merge_sort a 0 n;\n  print_int a.(0);\n  for i = 1 to n - 1 do\n    print_string \" \";\n    print_int a.(i);\n  done;\n  print_newline ();\n  print_int !cnt;\n  print_newline ()", "language": "OCaml", "metadata": {"date": 1499844328, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02272.html", "problem_id": "p02272", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02272/input.txt", "sample_output_relpath": "derived/input_output/data/p02272/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02272/OCaml/s574512303.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s574512303", "user_id": "u809138450"}, "prompt_components": {"gold_output": "1 2 3 4 5 6 7 8 9 10\n34\n", "input_to_evaluate": "let cnt = ref 0\n\nlet merge a l m r =\n  let ai = Array.make (m - l + 1) max_int in\n  for i = 0 to m - l - 1 do\n    ai.(i) <- a.(l + i)\n  done;\n  let aj = Array.make (r - m + 1) max_int in\n  for i = 0 to r - m - 1 do\n    aj.(i) <- a.(m + i)\n  done;\n  let i = ref 0 in\n  let j = ref 0 in\n  for k = l to r - 1 do\n    incr cnt;\n    if ai.(!i) <= aj.(!j) then begin\n      a.(k) <- ai.(!i);\n      incr i;\n    end else begin\n      a.(k) <- aj.(!j);\n      incr j;\n    end\n  done\n\nlet rec merge_sort a l r =\n  if (l + 1) < r then begin\n    let m = (l + r) / 2 in\n    merge_sort a l m;\n    merge_sort a m r;\n    merge a l m r\n  end\n\nlet () =\n  let n = read_int () in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  merge_sort a 0 n;\n  print_int a.(0);\n  for i = 1 to n - 1 do\n    print_string \" \";\n    print_int a.(i);\n  done;\n  print_newline ();\n  print_int !cnt;\n  print_newline ()", "problem_context": "Merge Sort\n\nWrite a program of a Merge Sort algorithm implemented by the following pseudocode. You should also report the number of comparisons in the Merge function.\n\nMerge(A, left, mid, right)\nn1 = mid - left;\nn2 = right - mid;\ncreate array L[0...n1], R[0...n2]\nfor i = 0 to n1-1\ndo L[i] = A[left + i]\nfor i = 0 to n2-1\ndo R[i] = A[mid + i]\nL[n1] = SENTINEL\nR[n2] = SENTINEL\ni = 0;\nj = 0;\nfor k = left to right-1\nif L[i] <= R[j]\nthen A[k] = L[i]\ni = i + 1\nelse A[k] = R[j]\nj = j + 1\n\nMerge-Sort(A, left, right){\nif left+1 < right\nthen mid = (left + right)/2;\ncall Merge-Sort(A, left, mid)\ncall Merge-Sort(A, mid, right)\ncall Merge(A, left, mid, right)\n\nInput\n\nIn the first line n is given. In the second line, n integers are given.\n\nOutput\n\nIn the first line, print the sequence S. Two consequtive elements should be separated by a space character.\n\nIn the second line, print the number of comparisons.\n\nConstraints\n\nn ≤ 500000\n\n0 ≤ an element in S ≤ 109\n\nSample Input 1\n\n10\n8 5 9 2 6 3 7 1 10 4\n\nSample Output 1\n\n1 2 3 4 5 6 7 8 9 10\n34\n\nNotes", "sample_input": "10\n8 5 9 2 6 3 7 1 10 4\n"}, "reference_outputs": ["1 2 3 4 5 6 7 8 9 10\n34\n"], "source_document_id": "p02272", "source_text": "Merge Sort\n\nWrite a program of a Merge Sort algorithm implemented by the following pseudocode. You should also report the number of comparisons in the Merge function.\n\nMerge(A, left, mid, right)\nn1 = mid - left;\nn2 = right - mid;\ncreate array L[0...n1], R[0...n2]\nfor i = 0 to n1-1\ndo L[i] = A[left + i]\nfor i = 0 to n2-1\ndo R[i] = A[mid + i]\nL[n1] = SENTINEL\nR[n2] = SENTINEL\ni = 0;\nj = 0;\nfor k = left to right-1\nif L[i] <= R[j]\nthen A[k] = L[i]\ni = i + 1\nelse A[k] = R[j]\nj = j + 1\n\nMerge-Sort(A, left, right){\nif left+1 < right\nthen mid = (left + right)/2;\ncall Merge-Sort(A, left, mid)\ncall Merge-Sort(A, mid, right)\ncall Merge(A, left, mid, right)\n\nInput\n\nIn the first line n is given. In the second line, n integers are given.\n\nOutput\n\nIn the first line, print the sequence S. Two consequtive elements should be separated by a space character.\n\nIn the second line, print the number of comparisons.\n\nConstraints\n\nn ≤ 500000\n\n0 ≤ an element in S ≤ 109\n\nSample Input 1\n\n10\n8 5 9 2 6 3 7 1 10 4\n\nSample Output 1\n\n1 2 3 4 5 6 7 8 9 10\n34\n\nNotes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 894, "cpu_time_ms": 230, "memory_kb": 22072}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s169905390", "group_id": "codeNet:p02275", "input_text": "let rev_iter (f : int -> unit) (a : int array) =\n  for i = Array.length a - 1 downto 0 do\n    f a.(i)\n  done\n\nlet counting_sort a b k =\n  let c = Array.make (k + 1) 0 in\n  Array.iter (fun e -> c.(e) <- c.(e) + 1) a;\n  Array.iteri (fun i _ -> if i <> 0 then c.(i) <- c.(i) + c.(i-1)) c;\n  rev_iter (fun e -> b.(c.(e)-1) <- e; c.(e) <- c.(e) - 1) a\n\nlet () =\n  let n = read_int () in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun e -> e)) in\n  let b = Array.make n 0 in\n  counting_sort a b 10000;\n  Array.iteri (fun i e -> if i <> 0 then print_string \" \"; print_int e) b;\n  print_newline ()", "language": "OCaml", "metadata": {"date": 1499350086, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02275.html", "problem_id": "p02275", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02275/input.txt", "sample_output_relpath": "derived/input_output/data/p02275/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02275/OCaml/s169905390.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s169905390", "user_id": "u809138450"}, "prompt_components": {"gold_output": "0 1 2 2 3 3 5\n", "input_to_evaluate": "let rev_iter (f : int -> unit) (a : int array) =\n  for i = Array.length a - 1 downto 0 do\n    f a.(i)\n  done\n\nlet counting_sort a b k =\n  let c = Array.make (k + 1) 0 in\n  Array.iter (fun e -> c.(e) <- c.(e) + 1) a;\n  Array.iteri (fun i _ -> if i <> 0 then c.(i) <- c.(i) + c.(i-1)) c;\n  rev_iter (fun e -> b.(c.(e)-1) <- e; c.(e) <- c.(e) - 1) a\n\nlet () =\n  let n = read_int () in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun e -> e)) in\n  let b = Array.make n 0 in\n  counting_sort a b 10000;\n  Array.iteri (fun i e -> if i <> 0 then print_string \" \"; print_int e) b;\n  print_newline ()", "problem_context": "Counting Sort\n\nCounting sort can be used for sorting elements in an array which each of the n input elements is an integer in the range 0 to k. The idea of counting sort is to determine, for each input element x, the number of elements less than x as C[x]. This information can be used to place element x directly into its position in the output array B. This scheme must be modified to handle the situation in which several elements have the same value. Please see the following pseudocode for the detail:\n\nCounting-Sort(A, B, k)\n1 for i = 0 to k\n2 do C[i] = 0\n3 for j = 1 to length[A]\n4 do C[A[j]] = C[A[j]]+1\n5 /* C[i] now contains the number of elements equal to i */\n6 for i = 1 to k\n7 do C[i] = C[i] + C[i-1]\n8 /* C[i] now contains the number of elements less than or equal to i */\n9 for j = length[A] downto 1\n10 do B[C[A[j]]] = A[j]\n11 C[A[j]] = C[A[j]]-1\n\nWrite a program which sorts elements of given array ascending order based on the counting sort.\n\nInput\n\nThe first line of the input includes an integer n, the number of elements in the sequence.\n\nIn the second line, n elements of the sequence are given separated by spaces characters.\n\nOutput\n\nPrint the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.\n\nConstraints\n\n1 ≤ n ≤ 2,000,000\n\n0 ≤ A[i] ≤ 10,000\n\nSample Input 1\n\n7\n2 5 1 3 2 3 0\n\nSample Output 1\n\n0 1 2 2 3 3 5", "sample_input": "7\n2 5 1 3 2 3 0\n"}, "reference_outputs": ["0 1 2 2 3 3 5\n"], "source_document_id": "p02275", "source_text": "Counting Sort\n\nCounting sort can be used for sorting elements in an array which each of the n input elements is an integer in the range 0 to k. The idea of counting sort is to determine, for each input element x, the number of elements less than x as C[x]. This information can be used to place element x directly into its position in the output array B. This scheme must be modified to handle the situation in which several elements have the same value. Please see the following pseudocode for the detail:\n\nCounting-Sort(A, B, k)\n1 for i = 0 to k\n2 do C[i] = 0\n3 for j = 1 to length[A]\n4 do C[A[j]] = C[A[j]]+1\n5 /* C[i] now contains the number of elements equal to i */\n6 for i = 1 to k\n7 do C[i] = C[i] + C[i-1]\n8 /* C[i] now contains the number of elements less than or equal to i */\n9 for j = length[A] downto 1\n10 do B[C[A[j]]] = A[j]\n11 C[A[j]] = C[A[j]]-1\n\nWrite a program which sorts elements of given array ascending order based on the counting sort.\n\nInput\n\nThe first line of the input includes an integer n, the number of elements in the sequence.\n\nIn the second line, n elements of the sequence are given separated by spaces characters.\n\nOutput\n\nPrint the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.\n\nConstraints\n\n1 ≤ n ≤ 2,000,000\n\n0 ≤ A[i] ≤ 10,000\n\nSample Input 1\n\n7\n2 5 1 3 2 3 0\n\nSample Output 1\n\n0 1 2 2 3 3 5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 598, "cpu_time_ms": 500, "memory_kb": 36248}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s636645923", "group_id": "codeNet:p02275", "input_text": "let counting_sort a b k n =\n  let c = Array.make (k + 1) 0 in\n  Array.iter (fun e -> c.(e) <- c.(e) + 1) a;\n  for i = 1 to k do\n    c.(i) <- c.(i) + c.(i-1)\n  done;\n  for i = n - 1 downto 0 do\n    c.(a.(i)) <- c.(a.(i)) - 1;\n    b.(c.(a.(i))) <- a.(i);\n  done\n\nlet () =\n  let n = read_int () in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun e -> e)) in\n  let b = Array.make n 0 in\n  counting_sort a b 10000 n;\n  print_int b.(0);\n  for i = 1 to n - 1 do\n    print_string \" \"; print_int b.(i);\n  done;\n  print_newline ()", "language": "OCaml", "metadata": {"date": 1499855797, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02275.html", "problem_id": "p02275", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02275/input.txt", "sample_output_relpath": "derived/input_output/data/p02275/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02275/OCaml/s636645923.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s636645923", "user_id": "u809138450"}, "prompt_components": {"gold_output": "0 1 2 2 3 3 5\n", "input_to_evaluate": "let counting_sort a b k n =\n  let c = Array.make (k + 1) 0 in\n  Array.iter (fun e -> c.(e) <- c.(e) + 1) a;\n  for i = 1 to k do\n    c.(i) <- c.(i) + c.(i-1)\n  done;\n  for i = n - 1 downto 0 do\n    c.(a.(i)) <- c.(a.(i)) - 1;\n    b.(c.(a.(i))) <- a.(i);\n  done\n\nlet () =\n  let n = read_int () in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun e -> e)) in\n  let b = Array.make n 0 in\n  counting_sort a b 10000 n;\n  print_int b.(0);\n  for i = 1 to n - 1 do\n    print_string \" \"; print_int b.(i);\n  done;\n  print_newline ()", "problem_context": "Counting Sort\n\nCounting sort can be used for sorting elements in an array which each of the n input elements is an integer in the range 0 to k. The idea of counting sort is to determine, for each input element x, the number of elements less than x as C[x]. This information can be used to place element x directly into its position in the output array B. This scheme must be modified to handle the situation in which several elements have the same value. Please see the following pseudocode for the detail:\n\nCounting-Sort(A, B, k)\n1 for i = 0 to k\n2 do C[i] = 0\n3 for j = 1 to length[A]\n4 do C[A[j]] = C[A[j]]+1\n5 /* C[i] now contains the number of elements equal to i */\n6 for i = 1 to k\n7 do C[i] = C[i] + C[i-1]\n8 /* C[i] now contains the number of elements less than or equal to i */\n9 for j = length[A] downto 1\n10 do B[C[A[j]]] = A[j]\n11 C[A[j]] = C[A[j]]-1\n\nWrite a program which sorts elements of given array ascending order based on the counting sort.\n\nInput\n\nThe first line of the input includes an integer n, the number of elements in the sequence.\n\nIn the second line, n elements of the sequence are given separated by spaces characters.\n\nOutput\n\nPrint the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.\n\nConstraints\n\n1 ≤ n ≤ 2,000,000\n\n0 ≤ A[i] ≤ 10,000\n\nSample Input 1\n\n7\n2 5 1 3 2 3 0\n\nSample Output 1\n\n0 1 2 2 3 3 5", "sample_input": "7\n2 5 1 3 2 3 0\n"}, "reference_outputs": ["0 1 2 2 3 3 5\n"], "source_document_id": "p02275", "source_text": "Counting Sort\n\nCounting sort can be used for sorting elements in an array which each of the n input elements is an integer in the range 0 to k. The idea of counting sort is to determine, for each input element x, the number of elements less than x as C[x]. This information can be used to place element x directly into its position in the output array B. This scheme must be modified to handle the situation in which several elements have the same value. Please see the following pseudocode for the detail:\n\nCounting-Sort(A, B, k)\n1 for i = 0 to k\n2 do C[i] = 0\n3 for j = 1 to length[A]\n4 do C[A[j]] = C[A[j]]+1\n5 /* C[i] now contains the number of elements equal to i */\n6 for i = 1 to k\n7 do C[i] = C[i] + C[i-1]\n8 /* C[i] now contains the number of elements less than or equal to i */\n9 for j = length[A] downto 1\n10 do B[C[A[j]]] = A[j]\n11 C[A[j]] = C[A[j]]-1\n\nWrite a program which sorts elements of given array ascending order based on the counting sort.\n\nInput\n\nThe first line of the input includes an integer n, the number of elements in the sequence.\n\nIn the second line, n elements of the sequence are given separated by spaces characters.\n\nOutput\n\nPrint the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.\n\nConstraints\n\n1 ≤ n ≤ 2,000,000\n\n0 ≤ A[i] ≤ 10,000\n\nSample Input 1\n\n7\n2 5 1 3 2 3 0\n\nSample Output 1\n\n0 1 2 2 3 3 5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 528, "cpu_time_ms": 500, "memory_kb": 36124}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s239993991", "group_id": "codeNet:p02275", "input_text": "let n=read_int()open Array\nlet a=init n(fun _->Scanf.scanf\"%d \"(fun e->e))and b=make n 0and c=make 10001 0;;iter(fun e->c.(e)<-c.(e)+1)a;iteri(fun i _->if i<>0then c.(i)<-c.(i)+c.(i-1))c;for i=n-1downto 0do c.(a.(i))<-c.(a.(i))-1;b.(c.(a.(i)))<-a.(i);done;print_int b.(0);for i=1to n-1do print_string\" \";print_int b.(i);done;print_newline()", "language": "OCaml", "metadata": {"date": 1499856142, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02275.html", "problem_id": "p02275", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02275/input.txt", "sample_output_relpath": "derived/input_output/data/p02275/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02275/OCaml/s239993991.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s239993991", "user_id": "u809138450"}, "prompt_components": {"gold_output": "0 1 2 2 3 3 5\n", "input_to_evaluate": "let n=read_int()open Array\nlet a=init n(fun _->Scanf.scanf\"%d \"(fun e->e))and b=make n 0and c=make 10001 0;;iter(fun e->c.(e)<-c.(e)+1)a;iteri(fun i _->if i<>0then c.(i)<-c.(i)+c.(i-1))c;for i=n-1downto 0do c.(a.(i))<-c.(a.(i))-1;b.(c.(a.(i)))<-a.(i);done;print_int b.(0);for i=1to n-1do print_string\" \";print_int b.(i);done;print_newline()", "problem_context": "Counting Sort\n\nCounting sort can be used for sorting elements in an array which each of the n input elements is an integer in the range 0 to k. The idea of counting sort is to determine, for each input element x, the number of elements less than x as C[x]. This information can be used to place element x directly into its position in the output array B. This scheme must be modified to handle the situation in which several elements have the same value. Please see the following pseudocode for the detail:\n\nCounting-Sort(A, B, k)\n1 for i = 0 to k\n2 do C[i] = 0\n3 for j = 1 to length[A]\n4 do C[A[j]] = C[A[j]]+1\n5 /* C[i] now contains the number of elements equal to i */\n6 for i = 1 to k\n7 do C[i] = C[i] + C[i-1]\n8 /* C[i] now contains the number of elements less than or equal to i */\n9 for j = length[A] downto 1\n10 do B[C[A[j]]] = A[j]\n11 C[A[j]] = C[A[j]]-1\n\nWrite a program which sorts elements of given array ascending order based on the counting sort.\n\nInput\n\nThe first line of the input includes an integer n, the number of elements in the sequence.\n\nIn the second line, n elements of the sequence are given separated by spaces characters.\n\nOutput\n\nPrint the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.\n\nConstraints\n\n1 ≤ n ≤ 2,000,000\n\n0 ≤ A[i] ≤ 10,000\n\nSample Input 1\n\n7\n2 5 1 3 2 3 0\n\nSample Output 1\n\n0 1 2 2 3 3 5", "sample_input": "7\n2 5 1 3 2 3 0\n"}, "reference_outputs": ["0 1 2 2 3 3 5\n"], "source_document_id": "p02275", "source_text": "Counting Sort\n\nCounting sort can be used for sorting elements in an array which each of the n input elements is an integer in the range 0 to k. The idea of counting sort is to determine, for each input element x, the number of elements less than x as C[x]. This information can be used to place element x directly into its position in the output array B. This scheme must be modified to handle the situation in which several elements have the same value. Please see the following pseudocode for the detail:\n\nCounting-Sort(A, B, k)\n1 for i = 0 to k\n2 do C[i] = 0\n3 for j = 1 to length[A]\n4 do C[A[j]] = C[A[j]]+1\n5 /* C[i] now contains the number of elements equal to i */\n6 for i = 1 to k\n7 do C[i] = C[i] + C[i-1]\n8 /* C[i] now contains the number of elements less than or equal to i */\n9 for j = length[A] downto 1\n10 do B[C[A[j]]] = A[j]\n11 C[A[j]] = C[A[j]]-1\n\nWrite a program which sorts elements of given array ascending order based on the counting sort.\n\nInput\n\nThe first line of the input includes an integer n, the number of elements in the sequence.\n\nIn the second line, n elements of the sequence are given separated by spaces characters.\n\nOutput\n\nPrint the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.\n\nConstraints\n\n1 ≤ n ≤ 2,000,000\n\n0 ≤ A[i] ≤ 10,000\n\nSample Input 1\n\n7\n2 5 1 3 2 3 0\n\nSample Output 1\n\n0 1 2 2 3 3 5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 340, "cpu_time_ms": 500, "memory_kb": 36204}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s602066451", "group_id": "codeNet:p02275", "input_text": "let n=read_int()open Array\nlet a=init n(fun _->Scanf.scanf\"%d \"(fun e->e))and b=make n 0and c=make 10001 0;;iter(fun e->c.(e)<-c.(e)+1)a;iteri(fun i _->if i<>0then c.(i)<-c.(i)+c.(i-1))c;for i=n-1downto 0do c.(a.(i))<-c.(a.(i))-1;b.(c.(a.(i)))<-a.(i);done;print_int b.(0);for i=1to n-1do print_string\" \";print_int b.(i);done;print_newline()", "language": "OCaml", "metadata": {"date": 1499903051, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02275.html", "problem_id": "p02275", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02275/input.txt", "sample_output_relpath": "derived/input_output/data/p02275/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02275/OCaml/s602066451.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s602066451", "user_id": "u809138450"}, "prompt_components": {"gold_output": "0 1 2 2 3 3 5\n", "input_to_evaluate": "let n=read_int()open Array\nlet a=init n(fun _->Scanf.scanf\"%d \"(fun e->e))and b=make n 0and c=make 10001 0;;iter(fun e->c.(e)<-c.(e)+1)a;iteri(fun i _->if i<>0then c.(i)<-c.(i)+c.(i-1))c;for i=n-1downto 0do c.(a.(i))<-c.(a.(i))-1;b.(c.(a.(i)))<-a.(i);done;print_int b.(0);for i=1to n-1do print_string\" \";print_int b.(i);done;print_newline()", "problem_context": "Counting Sort\n\nCounting sort can be used for sorting elements in an array which each of the n input elements is an integer in the range 0 to k. The idea of counting sort is to determine, for each input element x, the number of elements less than x as C[x]. This information can be used to place element x directly into its position in the output array B. This scheme must be modified to handle the situation in which several elements have the same value. Please see the following pseudocode for the detail:\n\nCounting-Sort(A, B, k)\n1 for i = 0 to k\n2 do C[i] = 0\n3 for j = 1 to length[A]\n4 do C[A[j]] = C[A[j]]+1\n5 /* C[i] now contains the number of elements equal to i */\n6 for i = 1 to k\n7 do C[i] = C[i] + C[i-1]\n8 /* C[i] now contains the number of elements less than or equal to i */\n9 for j = length[A] downto 1\n10 do B[C[A[j]]] = A[j]\n11 C[A[j]] = C[A[j]]-1\n\nWrite a program which sorts elements of given array ascending order based on the counting sort.\n\nInput\n\nThe first line of the input includes an integer n, the number of elements in the sequence.\n\nIn the second line, n elements of the sequence are given separated by spaces characters.\n\nOutput\n\nPrint the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.\n\nConstraints\n\n1 ≤ n ≤ 2,000,000\n\n0 ≤ A[i] ≤ 10,000\n\nSample Input 1\n\n7\n2 5 1 3 2 3 0\n\nSample Output 1\n\n0 1 2 2 3 3 5", "sample_input": "7\n2 5 1 3 2 3 0\n"}, "reference_outputs": ["0 1 2 2 3 3 5\n"], "source_document_id": "p02275", "source_text": "Counting Sort\n\nCounting sort can be used for sorting elements in an array which each of the n input elements is an integer in the range 0 to k. The idea of counting sort is to determine, for each input element x, the number of elements less than x as C[x]. This information can be used to place element x directly into its position in the output array B. This scheme must be modified to handle the situation in which several elements have the same value. Please see the following pseudocode for the detail:\n\nCounting-Sort(A, B, k)\n1 for i = 0 to k\n2 do C[i] = 0\n3 for j = 1 to length[A]\n4 do C[A[j]] = C[A[j]]+1\n5 /* C[i] now contains the number of elements equal to i */\n6 for i = 1 to k\n7 do C[i] = C[i] + C[i-1]\n8 /* C[i] now contains the number of elements less than or equal to i */\n9 for j = length[A] downto 1\n10 do B[C[A[j]]] = A[j]\n11 C[A[j]] = C[A[j]]-1\n\nWrite a program which sorts elements of given array ascending order based on the counting sort.\n\nInput\n\nThe first line of the input includes an integer n, the number of elements in the sequence.\n\nIn the second line, n elements of the sequence are given separated by spaces characters.\n\nOutput\n\nPrint the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.\n\nConstraints\n\n1 ≤ n ≤ 2,000,000\n\n0 ≤ A[i] ≤ 10,000\n\nSample Input 1\n\n7\n2 5 1 3 2 3 0\n\nSample Output 1\n\n0 1 2 2 3 3 5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 340, "cpu_time_ms": 500, "memory_kb": 36096}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s377294652", "group_id": "codeNet:p02276", "input_text": "let partition (a : int array) p r =\n  let x = a.(r) in\n  let swap i j = let t = a.(i) in a.(i) <- a.(j); a.(j) <- t\n  in\n  let rec doit i j =\n    if j >= r then i\n    else begin\n      if a.(j) <= x then (swap (i + 1) j; doit (i + 1) (j + 1))\n      else doit i (j + 1)\n    end\n  in\n  let i = doit (p - 1) p in\n  swap (i + 1) r;\n  i + 1\n\nlet () =\n  let n = read_int () in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  let k = partition a 0 (n - 1) in\n  Array.iteri (fun i e ->\n    Printf.printf (if i = 0 then \"%d\" else if i = k then \" [%d]\" else \" %d\") e) a;\n  print_newline ()", "language": "OCaml", "metadata": {"date": 1474610970, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02276.html", "problem_id": "p02276", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02276/input.txt", "sample_output_relpath": "derived/input_output/data/p02276/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02276/OCaml/s377294652.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s377294652", "user_id": "u809138450"}, "prompt_components": {"gold_output": "9 5 8 7 4 2 6 [11] 21 13 19 12\n", "input_to_evaluate": "let partition (a : int array) p r =\n  let x = a.(r) in\n  let swap i j = let t = a.(i) in a.(i) <- a.(j); a.(j) <- t\n  in\n  let rec doit i j =\n    if j >= r then i\n    else begin\n      if a.(j) <= x then (swap (i + 1) j; doit (i + 1) (j + 1))\n      else doit i (j + 1)\n    end\n  in\n  let i = doit (p - 1) p in\n  swap (i + 1) r;\n  i + 1\n\nlet () =\n  let n = read_int () in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  let k = partition a 0 (n - 1) in\n  Array.iteri (fun i e ->\n    Printf.printf (if i = 0 then \"%d\" else if i = k then \" [%d]\" else \" %d\") e) a;\n  print_newline ()", "problem_context": "Partition\n\nQuick sort is based on the Divide-and-conquer approach. In QuickSort(A, p, r), first, a procedure Partition(A, p, r) divides an array A[p..r] into two subarrays A[p..q-1] and A[q+1..r] such that each element of A[p..q-1] is less than or equal to A[q], which is, inturn, less than or equal to each element of A[q+1..r]. It also computes the index q.\n\nIn the conquer processes, the two subarrays A[p..q-1] and A[q+1..r] are sorted by recursive calls of QuickSort(A, p, q-1) and QuickSort(A, q+1, r).\n\nYour task is to read a sequence A and perform the Partition based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nNote that, in this algorithm, Partition always selects an element A[r] as a pivot element around which to partition the array A[p..r].\n\nInput\n\nThe first line of the input includes an integer n, the number of elements in the sequence A.\n\nIn the second line, Ai (i = 1,2,...,n), elements of the sequence are given separated by space characters.\n\nOutput\n\nPrint the sorted sequence. Two contiguous elements of the sequence should be separated by a space character. The element which is selected as the pivot of the partition should be indicated by [  ].\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n0 ≤ Ai ≤ 100,000\n\nSample Input 1\n\n12\n13 19 9 5 12 8 7 4 21 2 6 11\n\nSample Output 1\n\n9 5 8 7 4 2 6 [11] 21 13 19 12", "sample_input": "12\n13 19 9 5 12 8 7 4 21 2 6 11\n"}, "reference_outputs": ["9 5 8 7 4 2 6 [11] 21 13 19 12\n"], "source_document_id": "p02276", "source_text": "Partition\n\nQuick sort is based on the Divide-and-conquer approach. In QuickSort(A, p, r), first, a procedure Partition(A, p, r) divides an array A[p..r] into two subarrays A[p..q-1] and A[q+1..r] such that each element of A[p..q-1] is less than or equal to A[q], which is, inturn, less than or equal to each element of A[q+1..r]. It also computes the index q.\n\nIn the conquer processes, the two subarrays A[p..q-1] and A[q+1..r] are sorted by recursive calls of QuickSort(A, p, q-1) and QuickSort(A, q+1, r).\n\nYour task is to read a sequence A and perform the Partition based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nNote that, in this algorithm, Partition always selects an element A[r] as a pivot element around which to partition the array A[p..r].\n\nInput\n\nThe first line of the input includes an integer n, the number of elements in the sequence A.\n\nIn the second line, Ai (i = 1,2,...,n), elements of the sequence are given separated by space characters.\n\nOutput\n\nPrint the sorted sequence. Two contiguous elements of the sequence should be separated by a space character. The element which is selected as the pivot of the partition should be indicated by [  ].\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n0 ≤ Ai ≤ 100,000\n\nSample Input 1\n\n12\n13 19 9 5 12 8 7 4 21 2 6 11\n\nSample Output 1\n\n9 5 8 7 4 2 6 [11] 21 13 19 12", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 600, "cpu_time_ms": 20, "memory_kb": 5404}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s919019829", "group_id": "codeNet:p02276", "input_text": "let partition (a : int array) p r =\n  let x = a.(r) in\n  let swap i j = let t = a.(i) in a.(i) <- a.(j); a.(j) <- t\n  in\n  let rec doit i j =\n    if j = r then (swap (i + 1) r; i + 1)\n    else if a.(j) <= x then (swap (i + 1) j; doit (i + 1) (j + 1))\n    else doit i (j + 1)\n  in doit (p - 1) p\n\nlet () =\n  let n = read_int () in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  let k = partition a 0 (n - 1) in\n  Array.iteri (fun i e -> Printf.printf (if i = 0 then \"%d\" else if i = k then \" [%d]\" else \" %d\") e) a;\n  print_newline ()", "language": "OCaml", "metadata": {"date": 1475850365, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02276.html", "problem_id": "p02276", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02276/input.txt", "sample_output_relpath": "derived/input_output/data/p02276/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02276/OCaml/s919019829.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s919019829", "user_id": "u809138450"}, "prompt_components": {"gold_output": "9 5 8 7 4 2 6 [11] 21 13 19 12\n", "input_to_evaluate": "let partition (a : int array) p r =\n  let x = a.(r) in\n  let swap i j = let t = a.(i) in a.(i) <- a.(j); a.(j) <- t\n  in\n  let rec doit i j =\n    if j = r then (swap (i + 1) r; i + 1)\n    else if a.(j) <= x then (swap (i + 1) j; doit (i + 1) (j + 1))\n    else doit i (j + 1)\n  in doit (p - 1) p\n\nlet () =\n  let n = read_int () in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  let k = partition a 0 (n - 1) in\n  Array.iteri (fun i e -> Printf.printf (if i = 0 then \"%d\" else if i = k then \" [%d]\" else \" %d\") e) a;\n  print_newline ()", "problem_context": "Partition\n\nQuick sort is based on the Divide-and-conquer approach. In QuickSort(A, p, r), first, a procedure Partition(A, p, r) divides an array A[p..r] into two subarrays A[p..q-1] and A[q+1..r] such that each element of A[p..q-1] is less than or equal to A[q], which is, inturn, less than or equal to each element of A[q+1..r]. It also computes the index q.\n\nIn the conquer processes, the two subarrays A[p..q-1] and A[q+1..r] are sorted by recursive calls of QuickSort(A, p, q-1) and QuickSort(A, q+1, r).\n\nYour task is to read a sequence A and perform the Partition based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nNote that, in this algorithm, Partition always selects an element A[r] as a pivot element around which to partition the array A[p..r].\n\nInput\n\nThe first line of the input includes an integer n, the number of elements in the sequence A.\n\nIn the second line, Ai (i = 1,2,...,n), elements of the sequence are given separated by space characters.\n\nOutput\n\nPrint the sorted sequence. Two contiguous elements of the sequence should be separated by a space character. The element which is selected as the pivot of the partition should be indicated by [  ].\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n0 ≤ Ai ≤ 100,000\n\nSample Input 1\n\n12\n13 19 9 5 12 8 7 4 21 2 6 11\n\nSample Output 1\n\n9 5 8 7 4 2 6 [11] 21 13 19 12", "sample_input": "12\n13 19 9 5 12 8 7 4 21 2 6 11\n"}, "reference_outputs": ["9 5 8 7 4 2 6 [11] 21 13 19 12\n"], "source_document_id": "p02276", "source_text": "Partition\n\nQuick sort is based on the Divide-and-conquer approach. In QuickSort(A, p, r), first, a procedure Partition(A, p, r) divides an array A[p..r] into two subarrays A[p..q-1] and A[q+1..r] such that each element of A[p..q-1] is less than or equal to A[q], which is, inturn, less than or equal to each element of A[q+1..r]. It also computes the index q.\n\nIn the conquer processes, the two subarrays A[p..q-1] and A[q+1..r] are sorted by recursive calls of QuickSort(A, p, q-1) and QuickSort(A, q+1, r).\n\nYour task is to read a sequence A and perform the Partition based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nNote that, in this algorithm, Partition always selects an element A[r] as a pivot element around which to partition the array A[p..r].\n\nInput\n\nThe first line of the input includes an integer n, the number of elements in the sequence A.\n\nIn the second line, Ai (i = 1,2,...,n), elements of the sequence are given separated by space characters.\n\nOutput\n\nPrint the sorted sequence. Two contiguous elements of the sequence should be separated by a space character. The element which is selected as the pivot of the partition should be indicated by [  ].\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n0 ≤ Ai ≤ 100,000\n\nSample Input 1\n\n12\n13 19 9 5 12 8 7 4 21 2 6 11\n\nSample Output 1\n\n9 5 8 7 4 2 6 [11] 21 13 19 12", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 556, "cpu_time_ms": 20, "memory_kb": 5192}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s334172967", "group_id": "codeNet:p02276", "input_text": "let partition (a : int array) p r =\n  let i = ref p in\n  for j = p to r - 1 do\n    if a.(j) <= a.(r) then begin\n      let tmp = a.(!i) in\n      a.(!i) <- a.(j);\n      a.(j) <- tmp;\n      incr i;\n    end\n  done;\n  let tmp = a.(!i) in\n  a.(!i) <- a.(r);\n  a.(r) <- tmp;\n  !i\n\nlet () =\n  let n = read_int () in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  let k = partition a 0 (n - 1) in\n  print_int a.(0);\n  for i = 1 to n - 1 do\n    if i = k then (print_string \" [\"; print_int a.(i); print_string \"]\")\n    else (print_string \" \"; print_int a.(i))\n  done;\n  print_newline ()", "language": "OCaml", "metadata": {"date": 1499856984, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02276.html", "problem_id": "p02276", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02276/input.txt", "sample_output_relpath": "derived/input_output/data/p02276/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02276/OCaml/s334172967.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s334172967", "user_id": "u809138450"}, "prompt_components": {"gold_output": "9 5 8 7 4 2 6 [11] 21 13 19 12\n", "input_to_evaluate": "let partition (a : int array) p r =\n  let i = ref p in\n  for j = p to r - 1 do\n    if a.(j) <= a.(r) then begin\n      let tmp = a.(!i) in\n      a.(!i) <- a.(j);\n      a.(j) <- tmp;\n      incr i;\n    end\n  done;\n  let tmp = a.(!i) in\n  a.(!i) <- a.(r);\n  a.(r) <- tmp;\n  !i\n\nlet () =\n  let n = read_int () in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  let k = partition a 0 (n - 1) in\n  print_int a.(0);\n  for i = 1 to n - 1 do\n    if i = k then (print_string \" [\"; print_int a.(i); print_string \"]\")\n    else (print_string \" \"; print_int a.(i))\n  done;\n  print_newline ()", "problem_context": "Partition\n\nQuick sort is based on the Divide-and-conquer approach. In QuickSort(A, p, r), first, a procedure Partition(A, p, r) divides an array A[p..r] into two subarrays A[p..q-1] and A[q+1..r] such that each element of A[p..q-1] is less than or equal to A[q], which is, inturn, less than or equal to each element of A[q+1..r]. It also computes the index q.\n\nIn the conquer processes, the two subarrays A[p..q-1] and A[q+1..r] are sorted by recursive calls of QuickSort(A, p, q-1) and QuickSort(A, q+1, r).\n\nYour task is to read a sequence A and perform the Partition based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nNote that, in this algorithm, Partition always selects an element A[r] as a pivot element around which to partition the array A[p..r].\n\nInput\n\nThe first line of the input includes an integer n, the number of elements in the sequence A.\n\nIn the second line, Ai (i = 1,2,...,n), elements of the sequence are given separated by space characters.\n\nOutput\n\nPrint the sorted sequence. Two contiguous elements of the sequence should be separated by a space character. The element which is selected as the pivot of the partition should be indicated by [  ].\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n0 ≤ Ai ≤ 100,000\n\nSample Input 1\n\n12\n13 19 9 5 12 8 7 4 21 2 6 11\n\nSample Output 1\n\n9 5 8 7 4 2 6 [11] 21 13 19 12", "sample_input": "12\n13 19 9 5 12 8 7 4 21 2 6 11\n"}, "reference_outputs": ["9 5 8 7 4 2 6 [11] 21 13 19 12\n"], "source_document_id": "p02276", "source_text": "Partition\n\nQuick sort is based on the Divide-and-conquer approach. In QuickSort(A, p, r), first, a procedure Partition(A, p, r) divides an array A[p..r] into two subarrays A[p..q-1] and A[q+1..r] such that each element of A[p..q-1] is less than or equal to A[q], which is, inturn, less than or equal to each element of A[q+1..r]. It also computes the index q.\n\nIn the conquer processes, the two subarrays A[p..q-1] and A[q+1..r] are sorted by recursive calls of QuickSort(A, p, q-1) and QuickSort(A, q+1, r).\n\nYour task is to read a sequence A and perform the Partition based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nNote that, in this algorithm, Partition always selects an element A[r] as a pivot element around which to partition the array A[p..r].\n\nInput\n\nThe first line of the input includes an integer n, the number of elements in the sequence A.\n\nIn the second line, Ai (i = 1,2,...,n), elements of the sequence are given separated by space characters.\n\nOutput\n\nPrint the sorted sequence. Two contiguous elements of the sequence should be separated by a space character. The element which is selected as the pivot of the partition should be indicated by [  ].\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n0 ≤ Ai ≤ 100,000\n\nSample Input 1\n\n12\n13 19 9 5 12 8 7 4 21 2 6 11\n\nSample Output 1\n\n9 5 8 7 4 2 6 [11] 21 13 19 12", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 598, "cpu_time_ms": 20, "memory_kb": 5336}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s116694409", "group_id": "codeNet:p02277", "input_text": "let quick_sort (a : (int * char * int) array) cmp =\n  let rec partition p r =\n    let swap i j = let t = Array.get a i in Array.set a i (Array.get a j); Array.set a j t\n    in\n    let rec exchange i j =\n      if j >= r then (swap (i + 1) r; i + 1)\n      else if cmp a.(j) a.(r) <= 0 then (swap (i + 1) j; exchange (i + 1) (j + 1))\n      else exchange i (j + 1)\n    in exchange (p - 1) p\n  and doit p r =\n    if p < r then begin\n      let q = partition p r in\n      doit p (q - 1);\n      doit q r\n    end in\n  doit 0 (Array.length a - 1)\n\nlet stable_p (a : (int * char * int) array) n =\n  let rec doit i =\n    if i = n - 1 then true\n    else if (fun (xi, _, xd) (yi, _, yd) -> xd = yd && xi > yi) a.(i) a.(i+1) then false\n    else doit (i + 1)\n  in doit 0\n\nlet split str delim =\n  let rec doit s acc =\n    match\n      try Some (String.rindex s delim) with _ -> None\n    with\n    | None -> s :: acc\n    | Some i ->\n        let s1 = String.sub s 0 i in\n        doit s1 (String.sub s (i + 1) (String.length s - String.length s1 - 1) :: acc)\n  in doit str []\n\nlet () =\n  let n = read_int () in\n  let a = Array.init n (fun i ->\n    match split (read_line ()) ' ' with\n    | [c; d] -> (i, c.[0], int_of_string d)\n    | _ -> exit 1\n  ) in\n  quick_sort a (fun (_, _, x) (_, _, y) -> compare x y);\n  print_endline (if stable_p a n then \"Stable\" else \"Not stable\");\n  Array.iter (fun (_, c, d) -> Printf.printf \"%c %d\\n\" c d) a", "language": "OCaml", "metadata": {"date": 1475472772, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02277.html", "problem_id": "p02277", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02277/input.txt", "sample_output_relpath": "derived/input_output/data/p02277/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02277/OCaml/s116694409.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s116694409", "user_id": "u809138450"}, "prompt_components": {"gold_output": "Not stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n", "input_to_evaluate": "let quick_sort (a : (int * char * int) array) cmp =\n  let rec partition p r =\n    let swap i j = let t = Array.get a i in Array.set a i (Array.get a j); Array.set a j t\n    in\n    let rec exchange i j =\n      if j >= r then (swap (i + 1) r; i + 1)\n      else if cmp a.(j) a.(r) <= 0 then (swap (i + 1) j; exchange (i + 1) (j + 1))\n      else exchange i (j + 1)\n    in exchange (p - 1) p\n  and doit p r =\n    if p < r then begin\n      let q = partition p r in\n      doit p (q - 1);\n      doit q r\n    end in\n  doit 0 (Array.length a - 1)\n\nlet stable_p (a : (int * char * int) array) n =\n  let rec doit i =\n    if i = n - 1 then true\n    else if (fun (xi, _, xd) (yi, _, yd) -> xd = yd && xi > yi) a.(i) a.(i+1) then false\n    else doit (i + 1)\n  in doit 0\n\nlet split str delim =\n  let rec doit s acc =\n    match\n      try Some (String.rindex s delim) with _ -> None\n    with\n    | None -> s :: acc\n    | Some i ->\n        let s1 = String.sub s 0 i in\n        doit s1 (String.sub s (i + 1) (String.length s - String.length s1 - 1) :: acc)\n  in doit str []\n\nlet () =\n  let n = read_int () in\n  let a = Array.init n (fun i ->\n    match split (read_line ()) ' ' with\n    | [c; d] -> (i, c.[0], int_of_string d)\n    | _ -> exit 1\n  ) in\n  quick_sort a (fun (_, _, x) (_, _, y) -> compare x y);\n  print_endline (if stable_p a n then \"Stable\" else \"Not stable\");\n  Array.iter (fun (_, c, d) -> Printf.printf \"%c %d\\n\" c d) a", "problem_context": "Quick Sort\n\nLet's arrange a deck of cards. Your task is to sort totally n cards. A card consists of a part of a suit (S, H, C or D) and an number. Write a program which sorts such cards based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nQuicksort(A, p, r)\n1 if p < r\n2 then q = Partition(A, p, r)\n3 run Quicksort(A, p, q-1)\n4 run Quicksort(A, q+1, r)\n\nHere, A is an array which represents a deck of cards and comparison operations are performed based on the numbers.\n\nYour program should also report the stability of the output for the given input (instance). Here, 'stability of the output' means that: cards with the same value appear in the output in the same order as they do in the input (instance).\n\nInput\n\nThe first line contains an integer n, the number of cards.\n\nn cards are given in the following lines. Each card is given in a line and represented by a pair of a character and an integer separated by a single space.\n\nOutput\n\nIn the first line, print the stability (\"Stable\" or \"Not stable\") of this output.\n\nIn the following lines, print the arranged cards in the same manner of that of the input.\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n1 ≤ the number of a card ≤ 109\n\nThere are no identical card in the input\n\nSample Input 1\n\n6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n\nSample Output 1\n\nNot stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n\nSample Input 2\n\n2\nS 1\nH 1\n\nSample Output 2\n\nStable\nS 1\nH 1", "sample_input": "6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n"}, "reference_outputs": ["Not stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n"], "source_document_id": "p02277", "source_text": "Quick Sort\n\nLet's arrange a deck of cards. Your task is to sort totally n cards. A card consists of a part of a suit (S, H, C or D) and an number. Write a program which sorts such cards based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nQuicksort(A, p, r)\n1 if p < r\n2 then q = Partition(A, p, r)\n3 run Quicksort(A, p, q-1)\n4 run Quicksort(A, q+1, r)\n\nHere, A is an array which represents a deck of cards and comparison operations are performed based on the numbers.\n\nYour program should also report the stability of the output for the given input (instance). Here, 'stability of the output' means that: cards with the same value appear in the output in the same order as they do in the input (instance).\n\nInput\n\nThe first line contains an integer n, the number of cards.\n\nn cards are given in the following lines. Each card is given in a line and represented by a pair of a character and an integer separated by a single space.\n\nOutput\n\nIn the first line, print the stability (\"Stable\" or \"Not stable\") of this output.\n\nIn the following lines, print the arranged cards in the same manner of that of the input.\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n1 ≤ the number of a card ≤ 109\n\nThere are no identical card in the input\n\nSample Input 1\n\n6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n\nSample Output 1\n\nNot stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n\nSample Input 2\n\n2\nS 1\nH 1\n\nSample Output 2\n\nStable\nS 1\nH 1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1416, "cpu_time_ms": 60, "memory_kb": 8780}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s306729422", "group_id": "codeNet:p02277", "input_text": "let quick_sort (a : (int * char * int) array) =\n  let swap i j = let tmp = a.(i) in a.(i) <- a.(j); a.(j) <- tmp in\n  let partition p r =\n    let rec exchange = function\n      | (i, j) when j = r -> swap i r; i\n      | (i, j) when (fun (_, _, x) (_, _, y) -> x - y) a.(j) a.(r) <= 0 -> swap i j; exchange (i + 1, j + 1)\n      | (i, j) -> exchange (i, j + 1) in\n    exchange (p, p) in\n  let rec doit p r =\n    if p < r then begin\n      let q = partition p r in\n      doit p (q - 1);\n      doit q r\n    end in\n  doit 0 (Array.length a - 1)\n\nlet stable_p (a : (int * char * int) array) n =\n  let rec doit i =\n    if i = n then true\n    else if (fun (xi, _, xd) (yi, _, yd) -> xd = yd && xi > yi) a.(i-1) a.(i) then false\n    else doit (i + 1) in\n  doit 1\n\nlet split str delim =\n  let open String in\n  let rec doit s acc =\n    match\n      try Some (rindex s delim) with _ -> None\n    with\n    | None -> s :: acc\n    | Some i -> doit (sub s 0 i) (sub s (i + 1) (length s - i - 1) :: acc) in\n  doit str []\n\nlet () =\n  let n = read_int () in\n  let a = Array.init n (fun i ->\n    match split (read_line ()) ' ' with\n    | [c; d] -> (i, c.[0], int_of_string d)\n    | _ -> exit 1) in\n  quick_sort a;\n  print_endline (if stable_p a n then \"Stable\" else \"Not stable\");\n  Array.iter (fun (_, c, d) -> Printf.printf \"%c %d\\n\" c d) a", "language": "OCaml", "metadata": {"date": 1476511288, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02277.html", "problem_id": "p02277", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02277/input.txt", "sample_output_relpath": "derived/input_output/data/p02277/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02277/OCaml/s306729422.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s306729422", "user_id": "u809138450"}, "prompt_components": {"gold_output": "Not stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n", "input_to_evaluate": "let quick_sort (a : (int * char * int) array) =\n  let swap i j = let tmp = a.(i) in a.(i) <- a.(j); a.(j) <- tmp in\n  let partition p r =\n    let rec exchange = function\n      | (i, j) when j = r -> swap i r; i\n      | (i, j) when (fun (_, _, x) (_, _, y) -> x - y) a.(j) a.(r) <= 0 -> swap i j; exchange (i + 1, j + 1)\n      | (i, j) -> exchange (i, j + 1) in\n    exchange (p, p) in\n  let rec doit p r =\n    if p < r then begin\n      let q = partition p r in\n      doit p (q - 1);\n      doit q r\n    end in\n  doit 0 (Array.length a - 1)\n\nlet stable_p (a : (int * char * int) array) n =\n  let rec doit i =\n    if i = n then true\n    else if (fun (xi, _, xd) (yi, _, yd) -> xd = yd && xi > yi) a.(i-1) a.(i) then false\n    else doit (i + 1) in\n  doit 1\n\nlet split str delim =\n  let open String in\n  let rec doit s acc =\n    match\n      try Some (rindex s delim) with _ -> None\n    with\n    | None -> s :: acc\n    | Some i -> doit (sub s 0 i) (sub s (i + 1) (length s - i - 1) :: acc) in\n  doit str []\n\nlet () =\n  let n = read_int () in\n  let a = Array.init n (fun i ->\n    match split (read_line ()) ' ' with\n    | [c; d] -> (i, c.[0], int_of_string d)\n    | _ -> exit 1) in\n  quick_sort a;\n  print_endline (if stable_p a n then \"Stable\" else \"Not stable\");\n  Array.iter (fun (_, c, d) -> Printf.printf \"%c %d\\n\" c d) a", "problem_context": "Quick Sort\n\nLet's arrange a deck of cards. Your task is to sort totally n cards. A card consists of a part of a suit (S, H, C or D) and an number. Write a program which sorts such cards based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nQuicksort(A, p, r)\n1 if p < r\n2 then q = Partition(A, p, r)\n3 run Quicksort(A, p, q-1)\n4 run Quicksort(A, q+1, r)\n\nHere, A is an array which represents a deck of cards and comparison operations are performed based on the numbers.\n\nYour program should also report the stability of the output for the given input (instance). Here, 'stability of the output' means that: cards with the same value appear in the output in the same order as they do in the input (instance).\n\nInput\n\nThe first line contains an integer n, the number of cards.\n\nn cards are given in the following lines. Each card is given in a line and represented by a pair of a character and an integer separated by a single space.\n\nOutput\n\nIn the first line, print the stability (\"Stable\" or \"Not stable\") of this output.\n\nIn the following lines, print the arranged cards in the same manner of that of the input.\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n1 ≤ the number of a card ≤ 109\n\nThere are no identical card in the input\n\nSample Input 1\n\n6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n\nSample Output 1\n\nNot stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n\nSample Input 2\n\n2\nS 1\nH 1\n\nSample Output 2\n\nStable\nS 1\nH 1", "sample_input": "6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n"}, "reference_outputs": ["Not stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n"], "source_document_id": "p02277", "source_text": "Quick Sort\n\nLet's arrange a deck of cards. Your task is to sort totally n cards. A card consists of a part of a suit (S, H, C or D) and an number. Write a program which sorts such cards based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nQuicksort(A, p, r)\n1 if p < r\n2 then q = Partition(A, p, r)\n3 run Quicksort(A, p, q-1)\n4 run Quicksort(A, q+1, r)\n\nHere, A is an array which represents a deck of cards and comparison operations are performed based on the numbers.\n\nYour program should also report the stability of the output for the given input (instance). Here, 'stability of the output' means that: cards with the same value appear in the output in the same order as they do in the input (instance).\n\nInput\n\nThe first line contains an integer n, the number of cards.\n\nn cards are given in the following lines. Each card is given in a line and represented by a pair of a character and an integer separated by a single space.\n\nOutput\n\nIn the first line, print the stability (\"Stable\" or \"Not stable\") of this output.\n\nIn the following lines, print the arranged cards in the same manner of that of the input.\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n1 ≤ the number of a card ≤ 109\n\nThere are no identical card in the input\n\nSample Input 1\n\n6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n\nSample Output 1\n\nNot stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n\nSample Input 2\n\n2\nS 1\nH 1\n\nSample Output 2\n\nStable\nS 1\nH 1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1318, "cpu_time_ms": 60, "memory_kb": 8788}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s475046190", "group_id": "codeNet:p02277", "input_text": "type t = {\n  id : int;\n  ch : char;\n  num : int;\n}\n\nlet a = Array.make 100001 { id = 0; ch = '\\000'; num = 0 }\n\nlet rec partitoin r = function\n  | (i, j) when j = r ->\n    let tmp = a.(i) in\n    a.(i) <- a.(j);\n    a.(j) <- tmp;\n    i\n  | (i, j) when a.(j).num <= a.(r).num ->\n    let tmp = a.(i) in\n    a.(i) <- a.(j);\n    a.(j) <- tmp;\n    partitoin r (i + 1, j + 1)\n  | (i, j) ->\n    partitoin r (i, j + 1)\n\nlet rec quick_sort p r =\n  if p < r then begin\n    let q = partitoin r (p, p) in\n    quick_sort p (q - 1);\n    quick_sort q r\n  end\n\nlet rec stable_str n i =\n  if i = n then \"Stable\"\n  else if a.(i-1).num = a.(i).num && a.(i-1).id > a.(i).id then \"Not stable\"\n  else stable_str n (i + 1)\n\nlet rec read i n =\n  if i < n then begin\n    begin match Str.split (Str.regexp \" \") (read_line ()) with\n    | [c; d] -> a.(i) <- { id = i; ch = c.[0]; num = int_of_string d }\n    | _ -> exit 1\n    end;\n    read (i + 1) n\n  end\n\nlet rec print i n =\n  if i < n then begin\n    print_char a.(i).ch;\n    print_string \" \";\n    print_int a.(i).num;\n    print_string \"\\n\";\n    print (i + 1) n\n  end\n\nlet () =\n  let n = read_int () in\n  read 0 n;\n  quick_sort 0 (n - 1);\n  print_endline (stable_str n 1);\n  print 0 n", "language": "OCaml", "metadata": {"date": 1476512935, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02277.html", "problem_id": "p02277", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02277/input.txt", "sample_output_relpath": "derived/input_output/data/p02277/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02277/OCaml/s475046190.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s475046190", "user_id": "u809138450"}, "prompt_components": {"gold_output": "Not stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n", "input_to_evaluate": "type t = {\n  id : int;\n  ch : char;\n  num : int;\n}\n\nlet a = Array.make 100001 { id = 0; ch = '\\000'; num = 0 }\n\nlet rec partitoin r = function\n  | (i, j) when j = r ->\n    let tmp = a.(i) in\n    a.(i) <- a.(j);\n    a.(j) <- tmp;\n    i\n  | (i, j) when a.(j).num <= a.(r).num ->\n    let tmp = a.(i) in\n    a.(i) <- a.(j);\n    a.(j) <- tmp;\n    partitoin r (i + 1, j + 1)\n  | (i, j) ->\n    partitoin r (i, j + 1)\n\nlet rec quick_sort p r =\n  if p < r then begin\n    let q = partitoin r (p, p) in\n    quick_sort p (q - 1);\n    quick_sort q r\n  end\n\nlet rec stable_str n i =\n  if i = n then \"Stable\"\n  else if a.(i-1).num = a.(i).num && a.(i-1).id > a.(i).id then \"Not stable\"\n  else stable_str n (i + 1)\n\nlet rec read i n =\n  if i < n then begin\n    begin match Str.split (Str.regexp \" \") (read_line ()) with\n    | [c; d] -> a.(i) <- { id = i; ch = c.[0]; num = int_of_string d }\n    | _ -> exit 1\n    end;\n    read (i + 1) n\n  end\n\nlet rec print i n =\n  if i < n then begin\n    print_char a.(i).ch;\n    print_string \" \";\n    print_int a.(i).num;\n    print_string \"\\n\";\n    print (i + 1) n\n  end\n\nlet () =\n  let n = read_int () in\n  read 0 n;\n  quick_sort 0 (n - 1);\n  print_endline (stable_str n 1);\n  print 0 n", "problem_context": "Quick Sort\n\nLet's arrange a deck of cards. Your task is to sort totally n cards. A card consists of a part of a suit (S, H, C or D) and an number. Write a program which sorts such cards based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nQuicksort(A, p, r)\n1 if p < r\n2 then q = Partition(A, p, r)\n3 run Quicksort(A, p, q-1)\n4 run Quicksort(A, q+1, r)\n\nHere, A is an array which represents a deck of cards and comparison operations are performed based on the numbers.\n\nYour program should also report the stability of the output for the given input (instance). Here, 'stability of the output' means that: cards with the same value appear in the output in the same order as they do in the input (instance).\n\nInput\n\nThe first line contains an integer n, the number of cards.\n\nn cards are given in the following lines. Each card is given in a line and represented by a pair of a character and an integer separated by a single space.\n\nOutput\n\nIn the first line, print the stability (\"Stable\" or \"Not stable\") of this output.\n\nIn the following lines, print the arranged cards in the same manner of that of the input.\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n1 ≤ the number of a card ≤ 109\n\nThere are no identical card in the input\n\nSample Input 1\n\n6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n\nSample Output 1\n\nNot stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n\nSample Input 2\n\n2\nS 1\nH 1\n\nSample Output 2\n\nStable\nS 1\nH 1", "sample_input": "6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n"}, "reference_outputs": ["Not stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n"], "source_document_id": "p02277", "source_text": "Quick Sort\n\nLet's arrange a deck of cards. Your task is to sort totally n cards. A card consists of a part of a suit (S, H, C or D) and an number. Write a program which sorts such cards based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nQuicksort(A, p, r)\n1 if p < r\n2 then q = Partition(A, p, r)\n3 run Quicksort(A, p, q-1)\n4 run Quicksort(A, q+1, r)\n\nHere, A is an array which represents a deck of cards and comparison operations are performed based on the numbers.\n\nYour program should also report the stability of the output for the given input (instance). Here, 'stability of the output' means that: cards with the same value appear in the output in the same order as they do in the input (instance).\n\nInput\n\nThe first line contains an integer n, the number of cards.\n\nn cards are given in the following lines. Each card is given in a line and represented by a pair of a character and an integer separated by a single space.\n\nOutput\n\nIn the first line, print the stability (\"Stable\" or \"Not stable\") of this output.\n\nIn the following lines, print the arranged cards in the same manner of that of the input.\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n1 ≤ the number of a card ≤ 109\n\nThere are no identical card in the input\n\nSample Input 1\n\n6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n\nSample Output 1\n\nNot stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n\nSample Input 2\n\n2\nS 1\nH 1\n\nSample Output 2\n\nStable\nS 1\nH 1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1207, "cpu_time_ms": 110, "memory_kb": 8972}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s296064250", "group_id": "codeNet:p02277", "input_text": "let quick_sort (a : (int * char * int) array) cmp =\n  let swap i j = let tmp = a.(i) in a.(i) <- a.(j); a.(j) <- tmp in\n  let partition p r =\n    let rec exchange = function\n      | (i, j) when j = r -> swap i r; i\n      | (i, j) when cmp a.(j) a.(r) <= 0 -> swap i j; exchange (i + 1, j + 1)\n      | (i, j) -> exchange (i, j + 1) in\n    exchange (p, p) in\n  let rec doit p r =\n    if p < r then begin\n      let q = partition p r in\n      doit p (q - 1);\n      doit q r\n    end in\n  doit 0 (Array.length a - 1)\n\nlet stable_p (a : (int * char * int) array) n =\n  let rec doit i =\n    if i = n then true\n    else if (fun (xi, _, xd) (yi, _, yd) -> xd = yd && xi > yi) a.(i-1) a.(i) then false\n    else doit (i + 1) in\n  doit 1\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let n = read_int () in\n  let read i =\n    match split_on_char ' ' (read_line ()) with\n    | [c; d] -> (i, c.[0], int_of_string d)\n    | _ -> exit 1 in\n  let a = Array.init n read in\n  quick_sort a (fun (_, _, x) (_, _, y) -> compare x y);\n  print_endline (if stable_p a n then \"Stable\" else \"Not stable\");\n  Array.iter (fun (_, c, d) -> Printf.printf \"%c %d\\n\" c d) a", "language": "OCaml", "metadata": {"date": 1479565576, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02277.html", "problem_id": "p02277", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02277/input.txt", "sample_output_relpath": "derived/input_output/data/p02277/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02277/OCaml/s296064250.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s296064250", "user_id": "u809138450"}, "prompt_components": {"gold_output": "Not stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n", "input_to_evaluate": "let quick_sort (a : (int * char * int) array) cmp =\n  let swap i j = let tmp = a.(i) in a.(i) <- a.(j); a.(j) <- tmp in\n  let partition p r =\n    let rec exchange = function\n      | (i, j) when j = r -> swap i r; i\n      | (i, j) when cmp a.(j) a.(r) <= 0 -> swap i j; exchange (i + 1, j + 1)\n      | (i, j) -> exchange (i, j + 1) in\n    exchange (p, p) in\n  let rec doit p r =\n    if p < r then begin\n      let q = partition p r in\n      doit p (q - 1);\n      doit q r\n    end in\n  doit 0 (Array.length a - 1)\n\nlet stable_p (a : (int * char * int) array) n =\n  let rec doit i =\n    if i = n then true\n    else if (fun (xi, _, xd) (yi, _, yd) -> xd = yd && xi > yi) a.(i-1) a.(i) then false\n    else doit (i + 1) in\n  doit 1\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let n = read_int () in\n  let read i =\n    match split_on_char ' ' (read_line ()) with\n    | [c; d] -> (i, c.[0], int_of_string d)\n    | _ -> exit 1 in\n  let a = Array.init n read in\n  quick_sort a (fun (_, _, x) (_, _, y) -> compare x y);\n  print_endline (if stable_p a n then \"Stable\" else \"Not stable\");\n  Array.iter (fun (_, c, d) -> Printf.printf \"%c %d\\n\" c d) a", "problem_context": "Quick Sort\n\nLet's arrange a deck of cards. Your task is to sort totally n cards. A card consists of a part of a suit (S, H, C or D) and an number. Write a program which sorts such cards based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nQuicksort(A, p, r)\n1 if p < r\n2 then q = Partition(A, p, r)\n3 run Quicksort(A, p, q-1)\n4 run Quicksort(A, q+1, r)\n\nHere, A is an array which represents a deck of cards and comparison operations are performed based on the numbers.\n\nYour program should also report the stability of the output for the given input (instance). Here, 'stability of the output' means that: cards with the same value appear in the output in the same order as they do in the input (instance).\n\nInput\n\nThe first line contains an integer n, the number of cards.\n\nn cards are given in the following lines. Each card is given in a line and represented by a pair of a character and an integer separated by a single space.\n\nOutput\n\nIn the first line, print the stability (\"Stable\" or \"Not stable\") of this output.\n\nIn the following lines, print the arranged cards in the same manner of that of the input.\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n1 ≤ the number of a card ≤ 109\n\nThere are no identical card in the input\n\nSample Input 1\n\n6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n\nSample Output 1\n\nNot stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n\nSample Input 2\n\n2\nS 1\nH 1\n\nSample Output 2\n\nStable\nS 1\nH 1", "sample_input": "6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n"}, "reference_outputs": ["Not stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n"], "source_document_id": "p02277", "source_text": "Quick Sort\n\nLet's arrange a deck of cards. Your task is to sort totally n cards. A card consists of a part of a suit (S, H, C or D) and an number. Write a program which sorts such cards based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nQuicksort(A, p, r)\n1 if p < r\n2 then q = Partition(A, p, r)\n3 run Quicksort(A, p, q-1)\n4 run Quicksort(A, q+1, r)\n\nHere, A is an array which represents a deck of cards and comparison operations are performed based on the numbers.\n\nYour program should also report the stability of the output for the given input (instance). Here, 'stability of the output' means that: cards with the same value appear in the output in the same order as they do in the input (instance).\n\nInput\n\nThe first line contains an integer n, the number of cards.\n\nn cards are given in the following lines. Each card is given in a line and represented by a pair of a character and an integer separated by a single space.\n\nOutput\n\nIn the first line, print the stability (\"Stable\" or \"Not stable\") of this output.\n\nIn the following lines, print the arranged cards in the same manner of that of the input.\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n1 ≤ the number of a card ≤ 109\n\nThere are no identical card in the input\n\nSample Input 1\n\n6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n\nSample Output 1\n\nNot stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n\nSample Input 2\n\n2\nS 1\nH 1\n\nSample Output 2\n\nStable\nS 1\nH 1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1360, "cpu_time_ms": 60, "memory_kb": 9140}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s442219363", "group_id": "codeNet:p02277", "input_text": "let quick_sort (a : (int * char * int) array) n cmp =\n  let swap i j = let tmp = a.(i) in a.(i) <- a.(j); a.(j) <- tmp in\n  let partition p r =\n    let i = ref p in\n    for j = p to r - 1 do\n      if cmp a.(j) a.(r) <= 0 then begin\n        swap !i j;\n        incr i;\n      end\n    done;\n    swap !i r;\n    !i in\n  let rec doit p r =\n    if p >= r then () else\n    let q = partition p r in\n    doit p (q - 1);\n    doit q r in\n  doit 0 (n - 1)\n\nlet stable_p (a : (int * char * int) array) n =\n  try\n    for i = 1 to n - 1 do\n      if (fun (xi, _, xd) (yi, _, yd) -> xd = yd && xi > yi) a.(i-1) a.(i) then raise Exit\n    done;\n    true\n  with Exit -> false\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let n = read_int () in\n  let a = Array.init n (fun i ->\n    match read_line () |> split_on_char ' ' with\n    | [c; d] -> (i, c.[0], int_of_string d)\n    | _ -> assert false) in\n  quick_sort a n (fun (_, _, x) (_, _, y) -> compare x y);\n  print_endline (if stable_p a n then \"Stable\" else \"Not stable\");\n  Array.iter (fun (_, c, d) -> Printf.printf \"%c %d\\n\" c d) a", "language": "OCaml", "metadata": {"date": 1499858249, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02277.html", "problem_id": "p02277", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02277/input.txt", "sample_output_relpath": "derived/input_output/data/p02277/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02277/OCaml/s442219363.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s442219363", "user_id": "u809138450"}, "prompt_components": {"gold_output": "Not stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n", "input_to_evaluate": "let quick_sort (a : (int * char * int) array) n cmp =\n  let swap i j = let tmp = a.(i) in a.(i) <- a.(j); a.(j) <- tmp in\n  let partition p r =\n    let i = ref p in\n    for j = p to r - 1 do\n      if cmp a.(j) a.(r) <= 0 then begin\n        swap !i j;\n        incr i;\n      end\n    done;\n    swap !i r;\n    !i in\n  let rec doit p r =\n    if p >= r then () else\n    let q = partition p r in\n    doit p (q - 1);\n    doit q r in\n  doit 0 (n - 1)\n\nlet stable_p (a : (int * char * int) array) n =\n  try\n    for i = 1 to n - 1 do\n      if (fun (xi, _, xd) (yi, _, yd) -> xd = yd && xi > yi) a.(i-1) a.(i) then raise Exit\n    done;\n    true\n  with Exit -> false\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let n = read_int () in\n  let a = Array.init n (fun i ->\n    match read_line () |> split_on_char ' ' with\n    | [c; d] -> (i, c.[0], int_of_string d)\n    | _ -> assert false) in\n  quick_sort a n (fun (_, _, x) (_, _, y) -> compare x y);\n  print_endline (if stable_p a n then \"Stable\" else \"Not stable\");\n  Array.iter (fun (_, c, d) -> Printf.printf \"%c %d\\n\" c d) a", "problem_context": "Quick Sort\n\nLet's arrange a deck of cards. Your task is to sort totally n cards. A card consists of a part of a suit (S, H, C or D) and an number. Write a program which sorts such cards based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nQuicksort(A, p, r)\n1 if p < r\n2 then q = Partition(A, p, r)\n3 run Quicksort(A, p, q-1)\n4 run Quicksort(A, q+1, r)\n\nHere, A is an array which represents a deck of cards and comparison operations are performed based on the numbers.\n\nYour program should also report the stability of the output for the given input (instance). Here, 'stability of the output' means that: cards with the same value appear in the output in the same order as they do in the input (instance).\n\nInput\n\nThe first line contains an integer n, the number of cards.\n\nn cards are given in the following lines. Each card is given in a line and represented by a pair of a character and an integer separated by a single space.\n\nOutput\n\nIn the first line, print the stability (\"Stable\" or \"Not stable\") of this output.\n\nIn the following lines, print the arranged cards in the same manner of that of the input.\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n1 ≤ the number of a card ≤ 109\n\nThere are no identical card in the input\n\nSample Input 1\n\n6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n\nSample Output 1\n\nNot stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n\nSample Input 2\n\n2\nS 1\nH 1\n\nSample Output 2\n\nStable\nS 1\nH 1", "sample_input": "6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n"}, "reference_outputs": ["Not stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n"], "source_document_id": "p02277", "source_text": "Quick Sort\n\nLet's arrange a deck of cards. Your task is to sort totally n cards. A card consists of a part of a suit (S, H, C or D) and an number. Write a program which sorts such cards based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nQuicksort(A, p, r)\n1 if p < r\n2 then q = Partition(A, p, r)\n3 run Quicksort(A, p, q-1)\n4 run Quicksort(A, q+1, r)\n\nHere, A is an array which represents a deck of cards and comparison operations are performed based on the numbers.\n\nYour program should also report the stability of the output for the given input (instance). Here, 'stability of the output' means that: cards with the same value appear in the output in the same order as they do in the input (instance).\n\nInput\n\nThe first line contains an integer n, the number of cards.\n\nn cards are given in the following lines. Each card is given in a line and represented by a pair of a character and an integer separated by a single space.\n\nOutput\n\nIn the first line, print the stability (\"Stable\" or \"Not stable\") of this output.\n\nIn the following lines, print the arranged cards in the same manner of that of the input.\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n1 ≤ the number of a card ≤ 109\n\nThere are no identical card in the input\n\nSample Input 1\n\n6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n\nSample Output 1\n\nNot stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n\nSample Input 2\n\n2\nS 1\nH 1\n\nSample Output 2\n\nStable\nS 1\nH 1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1286, "cpu_time_ms": 50, "memory_kb": 9836}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s415887508", "group_id": "codeNet:p02283", "input_text": "module type Comparable = sig\n  type t\n  val compare : t -> t -> int\nend\n\nmodule Make(Cmp : Comparable) = struct\n  type tree = Nil | Node of Cmp.t * tree * tree\n\n  let create () = Nil\n\n  let insert x t =\n    let rec doit = function\n      | Nil -> Node (x, Nil, Nil)\n      | (Node (y, _, _)) as d when x = y -> d\n      | Node (y, l, r) when Cmp.compare x y < 0 -> Node (y, doit l, r)\n      | Node (y, l, r) -> Node (y, l, doit r)\n    in\n    doit t\n\n  let preorder f t =\n    let rec doit = function\n      | Nil -> ()\n      | Node (x, l, r) -> (f x; doit l; doit r)\n    in\n    doit t\n\n  let inorder f t =\n    let rec doit = function\n      | Nil -> ()\n      | Node (x, l, r) -> (doit l; f x; doit r)\n    in\n    doit t\nend\n\nmodule T = Make(struct type t = int let compare x y = x - y end)\n\nlet print t =\n  let f e = print_string \" \"; print_int e in\n  T.inorder f t;\n  print_newline ();\n  T.preorder f t;\n  print_newline ()\n\nlet () =\n  let m = read_int () in\n  let rec read i t =\n    if i < m then begin\n      let op = Scanf.scanf \"%s \" (fun i -> i) in\n      if op = \"print\" then (print t; read (i + 1) t)\n      else\n        let k = Scanf.scanf \"%d \" (fun i -> i) in\n        read (i + 1) (T.insert k t)\n    end\n  in\n  read 0 (T.create ())", "language": "OCaml", "metadata": {"date": 1474728351, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02283.html", "problem_id": "p02283", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02283/input.txt", "sample_output_relpath": "derived/input_output/data/p02283/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02283/OCaml/s415887508.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s415887508", "user_id": "u809138450"}, "prompt_components": {"gold_output": " 1 12 17 20 25 30 88\n 30 12 1 20 17 25 88\n", "input_to_evaluate": "module type Comparable = sig\n  type t\n  val compare : t -> t -> int\nend\n\nmodule Make(Cmp : Comparable) = struct\n  type tree = Nil | Node of Cmp.t * tree * tree\n\n  let create () = Nil\n\n  let insert x t =\n    let rec doit = function\n      | Nil -> Node (x, Nil, Nil)\n      | (Node (y, _, _)) as d when x = y -> d\n      | Node (y, l, r) when Cmp.compare x y < 0 -> Node (y, doit l, r)\n      | Node (y, l, r) -> Node (y, l, doit r)\n    in\n    doit t\n\n  let preorder f t =\n    let rec doit = function\n      | Nil -> ()\n      | Node (x, l, r) -> (f x; doit l; doit r)\n    in\n    doit t\n\n  let inorder f t =\n    let rec doit = function\n      | Nil -> ()\n      | Node (x, l, r) -> (doit l; f x; doit r)\n    in\n    doit t\nend\n\nmodule T = Make(struct type t = int let compare x y = x - y end)\n\nlet print t =\n  let f e = print_string \" \"; print_int e in\n  T.inorder f t;\n  print_newline ();\n  T.preorder f t;\n  print_newline ()\n\nlet () =\n  let m = read_int () in\n  let rec read i t =\n    if i < m then begin\n      let op = Scanf.scanf \"%s \" (fun i -> i) in\n      if op = \"print\" then (print t; read (i + 1) t)\n      else\n        let k = Scanf.scanf \"%d \" (fun i -> i) in\n        read (i + 1) (T.insert k t)\n    end\n  in\n  read 0 (T.create ())", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nBinary Search Tree I\n\nSearch trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.\n\nBinary search tree is one of fundamental search trees. The keys in a binary search tree are always stored in such a way as to satisfy the following binary search tree property:\n\nLet $x$ be a node in a binary search tree. If $y$ is a node in the left subtree of $x$, then $y.key \\leq x.key$. If $y$ is a node in the right subtree of $x$, then $x.key \\leq y.key$.\n\nThe following figure shows an example of the binary search tree.\n\nFor example, keys of nodes which belong to the left sub-tree of the node containing 80 are less than or equal to 80, and keys of nodes which belong to the right sub-tree are more than or equal to 80. The binary search tree property allows us to print out all the keys in the tree in sorted order by an inorder tree walk.\n\nA binary search tree should be implemented in such a way that the binary search tree property continues to hold after modifications by insertions and deletions. A binary search tree can be represented by a linked data structure in which each node is an object. In addition to a key field and satellite data, each node contains fields left, right, and p that point to the nodes corresponding to its left child, its right child, and its parent, respectively.\n\nTo insert a new value $v$ into a binary search tree $T$, we can use the procedure insert as shown in the following pseudo code. The insert procedure is passed a node $z$ for which $z.key = v$, $z.left = NIL$, and $z.right = NIL$. The procedure modifies $T$ and some of the fields of $z$ in such a way that $z$ is inserted into an appropriate position in the tree.\n\n1 insert(T, z)\n2 y = NIL // parent of x\n3 x = 'the root of T'\n4 while x ≠ NIL\n5 y = x // set the parent\n6 if z.key < x.key\n7 x = x.left // move to the left child\n8 else\n9 x = x.right // move to the right child\n10 z.p = y\n11\n12 if y == NIL // T is empty\n13 'the root of T' = z\n14 else if z.key < y.key\n15 y.left = z // z is the left child of y\n16 else\n17 y.right = z // z is the right child of y\n\nWrite a program which performs the following operations to a binary search tree $T$.\n\ninsert $k$: Insert a node containing $k$ as key into $T$.\n\nprint: Print the keys of the binary search tree by inorder tree walk and preorder tree walk respectively.\n\nYou should use the above pseudo code to implement the insert operation. $T$ is empty at the initial state.\n\nInput\n\nIn the first line, the number of operations $m$ is given. In the following $m$ lines, operations represented by insert $k$ or print are given.\n\nOutput\n\nFor each print operation, print a list of keys obtained by inorder tree walk and preorder tree walk in a line respectively. Put a space character before each key.\n\nConstraints\n\nThe number of operations $\\leq 500,000$\n\nThe number of print operations $\\leq 10$.\n\n$-2,000,000,000 \\leq key \\leq 2,000,000,000$\n\nThe height of the binary tree does not exceed 100 if you employ the above pseudo code.\n\nThe keys in the binary search tree are all different.\n\nSample Input 1\n\n8\ninsert 30\ninsert 88\ninsert 12\ninsert 1\ninsert 20\ninsert 17\ninsert 25\nprint\n\nSample Output 1\n\n1 12 17 20 25 30 88\n30 12 1 20 17 25 88\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "8\ninsert 30\ninsert 88\ninsert 12\ninsert 1\ninsert 20\ninsert 17\ninsert 25\nprint\n"}, "reference_outputs": [" 1 12 17 20 25 30 88\n 30 12 1 20 17 25 88\n"], "source_document_id": "p02283", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nBinary Search Tree I\n\nSearch trees are data structures that support dynamic set operations including insert, search, delete and so on. Thus a search tree can be used both as a dictionary and as a priority queue.\n\nBinary search tree is one of fundamental search trees. The keys in a binary search tree are always stored in such a way as to satisfy the following binary search tree property:\n\nLet $x$ be a node in a binary search tree. If $y$ is a node in the left subtree of $x$, then $y.key \\leq x.key$. If $y$ is a node in the right subtree of $x$, then $x.key \\leq y.key$.\n\nThe following figure shows an example of the binary search tree.\n\nFor example, keys of nodes which belong to the left sub-tree of the node containing 80 are less than or equal to 80, and keys of nodes which belong to the right sub-tree are more than or equal to 80. The binary search tree property allows us to print out all the keys in the tree in sorted order by an inorder tree walk.\n\nA binary search tree should be implemented in such a way that the binary search tree property continues to hold after modifications by insertions and deletions. A binary search tree can be represented by a linked data structure in which each node is an object. In addition to a key field and satellite data, each node contains fields left, right, and p that point to the nodes corresponding to its left child, its right child, and its parent, respectively.\n\nTo insert a new value $v$ into a binary search tree $T$, we can use the procedure insert as shown in the following pseudo code. The insert procedure is passed a node $z$ for which $z.key = v$, $z.left = NIL$, and $z.right = NIL$. The procedure modifies $T$ and some of the fields of $z$ in such a way that $z$ is inserted into an appropriate position in the tree.\n\n1 insert(T, z)\n2 y = NIL // parent of x\n3 x = 'the root of T'\n4 while x ≠ NIL\n5 y = x // set the parent\n6 if z.key < x.key\n7 x = x.left // move to the left child\n8 else\n9 x = x.right // move to the right child\n10 z.p = y\n11\n12 if y == NIL // T is empty\n13 'the root of T' = z\n14 else if z.key < y.key\n15 y.left = z // z is the left child of y\n16 else\n17 y.right = z // z is the right child of y\n\nWrite a program which performs the following operations to a binary search tree $T$.\n\ninsert $k$: Insert a node containing $k$ as key into $T$.\n\nprint: Print the keys of the binary search tree by inorder tree walk and preorder tree walk respectively.\n\nYou should use the above pseudo code to implement the insert operation. $T$ is empty at the initial state.\n\nInput\n\nIn the first line, the number of operations $m$ is given. In the following $m$ lines, operations represented by insert $k$ or print are given.\n\nOutput\n\nFor each print operation, print a list of keys obtained by inorder tree walk and preorder tree walk in a line respectively. Put a space character before each key.\n\nConstraints\n\nThe number of operations $\\leq 500,000$\n\nThe number of print operations $\\leq 10$.\n\n$-2,000,000,000 \\leq key \\leq 2,000,000,000$\n\nThe height of the binary tree does not exceed 100 if you employ the above pseudo code.\n\nThe keys in the binary search tree are all different.\n\nSample Input 1\n\n8\ninsert 30\ninsert 88\ninsert 12\ninsert 1\ninsert 20\ninsert 17\ninsert 25\nprint\n\nSample Output 1\n\n1 12 17 20 25 30 88\n30 12 1 20 17 25 88\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1231, "cpu_time_ms": 970, "memory_kb": 31976}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s921420541", "group_id": "codeNet:p02284", "input_text": "type tree = Nil | Node of int * tree * tree\n\nlet create () = Nil\n\nlet insert x t =\n  let rec doit = function\n    | Nil -> Node (x, Nil, Nil)\n    | Node (y, l, r) ->\n      if x < y then Node (y, doit l, r)\n      else Node (y, l, doit r) in\n  doit t\n\nlet preorder f t =\n  let rec doit = function\n    | Nil -> ()\n    | Node (x, l, r) -> f x; doit l; doit r in\n  doit t\n\nlet inorder f t =\n  let rec doit = function\n    | Nil -> ()\n    | Node (x, l, r) -> doit l; f x; doit r in\n  doit t\n\nlet print t =\n  inorder (fun e -> print_string \" \"; print_int e) t;\n  print_newline ();\n  preorder (fun e -> print_string \" \"; print_int e) t;\n  print_newline ()\n\nlet find x t =\n  let rec doit = function\n    | Nil -> false\n    | Node (y, _, _) when x = y -> true\n    | Node (y, l, _) when x < y -> doit l\n    | Node (_, _, r) -> doit r in\n  doit t\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let m = read_int () in\n  let t = ref (create ()) in\n  for _ = 0 to m - 1 do\n    match read_line () |> split_on_char ' ' with\n    | [\"insert\"; n] -> t := insert (int_of_string n) !t\n    | [\"find\"; n] -> print_endline (if find (int_of_string n) !t then \"yes\" else \"no\")\n    | _ -> print !t\n  done", "language": "OCaml", "metadata": {"date": 1500059447, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02284.html", "problem_id": "p02284", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02284/input.txt", "sample_output_relpath": "derived/input_output/data/p02284/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02284/OCaml/s921420541.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s921420541", "user_id": "u809138450"}, "prompt_components": {"gold_output": "yes\nno\n 1 12 17 20 25 30 88\n 30 12 1 20 17 25 88\n", "input_to_evaluate": "type tree = Nil | Node of int * tree * tree\n\nlet create () = Nil\n\nlet insert x t =\n  let rec doit = function\n    | Nil -> Node (x, Nil, Nil)\n    | Node (y, l, r) ->\n      if x < y then Node (y, doit l, r)\n      else Node (y, l, doit r) in\n  doit t\n\nlet preorder f t =\n  let rec doit = function\n    | Nil -> ()\n    | Node (x, l, r) -> f x; doit l; doit r in\n  doit t\n\nlet inorder f t =\n  let rec doit = function\n    | Nil -> ()\n    | Node (x, l, r) -> doit l; f x; doit r in\n  doit t\n\nlet print t =\n  inorder (fun e -> print_string \" \"; print_int e) t;\n  print_newline ();\n  preorder (fun e -> print_string \" \"; print_int e) t;\n  print_newline ()\n\nlet find x t =\n  let rec doit = function\n    | Nil -> false\n    | Node (y, _, _) when x = y -> true\n    | Node (y, l, _) when x < y -> doit l\n    | Node (_, _, r) -> doit r in\n  doit t\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let m = read_int () in\n  let t = ref (create ()) in\n  for _ = 0 to m - 1 do\n    match read_line () |> split_on_char ' ' with\n    | [\"insert\"; n] -> t := insert (int_of_string n) !t\n    | [\"find\"; n] -> print_endline (if find (int_of_string n) !t then \"yes\" else \"no\")\n    | _ -> print !t\n  done", "problem_context": "Binary Search Tree II\n\nWrite a program which performs the following operations to a binary search tree $T$ by adding the find operation to A: Binary Search Tree I.\n\ninsert $k$: Insert a node containing $k$ as key into $T$.\n\nfind $k$: Report whether $T$ has a node containing $k$.\n\nprint: Print the keys of the binary search tree by inorder tree walk and preorder tree walk respectively.\n\nInput\n\nIn the first line, the number of operations $m$ is given. In the following $m$ lines, operations represented by insert $k$, find $k$ or print are given.\n\nOutput\n\nFor each find $k$ operation, print \"yes\" if $T$ has a node containing $k$, \"no\" if not.\n\nIn addition, for each print operation, print a list of keys obtained by inorder tree walk and preorder tree walk in a line respectively. Put a space character before each key.\n\nConstraints\n\nThe number of operations $\\leq 500,000$\n\nThe number of print operations $\\leq 10$.\n\n$-2,000,000,000 \\leq key \\leq 2,000,000,000$\n\nThe height of the binary tree does not exceed 100 if you employ the above pseudo code.\n\nThe keys in the binary search tree are all different.\n\nSample Input 1\n\n10\ninsert 30\ninsert 88\ninsert 12\ninsert 1\ninsert 20\nfind 12\ninsert 17\ninsert 25\nfind 16\nprint\n\nSample Output 1\n\nyes\nno\n1 12 17 20 25 30 88\n30 12 1 20 17 25 88\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "10\ninsert 30\ninsert 88\ninsert 12\ninsert 1\ninsert 20\nfind 12\ninsert 17\ninsert 25\nfind 16\nprint\n"}, "reference_outputs": ["yes\nno\n 1 12 17 20 25 30 88\n 30 12 1 20 17 25 88\n"], "source_document_id": "p02284", "source_text": "Binary Search Tree II\n\nWrite a program which performs the following operations to a binary search tree $T$ by adding the find operation to A: Binary Search Tree I.\n\ninsert $k$: Insert a node containing $k$ as key into $T$.\n\nfind $k$: Report whether $T$ has a node containing $k$.\n\nprint: Print the keys of the binary search tree by inorder tree walk and preorder tree walk respectively.\n\nInput\n\nIn the first line, the number of operations $m$ is given. In the following $m$ lines, operations represented by insert $k$, find $k$ or print are given.\n\nOutput\n\nFor each find $k$ operation, print \"yes\" if $T$ has a node containing $k$, \"no\" if not.\n\nIn addition, for each print operation, print a list of keys obtained by inorder tree walk and preorder tree walk in a line respectively. Put a space character before each key.\n\nConstraints\n\nThe number of operations $\\leq 500,000$\n\nThe number of print operations $\\leq 10$.\n\n$-2,000,000,000 \\leq key \\leq 2,000,000,000$\n\nThe height of the binary tree does not exceed 100 if you employ the above pseudo code.\n\nThe keys in the binary search tree are all different.\n\nSample Input 1\n\n10\ninsert 30\ninsert 88\ninsert 12\ninsert 1\ninsert 20\nfind 12\ninsert 17\ninsert 25\nfind 16\nprint\n\nSample Output 1\n\nyes\nno\n1 12 17 20 25 30 88\n30 12 1 20 17 25 88\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1394, "cpu_time_ms": 770, "memory_kb": 25172}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s380032687", "group_id": "codeNet:p02285", "input_text": "type tree = Nil | Node of int * tree * tree\n\nlet create () = Nil\n\nlet insert x t =\n  let rec doit = function\n    | Nil -> Node (x, Nil, Nil)\n    | Node (y, l, r) ->\n      if x < y then Node (y, doit l, r)\n      else Node (y, l, doit r) in\n  doit t\n\nlet preorder f t =\n  let rec doit = function\n    | Nil -> ()\n    | Node (x, l, r) -> f x; doit l; doit r in\n  doit t\n\nlet inorder f t =\n  let rec doit = function\n    | Nil -> ()\n    | Node (x, l, r) -> doit l; f x; doit r in\n  doit t\n\nlet print t =\n  inorder (fun e -> print_string \" \"; print_int e) t;\n  print_newline ();\n  preorder (fun e -> print_string \" \"; print_int e) t;\n  print_newline ()\n\nlet find x t =\n  let rec doit = function\n    | Nil -> false\n    | Node (y, _, _) when x = y -> true\n    | Node (y, l, _) when x < y -> doit l\n    | Node (_, _, r) -> doit r in\n  doit t\n\nlet delete x t =\n  let rec dudu = function\n    | Nil -> exit 1\n    | Node (x, Nil, _) -> x\n    | Node (_, l, _) -> dudu l\n  and wa = function\n    | Nil -> exit 1\n    | Node (_, Nil, r) -> r\n    | Node (x, l, r) -> Node (x, wa l, r)\n  and doit = function\n    | Nil -> exit 1\n    | Node (y, l, r) when x = y ->\n      if l = Nil then r\n      else if r = Nil then l\n      else Node (dudu r, l, wa r)\n    | Node (y, l, r) when x < y -> Node (y, doit l, r)\n    | Node (y, l, r) -> Node (y, l, doit r) in\n  doit t\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let m = read_int () in\n  let t = ref (create ()) in\n  for _ = 0 to m - 1 do\n    match read_line () |> split_on_char ' ' with\n    | [\"insert\"; n] -> t := insert (int_of_string n) !t\n    | [\"find\"; n] -> print_endline (if find (int_of_string n) !t then \"yes\" else \"no\")\n    | [\"delete\"; n] -> t := delete (int_of_string n) !t\n    | _ -> print !t\n  done", "language": "OCaml", "metadata": {"date": 1500092246, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02285.html", "problem_id": "p02285", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02285/input.txt", "sample_output_relpath": "derived/input_output/data/p02285/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02285/OCaml/s380032687.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s380032687", "user_id": "u809138450"}, "prompt_components": {"gold_output": "yes\nyes\nyes\nno\nno\nno\nyes\nyes\n 1 2 3 7 8 22\n 8 2 1 3 7 22\n 1 2 8 22\n 8 2 1 22\n", "input_to_evaluate": "type tree = Nil | Node of int * tree * tree\n\nlet create () = Nil\n\nlet insert x t =\n  let rec doit = function\n    | Nil -> Node (x, Nil, Nil)\n    | Node (y, l, r) ->\n      if x < y then Node (y, doit l, r)\n      else Node (y, l, doit r) in\n  doit t\n\nlet preorder f t =\n  let rec doit = function\n    | Nil -> ()\n    | Node (x, l, r) -> f x; doit l; doit r in\n  doit t\n\nlet inorder f t =\n  let rec doit = function\n    | Nil -> ()\n    | Node (x, l, r) -> doit l; f x; doit r in\n  doit t\n\nlet print t =\n  inorder (fun e -> print_string \" \"; print_int e) t;\n  print_newline ();\n  preorder (fun e -> print_string \" \"; print_int e) t;\n  print_newline ()\n\nlet find x t =\n  let rec doit = function\n    | Nil -> false\n    | Node (y, _, _) when x = y -> true\n    | Node (y, l, _) when x < y -> doit l\n    | Node (_, _, r) -> doit r in\n  doit t\n\nlet delete x t =\n  let rec dudu = function\n    | Nil -> exit 1\n    | Node (x, Nil, _) -> x\n    | Node (_, l, _) -> dudu l\n  and wa = function\n    | Nil -> exit 1\n    | Node (_, Nil, r) -> r\n    | Node (x, l, r) -> Node (x, wa l, r)\n  and doit = function\n    | Nil -> exit 1\n    | Node (y, l, r) when x = y ->\n      if l = Nil then r\n      else if r = Nil then l\n      else Node (dudu r, l, wa r)\n    | Node (y, l, r) when x < y -> Node (y, doit l, r)\n    | Node (y, l, r) -> Node (y, l, doit r) in\n  doit t\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let m = read_int () in\n  let t = ref (create ()) in\n  for _ = 0 to m - 1 do\n    match read_line () |> split_on_char ' ' with\n    | [\"insert\"; n] -> t := insert (int_of_string n) !t\n    | [\"find\"; n] -> print_endline (if find (int_of_string n) !t then \"yes\" else \"no\")\n    | [\"delete\"; n] -> t := delete (int_of_string n) !t\n    | _ -> print !t\n  done", "problem_context": "Binary Search Tree III\n\nWrite a program which performs the following operations to a binary search tree $T$ by adding delete operation to B: Binary Search Tree II.\n\ninsert $k$: Insert a node containing $k$ as key into $T$.\n\nfind $k$: Report whether $T$ has a node containing $k$.\n\ndelete $k$: Delete a node containing $k$.\n\nprint: Print the keys of the binary search tree by inorder tree walk and preorder tree walk respectively.\n\nThe operation delete $k$ for deleting a given node $z$ containing key $k$ from $T$ can be implemented by an algorithm which considers the following cases:\n\nIf $z$ has no children, we modify its parent $z.p$ to replace $z$ with NIL as its child (delete $z$).\n\nIf $z$ has only a single child, we \"splice out\" $z$ by making a new link between its child and its parent.\n\nIf $z$ has two children, we splice out $z$'s successor $y$ and replace $z$'s key with $y$'s key.\n\nInput\n\nIn the first line, the number of operations $m$ is given. In the following $m$ lines, operations represented by insert $k$, find $k$, delete $k$ or print are given.\n\nOutput\n\nFor each find $k$ operation, print \"yes\" if $T$ has a node containing $k$, \"no\" if not.\n\nIn addition, for each print operation, print a list of keys obtained by inorder tree walk and preorder tree walk in a line respectively. Put a space character before each key\n\nConstraints\n\nThe number of operations $\\leq 500,000$\n\nThe number of print operations $\\leq 10$.\n\n$-2,000,000,000 \\leq key \\leq 2,000,000,000$\n\nThe height of the binary tree does not exceed 100 if you employ the above pseudo code.\n\nThe keys in the binary search tree are all different.\n\nSample Input 1\n\n18\ninsert 8\ninsert 2\ninsert 3\ninsert 7\ninsert 22\ninsert 1\nfind 1\nfind 2\nfind 3\nfind 4\nfind 5\nfind 6\nfind 7\nfind 8\nprint\ndelete 3\ndelete 7\nprint\n\nSample Output 1\n\nyes\nyes\nyes\nno\nno\nno\nyes\nyes\n1 2 3 7 8 22\n8 2 1 3 7 22\n1 2 8 22\n8 2 1 22\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "18\ninsert 8\ninsert 2\ninsert 3\ninsert 7\ninsert 22\ninsert 1\nfind 1\nfind 2\nfind 3\nfind 4\nfind 5\nfind 6\nfind 7\nfind 8\nprint\ndelete 3\ndelete 7\nprint\n"}, "reference_outputs": ["yes\nyes\nyes\nno\nno\nno\nyes\nyes\n 1 2 3 7 8 22\n 8 2 1 3 7 22\n 1 2 8 22\n 8 2 1 22\n"], "source_document_id": "p02285", "source_text": "Binary Search Tree III\n\nWrite a program which performs the following operations to a binary search tree $T$ by adding delete operation to B: Binary Search Tree II.\n\ninsert $k$: Insert a node containing $k$ as key into $T$.\n\nfind $k$: Report whether $T$ has a node containing $k$.\n\ndelete $k$: Delete a node containing $k$.\n\nprint: Print the keys of the binary search tree by inorder tree walk and preorder tree walk respectively.\n\nThe operation delete $k$ for deleting a given node $z$ containing key $k$ from $T$ can be implemented by an algorithm which considers the following cases:\n\nIf $z$ has no children, we modify its parent $z.p$ to replace $z$ with NIL as its child (delete $z$).\n\nIf $z$ has only a single child, we \"splice out\" $z$ by making a new link between its child and its parent.\n\nIf $z$ has two children, we splice out $z$'s successor $y$ and replace $z$'s key with $y$'s key.\n\nInput\n\nIn the first line, the number of operations $m$ is given. In the following $m$ lines, operations represented by insert $k$, find $k$, delete $k$ or print are given.\n\nOutput\n\nFor each find $k$ operation, print \"yes\" if $T$ has a node containing $k$, \"no\" if not.\n\nIn addition, for each print operation, print a list of keys obtained by inorder tree walk and preorder tree walk in a line respectively. Put a space character before each key\n\nConstraints\n\nThe number of operations $\\leq 500,000$\n\nThe number of print operations $\\leq 10$.\n\n$-2,000,000,000 \\leq key \\leq 2,000,000,000$\n\nThe height of the binary tree does not exceed 100 if you employ the above pseudo code.\n\nThe keys in the binary search tree are all different.\n\nSample Input 1\n\n18\ninsert 8\ninsert 2\ninsert 3\ninsert 7\ninsert 22\ninsert 1\nfind 1\nfind 2\nfind 3\nfind 4\nfind 5\nfind 6\nfind 7\nfind 8\nprint\ndelete 3\ndelete 7\nprint\n\nSample Output 1\n\nyes\nyes\nyes\nno\nno\nno\nyes\nyes\n1 2 3 7 8 22\n8 2 1 3 7 22\n1 2 8 22\n8 2 1 22\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1958, "cpu_time_ms": 720, "memory_kb": 25232}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s912394279", "group_id": "codeNet:p02285", "input_text": "type tree = Nil | Node of int * tree * tree\n\nlet create () = Nil\n\nlet insert x t =\n  let rec doit = function\n    | Nil -> Node (x, Nil, Nil)\n    | Node (y, l, r) ->\n      if x < y then Node (y, doit l, r)\n      else Node (y, l, doit r) in\n  doit t\n\nlet preorder f t =\n  let rec doit = function\n    | Nil -> ()\n    | Node (x, l, r) -> f x; doit l; doit r in\n  doit t\n\nlet inorder f t =\n  let rec doit = function\n    | Nil -> ()\n    | Node (x, l, r) -> doit l; f x; doit r in\n  doit t\n\nlet print t =\n  inorder (fun e -> print_string \" \"; print_int e) t;\n  Printf.printf \"\\n\";\n  preorder (fun e -> print_string \" \"; print_int e) t;\n  Printf.printf \"\\n\"\n\nlet find x t =\n  let rec doit = function\n    | Nil -> false\n    | Node (y, _, _) when x = y -> true\n    | Node (y, l, _) when x < y -> doit l\n    | Node (_, _, r) -> doit r in\n  doit t\n\nlet delete x t =\n  let rec balance = function\n    | Nil -> assert false\n    | Node (x, Nil, r) -> (x, r)\n    | Node (x, l, r) ->\n      let (m, l) = balance l in\n      (m, Node (x, l, r)) in\n  let rec doit = function\n    | Nil -> assert false\n    | Node (y, l, r) ->\n      if x = y then\n        if l = Nil then r\n        else if r = Nil then l\n        else\n          let (m, r) = balance r in\n          Node (m, l, r)\n      else if x < y then Node (y, doit l, r)\n      else Node (y, l, doit r) in\n  doit t\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let m = read_int () in\n  let t = ref (create ()) in\n  for _ = 0 to m - 1 do\n    match read_line () |> split_on_char ' ' with\n    | [\"insert\"; n] -> t := insert (int_of_string n) !t\n    | [\"find\"; n] -> print_endline (if find (int_of_string n) !t then \"yes\" else \"no\")\n    | [\"delete\"; n] -> t := delete (int_of_string n) !t\n    | _ -> print !t\n  done", "language": "OCaml", "metadata": {"date": 1500093660, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02285.html", "problem_id": "p02285", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02285/input.txt", "sample_output_relpath": "derived/input_output/data/p02285/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02285/OCaml/s912394279.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s912394279", "user_id": "u809138450"}, "prompt_components": {"gold_output": "yes\nyes\nyes\nno\nno\nno\nyes\nyes\n 1 2 3 7 8 22\n 8 2 1 3 7 22\n 1 2 8 22\n 8 2 1 22\n", "input_to_evaluate": "type tree = Nil | Node of int * tree * tree\n\nlet create () = Nil\n\nlet insert x t =\n  let rec doit = function\n    | Nil -> Node (x, Nil, Nil)\n    | Node (y, l, r) ->\n      if x < y then Node (y, doit l, r)\n      else Node (y, l, doit r) in\n  doit t\n\nlet preorder f t =\n  let rec doit = function\n    | Nil -> ()\n    | Node (x, l, r) -> f x; doit l; doit r in\n  doit t\n\nlet inorder f t =\n  let rec doit = function\n    | Nil -> ()\n    | Node (x, l, r) -> doit l; f x; doit r in\n  doit t\n\nlet print t =\n  inorder (fun e -> print_string \" \"; print_int e) t;\n  Printf.printf \"\\n\";\n  preorder (fun e -> print_string \" \"; print_int e) t;\n  Printf.printf \"\\n\"\n\nlet find x t =\n  let rec doit = function\n    | Nil -> false\n    | Node (y, _, _) when x = y -> true\n    | Node (y, l, _) when x < y -> doit l\n    | Node (_, _, r) -> doit r in\n  doit t\n\nlet delete x t =\n  let rec balance = function\n    | Nil -> assert false\n    | Node (x, Nil, r) -> (x, r)\n    | Node (x, l, r) ->\n      let (m, l) = balance l in\n      (m, Node (x, l, r)) in\n  let rec doit = function\n    | Nil -> assert false\n    | Node (y, l, r) ->\n      if x = y then\n        if l = Nil then r\n        else if r = Nil then l\n        else\n          let (m, r) = balance r in\n          Node (m, l, r)\n      else if x < y then Node (y, doit l, r)\n      else Node (y, l, doit r) in\n  doit t\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let m = read_int () in\n  let t = ref (create ()) in\n  for _ = 0 to m - 1 do\n    match read_line () |> split_on_char ' ' with\n    | [\"insert\"; n] -> t := insert (int_of_string n) !t\n    | [\"find\"; n] -> print_endline (if find (int_of_string n) !t then \"yes\" else \"no\")\n    | [\"delete\"; n] -> t := delete (int_of_string n) !t\n    | _ -> print !t\n  done", "problem_context": "Binary Search Tree III\n\nWrite a program which performs the following operations to a binary search tree $T$ by adding delete operation to B: Binary Search Tree II.\n\ninsert $k$: Insert a node containing $k$ as key into $T$.\n\nfind $k$: Report whether $T$ has a node containing $k$.\n\ndelete $k$: Delete a node containing $k$.\n\nprint: Print the keys of the binary search tree by inorder tree walk and preorder tree walk respectively.\n\nThe operation delete $k$ for deleting a given node $z$ containing key $k$ from $T$ can be implemented by an algorithm which considers the following cases:\n\nIf $z$ has no children, we modify its parent $z.p$ to replace $z$ with NIL as its child (delete $z$).\n\nIf $z$ has only a single child, we \"splice out\" $z$ by making a new link between its child and its parent.\n\nIf $z$ has two children, we splice out $z$'s successor $y$ and replace $z$'s key with $y$'s key.\n\nInput\n\nIn the first line, the number of operations $m$ is given. In the following $m$ lines, operations represented by insert $k$, find $k$, delete $k$ or print are given.\n\nOutput\n\nFor each find $k$ operation, print \"yes\" if $T$ has a node containing $k$, \"no\" if not.\n\nIn addition, for each print operation, print a list of keys obtained by inorder tree walk and preorder tree walk in a line respectively. Put a space character before each key\n\nConstraints\n\nThe number of operations $\\leq 500,000$\n\nThe number of print operations $\\leq 10$.\n\n$-2,000,000,000 \\leq key \\leq 2,000,000,000$\n\nThe height of the binary tree does not exceed 100 if you employ the above pseudo code.\n\nThe keys in the binary search tree are all different.\n\nSample Input 1\n\n18\ninsert 8\ninsert 2\ninsert 3\ninsert 7\ninsert 22\ninsert 1\nfind 1\nfind 2\nfind 3\nfind 4\nfind 5\nfind 6\nfind 7\nfind 8\nprint\ndelete 3\ndelete 7\nprint\n\nSample Output 1\n\nyes\nyes\nyes\nno\nno\nno\nyes\nyes\n1 2 3 7 8 22\n8 2 1 3 7 22\n1 2 8 22\n8 2 1 22\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "18\ninsert 8\ninsert 2\ninsert 3\ninsert 7\ninsert 22\ninsert 1\nfind 1\nfind 2\nfind 3\nfind 4\nfind 5\nfind 6\nfind 7\nfind 8\nprint\ndelete 3\ndelete 7\nprint\n"}, "reference_outputs": ["yes\nyes\nyes\nno\nno\nno\nyes\nyes\n 1 2 3 7 8 22\n 8 2 1 3 7 22\n 1 2 8 22\n 8 2 1 22\n"], "source_document_id": "p02285", "source_text": "Binary Search Tree III\n\nWrite a program which performs the following operations to a binary search tree $T$ by adding delete operation to B: Binary Search Tree II.\n\ninsert $k$: Insert a node containing $k$ as key into $T$.\n\nfind $k$: Report whether $T$ has a node containing $k$.\n\ndelete $k$: Delete a node containing $k$.\n\nprint: Print the keys of the binary search tree by inorder tree walk and preorder tree walk respectively.\n\nThe operation delete $k$ for deleting a given node $z$ containing key $k$ from $T$ can be implemented by an algorithm which considers the following cases:\n\nIf $z$ has no children, we modify its parent $z.p$ to replace $z$ with NIL as its child (delete $z$).\n\nIf $z$ has only a single child, we \"splice out\" $z$ by making a new link between its child and its parent.\n\nIf $z$ has two children, we splice out $z$'s successor $y$ and replace $z$'s key with $y$'s key.\n\nInput\n\nIn the first line, the number of operations $m$ is given. In the following $m$ lines, operations represented by insert $k$, find $k$, delete $k$ or print are given.\n\nOutput\n\nFor each find $k$ operation, print \"yes\" if $T$ has a node containing $k$, \"no\" if not.\n\nIn addition, for each print operation, print a list of keys obtained by inorder tree walk and preorder tree walk in a line respectively. Put a space character before each key\n\nConstraints\n\nThe number of operations $\\leq 500,000$\n\nThe number of print operations $\\leq 10$.\n\n$-2,000,000,000 \\leq key \\leq 2,000,000,000$\n\nThe height of the binary tree does not exceed 100 if you employ the above pseudo code.\n\nThe keys in the binary search tree are all different.\n\nSample Input 1\n\n18\ninsert 8\ninsert 2\ninsert 3\ninsert 7\ninsert 22\ninsert 1\nfind 1\nfind 2\nfind 3\nfind 4\nfind 5\nfind 6\nfind 7\nfind 8\nprint\ndelete 3\ndelete 7\nprint\n\nSample Output 1\n\nyes\nyes\nyes\nno\nno\nno\nyes\nyes\n1 2 3 7 8 22\n8 2 1 3 7 22\n1 2 8 22\n8 2 1 22\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1960, "cpu_time_ms": 720, "memory_kb": 27144}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s518531027", "group_id": "codeNet:p02285", "input_text": "type tree = Nil | Node of int * tree * tree\n\nlet create () = Nil\n\nlet insert x t =\n  let rec doit = function\n    | Nil -> Node (x, Nil, Nil)\n    | Node (y, l, r) ->\n      if x < y then Node (y, doit l, r)\n      else Node (y, l, doit r) in\n  doit t\n\nlet preorder f t =\n  let rec doit = function\n    | Nil -> ()\n    | Node (x, l, r) -> f x; doit l; doit r in\n  doit t\n\nlet inorder f t =\n  let rec doit = function\n    | Nil -> ()\n    | Node (x, l, r) -> doit l; f x; doit r in\n  doit t\n\nlet print t =\n  inorder (fun e -> print_string \" \"; print_int e) t;\n  print_newline ();\n  preorder (fun e -> print_string \" \"; print_int e) t;\n  print_newline ()\n\nlet find x t =\n  let rec doit = function\n    | Nil -> false\n    | Node (y, _, _) when x = y -> true\n    | Node (y, l, _) when x < y -> doit l\n    | Node (_, _, r) -> doit r in\n  doit t\n\nlet delete x t =\n  let rec balance = function\n    | Nil -> assert false\n    | Node (x, Nil, r) -> (x, r)\n    | Node (x, l, r) ->\n      let (m, l) = balance l in\n      (m, Node (x, l, r)) in\n  let rec doit = function\n    | Nil -> assert false\n    | Node (y, l, r) ->\n      if x = y then\n        if l = Nil then r\n        else if r = Nil then l\n        else\n          let (m, r) = balance r in\n          Node (m, l, r)\n      else if x < y then Node (y, doit l, r)\n      else Node (y, l, doit r) in\n  doit t\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let m = read_int () in\n  let t = ref (create ()) in\n  for _ = 0 to m - 1 do\n    match read_line () |> split_on_char ' ' with\n    | [\"insert\"; n] -> t := insert (int_of_string n) !t\n    | [\"find\"; n] -> print_endline (if find (int_of_string n) !t then \"yes\" else \"no\")\n    | [\"delete\"; n] -> t := delete (int_of_string n) !t\n    | _ -> print !t\n  done", "language": "OCaml", "metadata": {"date": 1500093685, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02285.html", "problem_id": "p02285", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02285/input.txt", "sample_output_relpath": "derived/input_output/data/p02285/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02285/OCaml/s518531027.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s518531027", "user_id": "u809138450"}, "prompt_components": {"gold_output": "yes\nyes\nyes\nno\nno\nno\nyes\nyes\n 1 2 3 7 8 22\n 8 2 1 3 7 22\n 1 2 8 22\n 8 2 1 22\n", "input_to_evaluate": "type tree = Nil | Node of int * tree * tree\n\nlet create () = Nil\n\nlet insert x t =\n  let rec doit = function\n    | Nil -> Node (x, Nil, Nil)\n    | Node (y, l, r) ->\n      if x < y then Node (y, doit l, r)\n      else Node (y, l, doit r) in\n  doit t\n\nlet preorder f t =\n  let rec doit = function\n    | Nil -> ()\n    | Node (x, l, r) -> f x; doit l; doit r in\n  doit t\n\nlet inorder f t =\n  let rec doit = function\n    | Nil -> ()\n    | Node (x, l, r) -> doit l; f x; doit r in\n  doit t\n\nlet print t =\n  inorder (fun e -> print_string \" \"; print_int e) t;\n  print_newline ();\n  preorder (fun e -> print_string \" \"; print_int e) t;\n  print_newline ()\n\nlet find x t =\n  let rec doit = function\n    | Nil -> false\n    | Node (y, _, _) when x = y -> true\n    | Node (y, l, _) when x < y -> doit l\n    | Node (_, _, r) -> doit r in\n  doit t\n\nlet delete x t =\n  let rec balance = function\n    | Nil -> assert false\n    | Node (x, Nil, r) -> (x, r)\n    | Node (x, l, r) ->\n      let (m, l) = balance l in\n      (m, Node (x, l, r)) in\n  let rec doit = function\n    | Nil -> assert false\n    | Node (y, l, r) ->\n      if x = y then\n        if l = Nil then r\n        else if r = Nil then l\n        else\n          let (m, r) = balance r in\n          Node (m, l, r)\n      else if x < y then Node (y, doit l, r)\n      else Node (y, l, doit r) in\n  doit t\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let m = read_int () in\n  let t = ref (create ()) in\n  for _ = 0 to m - 1 do\n    match read_line () |> split_on_char ' ' with\n    | [\"insert\"; n] -> t := insert (int_of_string n) !t\n    | [\"find\"; n] -> print_endline (if find (int_of_string n) !t then \"yes\" else \"no\")\n    | [\"delete\"; n] -> t := delete (int_of_string n) !t\n    | _ -> print !t\n  done", "problem_context": "Binary Search Tree III\n\nWrite a program which performs the following operations to a binary search tree $T$ by adding delete operation to B: Binary Search Tree II.\n\ninsert $k$: Insert a node containing $k$ as key into $T$.\n\nfind $k$: Report whether $T$ has a node containing $k$.\n\ndelete $k$: Delete a node containing $k$.\n\nprint: Print the keys of the binary search tree by inorder tree walk and preorder tree walk respectively.\n\nThe operation delete $k$ for deleting a given node $z$ containing key $k$ from $T$ can be implemented by an algorithm which considers the following cases:\n\nIf $z$ has no children, we modify its parent $z.p$ to replace $z$ with NIL as its child (delete $z$).\n\nIf $z$ has only a single child, we \"splice out\" $z$ by making a new link between its child and its parent.\n\nIf $z$ has two children, we splice out $z$'s successor $y$ and replace $z$'s key with $y$'s key.\n\nInput\n\nIn the first line, the number of operations $m$ is given. In the following $m$ lines, operations represented by insert $k$, find $k$, delete $k$ or print are given.\n\nOutput\n\nFor each find $k$ operation, print \"yes\" if $T$ has a node containing $k$, \"no\" if not.\n\nIn addition, for each print operation, print a list of keys obtained by inorder tree walk and preorder tree walk in a line respectively. Put a space character before each key\n\nConstraints\n\nThe number of operations $\\leq 500,000$\n\nThe number of print operations $\\leq 10$.\n\n$-2,000,000,000 \\leq key \\leq 2,000,000,000$\n\nThe height of the binary tree does not exceed 100 if you employ the above pseudo code.\n\nThe keys in the binary search tree are all different.\n\nSample Input 1\n\n18\ninsert 8\ninsert 2\ninsert 3\ninsert 7\ninsert 22\ninsert 1\nfind 1\nfind 2\nfind 3\nfind 4\nfind 5\nfind 6\nfind 7\nfind 8\nprint\ndelete 3\ndelete 7\nprint\n\nSample Output 1\n\nyes\nyes\nyes\nno\nno\nno\nyes\nyes\n1 2 3 7 8 22\n8 2 1 3 7 22\n1 2 8 22\n8 2 1 22\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "18\ninsert 8\ninsert 2\ninsert 3\ninsert 7\ninsert 22\ninsert 1\nfind 1\nfind 2\nfind 3\nfind 4\nfind 5\nfind 6\nfind 7\nfind 8\nprint\ndelete 3\ndelete 7\nprint\n"}, "reference_outputs": ["yes\nyes\nyes\nno\nno\nno\nyes\nyes\n 1 2 3 7 8 22\n 8 2 1 3 7 22\n 1 2 8 22\n 8 2 1 22\n"], "source_document_id": "p02285", "source_text": "Binary Search Tree III\n\nWrite a program which performs the following operations to a binary search tree $T$ by adding delete operation to B: Binary Search Tree II.\n\ninsert $k$: Insert a node containing $k$ as key into $T$.\n\nfind $k$: Report whether $T$ has a node containing $k$.\n\ndelete $k$: Delete a node containing $k$.\n\nprint: Print the keys of the binary search tree by inorder tree walk and preorder tree walk respectively.\n\nThe operation delete $k$ for deleting a given node $z$ containing key $k$ from $T$ can be implemented by an algorithm which considers the following cases:\n\nIf $z$ has no children, we modify its parent $z.p$ to replace $z$ with NIL as its child (delete $z$).\n\nIf $z$ has only a single child, we \"splice out\" $z$ by making a new link between its child and its parent.\n\nIf $z$ has two children, we splice out $z$'s successor $y$ and replace $z$'s key with $y$'s key.\n\nInput\n\nIn the first line, the number of operations $m$ is given. In the following $m$ lines, operations represented by insert $k$, find $k$, delete $k$ or print are given.\n\nOutput\n\nFor each find $k$ operation, print \"yes\" if $T$ has a node containing $k$, \"no\" if not.\n\nIn addition, for each print operation, print a list of keys obtained by inorder tree walk and preorder tree walk in a line respectively. Put a space character before each key\n\nConstraints\n\nThe number of operations $\\leq 500,000$\n\nThe number of print operations $\\leq 10$.\n\n$-2,000,000,000 \\leq key \\leq 2,000,000,000$\n\nThe height of the binary tree does not exceed 100 if you employ the above pseudo code.\n\nThe keys in the binary search tree are all different.\n\nSample Input 1\n\n18\ninsert 8\ninsert 2\ninsert 3\ninsert 7\ninsert 22\ninsert 1\nfind 1\nfind 2\nfind 3\nfind 4\nfind 5\nfind 6\nfind 7\nfind 8\nprint\ndelete 3\ndelete 7\nprint\n\nSample Output 1\n\nyes\nyes\nyes\nno\nno\nno\nyes\nyes\n1 2 3 7 8 22\n8 2 1 3 7 22\n1 2 8 22\n8 2 1 22\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1956, "cpu_time_ms": 720, "memory_kb": 25288}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s056722651", "group_id": "codeNet:p02285", "input_text": "type tree = Nil | Node of int * tree * tree\n\nlet create () = Nil\n\nlet insert x t =\n  let rec doit = function\n    | Nil -> Node (x, Nil, Nil)\n    | Node (y, l, r) ->\n      if x < y then Node (y, doit l, r)\n      else Node (y, l, doit r) in\n  doit t\n\nlet preorder f t =\n  let rec doit = function\n    | Nil -> ()\n    | Node (x, l, r) -> f x; doit l; doit r in\n  doit t\n\nlet inorder f t =\n  let rec doit = function\n    | Nil -> ()\n    | Node (x, l, r) -> doit l; f x; doit r in\n  doit t\n\nlet print t =\n  inorder (fun e -> print_string \" \"; print_int e) t;\n  print_newline ();\n  preorder (fun e -> print_string \" \"; print_int e) t;\n  print_newline ()\n\nlet find x t =\n  let rec doit = function\n    | Nil -> false\n    | Node (y, _, _) when x = y -> true\n    | Node (y, l, _) when x < y -> doit l\n    | Node (_, _, r) -> doit r in\n  doit t\n\nlet delete x t =\n  let rec doit = function\n    | Nil -> assert false\n    | Node (y, l, r) ->\n      if x = y then\n        if l = Nil then r\n        else if r = Nil then l\n        else\n          let rec balance = function\n            | Nil -> assert false\n            | Node (x, Nil, r) -> (x, r)\n            | Node (x, l, r) ->\n              let (m, l) = balance l in\n              (m, Node (x, l, r)) in\n          let (m, r) = balance r in\n          Node (m, l, r)\n      else if x < y then Node (y, doit l, r)\n      else Node (y, l, doit r) in\n  doit t\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let m = read_int () in\n  let t = ref (create ()) in\n  for _ = 0 to m - 1 do\n    match read_line () |> split_on_char ' ' with\n    | [\"insert\"; n] -> t := insert (int_of_string n) !t\n    | [\"find\"; n] -> print_endline (if find (int_of_string n) !t then \"yes\" else \"no\")\n    | [\"delete\"; n] -> t := delete (int_of_string n) !t\n    | _ -> print !t\n  done", "language": "OCaml", "metadata": {"date": 1500093822, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02285.html", "problem_id": "p02285", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02285/input.txt", "sample_output_relpath": "derived/input_output/data/p02285/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02285/OCaml/s056722651.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s056722651", "user_id": "u809138450"}, "prompt_components": {"gold_output": "yes\nyes\nyes\nno\nno\nno\nyes\nyes\n 1 2 3 7 8 22\n 8 2 1 3 7 22\n 1 2 8 22\n 8 2 1 22\n", "input_to_evaluate": "type tree = Nil | Node of int * tree * tree\n\nlet create () = Nil\n\nlet insert x t =\n  let rec doit = function\n    | Nil -> Node (x, Nil, Nil)\n    | Node (y, l, r) ->\n      if x < y then Node (y, doit l, r)\n      else Node (y, l, doit r) in\n  doit t\n\nlet preorder f t =\n  let rec doit = function\n    | Nil -> ()\n    | Node (x, l, r) -> f x; doit l; doit r in\n  doit t\n\nlet inorder f t =\n  let rec doit = function\n    | Nil -> ()\n    | Node (x, l, r) -> doit l; f x; doit r in\n  doit t\n\nlet print t =\n  inorder (fun e -> print_string \" \"; print_int e) t;\n  print_newline ();\n  preorder (fun e -> print_string \" \"; print_int e) t;\n  print_newline ()\n\nlet find x t =\n  let rec doit = function\n    | Nil -> false\n    | Node (y, _, _) when x = y -> true\n    | Node (y, l, _) when x < y -> doit l\n    | Node (_, _, r) -> doit r in\n  doit t\n\nlet delete x t =\n  let rec doit = function\n    | Nil -> assert false\n    | Node (y, l, r) ->\n      if x = y then\n        if l = Nil then r\n        else if r = Nil then l\n        else\n          let rec balance = function\n            | Nil -> assert false\n            | Node (x, Nil, r) -> (x, r)\n            | Node (x, l, r) ->\n              let (m, l) = balance l in\n              (m, Node (x, l, r)) in\n          let (m, r) = balance r in\n          Node (m, l, r)\n      else if x < y then Node (y, doit l, r)\n      else Node (y, l, doit r) in\n  doit t\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let m = read_int () in\n  let t = ref (create ()) in\n  for _ = 0 to m - 1 do\n    match read_line () |> split_on_char ' ' with\n    | [\"insert\"; n] -> t := insert (int_of_string n) !t\n    | [\"find\"; n] -> print_endline (if find (int_of_string n) !t then \"yes\" else \"no\")\n    | [\"delete\"; n] -> t := delete (int_of_string n) !t\n    | _ -> print !t\n  done", "problem_context": "Binary Search Tree III\n\nWrite a program which performs the following operations to a binary search tree $T$ by adding delete operation to B: Binary Search Tree II.\n\ninsert $k$: Insert a node containing $k$ as key into $T$.\n\nfind $k$: Report whether $T$ has a node containing $k$.\n\ndelete $k$: Delete a node containing $k$.\n\nprint: Print the keys of the binary search tree by inorder tree walk and preorder tree walk respectively.\n\nThe operation delete $k$ for deleting a given node $z$ containing key $k$ from $T$ can be implemented by an algorithm which considers the following cases:\n\nIf $z$ has no children, we modify its parent $z.p$ to replace $z$ with NIL as its child (delete $z$).\n\nIf $z$ has only a single child, we \"splice out\" $z$ by making a new link between its child and its parent.\n\nIf $z$ has two children, we splice out $z$'s successor $y$ and replace $z$'s key with $y$'s key.\n\nInput\n\nIn the first line, the number of operations $m$ is given. In the following $m$ lines, operations represented by insert $k$, find $k$, delete $k$ or print are given.\n\nOutput\n\nFor each find $k$ operation, print \"yes\" if $T$ has a node containing $k$, \"no\" if not.\n\nIn addition, for each print operation, print a list of keys obtained by inorder tree walk and preorder tree walk in a line respectively. Put a space character before each key\n\nConstraints\n\nThe number of operations $\\leq 500,000$\n\nThe number of print operations $\\leq 10$.\n\n$-2,000,000,000 \\leq key \\leq 2,000,000,000$\n\nThe height of the binary tree does not exceed 100 if you employ the above pseudo code.\n\nThe keys in the binary search tree are all different.\n\nSample Input 1\n\n18\ninsert 8\ninsert 2\ninsert 3\ninsert 7\ninsert 22\ninsert 1\nfind 1\nfind 2\nfind 3\nfind 4\nfind 5\nfind 6\nfind 7\nfind 8\nprint\ndelete 3\ndelete 7\nprint\n\nSample Output 1\n\nyes\nyes\nyes\nno\nno\nno\nyes\nyes\n1 2 3 7 8 22\n8 2 1 3 7 22\n1 2 8 22\n8 2 1 22\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "18\ninsert 8\ninsert 2\ninsert 3\ninsert 7\ninsert 22\ninsert 1\nfind 1\nfind 2\nfind 3\nfind 4\nfind 5\nfind 6\nfind 7\nfind 8\nprint\ndelete 3\ndelete 7\nprint\n"}, "reference_outputs": ["yes\nyes\nyes\nno\nno\nno\nyes\nyes\n 1 2 3 7 8 22\n 8 2 1 3 7 22\n 1 2 8 22\n 8 2 1 22\n"], "source_document_id": "p02285", "source_text": "Binary Search Tree III\n\nWrite a program which performs the following operations to a binary search tree $T$ by adding delete operation to B: Binary Search Tree II.\n\ninsert $k$: Insert a node containing $k$ as key into $T$.\n\nfind $k$: Report whether $T$ has a node containing $k$.\n\ndelete $k$: Delete a node containing $k$.\n\nprint: Print the keys of the binary search tree by inorder tree walk and preorder tree walk respectively.\n\nThe operation delete $k$ for deleting a given node $z$ containing key $k$ from $T$ can be implemented by an algorithm which considers the following cases:\n\nIf $z$ has no children, we modify its parent $z.p$ to replace $z$ with NIL as its child (delete $z$).\n\nIf $z$ has only a single child, we \"splice out\" $z$ by making a new link between its child and its parent.\n\nIf $z$ has two children, we splice out $z$'s successor $y$ and replace $z$'s key with $y$'s key.\n\nInput\n\nIn the first line, the number of operations $m$ is given. In the following $m$ lines, operations represented by insert $k$, find $k$, delete $k$ or print are given.\n\nOutput\n\nFor each find $k$ operation, print \"yes\" if $T$ has a node containing $k$, \"no\" if not.\n\nIn addition, for each print operation, print a list of keys obtained by inorder tree walk and preorder tree walk in a line respectively. Put a space character before each key\n\nConstraints\n\nThe number of operations $\\leq 500,000$\n\nThe number of print operations $\\leq 10$.\n\n$-2,000,000,000 \\leq key \\leq 2,000,000,000$\n\nThe height of the binary tree does not exceed 100 if you employ the above pseudo code.\n\nThe keys in the binary search tree are all different.\n\nSample Input 1\n\n18\ninsert 8\ninsert 2\ninsert 3\ninsert 7\ninsert 22\ninsert 1\nfind 1\nfind 2\nfind 3\nfind 4\nfind 5\nfind 6\nfind 7\nfind 8\nprint\ndelete 3\ndelete 7\nprint\n\nSample Output 1\n\nyes\nyes\nyes\nno\nno\nno\nyes\nyes\n1 2 3 7 8 22\n8 2 1 3 7 22\n1 2 8 22\n8 2 1 22\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2004, "cpu_time_ms": 720, "memory_kb": 25332}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s960792340", "group_id": "codeNet:p02289", "input_text": "let swap a i j =\n    let temp = a.(i) in\n    a.(i) <- a.(j);\n    a.(j) <- temp\n;;\n\nlet i = ref 0;;\n\nlet extract (a:int array) =\n    Printf.printf \"%d\\n\" a.(0);\n    a.(0) <- a.(!i);\n    let rec downheap h j =\n      let largest = ref j in\n      if j*2 <= h then\n        begin\n          if a.(j*2-1) > a.(j-1) then largest := j*2;\n          if j*2+1 <= h && a.(j*2) > a.(!largest-1) then largest := j*2+1;\n          if !largest != j then\n            begin\n              swap a (!largest-1) (j-1);\n              downheap h (!largest)\n            end\n        end\n    in downheap !i 1;i := !i-1\n;;\n\nlet insert (a:int array) n =\n    a.(!i+1) <- n;\n    let rec upheap j =\n        if j = 1 then ()\n        else\n          begin\n            if a.(j/2-1) < a.(j-1) then swap a (j/2-1) (j-1)\n            ;upheap (j/2)\n          end\n    in upheap (!i+2);\n    i := !i+1\n\nlet () =\n  let l = Array.make 2000000 0 in\n  let rec read () =\n      let op = Scanf.scanf \"%s \" (fun x -> x) in\n      if op = \"insert\" then\n        begin\n              let n = Scanf.scanf \"%d \" (fun x -> x) in\n              insert l n;read ()\n        end\n      else if op = \"extract\" then begin extract l;read () end\n  in read ()\n;;", "language": "OCaml", "metadata": {"date": 1477029952, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02289.html", "problem_id": "p02289", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02289/input.txt", "sample_output_relpath": "derived/input_output/data/p02289/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02289/OCaml/s960792340.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s960792340", "user_id": "u935184340"}, "prompt_components": {"gold_output": "8\n10\n11\n2\n", "input_to_evaluate": "let swap a i j =\n    let temp = a.(i) in\n    a.(i) <- a.(j);\n    a.(j) <- temp\n;;\n\nlet i = ref 0;;\n\nlet extract (a:int array) =\n    Printf.printf \"%d\\n\" a.(0);\n    a.(0) <- a.(!i);\n    let rec downheap h j =\n      let largest = ref j in\n      if j*2 <= h then\n        begin\n          if a.(j*2-1) > a.(j-1) then largest := j*2;\n          if j*2+1 <= h && a.(j*2) > a.(!largest-1) then largest := j*2+1;\n          if !largest != j then\n            begin\n              swap a (!largest-1) (j-1);\n              downheap h (!largest)\n            end\n        end\n    in downheap !i 1;i := !i-1\n;;\n\nlet insert (a:int array) n =\n    a.(!i+1) <- n;\n    let rec upheap j =\n        if j = 1 then ()\n        else\n          begin\n            if a.(j/2-1) < a.(j-1) then swap a (j/2-1) (j-1)\n            ;upheap (j/2)\n          end\n    in upheap (!i+2);\n    i := !i+1\n\nlet () =\n  let l = Array.make 2000000 0 in\n  let rec read () =\n      let op = Scanf.scanf \"%s \" (fun x -> x) in\n      if op = \"insert\" then\n        begin\n              let n = Scanf.scanf \"%d \" (fun x -> x) in\n              insert l n;read ()\n        end\n      else if op = \"extract\" then begin extract l;read () end\n  in read ()\n;;", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nPriority Queue\n\nA priority queue is a data structure which maintains a set $S$ of elements, each of with an associated value (key), and supports the following operations:\n\n$insert(S, k)$: insert an element $k$ into the set $S$\n\n$extractMax(S)$: remove and return the element of $S$ with the largest key\n\nWrite a program which performs the $insert(S, k)$ and $extractMax(S)$ operations to a priority queue $S$.\nThe priority queue manages a set of integers, which are also keys for the priority.\n\nInput\n\nMultiple operations to the priority queue $S$ are given. Each operation is given by \"insert $k$\", \"extract\" or \"end\" in a line. Here, $k$ represents an integer element to be inserted to the priority queue.\n\nThe input ends with \"end\" operation.\n\nOutput\n\nFor each \"extract\" operation, print the element extracted from the priority queue $S$ in a line.\n\nConstraints\n\nThe number of operations $\\leq 2,000,000$\n\n$0 \\leq k \\leq 2,000,000,000$\n\nSample Input 1\n\ninsert 8\ninsert 2\nextract\ninsert 10\nextract\ninsert 11\nextract\nextract\nend\n\nSample Output 1\n\n8\n10\n11\n2", "sample_input": "insert 8\ninsert 2\nextract\ninsert 10\nextract\ninsert 11\nextract\nextract\nend\n"}, "reference_outputs": ["8\n10\n11\n2\n"], "source_document_id": "p02289", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nPriority Queue\n\nA priority queue is a data structure which maintains a set $S$ of elements, each of with an associated value (key), and supports the following operations:\n\n$insert(S, k)$: insert an element $k$ into the set $S$\n\n$extractMax(S)$: remove and return the element of $S$ with the largest key\n\nWrite a program which performs the $insert(S, k)$ and $extractMax(S)$ operations to a priority queue $S$.\nThe priority queue manages a set of integers, which are also keys for the priority.\n\nInput\n\nMultiple operations to the priority queue $S$ are given. Each operation is given by \"insert $k$\", \"extract\" or \"end\" in a line. Here, $k$ represents an integer element to be inserted to the priority queue.\n\nThe input ends with \"end\" operation.\n\nOutput\n\nFor each \"extract\" operation, print the element extracted from the priority queue $S$ in a line.\n\nConstraints\n\nThe number of operations $\\leq 2,000,000$\n\n$0 \\leq k \\leq 2,000,000,000$\n\nSample Input 1\n\ninsert 8\ninsert 2\nextract\ninsert 10\nextract\ninsert 11\nextract\nextract\nend\n\nSample Output 1\n\n8\n10\n11\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1188, "cpu_time_ms": 830, "memory_kb": 20488}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s114756899", "group_id": "codeNet:p02289", "input_text": "let last_i = ref 0\n\nlet parent i = int_of_float (floor (float_of_int i) /. 2.)\n\nlet left i = 2*i\n\nlet right i = 2*i + 1\n\nlet swap i j t = let tmp = t.(i) in t.(i) <- t.(j); t.(j) <- tmp\n\nlet extract (t : int array) =\n  let ret = t.(1) in\n  t.(1) <- t.(!last_i);\n  decr last_i;\n  let rec max_heapify i =\n    let l = left i in\n    let r = right i in\n    let m = if l <= !last_i && t.(l) > t.(i) then l else i in\n    let m = if r <= !last_i && t.(r) > t.(m) then r else m in\n    if i = m then ()\n    else begin\n      let tmp = t.(i) in t.(i) <- t.(m); t.(m) <- tmp;\n      max_heapify m\n    end in\n  max_heapify 1;\n  ret\n\nlet insert x (t : int array) =\n  incr last_i;\n  t.(!last_i) <- x;\n  let rec doit i =\n    if i <= 1 || t.(parent i) >= t.(i) then ()\n    else begin\n      let pi = parent i in\n      let tmp = t.(i) in t.(i) <- t.(pi); t.(pi) <- tmp;\n      doit pi\n    end in\n  doit !last_i\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let t = Array.make 2000001 0 in\n  while true do\n    match read_line () |> split_on_char ' ' with\n    | [\"extract\"] -> extract t |> Printf.printf \"%d\\n\"\n    | [\"insert\"; n] -> insert (int_of_string n) t\n    | _ -> exit 0\n  done", "language": "OCaml", "metadata": {"date": 1500098795, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02289.html", "problem_id": "p02289", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02289/input.txt", "sample_output_relpath": "derived/input_output/data/p02289/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02289/OCaml/s114756899.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s114756899", "user_id": "u809138450"}, "prompt_components": {"gold_output": "8\n10\n11\n2\n", "input_to_evaluate": "let last_i = ref 0\n\nlet parent i = int_of_float (floor (float_of_int i) /. 2.)\n\nlet left i = 2*i\n\nlet right i = 2*i + 1\n\nlet swap i j t = let tmp = t.(i) in t.(i) <- t.(j); t.(j) <- tmp\n\nlet extract (t : int array) =\n  let ret = t.(1) in\n  t.(1) <- t.(!last_i);\n  decr last_i;\n  let rec max_heapify i =\n    let l = left i in\n    let r = right i in\n    let m = if l <= !last_i && t.(l) > t.(i) then l else i in\n    let m = if r <= !last_i && t.(r) > t.(m) then r else m in\n    if i = m then ()\n    else begin\n      let tmp = t.(i) in t.(i) <- t.(m); t.(m) <- tmp;\n      max_heapify m\n    end in\n  max_heapify 1;\n  ret\n\nlet insert x (t : int array) =\n  incr last_i;\n  t.(!last_i) <- x;\n  let rec doit i =\n    if i <= 1 || t.(parent i) >= t.(i) then ()\n    else begin\n      let pi = parent i in\n      let tmp = t.(i) in t.(i) <- t.(pi); t.(pi) <- tmp;\n      doit pi\n    end in\n  doit !last_i\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet () =\n  let t = Array.make 2000001 0 in\n  while true do\n    match read_line () |> split_on_char ' ' with\n    | [\"extract\"] -> extract t |> Printf.printf \"%d\\n\"\n    | [\"insert\"; n] -> insert (int_of_string n) t\n    | _ -> exit 0\n  done", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nPriority Queue\n\nA priority queue is a data structure which maintains a set $S$ of elements, each of with an associated value (key), and supports the following operations:\n\n$insert(S, k)$: insert an element $k$ into the set $S$\n\n$extractMax(S)$: remove and return the element of $S$ with the largest key\n\nWrite a program which performs the $insert(S, k)$ and $extractMax(S)$ operations to a priority queue $S$.\nThe priority queue manages a set of integers, which are also keys for the priority.\n\nInput\n\nMultiple operations to the priority queue $S$ are given. Each operation is given by \"insert $k$\", \"extract\" or \"end\" in a line. Here, $k$ represents an integer element to be inserted to the priority queue.\n\nThe input ends with \"end\" operation.\n\nOutput\n\nFor each \"extract\" operation, print the element extracted from the priority queue $S$ in a line.\n\nConstraints\n\nThe number of operations $\\leq 2,000,000$\n\n$0 \\leq k \\leq 2,000,000,000$\n\nSample Input 1\n\ninsert 8\ninsert 2\nextract\ninsert 10\nextract\ninsert 11\nextract\nextract\nend\n\nSample Output 1\n\n8\n10\n11\n2", "sample_input": "insert 8\ninsert 2\nextract\ninsert 10\nextract\ninsert 11\nextract\nextract\nend\n"}, "reference_outputs": ["8\n10\n11\n2\n"], "source_document_id": "p02289", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nPriority Queue\n\nA priority queue is a data structure which maintains a set $S$ of elements, each of with an associated value (key), and supports the following operations:\n\n$insert(S, k)$: insert an element $k$ into the set $S$\n\n$extractMax(S)$: remove and return the element of $S$ with the largest key\n\nWrite a program which performs the $insert(S, k)$ and $extractMax(S)$ operations to a priority queue $S$.\nThe priority queue manages a set of integers, which are also keys for the priority.\n\nInput\n\nMultiple operations to the priority queue $S$ are given. Each operation is given by \"insert $k$\", \"extract\" or \"end\" in a line. Here, $k$ represents an integer element to be inserted to the priority queue.\n\nThe input ends with \"end\" operation.\n\nOutput\n\nFor each \"extract\" operation, print the element extracted from the priority queue $S$ in a line.\n\nConstraints\n\nThe number of operations $\\leq 2,000,000$\n\n$0 \\leq k \\leq 2,000,000,000$\n\nSample Input 1\n\ninsert 8\ninsert 2\nextract\ninsert 10\nextract\ninsert 11\nextract\nextract\nend\n\nSample Output 1\n\n8\n10\n11\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1383, "cpu_time_ms": 840, "memory_kb": 20344}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s218876007", "group_id": "codeNet:p02314", "input_text": "let dbg = Printf.printf \"[debug]%s\"\n\nlet id = fun x -> x\nlet tuple2 x y = (x,y)\n\nlet (++) n m =\n  let rec aux i =\n    if i = m then [m]\n    else i :: aux (i+1) in\n  if n > m then [] else aux n\n\nlet (++^) n m = n ++ (m-1)\n\nlet scanf fmt f = Scanf.sscanf (read_line ()) fmt f\n\nlet scanfs n fmt f =\n  List.map (fun _ -> scanf fmt f) (0++^n)\n\nlet scan_array n conv =\n  let b = Scanf.Scanning.from_string @@ read_line () in\n  Array.init n (fun _ -> Scanf.bscanf b \" %s\" conv)\n\nlet scan_matrix n m e conv =\n  let arr = Array.make_matrix n m e in\n  Array.iteri (fun i line ->\n      let s = Scanf.Scanning.from_string @@ read_line () in\n      Array.iteri (fun j _ ->\n          arr.(i).(j) <- Scanf.bscanf s \" %s\" conv;\n        ) line) arr; arr\n\nlet between n x m = n <= x && x < m\n\nlet (n,m) = scanf \"%d %d\" tuple2\nlet coins = scan_array m int_of_string\n\nlet () =\n  let memo = Array.make_matrix (m+1) (n+1) max_int in\n  memo.(0).(0) <- 0;\n  List.iter (fun i ->\n      let c = coins.(i-1) in\n      List.iter (fun j ->\n          memo.(i).(j) <-\n            if j -c >= 0 then\n              let x = if memo.(i-1).(j-c) <> max_int\n                then memo.(i-1).(j-c) + 1 else max_int in\n              let y = if memo.(i).(j-c) <> max_int\n                then memo.(i).(j-c) + 1 else max_int in\n              min memo.(i-1).(j) @@ min x y\n            else\n              memo.(i-1).(j)\n        ) (0++n)\n    ) (1++m);\n  Printf.printf \"%d\\n\" memo.(m).(n)\n\n", "language": "OCaml", "metadata": {"date": 1587902885, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02314.html", "problem_id": "p02314", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02314/input.txt", "sample_output_relpath": "derived/input_output/data/p02314/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02314/OCaml/s218876007.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s218876007", "user_id": "u827214117"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let dbg = Printf.printf \"[debug]%s\"\n\nlet id = fun x -> x\nlet tuple2 x y = (x,y)\n\nlet (++) n m =\n  let rec aux i =\n    if i = m then [m]\n    else i :: aux (i+1) in\n  if n > m then [] else aux n\n\nlet (++^) n m = n ++ (m-1)\n\nlet scanf fmt f = Scanf.sscanf (read_line ()) fmt f\n\nlet scanfs n fmt f =\n  List.map (fun _ -> scanf fmt f) (0++^n)\n\nlet scan_array n conv =\n  let b = Scanf.Scanning.from_string @@ read_line () in\n  Array.init n (fun _ -> Scanf.bscanf b \" %s\" conv)\n\nlet scan_matrix n m e conv =\n  let arr = Array.make_matrix n m e in\n  Array.iteri (fun i line ->\n      let s = Scanf.Scanning.from_string @@ read_line () in\n      Array.iteri (fun j _ ->\n          arr.(i).(j) <- Scanf.bscanf s \" %s\" conv;\n        ) line) arr; arr\n\nlet between n x m = n <= x && x < m\n\nlet (n,m) = scanf \"%d %d\" tuple2\nlet coins = scan_array m int_of_string\n\nlet () =\n  let memo = Array.make_matrix (m+1) (n+1) max_int in\n  memo.(0).(0) <- 0;\n  List.iter (fun i ->\n      let c = coins.(i-1) in\n      List.iter (fun j ->\n          memo.(i).(j) <-\n            if j -c >= 0 then\n              let x = if memo.(i-1).(j-c) <> max_int\n                then memo.(i-1).(j-c) + 1 else max_int in\n              let y = if memo.(i).(j-c) <> max_int\n                then memo.(i).(j-c) + 1 else max_int in\n              min memo.(i-1).(j) @@ min x y\n            else\n              memo.(i-1).(j)\n        ) (0++n)\n    ) (1++m);\n  Printf.printf \"%d\\n\" memo.(m).(n)\n\n", "problem_context": "Coin Changing Problem\n\nFind the minimum number of coins to make change for n cents using coins of denominations d1, d2,.., dm. The coins can be used any number of times.\n\nInput\n\nn m\nd1 d2 ... dm\n\nTwo integers n and m are given in the first line. The available denominations are given in the second line.\n\nOutput\n\nPrint the minimum number of coins in a line.\n\nConstraints\n\n1 ≤ n ≤ 50000\n\n1 ≤ m ≤ 20\n\n1 ≤ denomination ≤ 10000\n\nThe denominations are all different and contain 1.\n\nSample Input 1\n\n55 4\n1 5 10 50\n\nSample Output 1\n\n2\n\nSample Input 2\n\n15 6\n1 2 7 8 12 50\n\nSample Output 2\n\n2\n\nSample Input 3\n\n65 6\n1 2 7 8 12 50\n\nSample Output 3\n\n3", "sample_input": "55 4\n1 5 10 50\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02314", "source_text": "Coin Changing Problem\n\nFind the minimum number of coins to make change for n cents using coins of denominations d1, d2,.., dm. The coins can be used any number of times.\n\nInput\n\nn m\nd1 d2 ... dm\n\nTwo integers n and m are given in the first line. The available denominations are given in the second line.\n\nOutput\n\nPrint the minimum number of coins in a line.\n\nConstraints\n\n1 ≤ n ≤ 50000\n\n1 ≤ m ≤ 20\n\n1 ≤ denomination ≤ 10000\n\nThe denominations are all different and contain 1.\n\nSample Input 1\n\n55 4\n1 5 10 50\n\nSample Output 1\n\n2\n\nSample Input 2\n\n15 6\n1 2 7 8 12 50\n\nSample Output 2\n\n2\n\nSample Input 3\n\n65 6\n1 2 7 8 12 50\n\nSample Output 3\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1440, "cpu_time_ms": 30, "memory_kb": 20212}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s684701659", "group_id": "codeNet:p02317", "input_text": "let lower_bound (a : int array) first last v =\n  let rec doit len first =\n    if len = 0 then first\n    else\n      let half = len / 2 in\n      let mid = first + half in\n      if a.(mid) < v then doit (len - half - 1) (mid + 1)\n      else doit half first in\n  doit (last - first + 1) first\n\nlet () =\n  let n = read_int () in\n  let dp = Array.make (n + 1) max_int in\n  for _ = 0 to n - 1 do\n    let a = read_int () in\n    dp.(lower_bound dp 0 n a) <- a\n  done;\n  lower_bound dp 0 n max_int |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1501737122, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02317.html", "problem_id": "p02317", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02317/input.txt", "sample_output_relpath": "derived/input_output/data/p02317/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02317/OCaml/s684701659.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s684701659", "user_id": "u809138450"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let lower_bound (a : int array) first last v =\n  let rec doit len first =\n    if len = 0 then first\n    else\n      let half = len / 2 in\n      let mid = first + half in\n      if a.(mid) < v then doit (len - half - 1) (mid + 1)\n      else doit half first in\n  doit (last - first + 1) first\n\nlet () =\n  let n = read_int () in\n  let dp = Array.make (n + 1) max_int in\n  for _ = 0 to n - 1 do\n    let a = read_int () in\n    dp.(lower_bound dp 0 n a) <- a\n  done;\n  lower_bound dp 0 n max_int |> Printf.printf \"%d\\n\"", "problem_context": "Longest Increasing Subsequence\n\nFor a given sequence A = {a0, a1, ... , an-1}, find the length of the longest increasing subsequnece (LIS) in A.\n\nAn increasing subsequence of A is defined by a subsequence {ai0, ai1, ... , aik} where 0 ≤ i0 < i1 < ... < ik < n and ai0 < ai1 < ... < aik.\n\nInput\n\nn\na0\na1\n:\nan-1\n\nIn the first line, an integer n is given. In the next n lines, elements of A are given.\n\nOutput\n\nThe length of the longest increasing subsequence of A.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n0 ≤ ai ≤ 109\n\nSample Input 1\n\n5\n5\n1\n3\n2\n4\n\nSample Output 1\n\n3\n\nSample Input 2\n\n3\n1\n1\n1\n\nSample Output 2\n\n1", "sample_input": "5\n5\n1\n3\n2\n4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02317", "source_text": "Longest Increasing Subsequence\n\nFor a given sequence A = {a0, a1, ... , an-1}, find the length of the longest increasing subsequnece (LIS) in A.\n\nAn increasing subsequence of A is defined by a subsequence {ai0, ai1, ... , aik} where 0 ≤ i0 < i1 < ... < ik < n and ai0 < ai1 < ... < aik.\n\nInput\n\nn\na0\na1\n:\nan-1\n\nIn the first line, an integer n is given. In the next n lines, elements of A are given.\n\nOutput\n\nThe length of the longest increasing subsequence of A.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n0 ≤ ai ≤ 109\n\nSample Input 1\n\n5\n5\n1\n3\n2\n4\n\nSample Output 1\n\n3\n\nSample Input 2\n\n3\n1\n1\n1\n\nSample Output 2\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 511, "cpu_time_ms": 10, "memory_kb": 5232}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s786780155", "group_id": "codeNet:p02319", "input_text": "let solve n w d =\n  let v0 = Array.make (w + 1) 0 in\n  let v1 = Array.make (w + 1) 0 in\n  let rec doit = function\n    | (i, _) when i > n -> v1.(w)\n    | (i, x) when x > w ->\n      Array.iteri (fun i e -> v0.(i) <- e) v1;\n      doit (i + 1, 1)\n    | (i, x) ->\n      let (vi, wi) = d.(i-1) in\n      v1.(x) <- if wi <= x && v0.(x-wi) + vi > v0.(x) then v0.(x-wi) + vi else v0.(x);\n      doit (i, x + 1) in\n  doit (1, 1)\n\nlet read () = Scanf.scanf \"%d %d\\n\" (fun x y -> (x, y))\n\nlet () =\n  let (n, w) = read () in\n  let d = Array.init n (fun _ -> read ()) in\n  Printf.printf \"%d\\n\" (solve n w d)", "language": "OCaml", "metadata": {"date": 1480356758, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02319.html", "problem_id": "p02319", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02319/input.txt", "sample_output_relpath": "derived/input_output/data/p02319/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02319/OCaml/s786780155.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s786780155", "user_id": "u809138450"}, "prompt_components": {"gold_output": "13\n", "input_to_evaluate": "let solve n w d =\n  let v0 = Array.make (w + 1) 0 in\n  let v1 = Array.make (w + 1) 0 in\n  let rec doit = function\n    | (i, _) when i > n -> v1.(w)\n    | (i, x) when x > w ->\n      Array.iteri (fun i e -> v0.(i) <- e) v1;\n      doit (i + 1, 1)\n    | (i, x) ->\n      let (vi, wi) = d.(i-1) in\n      v1.(x) <- if wi <= x && v0.(x-wi) + vi > v0.(x) then v0.(x-wi) + vi else v0.(x);\n      doit (i, x + 1) in\n  doit (1, 1)\n\nlet read () = Scanf.scanf \"%d %d\\n\" (fun x y -> (x, y))\n\nlet () =\n  let (n, w) = read () in\n  let d = Array.init n (fun _ -> read ()) in\n  Printf.printf \"%d\\n\" (solve n w d)", "problem_context": "0-1 Knapsack Problem II\n\nYou have N items that you want to put them into a knapsack. Item i has value vi and weight wi.\n\nYou want to find a subset of items to put such that:\n\nThe total value of the items is as large as possible.\n\nThe items have combined weight at most W, that is capacity of the knapsack.\n\nFind the maximum total value of items in the knapsack.\n\nInput\n\nN W\nv1 w1\nv2 w2\n:\nvN wN\n\nThe first line consists of the integers N and W. In the following N lines, the value and weight of the i-th item are given.\n\nOutput\n\nPrint the maximum total values of the items in a line.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ vi ≤ 100\n\n1 ≤ wi ≤ 10,000,000\n\n1 ≤ W ≤ 1,000,000,000\n\nSample Input 1\n\n4 5\n4 2\n5 2\n2 1\n8 3\n\nSample Output 1\n\n13\n\nSample Input 2\n\n2 20\n5 9\n4 10\n\nSample Output 2\n\n9", "sample_input": "4 5\n4 2\n5 2\n2 1\n8 3\n"}, "reference_outputs": ["13\n"], "source_document_id": "p02319", "source_text": "0-1 Knapsack Problem II\n\nYou have N items that you want to put them into a knapsack. Item i has value vi and weight wi.\n\nYou want to find a subset of items to put such that:\n\nThe total value of the items is as large as possible.\n\nThe items have combined weight at most W, that is capacity of the knapsack.\n\nFind the maximum total value of items in the knapsack.\n\nInput\n\nN W\nv1 w1\nv2 w2\n:\nvN wN\n\nThe first line consists of the integers N and W. In the following N lines, the value and weight of the i-th item are given.\n\nOutput\n\nPrint the maximum total values of the items in a line.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ vi ≤ 100\n\n1 ≤ wi ≤ 10,000,000\n\n1 ≤ W ≤ 1,000,000,000\n\nSample Input 1\n\n4 5\n4 2\n5 2\n2 1\n8 3\n\nSample Output 1\n\n13\n\nSample Input 2\n\n2 20\n5 9\n4 10\n\nSample Output 2\n\n9", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 592, "cpu_time_ms": 40, "memory_kb": 3816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s932195508", "group_id": "codeNet:p02326", "input_text": "let solve h w c =\n  let v0 = Array.make w 0 in\n  let v1 = Array.make w 0 in\n  let r = ref 0 in\n  Array.iteri (fun i _ -> if c.(0).(i) = 0 then begin v0.(i) <- 1; r := 1 end) v0;\n  for i = 1 to h - 1 do\n    if c.(i).(0) = 0 then v1.(0) <- 1;\n    for j = 1 to w - 1 do\n      if c.(i).(j) = 1 then v1.(j) <- 0\n      else begin\n        let t = if v0.(j) < v1.(j-1) then v0.(j) else v1.(j-1) in\n        v1.(j) <- if v0.(j-1) < t then v0.(j-1) + 1 else t + 1;\n        r := if v1.(j) > !r then v1.(j) else !r;\n      end\n    done;\n    Array.iteri (fun i e -> v0.(i) <- e) v1\n  done;\n  !r * !r\n\nlet () =\n  let (h, w) = Scanf.scanf \"%d %d\\n\" (fun h w -> (h, w)) in\n  let c = Array.make_matrix h w 0 in\n  let rec read = function\n    | (i, _) when i = h -> ()\n    | (i, j) when j = w -> read (i + 1, 0)\n    | (i, j) ->\n      c.(i).(j) <- Scanf.scanf \"%d \" (fun i -> i);\n      read (i, j + 1) in\n  read (0, 0);\n  Printf.printf \"%d\\n\" (solve h w c)", "language": "OCaml", "metadata": {"date": 1480091431, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02326.html", "problem_id": "p02326", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02326/input.txt", "sample_output_relpath": "derived/input_output/data/p02326/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02326/OCaml/s932195508.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s932195508", "user_id": "u809138450"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let solve h w c =\n  let v0 = Array.make w 0 in\n  let v1 = Array.make w 0 in\n  let r = ref 0 in\n  Array.iteri (fun i _ -> if c.(0).(i) = 0 then begin v0.(i) <- 1; r := 1 end) v0;\n  for i = 1 to h - 1 do\n    if c.(i).(0) = 0 then v1.(0) <- 1;\n    for j = 1 to w - 1 do\n      if c.(i).(j) = 1 then v1.(j) <- 0\n      else begin\n        let t = if v0.(j) < v1.(j-1) then v0.(j) else v1.(j-1) in\n        v1.(j) <- if v0.(j-1) < t then v0.(j-1) + 1 else t + 1;\n        r := if v1.(j) > !r then v1.(j) else !r;\n      end\n    done;\n    Array.iteri (fun i e -> v0.(i) <- e) v1\n  done;\n  !r * !r\n\nlet () =\n  let (h, w) = Scanf.scanf \"%d %d\\n\" (fun h w -> (h, w)) in\n  let c = Array.make_matrix h w 0 in\n  let rec read = function\n    | (i, _) when i = h -> ()\n    | (i, j) when j = w -> read (i + 1, 0)\n    | (i, j) ->\n      c.(i).(j) <- Scanf.scanf \"%d \" (fun i -> i);\n      read (i, j + 1) in\n  read (0, 0);\n  Printf.printf \"%d\\n\" (solve h w c)", "problem_context": "Largest Square\n\nGiven a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.\n\nInput\n\nH W\nc1,1 c1,2 ... c1,W\nc2,1 c2,2 ... c2,W\n:\ncH,1 cH,2 ... cH,W\n\nIn the first line, two integers H and W separated by a space character are given. In the following H lines, ci,j, elements of the H × W matrix, are given.\n\nOutput\n\nPrint the area (the number of 0s) of the largest square.\n\nConstraints\n\n1 ≤ H, W ≤ 1,400\n\nSample Input\n\n4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n\nSample Output\n\n4", "sample_input": "4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02326", "source_text": "Largest Square\n\nGiven a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.\n\nInput\n\nH W\nc1,1 c1,2 ... c1,W\nc2,1 c2,2 ... c2,W\n:\ncH,1 cH,2 ... cH,W\n\nIn the first line, two integers H and W separated by a space character are given. In the following H lines, ci,j, elements of the H × W matrix, are given.\n\nOutput\n\nPrint the area (the number of 0s) of the largest square.\n\nConstraints\n\n1 ≤ H, W ≤ 1,400\n\nSample Input\n\n4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n\nSample Output\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 934, "cpu_time_ms": 40, "memory_kb": 7912}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s767305093", "group_id": "codeNet:p02326", "input_text": "let solve h w c =\n  let v0 = Array.make w 0 in\n  let v1 = Array.make w 0 in\n  let r = ref 0 in\n  for i = 0 to h - 1 do if c.(i).(0) = 0 then r := 1 done;\n  for j = 0 to w - 1 do if c.(0).(j) = 0 then begin v0.(j) <- 1; r := 1 end done;\n  for i = 1 to h - 1 do\n    if c.(i).(0) = 0 then v1.(0) <- 1;\n    for j = 1 to w - 1 do\n      if c.(i).(j) = 1 then v1.(j) <- 0\n      else begin\n        let t = if v0.(j) < v1.(j-1) then v0.(j) else v1.(j-1) in\n        v1.(j) <- if v0.(j-1) < t then v0.(j-1) + 1 else t + 1;\n        r := if v1.(j) > !r then v1.(j) else !r;\n      end\n    done;\n    Array.iteri (fun i e -> v0.(i) <- e) v1\n  done;\n  !r * !r\n\nlet () =\n  let (h, w) = Scanf.scanf \"%d %d\\n\" (fun h w -> (h, w)) in\n  let c = Array.make_matrix h w 0 in\n  let rec read = function\n    | (i, _) when i = h -> ()\n    | (i, j) when j = w -> read (i + 1, 0)\n    | (i, j) ->\n      c.(i).(j) <- Scanf.scanf \"%d \" (fun i -> i);\n      read (i, j + 1) in\n  read (0, 0);\n  Printf.printf \"%d\\n\" (solve h w c)", "language": "OCaml", "metadata": {"date": 1480091622, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02326.html", "problem_id": "p02326", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02326/input.txt", "sample_output_relpath": "derived/input_output/data/p02326/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02326/OCaml/s767305093.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s767305093", "user_id": "u809138450"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let solve h w c =\n  let v0 = Array.make w 0 in\n  let v1 = Array.make w 0 in\n  let r = ref 0 in\n  for i = 0 to h - 1 do if c.(i).(0) = 0 then r := 1 done;\n  for j = 0 to w - 1 do if c.(0).(j) = 0 then begin v0.(j) <- 1; r := 1 end done;\n  for i = 1 to h - 1 do\n    if c.(i).(0) = 0 then v1.(0) <- 1;\n    for j = 1 to w - 1 do\n      if c.(i).(j) = 1 then v1.(j) <- 0\n      else begin\n        let t = if v0.(j) < v1.(j-1) then v0.(j) else v1.(j-1) in\n        v1.(j) <- if v0.(j-1) < t then v0.(j-1) + 1 else t + 1;\n        r := if v1.(j) > !r then v1.(j) else !r;\n      end\n    done;\n    Array.iteri (fun i e -> v0.(i) <- e) v1\n  done;\n  !r * !r\n\nlet () =\n  let (h, w) = Scanf.scanf \"%d %d\\n\" (fun h w -> (h, w)) in\n  let c = Array.make_matrix h w 0 in\n  let rec read = function\n    | (i, _) when i = h -> ()\n    | (i, j) when j = w -> read (i + 1, 0)\n    | (i, j) ->\n      c.(i).(j) <- Scanf.scanf \"%d \" (fun i -> i);\n      read (i, j + 1) in\n  read (0, 0);\n  Printf.printf \"%d\\n\" (solve h w c)", "problem_context": "Largest Square\n\nGiven a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.\n\nInput\n\nH W\nc1,1 c1,2 ... c1,W\nc2,1 c2,2 ... c2,W\n:\ncH,1 cH,2 ... cH,W\n\nIn the first line, two integers H and W separated by a space character are given. In the following H lines, ci,j, elements of the H × W matrix, are given.\n\nOutput\n\nPrint the area (the number of 0s) of the largest square.\n\nConstraints\n\n1 ≤ H, W ≤ 1,400\n\nSample Input\n\n4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n\nSample Output\n\n4", "sample_input": "4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02326", "source_text": "Largest Square\n\nGiven a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.\n\nInput\n\nH W\nc1,1 c1,2 ... c1,W\nc2,1 c2,2 ... c2,W\n:\ncH,1 cH,2 ... cH,W\n\nIn the first line, two integers H and W separated by a space character are given. In the following H lines, ci,j, elements of the H × W matrix, are given.\n\nOutput\n\nPrint the area (the number of 0s) of the largest square.\n\nConstraints\n\n1 ≤ H, W ≤ 1,400\n\nSample Input\n\n4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n\nSample Output\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 992, "cpu_time_ms": 220, "memory_kb": 20232}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s129646193", "group_id": "codeNet:p02326", "input_text": "let solve h w c =\n  let s = Array.make w 0 in\n  let t = Array.make w 0 in\n  let r = ref 0 in\n  for i = 0 to h - 1 do\n    if c.(i).(0) = 0 then r := 1\n  done;\n  for j = 0 to w - 1 do\n    if c.(0).(j) = 0 then begin\n      s.(j) <- 1;\n      r := 1\n    end\n  done;\n  for i = 1 to h - 1 do\n    if c.(i).(0) = 0 then t.(0) <- 1;\n    for j = 1 to w - 1 do\n      if c.(i).(j) = 1 then t.(j) <- 0\n      else begin\n        let d = if s.(j) < t.(j-1) then s.(j) else t.(j-1) in\n        t.(j) <- 1 + if s.(j-1) < d then s.(j-1) else d;\n        if t.(j) > !r then r := t.(j)\n      end\n    done;\n    Array.iteri (fun i e -> s.(i) <- e) t\n  done;\n  !r * !r\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet read () = List.map int_of_string (split_on_char ' ' (read_line ()))\n\nlet () =\n  match read () with\n  | [h; w] ->\n    let c = Array.make_matrix h w 0 in\n    for i = 0 to h - 1 do\n      let rec doit j = function\n        | [] -> ()\n        | x::xs ->\n          c.(i).(j) <- x;\n          doit (j + 1) xs in\n      read () |> doit 0\n    done;\n    solve h w c |> Printf.printf \"%d\\n\"\n  | _ -> assert false", "language": "OCaml", "metadata": {"date": 1501898826, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02326.html", "problem_id": "p02326", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02326/input.txt", "sample_output_relpath": "derived/input_output/data/p02326/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02326/OCaml/s129646193.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s129646193", "user_id": "u809138450"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let solve h w c =\n  let s = Array.make w 0 in\n  let t = Array.make w 0 in\n  let r = ref 0 in\n  for i = 0 to h - 1 do\n    if c.(i).(0) = 0 then r := 1\n  done;\n  for j = 0 to w - 1 do\n    if c.(0).(j) = 0 then begin\n      s.(j) <- 1;\n      r := 1\n    end\n  done;\n  for i = 1 to h - 1 do\n    if c.(i).(0) = 0 then t.(0) <- 1;\n    for j = 1 to w - 1 do\n      if c.(i).(j) = 1 then t.(j) <- 0\n      else begin\n        let d = if s.(j) < t.(j-1) then s.(j) else t.(j-1) in\n        t.(j) <- 1 + if s.(j-1) < d then s.(j-1) else d;\n        if t.(j) > !r then r := t.(j)\n      end\n    done;\n    Array.iteri (fun i e -> s.(i) <- e) t\n  done;\n  !r * !r\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet read () = List.map int_of_string (split_on_char ' ' (read_line ()))\n\nlet () =\n  match read () with\n  | [h; w] ->\n    let c = Array.make_matrix h w 0 in\n    for i = 0 to h - 1 do\n      let rec doit j = function\n        | [] -> ()\n        | x::xs ->\n          c.(i).(j) <- x;\n          doit (j + 1) xs in\n      read () |> doit 0\n    done;\n    solve h w c |> Printf.printf \"%d\\n\"\n  | _ -> assert false", "problem_context": "Largest Square\n\nGiven a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.\n\nInput\n\nH W\nc1,1 c1,2 ... c1,W\nc2,1 c2,2 ... c2,W\n:\ncH,1 cH,2 ... cH,W\n\nIn the first line, two integers H and W separated by a space character are given. In the following H lines, ci,j, elements of the H × W matrix, are given.\n\nOutput\n\nPrint the area (the number of 0s) of the largest square.\n\nConstraints\n\n1 ≤ H, W ≤ 1,400\n\nSample Input\n\n4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n\nSample Output\n\n4", "sample_input": "4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02326", "source_text": "Largest Square\n\nGiven a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.\n\nInput\n\nH W\nc1,1 c1,2 ... c1,W\nc2,1 c2,2 ... c2,W\n:\ncH,1 cH,2 ... cH,W\n\nIn the first line, two integers H and W separated by a space character are given. In the following H lines, ci,j, elements of the H × W matrix, are given.\n\nOutput\n\nPrint the area (the number of 0s) of the largest square.\n\nConstraints\n\n1 ≤ H, W ≤ 1,400\n\nSample Input\n\n4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n\nSample Output\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1301, "cpu_time_ms": 70, "memory_kb": 25268}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s954530584", "group_id": "codeNet:p02326", "input_text": "module IO = struct\n\n  (* @since 4.04.0 *)\n  let split_on_char sep s =\n    let open String in\n    let r = ref [] in\n    let j = ref (length s) in\n    for i = length s - 1 downto 0 do\n      if get s i = sep then begin\n        r := sub s (i + 1) (!j - i - 1) :: !r;\n        j := i\n      end\n    done;\n    sub s 0 !j :: !r\n\n  let read_ns () = read_line () |> split_on_char ' ' |> List.map int_of_string\n\nend\n\nlet solve h w c =\n  let s = Array.make w 0 in\n  let t = Array.make w 0 in\n  let r = ref 0 in\n  for j = 0 to w - 1 do\n    if c.(0).(j) then begin\n      s.(j) <- 1;\n      r := 1;\n    end\n  done;\n  if !r = 0 then begin\n    let rec doit i =\n      if i = h then ()\n      else if c.(i).(0) then r := 1\n      else doit (i + 1) in\n    doit 0\n  end;\n  for i = 1 to h - 1 do\n    if c.(i).(0) then t.(0) <- 1;\n    for j = 1 to w - 1 do\n      if not c.(i).(j) then t.(j) <- 0\n      else begin\n        let d = if s.(j) < t.(j-1) then s.(j) else t.(j-1) in\n        t.(j) <- 1 + if s.(j-1) < d then s.(j-1) else d;\n        if t.(j) > !r then r := t.(j)\n      end\n    done;\n    Array.iteri (fun i e -> s.(i) <- e) t\n  done;\n  !r * !r\n\nlet () =\n  match IO.read_ns () with\n  | [h; w] ->\n    let c = Array.make_matrix h w false in\n    for i = 0 to h - 1 do\n      IO.read_ns () |> List.iteri (fun j e -> c.(i).(j) <- e = 0);\n    done;\n    solve h w c |> Printf.printf \"%d\\n\"\n  | _ -> assert false", "language": "OCaml", "metadata": {"date": 1501903354, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02326.html", "problem_id": "p02326", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02326/input.txt", "sample_output_relpath": "derived/input_output/data/p02326/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02326/OCaml/s954530584.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s954530584", "user_id": "u809138450"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "module IO = struct\n\n  (* @since 4.04.0 *)\n  let split_on_char sep s =\n    let open String in\n    let r = ref [] in\n    let j = ref (length s) in\n    for i = length s - 1 downto 0 do\n      if get s i = sep then begin\n        r := sub s (i + 1) (!j - i - 1) :: !r;\n        j := i\n      end\n    done;\n    sub s 0 !j :: !r\n\n  let read_ns () = read_line () |> split_on_char ' ' |> List.map int_of_string\n\nend\n\nlet solve h w c =\n  let s = Array.make w 0 in\n  let t = Array.make w 0 in\n  let r = ref 0 in\n  for j = 0 to w - 1 do\n    if c.(0).(j) then begin\n      s.(j) <- 1;\n      r := 1;\n    end\n  done;\n  if !r = 0 then begin\n    let rec doit i =\n      if i = h then ()\n      else if c.(i).(0) then r := 1\n      else doit (i + 1) in\n    doit 0\n  end;\n  for i = 1 to h - 1 do\n    if c.(i).(0) then t.(0) <- 1;\n    for j = 1 to w - 1 do\n      if not c.(i).(j) then t.(j) <- 0\n      else begin\n        let d = if s.(j) < t.(j-1) then s.(j) else t.(j-1) in\n        t.(j) <- 1 + if s.(j-1) < d then s.(j-1) else d;\n        if t.(j) > !r then r := t.(j)\n      end\n    done;\n    Array.iteri (fun i e -> s.(i) <- e) t\n  done;\n  !r * !r\n\nlet () =\n  match IO.read_ns () with\n  | [h; w] ->\n    let c = Array.make_matrix h w false in\n    for i = 0 to h - 1 do\n      IO.read_ns () |> List.iteri (fun j e -> c.(i).(j) <- e = 0);\n    done;\n    solve h w c |> Printf.printf \"%d\\n\"\n  | _ -> assert false", "problem_context": "Largest Square\n\nGiven a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.\n\nInput\n\nH W\nc1,1 c1,2 ... c1,W\nc2,1 c2,2 ... c2,W\n:\ncH,1 cH,2 ... cH,W\n\nIn the first line, two integers H and W separated by a space character are given. In the following H lines, ci,j, elements of the H × W matrix, are given.\n\nOutput\n\nPrint the area (the number of 0s) of the largest square.\n\nConstraints\n\n1 ≤ H, W ≤ 1,400\n\nSample Input\n\n4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n\nSample Output\n\n4", "sample_input": "4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02326", "source_text": "Largest Square\n\nGiven a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.\n\nInput\n\nH W\nc1,1 c1,2 ... c1,W\nc2,1 c2,2 ... c2,W\n:\ncH,1 cH,2 ... cH,W\n\nIn the first line, two integers H and W separated by a space character are given. In the following H lines, ci,j, elements of the H × W matrix, are given.\n\nOutput\n\nPrint the area (the number of 0s) of the largest square.\n\nConstraints\n\n1 ≤ H, W ≤ 1,400\n\nSample Input\n\n4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n\nSample Output\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1381, "cpu_time_ms": 70, "memory_kb": 25364}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s818768357", "group_id": "codeNet:p02326", "input_text": "module IO = struct\n\n  (* @since 4.04.0 *)\n  let split_on_char sep s =\n    let open String in\n    let r = ref [] in\n    let j = ref (length s) in\n    for i = length s - 1 downto 0 do\n      if get s i = sep then begin\n        r := sub s (i + 1) (!j - i - 1) :: !r;\n        j := i\n      end\n    done;\n    sub s 0 !j :: !r\n\n  let read_ns () = read_line () |> split_on_char ' ' |> List.map int_of_string\n\nend\n\nlet solve h w c =\n  let s = Array.make w 0 in\n  let t = Array.make w 0 in\n  let r = ref 0 in\n  List.iteri (fun j e -> if e = 0 then begin\n    s.(j) <- 1;\n    r := 1;\n  end) c.(0);\n  if !r = 0 then begin\n    let rec doit i =\n      if i = h then ()\n      else begin\n        match c.(i) with\n        | [] -> ()\n        | hd :: _ ->\n          if hd = 0 then r := 1\n          else doit (i + 1)\n      end in\n    doit 0\n  end;\n  Array.iteri (fun i l ->\n    if i = 0 then ()\n    else begin\n      match l with\n      | [] -> assert false\n      | x :: xs ->\n        if x = 0 then t.(0) <- 1;\n        List.iteri (fun j e ->\n          let j = j + 1 in\n          if e = 1 then t.(j) <- 0\n          else begin\n            let d = if s.(j) < t.(j-1) then s.(j) else t.(j-1) in\n            t.(j) <- 1 + if s.(j-1) < d then s.(j-1) else d;\n            if t.(j) > !r then r := t.(j)\n          end) xs;\n        Array.iteri (fun i e -> s.(i) <- e) t\n    end)\n    c;\n  !r * !r\n\nlet () =\n  match IO.read_ns () with\n  | [h; w] ->\n    Array.init h (fun _ -> IO.read_ns ()) |> solve h w |> Printf.printf \"%d\\n\"\n  | _ -> assert false", "language": "OCaml", "metadata": {"date": 1501905254, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02326.html", "problem_id": "p02326", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02326/input.txt", "sample_output_relpath": "derived/input_output/data/p02326/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02326/OCaml/s818768357.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s818768357", "user_id": "u809138450"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "module IO = struct\n\n  (* @since 4.04.0 *)\n  let split_on_char sep s =\n    let open String in\n    let r = ref [] in\n    let j = ref (length s) in\n    for i = length s - 1 downto 0 do\n      if get s i = sep then begin\n        r := sub s (i + 1) (!j - i - 1) :: !r;\n        j := i\n      end\n    done;\n    sub s 0 !j :: !r\n\n  let read_ns () = read_line () |> split_on_char ' ' |> List.map int_of_string\n\nend\n\nlet solve h w c =\n  let s = Array.make w 0 in\n  let t = Array.make w 0 in\n  let r = ref 0 in\n  List.iteri (fun j e -> if e = 0 then begin\n    s.(j) <- 1;\n    r := 1;\n  end) c.(0);\n  if !r = 0 then begin\n    let rec doit i =\n      if i = h then ()\n      else begin\n        match c.(i) with\n        | [] -> ()\n        | hd :: _ ->\n          if hd = 0 then r := 1\n          else doit (i + 1)\n      end in\n    doit 0\n  end;\n  Array.iteri (fun i l ->\n    if i = 0 then ()\n    else begin\n      match l with\n      | [] -> assert false\n      | x :: xs ->\n        if x = 0 then t.(0) <- 1;\n        List.iteri (fun j e ->\n          let j = j + 1 in\n          if e = 1 then t.(j) <- 0\n          else begin\n            let d = if s.(j) < t.(j-1) then s.(j) else t.(j-1) in\n            t.(j) <- 1 + if s.(j-1) < d then s.(j-1) else d;\n            if t.(j) > !r then r := t.(j)\n          end) xs;\n        Array.iteri (fun i e -> s.(i) <- e) t\n    end)\n    c;\n  !r * !r\n\nlet () =\n  match IO.read_ns () with\n  | [h; w] ->\n    Array.init h (fun _ -> IO.read_ns ()) |> solve h w |> Printf.printf \"%d\\n\"\n  | _ -> assert false", "problem_context": "Largest Square\n\nGiven a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.\n\nInput\n\nH W\nc1,1 c1,2 ... c1,W\nc2,1 c2,2 ... c2,W\n:\ncH,1 cH,2 ... cH,W\n\nIn the first line, two integers H and W separated by a space character are given. In the following H lines, ci,j, elements of the H × W matrix, are given.\n\nOutput\n\nPrint the area (the number of 0s) of the largest square.\n\nConstraints\n\n1 ≤ H, W ≤ 1,400\n\nSample Input\n\n4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n\nSample Output\n\n4", "sample_input": "4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02326", "source_text": "Largest Square\n\nGiven a matrix (H × W) which contains only 1 and 0, find the area of the largest square matrix which only contains 0s.\n\nInput\n\nH W\nc1,1 c1,2 ... c1,W\nc2,1 c2,2 ... c2,W\n:\ncH,1 cH,2 ... cH,W\n\nIn the first line, two integers H and W separated by a space character are given. In the following H lines, ci,j, elements of the H × W matrix, are given.\n\nOutput\n\nPrint the area (the number of 0s) of the largest square.\n\nConstraints\n\n1 ≤ H, W ≤ 1,400\n\nSample Input\n\n4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n\nSample Output\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1511, "cpu_time_ms": 140, "memory_kb": 52668}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s861925273", "group_id": "codeNet:p02327", "input_text": "module IO = struct\n\n  (* @since 4.04.0 *)\n  let split_on_char sep s =\n    let open String in\n    let r = ref [] in\n    let j = ref (length s) in\n    for i = length s - 1 downto 0 do\n      if get s i = sep then begin\n        r := sub s (i + 1) (!j - i - 1) :: !r;\n        j := i\n      end\n    done;\n    sub s 0 !j :: !r\n\n  let read_ns () = read_line () |> split_on_char ' ' |> List.map int_of_string\n\nend\n\nlet solve ans w v =\n  let rec g ans j xs =\n    if j = w then (ans, xs)\n    else\n      match xs with\n      | [] -> g ans (j + 1) [(v.(j), j)]\n      | (ch, _) :: _ ->\n        if ch = v.(j) then g ans (j + 1) xs\n        else if ch < v.(j) then g ans (j + 1) ((v.(j), j) :: xs)\n        else\n          let rec f ans k = function\n            | [] -> g ans (j + 1) [(v.(j), k)]\n            | (ch, cj) :: tl as ys ->\n              if ch >= v.(j) then f (if ch * (j - cj) > ans then ch * (j - cj) else ans) cj tl\n              else g ans (j + 1) ((v.(j), k) :: ys) in\n          f ans j xs in\n  let (ans, xs) = g ans 0 [] in\n  List.fold_left (fun acc (ch, cj) -> if ch * (w - cj) > acc then ch * (w - cj) else acc) ans xs\n\nlet () =\n  match IO.read_ns () with\n  | [h; w] ->\n    let s = Array.make w 0 in\n    let t = Array.make w 0 in\n    let rec doit i ans =\n      if i = h then ans\n      else begin\n        IO.read_ns () |> List.iteri (fun j e -> t.(j) <- if e = 1 then 0 else s.(j) + 1);\n        Array.iteri (fun i e -> s.(i) <- e) t;\n        solve ans w t |> doit (i + 1)\n      end in\n    doit 0 0 |> Printf.printf \"%d\\n\"\n  | _ -> assert false", "language": "OCaml", "metadata": {"date": 1501910580, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02327.html", "problem_id": "p02327", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02327/input.txt", "sample_output_relpath": "derived/input_output/data/p02327/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02327/OCaml/s861925273.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s861925273", "user_id": "u809138450"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "module IO = struct\n\n  (* @since 4.04.0 *)\n  let split_on_char sep s =\n    let open String in\n    let r = ref [] in\n    let j = ref (length s) in\n    for i = length s - 1 downto 0 do\n      if get s i = sep then begin\n        r := sub s (i + 1) (!j - i - 1) :: !r;\n        j := i\n      end\n    done;\n    sub s 0 !j :: !r\n\n  let read_ns () = read_line () |> split_on_char ' ' |> List.map int_of_string\n\nend\n\nlet solve ans w v =\n  let rec g ans j xs =\n    if j = w then (ans, xs)\n    else\n      match xs with\n      | [] -> g ans (j + 1) [(v.(j), j)]\n      | (ch, _) :: _ ->\n        if ch = v.(j) then g ans (j + 1) xs\n        else if ch < v.(j) then g ans (j + 1) ((v.(j), j) :: xs)\n        else\n          let rec f ans k = function\n            | [] -> g ans (j + 1) [(v.(j), k)]\n            | (ch, cj) :: tl as ys ->\n              if ch >= v.(j) then f (if ch * (j - cj) > ans then ch * (j - cj) else ans) cj tl\n              else g ans (j + 1) ((v.(j), k) :: ys) in\n          f ans j xs in\n  let (ans, xs) = g ans 0 [] in\n  List.fold_left (fun acc (ch, cj) -> if ch * (w - cj) > acc then ch * (w - cj) else acc) ans xs\n\nlet () =\n  match IO.read_ns () with\n  | [h; w] ->\n    let s = Array.make w 0 in\n    let t = Array.make w 0 in\n    let rec doit i ans =\n      if i = h then ans\n      else begin\n        IO.read_ns () |> List.iteri (fun j e -> t.(j) <- if e = 1 then 0 else s.(j) + 1);\n        Array.iteri (fun i e -> s.(i) <- e) t;\n        solve ans w t |> doit (i + 1)\n      end in\n    doit 0 0 |> Printf.printf \"%d\\n\"\n  | _ -> assert false", "problem_context": "Largest Rectangle\n\nGiven a matrix (H × W) which contains only 1 and 0, find the area of the largest rectangle which only contains 0s.\n\nInput\n\nH W\nc1,1 c1,2 ... c1,W\nc2,1 c2,2 ... c2,W\n:\ncH,1 cH,2 ... cH,W\n\nIn the first line, two integers H and W separated by a space character are given. In the following H lines, ci,j, elements of the H × W matrix, are given.\n\nOutput\n\nPrint the area (the number of 0s) of the largest rectangle.\n\nConstraints\n\n1 ≤ H, W ≤ 1,400\n\nSample Input\n\n4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n\nSample Output\n\n6", "sample_input": "4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02327", "source_text": "Largest Rectangle\n\nGiven a matrix (H × W) which contains only 1 and 0, find the area of the largest rectangle which only contains 0s.\n\nInput\n\nH W\nc1,1 c1,2 ... c1,W\nc2,1 c2,2 ... c2,W\n:\ncH,1 cH,2 ... cH,W\n\nIn the first line, two integers H and W separated by a space character are given. In the following H lines, ci,j, elements of the H × W matrix, are given.\n\nOutput\n\nPrint the area (the number of 0s) of the largest rectangle.\n\nConstraints\n\n1 ≤ H, W ≤ 1,400\n\nSample Input\n\n4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n\nSample Output\n\n6", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1540, "cpu_time_ms": 70, "memory_kb": 5188}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s410844403", "group_id": "codeNet:p02327", "input_text": "let split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet read_ns () = read_line () |> split_on_char ' ' |> List.map int_of_string\n\nlet solve ans w v =\n  let (ans, _, xs) = Array.fold_left (fun (ans, j, xs) c -> match xs with\n    | [] -> (ans, j + 1, [(c, j)])\n    | (ch, _) :: _ ->\n      if ch = c then (ans, j + 1, xs)\n      else if ch < c then (ans, j + 1, (c, j) :: xs)\n      else\n        let rec f ans k = function\n          | [] -> (ans, j + 1, [(c, k)])\n          | (ch, cj) :: tl as ys ->\n            if ch >= c then f (if ch * (j - cj) > ans then ch * (j - cj) else ans) cj tl\n            else (ans, j + 1, (c, k) :: ys) in\n        f ans j xs)\n    (ans, 0, [])\n    v in\n  List.fold_left (fun acc (ch, cj) -> if ch * (w - cj) > acc then ch * (w - cj) else acc) ans xs\n\nlet () =\n  match read_ns () with\n  | [h; w] ->\n    let s = Array.make w 0 in\n    let t = Array.make w 0 in\n    let rec doit i ans =\n      if i = h then ans\n      else begin\n        read_ns () |> List.iteri (fun j e -> t.(j) <- if e = 1 then 0 else s.(j) + 1);\n        Array.iteri (fun i e -> s.(i) <- e) t;\n        solve ans w t |> doit (i + 1)\n      end in\n    doit 0 0 |> Printf.printf \"%d\\n\"\n  | _ -> assert false", "language": "OCaml", "metadata": {"date": 1501911451, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02327.html", "problem_id": "p02327", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02327/input.txt", "sample_output_relpath": "derived/input_output/data/p02327/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02327/OCaml/s410844403.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s410844403", "user_id": "u809138450"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet read_ns () = read_line () |> split_on_char ' ' |> List.map int_of_string\n\nlet solve ans w v =\n  let (ans, _, xs) = Array.fold_left (fun (ans, j, xs) c -> match xs with\n    | [] -> (ans, j + 1, [(c, j)])\n    | (ch, _) :: _ ->\n      if ch = c then (ans, j + 1, xs)\n      else if ch < c then (ans, j + 1, (c, j) :: xs)\n      else\n        let rec f ans k = function\n          | [] -> (ans, j + 1, [(c, k)])\n          | (ch, cj) :: tl as ys ->\n            if ch >= c then f (if ch * (j - cj) > ans then ch * (j - cj) else ans) cj tl\n            else (ans, j + 1, (c, k) :: ys) in\n        f ans j xs)\n    (ans, 0, [])\n    v in\n  List.fold_left (fun acc (ch, cj) -> if ch * (w - cj) > acc then ch * (w - cj) else acc) ans xs\n\nlet () =\n  match read_ns () with\n  | [h; w] ->\n    let s = Array.make w 0 in\n    let t = Array.make w 0 in\n    let rec doit i ans =\n      if i = h then ans\n      else begin\n        read_ns () |> List.iteri (fun j e -> t.(j) <- if e = 1 then 0 else s.(j) + 1);\n        Array.iteri (fun i e -> s.(i) <- e) t;\n        solve ans w t |> doit (i + 1)\n      end in\n    doit 0 0 |> Printf.printf \"%d\\n\"\n  | _ -> assert false", "problem_context": "Largest Rectangle\n\nGiven a matrix (H × W) which contains only 1 and 0, find the area of the largest rectangle which only contains 0s.\n\nInput\n\nH W\nc1,1 c1,2 ... c1,W\nc2,1 c2,2 ... c2,W\n:\ncH,1 cH,2 ... cH,W\n\nIn the first line, two integers H and W separated by a space character are given. In the following H lines, ci,j, elements of the H × W matrix, are given.\n\nOutput\n\nPrint the area (the number of 0s) of the largest rectangle.\n\nConstraints\n\n1 ≤ H, W ≤ 1,400\n\nSample Input\n\n4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n\nSample Output\n\n6", "sample_input": "4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02327", "source_text": "Largest Rectangle\n\nGiven a matrix (H × W) which contains only 1 and 0, find the area of the largest rectangle which only contains 0s.\n\nInput\n\nH W\nc1,1 c1,2 ... c1,W\nc2,1 c2,2 ... c2,W\n:\ncH,1 cH,2 ... cH,W\n\nIn the first line, two integers H and W separated by a space character are given. In the following H lines, ci,j, elements of the H × W matrix, are given.\n\nOutput\n\nPrint the area (the number of 0s) of the largest rectangle.\n\nConstraints\n\n1 ≤ H, W ≤ 1,400\n\nSample Input\n\n4 5\n0 0 1 0 0\n1 0 0 0 0\n0 0 0 1 0\n0 0 0 1 0\n\nSample Output\n\n6", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1395, "cpu_time_ms": 70, "memory_kb": 5092}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s539070870", "group_id": "codeNet:p02343", "input_text": "type t = { mutable x : int; mutable y : int }\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet readln () = read_line () |> split_on_char ' ' |> List.map int_of_string\n\nlet find_set s x =\n  let rec doit x =\n    if x <> s.(x).x then s.(x).x <- doit (s.(x).x);\n    s.(x).x in\n  doit x\n\nlet unite s x y =\n  let (a, b) = (find_set s x, find_set s y) in\n  if s.(a).y > s.(b).y then s.(b).x <- a\n  else begin\n    s.(a).x <- b;\n    if s.(a).y = s.(b).y then s.(b).y <- s.(b).y + 1\n  end\n\nlet solve n q =\n  let s = Array.init n (fun i -> { x = i; y = 0 }) in\n  for i = 0 to q - 1 do\n    match readln () with\n    | n :: x :: y :: _ ->\n      if n = 0 then unite s x y\n      else print_endline (if find_set s x = find_set s y then \"1\" else \"0\")\n    | _ -> assert false\n  done\n\nlet () =\n  match readln () with\n  | [n; q] -> solve n q\n  | _ -> assert false", "language": "OCaml", "metadata": {"date": 1501045443, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02343.html", "problem_id": "p02343", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02343/input.txt", "sample_output_relpath": "derived/input_output/data/p02343/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02343/OCaml/s539070870.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s539070870", "user_id": "u809138450"}, "prompt_components": {"gold_output": "0\n0\n1\n1\n1\n0\n1\n1\n", "input_to_evaluate": "type t = { mutable x : int; mutable y : int }\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet readln () = read_line () |> split_on_char ' ' |> List.map int_of_string\n\nlet find_set s x =\n  let rec doit x =\n    if x <> s.(x).x then s.(x).x <- doit (s.(x).x);\n    s.(x).x in\n  doit x\n\nlet unite s x y =\n  let (a, b) = (find_set s x, find_set s y) in\n  if s.(a).y > s.(b).y then s.(b).x <- a\n  else begin\n    s.(a).x <- b;\n    if s.(a).y = s.(b).y then s.(b).y <- s.(b).y + 1\n  end\n\nlet solve n q =\n  let s = Array.init n (fun i -> { x = i; y = 0 }) in\n  for i = 0 to q - 1 do\n    match readln () with\n    | n :: x :: y :: _ ->\n      if n = 0 then unite s x y\n      else print_endline (if find_set s x = find_set s y then \"1\" else \"0\")\n    | _ -> assert false\n  done\n\nlet () =\n  match readln () with\n  | [n; q] -> solve n q\n  | _ -> assert false", "problem_context": "Disjoint Set\n\nWrite a program which manipulates a disjoint set S = {S1, S2, . . . , Sk}.\n\nFirst of all, the program should read an integer n, then make a disjoint set where each element consists of 0, 1, ... n−1 respectively.\n\nNext, the program should read an integer q and manipulate the set for q queries. There are two kinds of queries for different operations:\n\nunite(x, y): unites sets that contain x and y, say Sx and Sy, into a new set.\n\nsame(x, y): determine whether x and y are in the same set.\n\nInput\n\nn q\ncom1 x1 y1\ncom2 x2 y2\n...\ncomq xq yq\n\nIn the first line, n and q are given. Then, q queries are given where com represents the type of queries. '0' denotes unite and '1' denotes same operation.\n\nOutput\n\nFor each same operation, print 1 if x and y are in the same set, otherwise 0, in a line.\n\nConstraints\n\n1 ≤ n ≤ 10000\n\n1 ≤ q ≤ 100000\n\nx ≠ y\n\nSample Input\n\n5 12\n0 1 4\n0 2 3\n1 1 2\n1 3 4\n1 1 4\n1 3 2\n0 1 3\n1 2 4\n1 3 0\n0 0 4\n1 0 2\n1 3 0\n\nSample Output\n\n0\n0\n1\n1\n1\n0\n1\n1", "sample_input": "5 12\n0 1 4\n0 2 3\n1 1 2\n1 3 4\n1 1 4\n1 3 2\n0 1 3\n1 2 4\n1 3 0\n0 0 4\n1 0 2\n1 3 0\n"}, "reference_outputs": ["0\n0\n1\n1\n1\n0\n1\n1\n"], "source_document_id": "p02343", "source_text": "Disjoint Set\n\nWrite a program which manipulates a disjoint set S = {S1, S2, . . . , Sk}.\n\nFirst of all, the program should read an integer n, then make a disjoint set where each element consists of 0, 1, ... n−1 respectively.\n\nNext, the program should read an integer q and manipulate the set for q queries. There are two kinds of queries for different operations:\n\nunite(x, y): unites sets that contain x and y, say Sx and Sy, into a new set.\n\nsame(x, y): determine whether x and y are in the same set.\n\nInput\n\nn q\ncom1 x1 y1\ncom2 x2 y2\n...\ncomq xq yq\n\nIn the first line, n and q are given. Then, q queries are given where com represents the type of queries. '0' denotes unite and '1' denotes same operation.\n\nOutput\n\nFor each same operation, print 1 if x and y are in the same set, otherwise 0, in a line.\n\nConstraints\n\n1 ≤ n ≤ 10000\n\n1 ≤ q ≤ 100000\n\nx ≠ y\n\nSample Input\n\n5 12\n0 1 4\n0 2 3\n1 1 2\n1 3 4\n1 1 4\n1 3 2\n0 1 3\n1 2 4\n1 3 0\n0 0 4\n1 0 2\n1 3 0\n\nSample Output\n\n0\n0\n1\n1\n1\n0\n1\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1054, "cpu_time_ms": 50, "memory_kb": 4664}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s784722166", "group_id": "codeNet:p02345", "input_text": "module IO = struct\n\n  (* @since 4.04.0 *)\n  let split_on_char sep s =\n    let open String in\n    let r = ref [] in\n    let j = ref (length s) in\n    for i = length s - 1 downto 0 do\n      if get s i = sep then begin\n        r := sub s (i + 1) (!j - i - 1) :: !r;\n        j := i\n      end\n    done;\n    sub s 0 !j :: !r\n\n  let read_ss () = read_line () |> split_on_char ' '\n\n  let read_ns () = read_line () |> split_on_char ' ' |> List.map int_of_string\n\nend\n\nmodule SeguementTree = struct\n\n  let default_val = ref 0\n\n  let size = ref 0\n\n  let make n init =\n    default_val := init;\n    let rec pow_of_2 i =\n      if i >= n then i\n      else pow_of_2 (2 * i) in\n    size := pow_of_2 1;\n    Array.make (2 * (!size) - 1) init\n\n  let parent i = int_of_float ((float_of_int (i - 1)) /. 2.)\n\n  let left i = 2*i + 1\n\n  let right i = 2*i + 2\n\n  let update (s : int array) i x =\n    let j = !size + i - 1 in\n    s.(j) <- x;\n    let rec doit j =\n      if j <= 0 then () else\n      begin\n        let p = parent j in\n        let l = s.(left p) in\n        let r = s.(right p) in\n        s.(p) <- if l < r then l else r;\n        doit p\n      end in\n    doit j\n\n  let find s a b =\n    let rec doit a b k l r =\n      if r <= a || b <= l then !default_val\n      else if a <= l && r <= b then s.(k)\n      else begin\n        let v = doit a b (left k) l ((l + r) / 2) in\n        let w = doit a b (right k) ((l + r) / 2) r in\n        if v < w then v else w\n      end in\n    doit a b 0 0 !size\n\nend\n\nmodule S = SeguementTree\n\nlet solve n q =\n  let s = S.make n 2147483647 in\n  for _ = 0 to q - 1 do\n    match IO.read_ns () with\n    | c :: x :: y :: _ ->\n      if c = 0 then S.update s x y\n      else Printf.printf \"%d\\n\" (S.find s x (y + 1))\n    | _ -> assert false\n  done\n\nlet () =\n  match IO.read_ns () with\n  | [n; q] -> solve n q\n  | _ -> assert false", "language": "OCaml", "metadata": {"date": 1501058006, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02345.html", "problem_id": "p02345", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02345/input.txt", "sample_output_relpath": "derived/input_output/data/p02345/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02345/OCaml/s784722166.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s784722166", "user_id": "u809138450"}, "prompt_components": {"gold_output": "1\n2\n", "input_to_evaluate": "module IO = struct\n\n  (* @since 4.04.0 *)\n  let split_on_char sep s =\n    let open String in\n    let r = ref [] in\n    let j = ref (length s) in\n    for i = length s - 1 downto 0 do\n      if get s i = sep then begin\n        r := sub s (i + 1) (!j - i - 1) :: !r;\n        j := i\n      end\n    done;\n    sub s 0 !j :: !r\n\n  let read_ss () = read_line () |> split_on_char ' '\n\n  let read_ns () = read_line () |> split_on_char ' ' |> List.map int_of_string\n\nend\n\nmodule SeguementTree = struct\n\n  let default_val = ref 0\n\n  let size = ref 0\n\n  let make n init =\n    default_val := init;\n    let rec pow_of_2 i =\n      if i >= n then i\n      else pow_of_2 (2 * i) in\n    size := pow_of_2 1;\n    Array.make (2 * (!size) - 1) init\n\n  let parent i = int_of_float ((float_of_int (i - 1)) /. 2.)\n\n  let left i = 2*i + 1\n\n  let right i = 2*i + 2\n\n  let update (s : int array) i x =\n    let j = !size + i - 1 in\n    s.(j) <- x;\n    let rec doit j =\n      if j <= 0 then () else\n      begin\n        let p = parent j in\n        let l = s.(left p) in\n        let r = s.(right p) in\n        s.(p) <- if l < r then l else r;\n        doit p\n      end in\n    doit j\n\n  let find s a b =\n    let rec doit a b k l r =\n      if r <= a || b <= l then !default_val\n      else if a <= l && r <= b then s.(k)\n      else begin\n        let v = doit a b (left k) l ((l + r) / 2) in\n        let w = doit a b (right k) ((l + r) / 2) r in\n        if v < w then v else w\n      end in\n    doit a b 0 0 !size\n\nend\n\nmodule S = SeguementTree\n\nlet solve n q =\n  let s = S.make n 2147483647 in\n  for _ = 0 to q - 1 do\n    match IO.read_ns () with\n    | c :: x :: y :: _ ->\n      if c = 0 then S.update s x y\n      else Printf.printf \"%d\\n\" (S.find s x (y + 1))\n    | _ -> assert false\n  done\n\nlet () =\n  match IO.read_ns () with\n  | [n; q] -> solve n q\n  | _ -> assert false", "problem_context": "Range Minimum Query (RMQ)\n\nWrite a program which manipulates a sequence A = {a0, a1, . . . , an-1} with the following operations:\n\nfind(s, t): report the minimum element in as, as+1, . . . ,at.\n\nupdate(i, x): change ai to x.\n\nNote that the initial values of ai (i = 0, 1, . . . , n−1) are 231-1.\n\nInput\n\nn q\ncom0 x0 y0\ncom1 x1 y1\n...\ncomq−1 xq−1 yq−1\n\nIn the first line, n (the number of elements in A) and q (the number of queries) are given. Then, q queries are given where com represents the type of queries. '0' denotes update(xi, yi) and '1' denotes find(xi, yi).\n\nOutput\n\nFor each find operation, print the minimum element.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 100000\n\nIf comi is 0, then 0 ≤ xi < n, 0 ≤ yi < 231-1.\n\nIf comi is 1, then 0 ≤ xi < n, 0 ≤ yi < n.\n\nSample Input 1\n\n3 5\n0 0 1\n0 1 2\n0 2 3\n1 0 2\n1 1 2\n\nSample Output 1\n\n1\n2\n\nSample Input 2\n\n1 3\n1 0 0\n0 0 5\n1 0 0\n\nSample Output 2\n\n2147483647\n5", "sample_input": "3 5\n0 0 1\n0 1 2\n0 2 3\n1 0 2\n1 1 2\n"}, "reference_outputs": ["1\n2\n"], "source_document_id": "p02345", "source_text": "Range Minimum Query (RMQ)\n\nWrite a program which manipulates a sequence A = {a0, a1, . . . , an-1} with the following operations:\n\nfind(s, t): report the minimum element in as, as+1, . . . ,at.\n\nupdate(i, x): change ai to x.\n\nNote that the initial values of ai (i = 0, 1, . . . , n−1) are 231-1.\n\nInput\n\nn q\ncom0 x0 y0\ncom1 x1 y1\n...\ncomq−1 xq−1 yq−1\n\nIn the first line, n (the number of elements in A) and q (the number of queries) are given. Then, q queries are given where com represents the type of queries. '0' denotes update(xi, yi) and '1' denotes find(xi, yi).\n\nOutput\n\nFor each find operation, print the minimum element.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 100000\n\nIf comi is 0, then 0 ≤ xi < n, 0 ≤ yi < 231-1.\n\nIf comi is 1, then 0 ≤ xi < n, 0 ≤ yi < n.\n\nSample Input 1\n\n3 5\n0 0 1\n0 1 2\n0 2 3\n1 0 2\n1 1 2\n\nSample Output 1\n\n1\n2\n\nSample Input 2\n\n1 3\n1 0 0\n0 0 5\n1 0 0\n\nSample Output 2\n\n2147483647\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1833, "cpu_time_ms": 90, "memory_kb": 6548}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s262520823", "group_id": "codeNet:p02346", "input_text": "let split str delim =\n  let open String in\n  let rec doit s acc =\n    match\n      try Some (rindex s delim) with _ -> None\n    with\n    | None -> s :: acc\n    | Some i -> doit (sub s 0 i) (sub s (i + 1) (length s - i - 1) :: acc) in\n  doit str []\n\nlet parent i = int_of_float ((float_of_int (i - 1)) /. 2.)\n\nlet left i = 2*i + 1\n\nlet right i = 2*i + 2\n\nlet to_pow_of_2 n =\n  let rec doit i =\n    if i > n then i\n    else doit (i * 2) in\n  doit 1\n\nlet add (s : int array) n i x =\n  let j = n + i - 1 in\n  s.(j) <- x + s.(j);\n  let rec doit j =\n    if j > 0 then begin\n      let j = parent j in\n      s.(j) <- s.(left j) + s.(right j);\n      doit j\n    end in\n  doit j\n\nlet sum s n a b =\n  let rec doit a b k l r =\n    if r < a || b < l then 0\n    else if a <= l && r <= b then s.(k)\n    else doit a b (left k) l ((l + r) / 2) + doit a b (right k) ((l + r) / 2 + 1) r in\n  doit a b 0 0 (n - 1)\n\nlet solve n q =\n  let n = to_pow_of_2 n in\n  let s = Array.make (2*n) 0 in\n  let rec doit i =\n    if i < q then begin\n      begin match List.map int_of_string (split (read_line ()) ' ') with\n      | 0 :: x :: y :: _ -> add s n x y\n      | 1 :: x :: y :: _ -> Printf.printf \"%d\\n\" (sum s n x y)\n      | _ -> ()\n      end;\n      doit (i + 1)\n    end in\n  doit 0\n\nlet () =\n  match List.map int_of_string (split (read_line ()) ' ') with\n  | [n; q] -> solve n q\n  | _ -> ()", "language": "OCaml", "metadata": {"date": 1476300450, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02346.html", "problem_id": "p02346", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02346/input.txt", "sample_output_relpath": "derived/input_output/data/p02346/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02346/OCaml/s262520823.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s262520823", "user_id": "u809138450"}, "prompt_components": {"gold_output": "3\n2\n", "input_to_evaluate": "let split str delim =\n  let open String in\n  let rec doit s acc =\n    match\n      try Some (rindex s delim) with _ -> None\n    with\n    | None -> s :: acc\n    | Some i -> doit (sub s 0 i) (sub s (i + 1) (length s - i - 1) :: acc) in\n  doit str []\n\nlet parent i = int_of_float ((float_of_int (i - 1)) /. 2.)\n\nlet left i = 2*i + 1\n\nlet right i = 2*i + 2\n\nlet to_pow_of_2 n =\n  let rec doit i =\n    if i > n then i\n    else doit (i * 2) in\n  doit 1\n\nlet add (s : int array) n i x =\n  let j = n + i - 1 in\n  s.(j) <- x + s.(j);\n  let rec doit j =\n    if j > 0 then begin\n      let j = parent j in\n      s.(j) <- s.(left j) + s.(right j);\n      doit j\n    end in\n  doit j\n\nlet sum s n a b =\n  let rec doit a b k l r =\n    if r < a || b < l then 0\n    else if a <= l && r <= b then s.(k)\n    else doit a b (left k) l ((l + r) / 2) + doit a b (right k) ((l + r) / 2 + 1) r in\n  doit a b 0 0 (n - 1)\n\nlet solve n q =\n  let n = to_pow_of_2 n in\n  let s = Array.make (2*n) 0 in\n  let rec doit i =\n    if i < q then begin\n      begin match List.map int_of_string (split (read_line ()) ' ') with\n      | 0 :: x :: y :: _ -> add s n x y\n      | 1 :: x :: y :: _ -> Printf.printf \"%d\\n\" (sum s n x y)\n      | _ -> ()\n      end;\n      doit (i + 1)\n    end in\n  doit 0\n\nlet () =\n  match List.map int_of_string (split (read_line ()) ' ') with\n  | [n; q] -> solve n q\n  | _ -> ()", "problem_context": "Range Sum Query\n\nWrite a program which manipulates a sequence A = {a1, a2, . . . , an} with the following operations:\n\nadd(i, x): add x to ai.\n\ngetSum(s, t): print the sum of as, as+1,...,at.\n\nNote that the initial values of ai (i = 1, 2, . . . , n) are 0.\n\nInput\n\nn q\ncom1 x1 y1\ncom2 x2 y2\n...\ncomq xq yq\n\nIn the first line, n (the number of elements in A) and q (the number of queries) are given. Then, q queries are given where com represents the type of queries. '0' denotes add(xi, yi) and '1' denotes getSum(xi, yi).\n\nOutput\n\nFor each getSum operation, print the sum in a line.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 100000\n\nIf comi is 0, then 1 ≤ xi ≤ n, 0 ≤ yi ≤ 1000.\n\nIf comi is 1, then 1 ≤ xi ≤ n, 1 ≤ yi ≤ n.\n\nSample Input 1\n\n3 5\n0 1 1\n0 2 2\n0 3 3\n1 1 2\n1 2 2\n\nSample Output 1\n\n3\n2", "sample_input": "3 5\n0 1 1\n0 2 2\n0 3 3\n1 1 2\n1 2 2\n"}, "reference_outputs": ["3\n2\n"], "source_document_id": "p02346", "source_text": "Range Sum Query\n\nWrite a program which manipulates a sequence A = {a1, a2, . . . , an} with the following operations:\n\nadd(i, x): add x to ai.\n\ngetSum(s, t): print the sum of as, as+1,...,at.\n\nNote that the initial values of ai (i = 1, 2, . . . , n) are 0.\n\nInput\n\nn q\ncom1 x1 y1\ncom2 x2 y2\n...\ncomq xq yq\n\nIn the first line, n (the number of elements in A) and q (the number of queries) are given. Then, q queries are given where com represents the type of queries. '0' denotes add(xi, yi) and '1' denotes getSum(xi, yi).\n\nOutput\n\nFor each getSum operation, print the sum in a line.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 100000\n\nIf comi is 0, then 1 ≤ xi ≤ n, 0 ≤ yi ≤ 1000.\n\nIf comi is 1, then 1 ≤ xi ≤ n, 1 ≤ yi ≤ n.\n\nSample Input 1\n\n3 5\n0 1 1\n0 2 2\n0 3 3\n1 1 2\n1 2 2\n\nSample Output 1\n\n3\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1361, "cpu_time_ms": 80, "memory_kb": 6472}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s327945520", "group_id": "codeNet:p02347", "input_text": "let nil = -1\n\ntype node = { value : int; left : int; right : int }\n\nlet make_node () = { value = nil; left = nil; right = nil }\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet sort_range (a : (int * int * int) array) first last cmp =\n  let swap i j = let tmp = a.(i) in a.(i) <- a.(j); a.(j) <- tmp in\n  let partition p r =\n    let i = ref p in\n    for j = p to r - 1 do\n      if cmp a.(j) a.(r) <= 0 then (swap !i j; incr i)\n    done;\n    swap !i r;\n    !i in\n  let rec doit p r =\n    if p >= r then () else\n    let q = partition p r in\n    doit p (q - 1);\n    doit (q + 1) r in\n  doit first (last - 1)\n\nlet make_kd_tree p t n =\n  let rec doit l r d =\n    if l >= r then nil\n    else begin\n      if d mod 2 = 0 then sort_range p l r (fun (_, ax, _) (_, bx, _) -> ax - bx)\n      else sort_range p l r (fun (_, _, ay) (_, _, by) -> ay - by);\n      let m = (l + r) / 2 in\n      t.(m) <- {value = m; left = doit l m (d + 1); right = doit (m + 1) r (d + 1)};\n      m\n    end in\n  let root = doit 0 n 0 in\n  (root, p, t)\n\nlet ans = ref []\n\nlet find (p : (int * int * int) array) t root sx tx sy ty =\n  let rec doit i d =\n    let (id, x, y) = p.(t.(i).value) in\n    if sx <= x && x <= tx && sy <= y && y <= ty then ans := id :: !ans;\n    if d mod 2 = 0 then begin\n      if t.(i).left != nil && sx <= x then doit t.(i).left (d + 1);\n      if t.(i).right != nil && x <= tx then doit t.(i).right (d + 1);\n    end else begin\n      if t.(i).left != nil && sy <= y then doit t.(i).left (d + 1);\n      if t.(i).right != nil && y <= ty then doit t.(i).right (d + 1);\n    end in\n  doit root 0\n\nlet () =\n  let n = read_int () in\n  let p =\n    Array.init n (fun i ->\n      match read_line () |> split_on_char ' ' |> List.map int_of_string with\n      | [x; y] -> (i, x, y)\n      | _ -> assert false) in\n  let t = Array.make n (make_node ()) in\n  let (root, p, t) = make_kd_tree p t n in\n  let q = read_int () in\n  for _ = 0 to q - 1 do\n    match read_line () |> split_on_char ' ' |> List.map int_of_string with\n    | [sx; tx; sy; ty] ->\n      find p t root sx tx sy ty;\n      List.iter (fun e -> Printf.printf \"%d\\n\" e) (List.sort (-) !ans);\n      Printf.printf \"\\n\";\n      ans := []\n    | _ -> assert false\n  done", "language": "OCaml", "metadata": {"date": 1500208120, "filename_ext": "ml", "original_language": "OCaml", "problem_description_relpath": "problem_descriptions/p02347.html", "problem_id": "p02347", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02347/input.txt", "sample_output_relpath": "derived/input_output/data/p02347/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02347/OCaml/s327945520.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s327945520", "user_id": "u809138450"}, "prompt_components": {"gold_output": "0\n1\n2\n4\n\n2\n3\n5\n", "input_to_evaluate": "let nil = -1\n\ntype node = { value : int; left : int; right : int }\n\nlet make_node () = { value = nil; left = nil; right = nil }\n\nlet split_on_char sep s =\n  let open String in\n  let r = ref [] in\n  let j = ref (length s) in\n  for i = length s - 1 downto 0 do\n    if get s i = sep then begin\n      r := sub s (i + 1) (!j - i - 1) :: !r;\n      j := i\n    end\n  done;\n  sub s 0 !j :: !r\n\nlet sort_range (a : (int * int * int) array) first last cmp =\n  let swap i j = let tmp = a.(i) in a.(i) <- a.(j); a.(j) <- tmp in\n  let partition p r =\n    let i = ref p in\n    for j = p to r - 1 do\n      if cmp a.(j) a.(r) <= 0 then (swap !i j; incr i)\n    done;\n    swap !i r;\n    !i in\n  let rec doit p r =\n    if p >= r then () else\n    let q = partition p r in\n    doit p (q - 1);\n    doit (q + 1) r in\n  doit first (last - 1)\n\nlet make_kd_tree p t n =\n  let rec doit l r d =\n    if l >= r then nil\n    else begin\n      if d mod 2 = 0 then sort_range p l r (fun (_, ax, _) (_, bx, _) -> ax - bx)\n      else sort_range p l r (fun (_, _, ay) (_, _, by) -> ay - by);\n      let m = (l + r) / 2 in\n      t.(m) <- {value = m; left = doit l m (d + 1); right = doit (m + 1) r (d + 1)};\n      m\n    end in\n  let root = doit 0 n 0 in\n  (root, p, t)\n\nlet ans = ref []\n\nlet find (p : (int * int * int) array) t root sx tx sy ty =\n  let rec doit i d =\n    let (id, x, y) = p.(t.(i).value) in\n    if sx <= x && x <= tx && sy <= y && y <= ty then ans := id :: !ans;\n    if d mod 2 = 0 then begin\n      if t.(i).left != nil && sx <= x then doit t.(i).left (d + 1);\n      if t.(i).right != nil && x <= tx then doit t.(i).right (d + 1);\n    end else begin\n      if t.(i).left != nil && sy <= y then doit t.(i).left (d + 1);\n      if t.(i).right != nil && y <= ty then doit t.(i).right (d + 1);\n    end in\n  doit root 0\n\nlet () =\n  let n = read_int () in\n  let p =\n    Array.init n (fun i ->\n      match read_line () |> split_on_char ' ' |> List.map int_of_string with\n      | [x; y] -> (i, x, y)\n      | _ -> assert false) in\n  let t = Array.make n (make_node ()) in\n  let (root, p, t) = make_kd_tree p t n in\n  let q = read_int () in\n  for _ = 0 to q - 1 do\n    match read_line () |> split_on_char ' ' |> List.map int_of_string with\n    | [sx; tx; sy; ty] ->\n      find p t root sx tx sy ty;\n      List.iter (fun e -> Printf.printf \"%d\\n\" e) (List.sort (-) !ans);\n      Printf.printf \"\\n\";\n      ans := []\n    | _ -> assert false\n  done", "problem_context": "Range Search (kD Tree)\n\nThe range search problem consists of a set of attributed records S to determine which records from S intersect with a given range.\n\nFor n points on a plane, report a set of points which are within in a given range. Note that you do not need to consider insert and delete operations for the set.\n\nInput\n\nn\nx0 y0\nx1 y1\n:\nxn-1 yn-1\nq\nsx0 tx0 sy0 ty0\nsx1 tx1 sy1 ty1\n:\nsxq-1 txq-1 syq-1 tyq-1\n\nThe first integer n is the number of points. In the following n lines, the coordinate of the i-th point is given by two integers xi and yi.\n\nThe next integer q is the number of queries. In the following q lines, each query is given by four integers,\nsxi,\ntxi,\nsyi,\ntyi.\n\nOutput\n\nFor each query, report IDs of points such that\nsxi ≤ x ≤ txi and\nsyi ≤ y ≤ tyi.\nThe IDs should be reported in ascending order. Print an ID in a line, and print a blank line at the end of output for the each query.\n\nConstraints\n\n0 ≤ n ≤ 500,000\n\n0 ≤ q ≤ 20,000\n\n-1,000,000,000 ≤ x, y, sx, tx, sy, ty ≤ 1,000,000,000\n\nsx ≤ tx\n\nsy ≤ ty\n\nFor each query, the number of points which are within the range is less than or equal to 100.\n\nSample Input 1\n\n6\n2 1\n2 2\n4 2\n6 2\n3 3\n5 4\n2\n2 4 0 4\n4 10 2 5\n\nSample Output 1\n\n0\n1\n2\n4\n\n2\n3\n5", "sample_input": "6\n2 1\n2 2\n4 2\n6 2\n3 3\n5 4\n2\n2 4 0 4\n4 10 2 5\n"}, "reference_outputs": ["0\n1\n2\n4\n\n2\n3\n5\n"], "source_document_id": "p02347", "source_text": "Range Search (kD Tree)\n\nThe range search problem consists of a set of attributed records S to determine which records from S intersect with a given range.\n\nFor n points on a plane, report a set of points which are within in a given range. Note that you do not need to consider insert and delete operations for the set.\n\nInput\n\nn\nx0 y0\nx1 y1\n:\nxn-1 yn-1\nq\nsx0 tx0 sy0 ty0\nsx1 tx1 sy1 ty1\n:\nsxq-1 txq-1 syq-1 tyq-1\n\nThe first integer n is the number of points. In the following n lines, the coordinate of the i-th point is given by two integers xi and yi.\n\nThe next integer q is the number of queries. In the following q lines, each query is given by four integers,\nsxi,\ntxi,\nsyi,\ntyi.\n\nOutput\n\nFor each query, report IDs of points such that\nsxi ≤ x ≤ txi and\nsyi ≤ y ≤ tyi.\nThe IDs should be reported in ascending order. Print an ID in a line, and print a blank line at the end of output for the each query.\n\nConstraints\n\n0 ≤ n ≤ 500,000\n\n0 ≤ q ≤ 20,000\n\n-1,000,000,000 ≤ x, y, sx, tx, sy, ty ≤ 1,000,000,000\n\nsx ≤ tx\n\nsy ≤ ty\n\nFor each query, the number of points which are within the range is less than or equal to 100.\n\nSample Input 1\n\n6\n2 1\n2 2\n4 2\n6 2\n3 3\n5 4\n2\n2 4 0 4\n4 10 2 5\n\nSample Output 1\n\n0\n1\n2\n4\n\n2\n3\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2409, "cpu_time_ms": 20000, "memory_kb": 38192}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s851749012", "group_id": "codeNet:p02536", "input_text": "open Batteries\nopen Printf\n\nlet ($) g f x = g (f x)\n\nlet swap = Tuple2.swap\n\nlet s2i = int_of_string\nlet i2s = string_of_int\nlet s2f = float_of_string\nlet f2s = string_of_float\nlet f2i = int_of_float\nlet i2f = float_of_int \n\nlet c2a = int_of_char\nlet a2c = char_of_int\n\nlet c2i c = c2a c - 48\nlet i2c i = a2c (i + 48)\n\nlet c2s = String.of_char\nlet s2cl = String.to_list\nlet cl2s = String.of_list\n\nlet puts s = print_endline s\nlet putw ?yn:(yn=(\"Yes\", \"No\")) b = puts (if b then fst yn else snd yn)\nlet puti i = puts @@ i2s i\n\n\n\nmodule StaleList = struct\n  include List\n\n  let nmem x l = not @@ mem x l\n\n  let len = length\n  let size = length\n  let nempty l = not @@ is_empty l\n\n  let hdop l = if nempty l then Some (hd l) else None\n\n  (* let taker = drop *)\n  let takewh = take_while\n\n  (* let dropr = take *)\n  let dropwh = drop_while\n\n  let split_by = span\n\n  let chunk = ntake\n\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr f z l = fold_right f l z\n  let foldri f z l = fold_righti f l z\n\n  let partition_to_map f l =\n    foldr (fun x m -> Map.modify_opt (f x) (function\n      | None -> Some [x] \n      | Some [] -> Some [x] \n      | Some vl -> Some (x::vl)) m) Map.empty l;;\n\n  let scanl f z ls =\n    let rec loop acl acc = function\n      | [] -> rev acl\n      | h::t ->\n        let r = f acc h in\n        loop (r::acl) r t\n    in loop [] z ls\n\n  let scanr f z ls =\n    let rec loop acl acc = function\n      | [] -> acl \n      | h::t ->\n        let r = f h acc in\n        loop (r::acl) r t\n    in loop [] z (rev ls)\n\n  (* let scanli = scan_lefti *)\n  (* let scanri = scan_righti *)\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\n\nend\n\nmodule L = StaleList\n\nmodule StaleArray = struct\n  include Array \n\n  let nmem x l = not @@ mem x l\n\n  let len = length\n  let size = length\n  let is_empty r = len r = 0\n  let nempty r = len r > 0\n\n  let take n r = left r n\n  let taker n r = right r n\n\n  let takeb x r =\n    let l = len r in\n    let rec loop i =\n      if i >= l then r\n      else if r.(i) = x then take i r\n      else loop (i + 1)\n    in loop 0\n     \n  (* let takewh = take_while *)\n\n  let drop n r = tail r n\n  let dropr n r = take ((len r) - n) r\n  (* let dropwh = drop_while *)\n\n  let index_of x r =\n    let l = len r in\n    let rec loop i =\n      if i >= l then None\n      else if r.(i) = x then Some i\n      else loop (i + 1)\n    in loop 0\n\n  (* let split_by = span *)\n\n  (* let chunk = ntake *)\n\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr f z l = fold_right f l z\n  let foldri f z l = fold_righti f l z\n\n  (* let partition_to_map f l = *)\n  (*   foldr (fun x m -> Map.modify_opt (f x) (function *)\n  (*     | None -> Some [x]  *)\n  (*     | Some [] -> Some [x]  *)\n  (*     | Some vl -> Some (x::vl)) m) Map.empty l;; *)\n\n  (* let scanl = scan_left *)\n  (* let scanli = scan_lefti *)\n  (* let scanr = scan_right *)\n  (* let scanri = scan_righti *)\n  \n  let concat2 = append\n  \n  let flatmap (f : 'a -> 'b array) a =\n    map f a |> enum |> L.of_enum |> concat\n\n  let zipf = map2\n  (* let zipfi = map2i *)\n\nend\n\nmodule A = StaleArray\n\nmodule StaleString = struct\n  include String\n\n  let len = length\n\n  let replace_chars = map\n  let map = replace\n\n  let maptol f s = L.map f (s2cl s)\n  let maptoli f s = L.map f (s2cl s)\n\n  let zipf f a b = L.zipf f (s2cl a) (s2cl b)\n  let zipfi f a b = L.zipfi f (s2cl a) (s2cl b)\n\n  let mkstr f sep ls =\n    L.foldl (fun acc x -> acc ^ sep ^ (f x)) (f @@ L.hd ls) (List.tl ls)\n\nend\n\nmodule S = StaleString\n\nlet spsp s = S.split_on_char ' ' s\n\n\nmodule StaleSortedSet = struct\n  include Set\n\n  module Make (Ord : Set.OrderedType) = struct\n    include Set.Make(Ord)\n\n    let nempty st = not @@ is_empty st\n    let sing = singleton\n    let nmem x st = not @@ mem x st\n\n    let foldl f s z = fold (fun x a -> f a x) z s\n\n    let size = cardinal\n  end\n\n  let nempty st = not @@ is_empty st\n  let sing = singleton\n  let nmem x st = not @@ mem x st\n\n  let foldl f s z = fold (fun x a -> f a x) z s\n\n  let size = cardinal\nend\n\nmodule Ss = StaleSortedSet\n\nmodule StaleSortedMap  = struct\n  include Map\n\n  module Make (Ord : Map.OrderedType) = struct\n    include Map.Make(Ord)\n\n    let nempty st = not @@ is_empty st\n    let sing = singleton\n    let nmem x st = not @@ mem x st\n\n    let get = find\n    let get_or x d m = find_default d x m\n\n    let size = cardinal\n  end\n\n  let nempty st = not @@ is_empty st\n  let sing = singleton\n  let nmem x st = not @@ mem x st\n\n  let get = find\n  let get_or x d m = find_default d x m\n\n  let size = cardinal\nend\n\nmodule Ms = StaleSortedMap\n\n\nmodule StaleRange = struct\n\n  type t = Range of int * int\n\n  let make lb ub = Range (lb, ub)\n\n  let to_list r =\n    let Range (lb, ub) = r in\n    L.make (ub - lb) ((+) lb) \n\n  let to_array r =\n    let Range (lb, ub) = r in\n      A.make (ub - lb) ((+) lb)\n\n  let iter r f = \n    let Range (lb, ub) = r in\n    for i = lb to ub do f i done\n\n  let iter2 r1 r2 f =\n    let Range (lb1, ub1) = r1 and Range (lb2, ub2) = r2 in\n      for i = lb1 to ub2 do\n        for j = lb2 to ub2 do\n          f i j\n        done\n      done\nend\n\nmodule R = StaleRange\n\nlet (--) lb ub = R.make lb ub\nlet (--^) lb ub = R.make lb (ub - 1)\n\nmodule StaleGenericAlgorithms = struct\n\n  let set_power ls =\n    let rec loop ls pls =\n      match ls with\n      | [] -> pls\n      | hd::tl -> loop tl (L.flatmap (fun p -> [p; hd::p]) pls)\n    in loop ls [[]]\n\n  let rec bsearch_max_int f lb ub =\n    if lb >= ub then (if f lb then lb else (lb - 1))\n    else (\n      let m = (lb + ub) / 2 in\n      if f m then bsearch_max_int f (m + 1) ub\n      else bsearch_max_int f lb m\n    )\n\n  let partial_sum n ls =\n    let rec loop s k = function\n      | [] -> s\n      | h::t ->\n        if k >= n then s\n        else loop (s + h) (k + 1) t\n    in\n    loop 0 0 ls\n\nend\n\nmodule Gal = StaleGenericAlgorithms\n\nlet rds () = read_line ()\n\nlet rdi () = s2i @@ rds ()\n\nlet rdhs () = spsp @@ rds ()\nlet rdhi () = rdhs () |> L.map s2i\n\nlet rdhf () = rdhs () |> L.map s2f\n\nlet rdf2 () = match rdhf () with\n| a::b::_ -> (a, b)\n| _ -> (0., 0.)\n\nlet rdf3 () = match rdhf () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0., 0., 0.)\n\nlet rdf4 () = match rdhf () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0., 0., 0., 0.)\n\nlet rds2 () = match rdhs () with\n  | a::b::_ -> (a, b)\n  | _ -> (\"\", \"\")\n\nlet rdi2 () = match rdhi () with\n  | a::b::_ -> (a, b)\n  | _ -> (0, 0)\n\nlet rdi3 () = match rdhi () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0, 0, 0)\n\nlet rdi4 () = match rdhi () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0, 0, 0, 0)\n\nlet rdi5 () = match rdhi () with\n| a::b::c::d::e::_ -> (a, b, c, d, e)\n| _ -> (0, 0, 0, 0, 0)\n\nlet rdv n rf =\n  let rec loop n =\n    if n <= 0 then []\n    else (\n      let s = rf () in\n      s::(loop (n - 1))\n    )\n  in loop n\n\nlet rdvi n = rdv n rdi\nlet rdvi2 n = rdv n rdi2\nlet rdvi3 n = rdv n rdi3\nlet rdvi4 n = rdv n rdi4\n\n\nlet print_list aa = \n  printf \"[ \"; aa |> L.iter (fun a -> printf \"%d \" a); puts \"]\"\n\nlet print_array aa = \n  printf \"[ \"; aa |> A.iter (fun a -> printf \"%d \" a); puts \"]\"\n\nlet print_carray aa = \n  printf \"[ \"; aa |> A.iter (fun a -> printf \"%c \" a); puts \"]\"\n\nlet print_matrix mat =\n  puts \"----\";\n  mat |> A.iter (fun r -> print_carray r);\n  puts \"----\"\n\n\nlet rec pow_mod x e m =\n  let rec loop a e' =\n    if e' = 0 then a mod m\n    else loop ((a * x) mod m) (e'-1)\n  in\n  loop 1 e\n\nlet ext_euclid a b =\n  let rec next (r0, s0, t0) (r1, s1, t1) =\n    match r1 with\n    | 0 -> (r0, s0, t0)\n    | r2 ->\n      let q = r0 / r1 in\n      next (r1, s1, t1) (r0 - q * r1, s0 - q * s1, t0 - q * t1)\n  in\n  if a < b then\n    let (g, y, x) = next (b, 1, 0) (a, 0, 1) in (g, x, y)\n  else\n    next (a, 1, 0) (b, 0, 1)\n\nlet modinv x m =\n  let (g, y, z) = ext_euclid x m in\n  match g with\n  | 1 -> y mod m\n  | _ -> invalid_arg \"Not relatively prime\"\n    \nlet rec fact_mod x m =\n  let rec loop a x' =\n    if x' <= 0 then a\n    else loop ((x' * a) mod m) (x' - 1)\n  in loop 1 x\n\nlet binom_mod n k m =\n  let a = fact_mod n m in\n  let b = fact_mod k m in\n  let c = fact_mod (n - k) m in\n  (a * modinv (b * c) m) mod m\n\n\nmodule StaleFFT = struct\n\n  let complex_cooley_tukey ps ar =\n\n    let rec part e d ba =\n     ()\n    in\n\n  ()\nend\n\n\nmodule StaleGraph = struct\n\n  type iset_t = int Ss.t\n  type 'a v_t = { i : int; nb : iset_t; data : 'a }\n  type 'a t = 'a v_t array\n\n  let empty nv vd =\n    A.init (nv + 1) (fun i -> { i = i; nb = Ss.empty; data = vd })\n\n  let add_edge (e : int * int) g =\n    let (v1, v2) = e in\n    g.(v1) <- { g.(v1) with nb = Ss.add v2 g.(v1).nb };\n    g\n\n  let add_uedge e g =\n    add_edge e @@ add_edge (swap e) g\n\n  let from_edges nv vd es =\n    es |> L.foldl (fun g e -> add_edge e g) (empty nv vd)\n\n  let from_uedges nv vd es =\n    es |> L.foldl (fun g e -> add_uedge e g) (empty nv vd)\n\n  let setd g v d = g.(v.i) <- { g.(v.i) with data = d }\n  let getd g v = g.(v.i).data\n\n  let setdi g i d = g.(i) <- { g.(i) with data = d }\n  let getdi g i = g.(i).data\n\n  let sort_by_data cmp g =\n    g |> A.sort (fun v1 v2 -> cmp v1.data v2.data)\n\n\n  type ('a, 'b) update_t = 'a v_t -> iset_t -> 'a t -> 'b \n\n  let rec frontier (upd : ('a, bool) update_t)\n    (fr : iset_t) (cls : iset_t) (g : 'a t) =\n\n    let (fr_next, cls_next) =\n      fr |> Ss.foldl (fun (fr_next, cls_cur) i ->\n        let v = g.(i) in\n        let opnb = Ss.diff v.nb cls_cur in\n        let cl = upd v opnb g in\n        (Ss.union fr_next opnb |> Ss.remove i,\n          if cl then Ss.add i cls_cur else cls_cur)\n      ) (Ss.empty, cls)\n    in\n\n    if Ss.is_empty fr then cls\n    else frontier upd fr_next cls_next g\n\n\n  let bfs (upd : ('a, unit) update_t) s g =\n    frontier (fun v opnb g -> upd v opnb g; true)\n      (Ss.sing s) Ss.empty g\n     \n\n  let steps_by (f : ('a, unit) update_t -> int -> 'a t -> iset_t) s g =\n    f (fun v nb g -> nb |> Ss.iter (fun i -> setdi g i (getd g v + 1))) s g\n\nend\n\nmodule G = StaleGraph\n\n\nlet _ =\n  let prim = 1000000007 in\n\n  let n,m = rdi2 () in\n  let es = rdvi2 m in\n  let g = G.from_uedges n false es in\n  G.setdi g 0 true;\n\n  let rec decomp rvs ops cls =\n    let v0 = Ss.choose ops in\n    (* G.setdi g v0 true; *)\n    (* puti v0; *)\n    let opsr = ref (Ss.remove v0 ops) in\n    let cls_next = g |> G.frontier (fun v opnb g ->\n      opnb |> Ss.iter (fun w -> (* G.setdi g w true; *)\n      (* puti w; *)\n      opsr := Ss.remove w !opsr); true\n      ) (Ss.sing v0) cls in\n    (* print_list @@ Ss.to_list cls_next; *)\n    (* print_list @@ Ss.to_list !opsr; *)\n    if Ss.size cls_next = n then (Ss.add v0 rvs)\n    else decomp (Ss.add v0 rvs) !opsr cls_next\n  in\n\n  let ops_init = Ss.of_list @@ L.range 1 `To n in\n  let rvs = decomp Ss.empty ops_init Ss.empty in\n  puti @@ Ss.size rvs - 1;\n  ()\n", "language": "OCaml", "metadata": {"date": 1601172994, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02536.html", "problem_id": "p02536", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02536/input.txt", "sample_output_relpath": "derived/input_output/data/p02536/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02536/OCaml/s851749012.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s851749012", "user_id": "u970139668"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Batteries\nopen Printf\n\nlet ($) g f x = g (f x)\n\nlet swap = Tuple2.swap\n\nlet s2i = int_of_string\nlet i2s = string_of_int\nlet s2f = float_of_string\nlet f2s = string_of_float\nlet f2i = int_of_float\nlet i2f = float_of_int \n\nlet c2a = int_of_char\nlet a2c = char_of_int\n\nlet c2i c = c2a c - 48\nlet i2c i = a2c (i + 48)\n\nlet c2s = String.of_char\nlet s2cl = String.to_list\nlet cl2s = String.of_list\n\nlet puts s = print_endline s\nlet putw ?yn:(yn=(\"Yes\", \"No\")) b = puts (if b then fst yn else snd yn)\nlet puti i = puts @@ i2s i\n\n\n\nmodule StaleList = struct\n  include List\n\n  let nmem x l = not @@ mem x l\n\n  let len = length\n  let size = length\n  let nempty l = not @@ is_empty l\n\n  let hdop l = if nempty l then Some (hd l) else None\n\n  (* let taker = drop *)\n  let takewh = take_while\n\n  (* let dropr = take *)\n  let dropwh = drop_while\n\n  let split_by = span\n\n  let chunk = ntake\n\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr f z l = fold_right f l z\n  let foldri f z l = fold_righti f l z\n\n  let partition_to_map f l =\n    foldr (fun x m -> Map.modify_opt (f x) (function\n      | None -> Some [x] \n      | Some [] -> Some [x] \n      | Some vl -> Some (x::vl)) m) Map.empty l;;\n\n  let scanl f z ls =\n    let rec loop acl acc = function\n      | [] -> rev acl\n      | h::t ->\n        let r = f acc h in\n        loop (r::acl) r t\n    in loop [] z ls\n\n  let scanr f z ls =\n    let rec loop acl acc = function\n      | [] -> acl \n      | h::t ->\n        let r = f h acc in\n        loop (r::acl) r t\n    in loop [] z (rev ls)\n\n  (* let scanli = scan_lefti *)\n  (* let scanri = scan_righti *)\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\n\nend\n\nmodule L = StaleList\n\nmodule StaleArray = struct\n  include Array \n\n  let nmem x l = not @@ mem x l\n\n  let len = length\n  let size = length\n  let is_empty r = len r = 0\n  let nempty r = len r > 0\n\n  let take n r = left r n\n  let taker n r = right r n\n\n  let takeb x r =\n    let l = len r in\n    let rec loop i =\n      if i >= l then r\n      else if r.(i) = x then take i r\n      else loop (i + 1)\n    in loop 0\n     \n  (* let takewh = take_while *)\n\n  let drop n r = tail r n\n  let dropr n r = take ((len r) - n) r\n  (* let dropwh = drop_while *)\n\n  let index_of x r =\n    let l = len r in\n    let rec loop i =\n      if i >= l then None\n      else if r.(i) = x then Some i\n      else loop (i + 1)\n    in loop 0\n\n  (* let split_by = span *)\n\n  (* let chunk = ntake *)\n\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr f z l = fold_right f l z\n  let foldri f z l = fold_righti f l z\n\n  (* let partition_to_map f l = *)\n  (*   foldr (fun x m -> Map.modify_opt (f x) (function *)\n  (*     | None -> Some [x]  *)\n  (*     | Some [] -> Some [x]  *)\n  (*     | Some vl -> Some (x::vl)) m) Map.empty l;; *)\n\n  (* let scanl = scan_left *)\n  (* let scanli = scan_lefti *)\n  (* let scanr = scan_right *)\n  (* let scanri = scan_righti *)\n  \n  let concat2 = append\n  \n  let flatmap (f : 'a -> 'b array) a =\n    map f a |> enum |> L.of_enum |> concat\n\n  let zipf = map2\n  (* let zipfi = map2i *)\n\nend\n\nmodule A = StaleArray\n\nmodule StaleString = struct\n  include String\n\n  let len = length\n\n  let replace_chars = map\n  let map = replace\n\n  let maptol f s = L.map f (s2cl s)\n  let maptoli f s = L.map f (s2cl s)\n\n  let zipf f a b = L.zipf f (s2cl a) (s2cl b)\n  let zipfi f a b = L.zipfi f (s2cl a) (s2cl b)\n\n  let mkstr f sep ls =\n    L.foldl (fun acc x -> acc ^ sep ^ (f x)) (f @@ L.hd ls) (List.tl ls)\n\nend\n\nmodule S = StaleString\n\nlet spsp s = S.split_on_char ' ' s\n\n\nmodule StaleSortedSet = struct\n  include Set\n\n  module Make (Ord : Set.OrderedType) = struct\n    include Set.Make(Ord)\n\n    let nempty st = not @@ is_empty st\n    let sing = singleton\n    let nmem x st = not @@ mem x st\n\n    let foldl f s z = fold (fun x a -> f a x) z s\n\n    let size = cardinal\n  end\n\n  let nempty st = not @@ is_empty st\n  let sing = singleton\n  let nmem x st = not @@ mem x st\n\n  let foldl f s z = fold (fun x a -> f a x) z s\n\n  let size = cardinal\nend\n\nmodule Ss = StaleSortedSet\n\nmodule StaleSortedMap  = struct\n  include Map\n\n  module Make (Ord : Map.OrderedType) = struct\n    include Map.Make(Ord)\n\n    let nempty st = not @@ is_empty st\n    let sing = singleton\n    let nmem x st = not @@ mem x st\n\n    let get = find\n    let get_or x d m = find_default d x m\n\n    let size = cardinal\n  end\n\n  let nempty st = not @@ is_empty st\n  let sing = singleton\n  let nmem x st = not @@ mem x st\n\n  let get = find\n  let get_or x d m = find_default d x m\n\n  let size = cardinal\nend\n\nmodule Ms = StaleSortedMap\n\n\nmodule StaleRange = struct\n\n  type t = Range of int * int\n\n  let make lb ub = Range (lb, ub)\n\n  let to_list r =\n    let Range (lb, ub) = r in\n    L.make (ub - lb) ((+) lb) \n\n  let to_array r =\n    let Range (lb, ub) = r in\n      A.make (ub - lb) ((+) lb)\n\n  let iter r f = \n    let Range (lb, ub) = r in\n    for i = lb to ub do f i done\n\n  let iter2 r1 r2 f =\n    let Range (lb1, ub1) = r1 and Range (lb2, ub2) = r2 in\n      for i = lb1 to ub2 do\n        for j = lb2 to ub2 do\n          f i j\n        done\n      done\nend\n\nmodule R = StaleRange\n\nlet (--) lb ub = R.make lb ub\nlet (--^) lb ub = R.make lb (ub - 1)\n\nmodule StaleGenericAlgorithms = struct\n\n  let set_power ls =\n    let rec loop ls pls =\n      match ls with\n      | [] -> pls\n      | hd::tl -> loop tl (L.flatmap (fun p -> [p; hd::p]) pls)\n    in loop ls [[]]\n\n  let rec bsearch_max_int f lb ub =\n    if lb >= ub then (if f lb then lb else (lb - 1))\n    else (\n      let m = (lb + ub) / 2 in\n      if f m then bsearch_max_int f (m + 1) ub\n      else bsearch_max_int f lb m\n    )\n\n  let partial_sum n ls =\n    let rec loop s k = function\n      | [] -> s\n      | h::t ->\n        if k >= n then s\n        else loop (s + h) (k + 1) t\n    in\n    loop 0 0 ls\n\nend\n\nmodule Gal = StaleGenericAlgorithms\n\nlet rds () = read_line ()\n\nlet rdi () = s2i @@ rds ()\n\nlet rdhs () = spsp @@ rds ()\nlet rdhi () = rdhs () |> L.map s2i\n\nlet rdhf () = rdhs () |> L.map s2f\n\nlet rdf2 () = match rdhf () with\n| a::b::_ -> (a, b)\n| _ -> (0., 0.)\n\nlet rdf3 () = match rdhf () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0., 0., 0.)\n\nlet rdf4 () = match rdhf () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0., 0., 0., 0.)\n\nlet rds2 () = match rdhs () with\n  | a::b::_ -> (a, b)\n  | _ -> (\"\", \"\")\n\nlet rdi2 () = match rdhi () with\n  | a::b::_ -> (a, b)\n  | _ -> (0, 0)\n\nlet rdi3 () = match rdhi () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0, 0, 0)\n\nlet rdi4 () = match rdhi () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0, 0, 0, 0)\n\nlet rdi5 () = match rdhi () with\n| a::b::c::d::e::_ -> (a, b, c, d, e)\n| _ -> (0, 0, 0, 0, 0)\n\nlet rdv n rf =\n  let rec loop n =\n    if n <= 0 then []\n    else (\n      let s = rf () in\n      s::(loop (n - 1))\n    )\n  in loop n\n\nlet rdvi n = rdv n rdi\nlet rdvi2 n = rdv n rdi2\nlet rdvi3 n = rdv n rdi3\nlet rdvi4 n = rdv n rdi4\n\n\nlet print_list aa = \n  printf \"[ \"; aa |> L.iter (fun a -> printf \"%d \" a); puts \"]\"\n\nlet print_array aa = \n  printf \"[ \"; aa |> A.iter (fun a -> printf \"%d \" a); puts \"]\"\n\nlet print_carray aa = \n  printf \"[ \"; aa |> A.iter (fun a -> printf \"%c \" a); puts \"]\"\n\nlet print_matrix mat =\n  puts \"----\";\n  mat |> A.iter (fun r -> print_carray r);\n  puts \"----\"\n\n\nlet rec pow_mod x e m =\n  let rec loop a e' =\n    if e' = 0 then a mod m\n    else loop ((a * x) mod m) (e'-1)\n  in\n  loop 1 e\n\nlet ext_euclid a b =\n  let rec next (r0, s0, t0) (r1, s1, t1) =\n    match r1 with\n    | 0 -> (r0, s0, t0)\n    | r2 ->\n      let q = r0 / r1 in\n      next (r1, s1, t1) (r0 - q * r1, s0 - q * s1, t0 - q * t1)\n  in\n  if a < b then\n    let (g, y, x) = next (b, 1, 0) (a, 0, 1) in (g, x, y)\n  else\n    next (a, 1, 0) (b, 0, 1)\n\nlet modinv x m =\n  let (g, y, z) = ext_euclid x m in\n  match g with\n  | 1 -> y mod m\n  | _ -> invalid_arg \"Not relatively prime\"\n    \nlet rec fact_mod x m =\n  let rec loop a x' =\n    if x' <= 0 then a\n    else loop ((x' * a) mod m) (x' - 1)\n  in loop 1 x\n\nlet binom_mod n k m =\n  let a = fact_mod n m in\n  let b = fact_mod k m in\n  let c = fact_mod (n - k) m in\n  (a * modinv (b * c) m) mod m\n\n\nmodule StaleFFT = struct\n\n  let complex_cooley_tukey ps ar =\n\n    let rec part e d ba =\n     ()\n    in\n\n  ()\nend\n\n\nmodule StaleGraph = struct\n\n  type iset_t = int Ss.t\n  type 'a v_t = { i : int; nb : iset_t; data : 'a }\n  type 'a t = 'a v_t array\n\n  let empty nv vd =\n    A.init (nv + 1) (fun i -> { i = i; nb = Ss.empty; data = vd })\n\n  let add_edge (e : int * int) g =\n    let (v1, v2) = e in\n    g.(v1) <- { g.(v1) with nb = Ss.add v2 g.(v1).nb };\n    g\n\n  let add_uedge e g =\n    add_edge e @@ add_edge (swap e) g\n\n  let from_edges nv vd es =\n    es |> L.foldl (fun g e -> add_edge e g) (empty nv vd)\n\n  let from_uedges nv vd es =\n    es |> L.foldl (fun g e -> add_uedge e g) (empty nv vd)\n\n  let setd g v d = g.(v.i) <- { g.(v.i) with data = d }\n  let getd g v = g.(v.i).data\n\n  let setdi g i d = g.(i) <- { g.(i) with data = d }\n  let getdi g i = g.(i).data\n\n  let sort_by_data cmp g =\n    g |> A.sort (fun v1 v2 -> cmp v1.data v2.data)\n\n\n  type ('a, 'b) update_t = 'a v_t -> iset_t -> 'a t -> 'b \n\n  let rec frontier (upd : ('a, bool) update_t)\n    (fr : iset_t) (cls : iset_t) (g : 'a t) =\n\n    let (fr_next, cls_next) =\n      fr |> Ss.foldl (fun (fr_next, cls_cur) i ->\n        let v = g.(i) in\n        let opnb = Ss.diff v.nb cls_cur in\n        let cl = upd v opnb g in\n        (Ss.union fr_next opnb |> Ss.remove i,\n          if cl then Ss.add i cls_cur else cls_cur)\n      ) (Ss.empty, cls)\n    in\n\n    if Ss.is_empty fr then cls\n    else frontier upd fr_next cls_next g\n\n\n  let bfs (upd : ('a, unit) update_t) s g =\n    frontier (fun v opnb g -> upd v opnb g; true)\n      (Ss.sing s) Ss.empty g\n     \n\n  let steps_by (f : ('a, unit) update_t -> int -> 'a t -> iset_t) s g =\n    f (fun v nb g -> nb |> Ss.iter (fun i -> setdi g i (getd g v + 1))) s g\n\nend\n\nmodule G = StaleGraph\n\n\nlet _ =\n  let prim = 1000000007 in\n\n  let n,m = rdi2 () in\n  let es = rdvi2 m in\n  let g = G.from_uedges n false es in\n  G.setdi g 0 true;\n\n  let rec decomp rvs ops cls =\n    let v0 = Ss.choose ops in\n    (* G.setdi g v0 true; *)\n    (* puti v0; *)\n    let opsr = ref (Ss.remove v0 ops) in\n    let cls_next = g |> G.frontier (fun v opnb g ->\n      opnb |> Ss.iter (fun w -> (* G.setdi g w true; *)\n      (* puti w; *)\n      opsr := Ss.remove w !opsr); true\n      ) (Ss.sing v0) cls in\n    (* print_list @@ Ss.to_list cls_next; *)\n    (* print_list @@ Ss.to_list !opsr; *)\n    if Ss.size cls_next = n then (Ss.add v0 rvs)\n    else decomp (Ss.add v0 rvs) !opsr cls_next\n  in\n\n  let ops_init = Ss.of_list @@ L.range 1 `To n in\n  let rvs = decomp Ss.empty ops_init Ss.empty in\n  puti @@ Ss.size rvs - 1;\n  ()\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cities numbered 1 through N, and M bidirectional roads numbered 1 through M.\nRoad i connects City A_i and City B_i.\n\nSnuke can perform the following operation zero or more times:\n\nChoose two distinct cities that are not directly connected by a road, and build a new road between the two cities.\n\nAfter he finishes the operations, it must be possible to travel from any city to any other cities by following roads (possibly multiple times).\n\nWhat is the minimum number of roads he must build to achieve the goal?\n\nConstraints\n\n2 \\leq N \\leq 100,000\n\n1 \\leq M \\leq 100,000\n\n1 \\leq A_i < B_i \\leq N\n\nNo two roads connect the same pair of cities.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\n:\nA_M B_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 1\n1 2\n\nSample Output 1\n\n1\n\nInitially, there are three cities, and there is a road between City 1 and City 2.\n\nSnuke can achieve the goal by building one new road, for example, between City 1 and City 3.\nAfter that,\n\nWe can travel between 1 and 2 directly.\n\nWe can travel between 1 and 3 directly.\n\nWe can travel between 2 and 3 by following both roads (2 - 1 - 3).", "sample_input": "3 1\n1 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02536", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cities numbered 1 through N, and M bidirectional roads numbered 1 through M.\nRoad i connects City A_i and City B_i.\n\nSnuke can perform the following operation zero or more times:\n\nChoose two distinct cities that are not directly connected by a road, and build a new road between the two cities.\n\nAfter he finishes the operations, it must be possible to travel from any city to any other cities by following roads (possibly multiple times).\n\nWhat is the minimum number of roads he must build to achieve the goal?\n\nConstraints\n\n2 \\leq N \\leq 100,000\n\n1 \\leq M \\leq 100,000\n\n1 \\leq A_i < B_i \\leq N\n\nNo two roads connect the same pair of cities.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\n:\nA_M B_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 1\n1 2\n\nSample Output 1\n\n1\n\nInitially, there are three cities, and there is a road between City 1 and City 2.\n\nSnuke can achieve the goal by building one new road, for example, between City 1 and City 3.\nAfter that,\n\nWe can travel between 1 and 2 directly.\n\nWe can travel between 1 and 3 directly.\n\nWe can travel between 2 and 3 by following both roads (2 - 1 - 3).", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 10663, "cpu_time_ms": 2207, "memory_kb": 47068}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s213876827", "group_id": "codeNet:p02546", "input_text": "open Batteries\nlet s = read_line ()\nlet ss = (if s.[(String.length s)-1] = 's' then \"es\" else \"s\")\nlet () = print_endline (s ^ ss)\n", "language": "OCaml", "metadata": {"date": 1600550772, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s213876827.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s213876827", "user_id": "u511870776"}, "prompt_components": {"gold_output": "apples\n", "input_to_evaluate": "open Batteries\nlet s = read_line ()\nlet ss = (if s.[(String.length s)-1] = 's' then \"es\" else \"s\")\nlet () = print_endline (s ^ ss)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters.\n\nIn Taknese, the plural form of a noun is spelled based on the following rules:\n\nIf a noun's singular form does not end with s, append s to the end of the singular form.\n\nIf a noun's singular form ends with s, append es to the end of the singular form.\n\nYou are given the singular form S of a Taknese noun. Output its plural form.\n\nConstraints\n\nS is a string of length 1 between 1000, inclusive.\n\nS contains only lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the plural form of the given Taknese word.\n\nSample Input 1\n\napple\n\nSample Output 1\n\napples\n\napple ends with e, so its plural form is apples.\n\nSample Input 2\n\nbus\n\nSample Output 2\n\nbuses\n\nbus ends with s, so its plural form is buses.\n\nSample Input 3\n\nbox\n\nSample Output 3\n\nboxs", "sample_input": "apple\n"}, "reference_outputs": ["apples\n"], "source_document_id": "p02546", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters.\n\nIn Taknese, the plural form of a noun is spelled based on the following rules:\n\nIf a noun's singular form does not end with s, append s to the end of the singular form.\n\nIf a noun's singular form ends with s, append es to the end of the singular form.\n\nYou are given the singular form S of a Taknese noun. Output its plural form.\n\nConstraints\n\nS is a string of length 1 between 1000, inclusive.\n\nS contains only lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the plural form of the given Taknese word.\n\nSample Input 1\n\napple\n\nSample Output 1\n\napples\n\napple ends with e, so its plural form is apples.\n\nSample Input 2\n\nbus\n\nSample Output 2\n\nbuses\n\nbus ends with s, so its plural form is buses.\n\nSample Input 3\n\nbox\n\nSample Output 3\n\nboxs", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 131, "cpu_time_ms": 5, "memory_kb": 5160}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s900664080", "group_id": "codeNet:p02548", "input_text": "open Printf\nopen Scanf\n\nlet primes = Array.make 1000000 0;;\nlet np = ref 0;;\n\nlet input_int () =\n  scanf \"%d\\n\" (fun k -> k)\n\nlet is_prime k =\n  let n = !np in\n  let rec loop i =\n    if i=n then\n      true\n    else if k mod primes.(i) = 0 then\n      false\n    else\n      loop (i+1)\n  in\n  loop 0\n\nlet next_prime () =\n  let n = !np in\n  let rec loop k =\n    if is_prime k then\n      begin\n        primes.(n) <- k;\n        np := n + 1;\n        k\n      end\n    else\n      loop (k+2)\n  in\n  loop primes.(n-1)\n\nlet find_pow n p =\n  let rec loop c k =\n    if k mod p = 0 then\n      loop (c+1) (k / p)\n    else\n      (c, k)\n  in\n  loop 0 n\n\nlet find_factor m =\n  let n = !np in\n  let rec loop2 () =\n    let x = next_prime () in\n    if m mod x = 0 then\n      x\n    else\n      loop2 ()\n  in\n  let rec loop i =\n    if i=n then\n      loop2 ()\n    else if m mod primes.(i) = 0 then\n      primes.(i)\n    else\n      loop (i+1)\n  in\n  loop 0\n\nlet h n =\n  let rec loop c k =\n    if k=1 then\n      c\n    else\n      let p = find_factor k in\n      let (m, k) = find_pow k p in\n      loop ((m + 1) * c) k\n  in\n  if n mod 2 = 0 then\n    let (m, n) = find_pow n 2 in\n    loop (m + 1) n\n  else\n    loop 1 n\n      \nlet f () =\n  let n = input_int () in\n  let rec loop tot c =\n    (* printf \"%d\\n\" c; *)\n    if c = n then\n      tot\n    else\n      loop (tot + h (n - c)) (c+1)\n  in\n  loop 0 1\n\nlet () =\n  primes.(0) <- 2;\n  primes.(1) <- 3;\n  np := 2;\n  let tot = f () in\n  printf \"%d\\n\" tot\n", "language": "OCaml", "metadata": {"date": 1600547010, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s900664080.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s900664080", "user_id": "u104829762"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet primes = Array.make 1000000 0;;\nlet np = ref 0;;\n\nlet input_int () =\n  scanf \"%d\\n\" (fun k -> k)\n\nlet is_prime k =\n  let n = !np in\n  let rec loop i =\n    if i=n then\n      true\n    else if k mod primes.(i) = 0 then\n      false\n    else\n      loop (i+1)\n  in\n  loop 0\n\nlet next_prime () =\n  let n = !np in\n  let rec loop k =\n    if is_prime k then\n      begin\n        primes.(n) <- k;\n        np := n + 1;\n        k\n      end\n    else\n      loop (k+2)\n  in\n  loop primes.(n-1)\n\nlet find_pow n p =\n  let rec loop c k =\n    if k mod p = 0 then\n      loop (c+1) (k / p)\n    else\n      (c, k)\n  in\n  loop 0 n\n\nlet find_factor m =\n  let n = !np in\n  let rec loop2 () =\n    let x = next_prime () in\n    if m mod x = 0 then\n      x\n    else\n      loop2 ()\n  in\n  let rec loop i =\n    if i=n then\n      loop2 ()\n    else if m mod primes.(i) = 0 then\n      primes.(i)\n    else\n      loop (i+1)\n  in\n  loop 0\n\nlet h n =\n  let rec loop c k =\n    if k=1 then\n      c\n    else\n      let p = find_factor k in\n      let (m, k) = find_pow k p in\n      loop ((m + 1) * c) k\n  in\n  if n mod 2 = 0 then\n    let (m, n) = find_pow n 2 in\n    loop (m + 1) n\n  else\n    loop 1 n\n      \nlet f () =\n  let n = input_int () in\n  let rec loop tot c =\n    (* printf \"%d\\n\" c; *)\n    if c = n then\n      tot\n    else\n      loop (tot + h (n - c)) (c+1)\n  in\n  loop 0 1\n\nlet () =\n  primes.(0) <- 2;\n  primes.(1) <- 3;\n  np := 2;\n  let tot = f () in\n  printf \"%d\\n\" tot\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a positive integer N.\nHow many tuples (A,B,C) of positive integers satisfy A \\times B + C = N?\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n3\n\nThere are 3 tuples of integers that satisfy A \\times B + C = 3: (A, B, C) = (1, 1, 2), (1, 2, 1), (2, 1, 1).\n\nSample Input 2\n\n100\n\nSample Output 2\n\n473\n\nSample Input 3\n\n1000000\n\nSample Output 3\n\n13969985", "sample_input": "3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02548", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a positive integer N.\nHow many tuples (A,B,C) of positive integers satisfy A \\times B + C = N?\n\nConstraints\n\n2 \\leq N \\leq 10^6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n3\n\nThere are 3 tuples of integers that satisfy A \\times B + C = 3: (A, B, C) = (1, 1, 2), (1, 2, 1), (2, 1, 1).\n\nSample Input 2\n\n100\n\nSample Output 2\n\n473\n\nSample Input 3\n\n1000000\n\nSample Output 3\n\n13969985", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1465, "cpu_time_ms": 2206, "memory_kb": 13860}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s443295717", "group_id": "codeNet:p02553", "input_text": "let () = Scanf.scanf \"%d %d %d %d\\n\" @@ fun a b c d ->\n  Printf.printf \"%d\\n\" @@\n  List.fold_left max min_int\n  [a * c; a * d; b * c; b * d]", "language": "OCaml", "metadata": {"date": 1600029711, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s443295717.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s443295717", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d %d\\n\" @@ fun a b c d ->\n  Printf.printf \"%d\\n\" @@\n  List.fold_left max min_int\n  [a * c; a * d; b * c; b * d]", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are integers a,b,c and d.\nIf x and y are integers and a \\leq x \\leq b and c\\leq y \\leq d hold, what is the maximum possible value of x \\times y?\n\nConstraints\n\n-10^9 \\leq a \\leq b \\leq 10^9\n\n-10^9 \\leq c \\leq d \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c d\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 1 1\n\nSample Output 1\n\n2\n\nIf x = 1 and y = 1 then x \\times y = 1.\nIf x = 2 and y = 1 then x \\times y = 2.\nTherefore, the answer is 2.\n\nSample Input 2\n\n3 5 -4 -2\n\nSample Output 2\n\n-6\n\nThe answer can be negative.\n\nSample Input 3\n\n-1000000000 0 -1000000000 0\n\nSample Output 3\n\n1000000000000000000", "sample_input": "1 2 1 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02553", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are integers a,b,c and d.\nIf x and y are integers and a \\leq x \\leq b and c\\leq y \\leq d hold, what is the maximum possible value of x \\times y?\n\nConstraints\n\n-10^9 \\leq a \\leq b \\leq 10^9\n\n-10^9 \\leq c \\leq d \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c d\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 1 1\n\nSample Output 1\n\n2\n\nIf x = 1 and y = 1 then x \\times y = 1.\nIf x = 2 and y = 1 then x \\times y = 2.\nTherefore, the answer is 2.\n\nSample Input 2\n\n3 5 -4 -2\n\nSample Output 2\n\n-6\n\nThe answer can be negative.\n\nSample Input 3\n\n-1000000000 0 -1000000000 0\n\nSample Output 3\n\n1000000000000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 140, "cpu_time_ms": 6, "memory_kb": 3808}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s498443195", "group_id": "codeNet:p02553", "input_text": "let () =\n  Scanf.scanf \"%d %d %d %d\\n\" @@ fun a b c d ->\n  Printf.printf \"%d\\n\"\n    (if a < 0 && c < 0 then\n       if b > 0 && d > 0 then max (a*c) (b*d)\n       else a*c\n     else if a > 0 && c > 0 || b > 0 && d > 0 then b*d\n     else if a <= 0 && 0 <= b || c <= 0 && 0 <= d then 0\n     else max (a*d) (b*c))", "language": "OCaml", "metadata": {"date": 1600024523, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s498443195.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s498443195", "user_id": "u307426615"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d %d %d\\n\" @@ fun a b c d ->\n  Printf.printf \"%d\\n\"\n    (if a < 0 && c < 0 then\n       if b > 0 && d > 0 then max (a*c) (b*d)\n       else a*c\n     else if a > 0 && c > 0 || b > 0 && d > 0 then b*d\n     else if a <= 0 && 0 <= b || c <= 0 && 0 <= d then 0\n     else max (a*d) (b*c))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are integers a,b,c and d.\nIf x and y are integers and a \\leq x \\leq b and c\\leq y \\leq d hold, what is the maximum possible value of x \\times y?\n\nConstraints\n\n-10^9 \\leq a \\leq b \\leq 10^9\n\n-10^9 \\leq c \\leq d \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c d\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 1 1\n\nSample Output 1\n\n2\n\nIf x = 1 and y = 1 then x \\times y = 1.\nIf x = 2 and y = 1 then x \\times y = 2.\nTherefore, the answer is 2.\n\nSample Input 2\n\n3 5 -4 -2\n\nSample Output 2\n\n-6\n\nThe answer can be negative.\n\nSample Input 3\n\n-1000000000 0 -1000000000 0\n\nSample Output 3\n\n1000000000000000000", "sample_input": "1 2 1 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02553", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are integers a,b,c and d.\nIf x and y are integers and a \\leq x \\leq b and c\\leq y \\leq d hold, what is the maximum possible value of x \\times y?\n\nConstraints\n\n-10^9 \\leq a \\leq b \\leq 10^9\n\n-10^9 \\leq c \\leq d \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c d\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 1 1\n\nSample Output 1\n\n2\n\nIf x = 1 and y = 1 then x \\times y = 1.\nIf x = 2 and y = 1 then x \\times y = 2.\nTherefore, the answer is 2.\n\nSample Input 2\n\n3 5 -4 -2\n\nSample Output 2\n\n-6\n\nThe answer can be negative.\n\nSample Input 3\n\n-1000000000 0 -1000000000 0\n\nSample Output 3\n\n1000000000000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 308, "cpu_time_ms": 9, "memory_kb": 3844}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s441224535", "group_id": "codeNet:p02554", "input_text": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  let rec powmod x y ans = \n    if y=0 then ans else powmod x (y-1) ((ans*x) mod 1000000007) in\n  Printf.printf \"%d\\n\"\n    ((((powmod 10 n 1)-(powmod 9 n 1)+(powmod 8 n 1)-(powmod 9 n 1) mod 1000000007)\n     +1000000007) mod 1000000007) ", "language": "OCaml", "metadata": {"date": 1600439381, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02554.html", "problem_id": "p02554", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02554/input.txt", "sample_output_relpath": "derived/input_output/data/p02554/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02554/OCaml/s441224535.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s441224535", "user_id": "u307426615"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  let rec powmod x y ans = \n    if y=0 then ans else powmod x (y-1) ((ans*x) mod 1000000007) in\n  Printf.printf \"%d\\n\"\n    ((((powmod 10 n 1)-(powmod 9 n 1)+(powmod 8 n 1)-(powmod 9 n 1) mod 1000000007)\n     +1000000007) mod 1000000007) ", "problem_context": "Score : 300 points\n\nProblem Statement\n\nHow many integer sequences A_1,A_2,\\ldots,A_N of length N satisfy all of the following conditions?\n\n0 \\leq A_i \\leq 9\n\nThere exists some i such that A_i=0 holds.\n\nThere exists some i such that A_i=9 holds.\n\nThe answer can be very large, so output it modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^9 + 7.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n2\n\nTwo sequences \\{0,9\\} and \\{9,0\\} satisfy all conditions.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0\n\nSample Input 3\n\n869121\n\nSample Output 3\n\n2511445", "sample_input": "2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02554", "source_text": "Score : 300 points\n\nProblem Statement\n\nHow many integer sequences A_1,A_2,\\ldots,A_N of length N satisfy all of the following conditions?\n\n0 \\leq A_i \\leq 9\n\nThere exists some i such that A_i=0 holds.\n\nThere exists some i such that A_i=9 holds.\n\nThe answer can be very large, so output it modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^9 + 7.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n2\n\nTwo sequences \\{0,9\\} and \\{9,0\\} satisfy all conditions.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0\n\nSample Input 3\n\n869121\n\nSample Output 3\n\n2511445", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 38, "memory_kb": 3800}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s837849908", "group_id": "codeNet:p02554", "input_text": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  let rec powmod x y ans = if y = 0 then ans else powmod x (y-1) ((ans * x) mod 1000000007) in\n  Printf.printf \"%d\\n\"\n    (((powmod 10 n 1) - (powmod 9 n 1) - (powmod 9 n 1) + (powmod 8 n 1) + 1000000007) mod 1000000007)\n", "language": "OCaml", "metadata": {"date": 1600438853, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02554.html", "problem_id": "p02554", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02554/input.txt", "sample_output_relpath": "derived/input_output/data/p02554/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02554/OCaml/s837849908.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s837849908", "user_id": "u307426615"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  let rec powmod x y ans = if y = 0 then ans else powmod x (y-1) ((ans * x) mod 1000000007) in\n  Printf.printf \"%d\\n\"\n    (((powmod 10 n 1) - (powmod 9 n 1) - (powmod 9 n 1) + (powmod 8 n 1) + 1000000007) mod 1000000007)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nHow many integer sequences A_1,A_2,\\ldots,A_N of length N satisfy all of the following conditions?\n\n0 \\leq A_i \\leq 9\n\nThere exists some i such that A_i=0 holds.\n\nThere exists some i such that A_i=9 holds.\n\nThe answer can be very large, so output it modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^9 + 7.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n2\n\nTwo sequences \\{0,9\\} and \\{9,0\\} satisfy all conditions.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0\n\nSample Input 3\n\n869121\n\nSample Output 3\n\n2511445", "sample_input": "2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02554", "source_text": "Score : 300 points\n\nProblem Statement\n\nHow many integer sequences A_1,A_2,\\ldots,A_N of length N satisfy all of the following conditions?\n\n0 \\leq A_i \\leq 9\n\nThere exists some i such that A_i=0 holds.\n\nThere exists some i such that A_i=9 holds.\n\nThe answer can be very large, so output it modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^9 + 7.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n2\n\nTwo sequences \\{0,9\\} and \\{9,0\\} satisfy all conditions.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0\n\nSample Input 3\n\n869121\n\nSample Output 3\n\n2511445", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 37, "memory_kb": 3728}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s400674736", "group_id": "codeNet:p02554", "input_text": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  let rec powmod x y ans = \n  \tif y = 0 then ans else powmod x (y-1) (ans * x mod 1000000007) in\n  Printf.printf \"%d\\n\"\n    (((powmod 10 n 1) - 2 * (powmod 9 n 1) + (powmod 8 n 1)) mod 1000000007)\n", "language": "OCaml", "metadata": {"date": 1600438562, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02554.html", "problem_id": "p02554", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02554/input.txt", "sample_output_relpath": "derived/input_output/data/p02554/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02554/OCaml/s400674736.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s400674736", "user_id": "u307426615"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  let rec powmod x y ans = \n  \tif y = 0 then ans else powmod x (y-1) (ans * x mod 1000000007) in\n  Printf.printf \"%d\\n\"\n    (((powmod 10 n 1) - 2 * (powmod 9 n 1) + (powmod 8 n 1)) mod 1000000007)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nHow many integer sequences A_1,A_2,\\ldots,A_N of length N satisfy all of the following conditions?\n\n0 \\leq A_i \\leq 9\n\nThere exists some i such that A_i=0 holds.\n\nThere exists some i such that A_i=9 holds.\n\nThe answer can be very large, so output it modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^9 + 7.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n2\n\nTwo sequences \\{0,9\\} and \\{9,0\\} satisfy all conditions.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0\n\nSample Input 3\n\n869121\n\nSample Output 3\n\n2511445", "sample_input": "2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02554", "source_text": "Score : 300 points\n\nProblem Statement\n\nHow many integer sequences A_1,A_2,\\ldots,A_N of length N satisfy all of the following conditions?\n\n0 \\leq A_i \\leq 9\n\nThere exists some i such that A_i=0 holds.\n\nThere exists some i such that A_i=9 holds.\n\nThe answer can be very large, so output it modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^9 + 7.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n2\n\nTwo sequences \\{0,9\\} and \\{9,0\\} satisfy all conditions.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0\n\nSample Input 3\n\n869121\n\nSample Output 3\n\n2511445", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 31, "memory_kb": 3848}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s800987604", "group_id": "codeNet:p02554", "input_text": "open Batteries\nopen Printf\n\nlet ($) g f x = g (f x)\n\nlet swap = Tuple2.swap\n\nlet s2i = int_of_string\nlet i2s = string_of_int\nlet s2f = float_of_string\nlet f2s = string_of_float\nlet f2i = int_of_float\nlet i2f = float_of_int \n\nlet c2a = int_of_char\nlet a2c = char_of_int\n\nlet c2i c = c2a c - 48\nlet i2c i = a2c (i + 48)\n\nlet c2s = String.of_char\nlet s2cl = String.to_list\nlet cl2s = String.of_list\n\nlet puts s = print_endline s\nlet putw ?yn:(yn=(\"Yes\", \"No\")) b = puts (if b then fst yn else snd yn)\nlet puti i = puts @@ i2s i\n\n\n\nmodule StaleList = struct\n  include List\n\n  let nmem x l = not @@ mem x l\n\n  let len = length\n  let size = length\n  let nempty l = not @@ is_empty l\n\n  let hdop l = if nempty l then Some (hd l) else None\n\n  (* let taker = drop *)\n  let takewh = take_while\n\n  (* let dropr = take *)\n  let dropwh = drop_while\n\n  let split_by = span\n\n  let chunk = ntake\n\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr f z l = fold_right f l z\n  let foldri f z l = fold_righti f l z\n\n  let partition_to_map f l =\n    foldr (fun x m -> Map.modify_opt (f x) (function\n      | None -> Some [x] \n      | Some [] -> Some [x] \n      | Some vl -> Some (x::vl)) m) Map.empty l;;\n\n  let scanl f z ls =\n    let rec loop acl acc = function\n      | [] -> rev acl\n      | h::t ->\n        let r = f acc h in\n        loop (r::acl) r t\n    in loop [] z ls\n\n  let scanr f z ls =\n    let rec loop acl acc = function\n      | [] -> acl \n      | h::t ->\n        let r = f h acc in\n        loop (r::acl) r t\n    in loop [] z (rev ls)\n\n  (* let scanli = scan_lefti *)\n  (* let scanri = scan_righti *)\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\n\nend\n\nmodule L = StaleList\n\nmodule StaleArray = struct\n  include Array \n\n  let nmem x l = not @@ mem x l\n\n  let len = length\n  let size = length\n  let is_empty r = len r = 0\n  let nempty r = len r > 0\n\n  let take n r = left r n\n  let taker n r = right r n\n\n  let takeb x r =\n    let l = len r in\n    let rec loop i =\n      if i >= l then r\n      else if r.(i) = x then take i r\n      else loop (i + 1)\n    in loop 0\n     \n  (* let takewh = take_while *)\n\n  let drop n r = tail r n\n  let dropr n r = take ((len r) - n) r\n  (* let dropwh = drop_while *)\n\n  let index_of x r =\n    let l = len r in\n    let rec loop i =\n      if i >= l then None\n      else if r.(i) = x then Some i\n      else loop (i + 1)\n    in loop 0\n\n  (* let split_by = span *)\n\n  (* let chunk = ntake *)\n\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr f z l = fold_right f l z\n  let foldri f z l = fold_righti f l z\n\n  (* let partition_to_map f l = *)\n  (*   foldr (fun x m -> Map.modify_opt (f x) (function *)\n  (*     | None -> Some [x]  *)\n  (*     | Some [] -> Some [x]  *)\n  (*     | Some vl -> Some (x::vl)) m) Map.empty l;; *)\n\n  (* let scanl = scan_left *)\n  (* let scanli = scan_lefti *)\n  (* let scanr = scan_right *)\n  (* let scanri = scan_righti *)\n  \n  let concat2 = append\n  \n  let flatmap (f : 'a -> 'b array) a =\n    map f a |> enum |> L.of_enum |> concat\n\n  let zipf = map2\n  (* let zipfi = map2i *)\n\nend\n\nmodule A = StaleArray\n\nmodule StaleString = struct\n  include String\n\n  let len = length\n\n  let replace_chars = map\n  let map = replace\n\n  let maptol f s = L.map f (s2cl s)\n  let maptoli f s = L.map f (s2cl s)\n\n  let zipf f a b = L.zipf f (s2cl a) (s2cl b)\n  let zipfi f a b = L.zipfi f (s2cl a) (s2cl b)\n\n  let mkstr f sep ls =\n    L.foldl (fun acc x -> acc ^ sep ^ (f x)) (f @@ L.hd ls) (List.tl ls)\n\nend\n\nmodule S = StaleString\n\nlet spsp s = S.split_on_char ' ' s\n\n\nmodule StaleSortedSet = struct\n  include Set\n\n  module Make (Ord : Set.OrderedType) = struct\n    include Set.Make(Ord)\n\n    let nempty st = not @@ is_empty st\n    let sing = singleton\n    let nmem x st = not @@ mem x st\n\n    let foldl f s z = fold (fun x a -> f a x) z s\n\n    let size = cardinal\n  end\n\n  let nempty st = not @@ is_empty st\n  let sing = singleton\n  let nmem x st = not @@ mem x st\n\n  let foldl f s z = fold (fun x a -> f a x) z s\n\n  let size = cardinal\nend\n\nmodule Ss = StaleSortedSet\n\nmodule StaleSortedMap  = struct\n  include Map\n\n  module Make (Ord : Map.OrderedType) = struct\n    include Map.Make(Ord)\n\n    let nempty st = not @@ is_empty st\n    let sing = singleton\n    let nmem x st = not @@ mem x st\n\n    let get = find\n    let get_or x d m = find_default d x m\n\n    let size = cardinal\n  end\n\n  let nempty st = not @@ is_empty st\n  let sing = singleton\n  let nmem x st = not @@ mem x st\n\n  let get = find\n  let get_or x d m = find_default d x m\n\n  let size = cardinal\nend\n\nmodule Ms = StaleSortedMap\n\n\nmodule StaleRange = struct\n\n  type t = Range of int * int\n\n  let make lb ub = Range (lb, ub)\n\n  let to_list r =\n    let Range (lb, ub) = r in\n    L.make (ub - lb) ((+) lb) \n\n  let to_array r =\n    let Range (lb, ub) = r in\n      A.make (ub - lb) ((+) lb)\n\n  let iter r f = \n    let Range (lb, ub) = r in\n    for i = lb to ub do f i done\n\n  let iter2 r1 r2 f =\n    let Range (lb1, ub1) = r1 and Range (lb2, ub2) = r2 in\n      for i = lb1 to ub2 do\n        for j = lb2 to ub2 do\n          f i j\n        done\n      done\nend\n\nmodule R = StaleRange\n\nlet (---) lb ub = R.make lb ub\nlet (--^) lb ub = R.make lb (ub - 1)\n\nmodule StaleGenericAlgorithms = struct\n\n  let set_power ls =\n    let rec loop ls pls =\n      match ls with\n      | [] -> pls\n      | hd::tl -> loop tl (L.flatmap (fun p -> [p; hd::p]) pls)\n    in loop ls [[]]\n\n  let rec bsearch_max_int f lb ub =\n    if lb >= ub then (if f lb then lb else (lb - 1))\n    else (\n      let m = (lb + ub) / 2 in\n      if f m then bsearch_max_int f (m + 1) ub\n      else bsearch_max_int f lb m\n    )\n\n  let partial_sum n ls =\n    let rec loop s k = function\n      | [] -> s\n      | h::t ->\n        if k >= n then s\n        else loop (s + h) (k + 1) t\n    in\n    loop 0 0 ls\n\nend\n\nmodule Gal = StaleGenericAlgorithms\n\nlet rds () = read_line ()\n\nlet rdi () = s2i @@ rds ()\n\nlet rdhs () = spsp @@ rds ()\nlet rdhi () = rdhs () |> L.map s2i\n\nlet rdhf () = rdhs () |> L.map s2f\n\nlet rdf2 () = match rdhf () with\n| a::b::_ -> (a, b)\n| _ -> (0., 0.)\n\nlet rdf3 () = match rdhf () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0., 0., 0.)\n\nlet rdf4 () = match rdhf () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0., 0., 0., 0.)\n\nlet rds2 () = match rdhs () with\n  | a::b::_ -> (a, b)\n  | _ -> (\"\", \"\")\n\nlet rdi2 () = match rdhi () with\n  | a::b::_ -> (a, b)\n  | _ -> (0, 0)\n\nlet rdi3 () = match rdhi () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0, 0, 0)\n\nlet rdi4 () = match rdhi () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0, 0, 0, 0)\n\nlet rdi5 () = match rdhi () with\n| a::b::c::d::e::_ -> (a, b, c, d, e)\n| _ -> (0, 0, 0, 0, 0)\n\nlet rdv n rf =\n  let rec loop n =\n    if n <= 0 then []\n    else (\n      let s = rf () in\n      s::(loop (n - 1))\n    )\n  in loop n\n\nlet rdvi n = rdv n rdi\nlet rdvi2 n = rdv n rdi2\nlet rdvi3 n = rdv n rdi3\nlet rdvi4 n = rdv n rdi4\n\n\nlet print_list aa = \n  printf \"[ \"; aa |> L.iter (fun a -> printf \"%d \" a); puts \"]\"\n\nlet print_array aa = \n  printf \"[ \"; aa |> A.iter (fun a -> printf \"%d \" a); puts \"]\"\n\nlet print_carray aa = \n  printf \"[ \"; aa |> A.iter (fun a -> printf \"%c \" a); puts \"]\"\n\nlet print_matrix mat =\n  puts \"----\";\n  mat |> A.iter (fun r -> print_carray r);\n  puts \"----\"\n\n\nlet rec pow_mod x e m =\n  let rec loop a e' =\n    if e' = 0 then a mod m\n    else loop ((a * x) mod m) (e'-1)\n  in\n  loop 1 e\n\nlet _ =\n  let n = rdi () in\n  let m = 1000000007 in\n  let a = (pow_mod 10 n m) - 2 * (pow_mod 9 n m) + (pow_mod 8 n m) in\n  let ans = if a >= 0 then a mod m else (m - (-a) mod m) in\n  puti a;\n  ()\n", "language": "OCaml", "metadata": {"date": 1600024775, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02554.html", "problem_id": "p02554", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02554/input.txt", "sample_output_relpath": "derived/input_output/data/p02554/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02554/OCaml/s800987604.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s800987604", "user_id": "u970139668"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Batteries\nopen Printf\n\nlet ($) g f x = g (f x)\n\nlet swap = Tuple2.swap\n\nlet s2i = int_of_string\nlet i2s = string_of_int\nlet s2f = float_of_string\nlet f2s = string_of_float\nlet f2i = int_of_float\nlet i2f = float_of_int \n\nlet c2a = int_of_char\nlet a2c = char_of_int\n\nlet c2i c = c2a c - 48\nlet i2c i = a2c (i + 48)\n\nlet c2s = String.of_char\nlet s2cl = String.to_list\nlet cl2s = String.of_list\n\nlet puts s = print_endline s\nlet putw ?yn:(yn=(\"Yes\", \"No\")) b = puts (if b then fst yn else snd yn)\nlet puti i = puts @@ i2s i\n\n\n\nmodule StaleList = struct\n  include List\n\n  let nmem x l = not @@ mem x l\n\n  let len = length\n  let size = length\n  let nempty l = not @@ is_empty l\n\n  let hdop l = if nempty l then Some (hd l) else None\n\n  (* let taker = drop *)\n  let takewh = take_while\n\n  (* let dropr = take *)\n  let dropwh = drop_while\n\n  let split_by = span\n\n  let chunk = ntake\n\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr f z l = fold_right f l z\n  let foldri f z l = fold_righti f l z\n\n  let partition_to_map f l =\n    foldr (fun x m -> Map.modify_opt (f x) (function\n      | None -> Some [x] \n      | Some [] -> Some [x] \n      | Some vl -> Some (x::vl)) m) Map.empty l;;\n\n  let scanl f z ls =\n    let rec loop acl acc = function\n      | [] -> rev acl\n      | h::t ->\n        let r = f acc h in\n        loop (r::acl) r t\n    in loop [] z ls\n\n  let scanr f z ls =\n    let rec loop acl acc = function\n      | [] -> acl \n      | h::t ->\n        let r = f h acc in\n        loop (r::acl) r t\n    in loop [] z (rev ls)\n\n  (* let scanli = scan_lefti *)\n  (* let scanri = scan_righti *)\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\n\nend\n\nmodule L = StaleList\n\nmodule StaleArray = struct\n  include Array \n\n  let nmem x l = not @@ mem x l\n\n  let len = length\n  let size = length\n  let is_empty r = len r = 0\n  let nempty r = len r > 0\n\n  let take n r = left r n\n  let taker n r = right r n\n\n  let takeb x r =\n    let l = len r in\n    let rec loop i =\n      if i >= l then r\n      else if r.(i) = x then take i r\n      else loop (i + 1)\n    in loop 0\n     \n  (* let takewh = take_while *)\n\n  let drop n r = tail r n\n  let dropr n r = take ((len r) - n) r\n  (* let dropwh = drop_while *)\n\n  let index_of x r =\n    let l = len r in\n    let rec loop i =\n      if i >= l then None\n      else if r.(i) = x then Some i\n      else loop (i + 1)\n    in loop 0\n\n  (* let split_by = span *)\n\n  (* let chunk = ntake *)\n\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr f z l = fold_right f l z\n  let foldri f z l = fold_righti f l z\n\n  (* let partition_to_map f l = *)\n  (*   foldr (fun x m -> Map.modify_opt (f x) (function *)\n  (*     | None -> Some [x]  *)\n  (*     | Some [] -> Some [x]  *)\n  (*     | Some vl -> Some (x::vl)) m) Map.empty l;; *)\n\n  (* let scanl = scan_left *)\n  (* let scanli = scan_lefti *)\n  (* let scanr = scan_right *)\n  (* let scanri = scan_righti *)\n  \n  let concat2 = append\n  \n  let flatmap (f : 'a -> 'b array) a =\n    map f a |> enum |> L.of_enum |> concat\n\n  let zipf = map2\n  (* let zipfi = map2i *)\n\nend\n\nmodule A = StaleArray\n\nmodule StaleString = struct\n  include String\n\n  let len = length\n\n  let replace_chars = map\n  let map = replace\n\n  let maptol f s = L.map f (s2cl s)\n  let maptoli f s = L.map f (s2cl s)\n\n  let zipf f a b = L.zipf f (s2cl a) (s2cl b)\n  let zipfi f a b = L.zipfi f (s2cl a) (s2cl b)\n\n  let mkstr f sep ls =\n    L.foldl (fun acc x -> acc ^ sep ^ (f x)) (f @@ L.hd ls) (List.tl ls)\n\nend\n\nmodule S = StaleString\n\nlet spsp s = S.split_on_char ' ' s\n\n\nmodule StaleSortedSet = struct\n  include Set\n\n  module Make (Ord : Set.OrderedType) = struct\n    include Set.Make(Ord)\n\n    let nempty st = not @@ is_empty st\n    let sing = singleton\n    let nmem x st = not @@ mem x st\n\n    let foldl f s z = fold (fun x a -> f a x) z s\n\n    let size = cardinal\n  end\n\n  let nempty st = not @@ is_empty st\n  let sing = singleton\n  let nmem x st = not @@ mem x st\n\n  let foldl f s z = fold (fun x a -> f a x) z s\n\n  let size = cardinal\nend\n\nmodule Ss = StaleSortedSet\n\nmodule StaleSortedMap  = struct\n  include Map\n\n  module Make (Ord : Map.OrderedType) = struct\n    include Map.Make(Ord)\n\n    let nempty st = not @@ is_empty st\n    let sing = singleton\n    let nmem x st = not @@ mem x st\n\n    let get = find\n    let get_or x d m = find_default d x m\n\n    let size = cardinal\n  end\n\n  let nempty st = not @@ is_empty st\n  let sing = singleton\n  let nmem x st = not @@ mem x st\n\n  let get = find\n  let get_or x d m = find_default d x m\n\n  let size = cardinal\nend\n\nmodule Ms = StaleSortedMap\n\n\nmodule StaleRange = struct\n\n  type t = Range of int * int\n\n  let make lb ub = Range (lb, ub)\n\n  let to_list r =\n    let Range (lb, ub) = r in\n    L.make (ub - lb) ((+) lb) \n\n  let to_array r =\n    let Range (lb, ub) = r in\n      A.make (ub - lb) ((+) lb)\n\n  let iter r f = \n    let Range (lb, ub) = r in\n    for i = lb to ub do f i done\n\n  let iter2 r1 r2 f =\n    let Range (lb1, ub1) = r1 and Range (lb2, ub2) = r2 in\n      for i = lb1 to ub2 do\n        for j = lb2 to ub2 do\n          f i j\n        done\n      done\nend\n\nmodule R = StaleRange\n\nlet (---) lb ub = R.make lb ub\nlet (--^) lb ub = R.make lb (ub - 1)\n\nmodule StaleGenericAlgorithms = struct\n\n  let set_power ls =\n    let rec loop ls pls =\n      match ls with\n      | [] -> pls\n      | hd::tl -> loop tl (L.flatmap (fun p -> [p; hd::p]) pls)\n    in loop ls [[]]\n\n  let rec bsearch_max_int f lb ub =\n    if lb >= ub then (if f lb then lb else (lb - 1))\n    else (\n      let m = (lb + ub) / 2 in\n      if f m then bsearch_max_int f (m + 1) ub\n      else bsearch_max_int f lb m\n    )\n\n  let partial_sum n ls =\n    let rec loop s k = function\n      | [] -> s\n      | h::t ->\n        if k >= n then s\n        else loop (s + h) (k + 1) t\n    in\n    loop 0 0 ls\n\nend\n\nmodule Gal = StaleGenericAlgorithms\n\nlet rds () = read_line ()\n\nlet rdi () = s2i @@ rds ()\n\nlet rdhs () = spsp @@ rds ()\nlet rdhi () = rdhs () |> L.map s2i\n\nlet rdhf () = rdhs () |> L.map s2f\n\nlet rdf2 () = match rdhf () with\n| a::b::_ -> (a, b)\n| _ -> (0., 0.)\n\nlet rdf3 () = match rdhf () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0., 0., 0.)\n\nlet rdf4 () = match rdhf () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0., 0., 0., 0.)\n\nlet rds2 () = match rdhs () with\n  | a::b::_ -> (a, b)\n  | _ -> (\"\", \"\")\n\nlet rdi2 () = match rdhi () with\n  | a::b::_ -> (a, b)\n  | _ -> (0, 0)\n\nlet rdi3 () = match rdhi () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0, 0, 0)\n\nlet rdi4 () = match rdhi () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0, 0, 0, 0)\n\nlet rdi5 () = match rdhi () with\n| a::b::c::d::e::_ -> (a, b, c, d, e)\n| _ -> (0, 0, 0, 0, 0)\n\nlet rdv n rf =\n  let rec loop n =\n    if n <= 0 then []\n    else (\n      let s = rf () in\n      s::(loop (n - 1))\n    )\n  in loop n\n\nlet rdvi n = rdv n rdi\nlet rdvi2 n = rdv n rdi2\nlet rdvi3 n = rdv n rdi3\nlet rdvi4 n = rdv n rdi4\n\n\nlet print_list aa = \n  printf \"[ \"; aa |> L.iter (fun a -> printf \"%d \" a); puts \"]\"\n\nlet print_array aa = \n  printf \"[ \"; aa |> A.iter (fun a -> printf \"%d \" a); puts \"]\"\n\nlet print_carray aa = \n  printf \"[ \"; aa |> A.iter (fun a -> printf \"%c \" a); puts \"]\"\n\nlet print_matrix mat =\n  puts \"----\";\n  mat |> A.iter (fun r -> print_carray r);\n  puts \"----\"\n\n\nlet rec pow_mod x e m =\n  let rec loop a e' =\n    if e' = 0 then a mod m\n    else loop ((a * x) mod m) (e'-1)\n  in\n  loop 1 e\n\nlet _ =\n  let n = rdi () in\n  let m = 1000000007 in\n  let a = (pow_mod 10 n m) - 2 * (pow_mod 9 n m) + (pow_mod 8 n m) in\n  let ans = if a >= 0 then a mod m else (m - (-a) mod m) in\n  puti a;\n  ()\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nHow many integer sequences A_1,A_2,\\ldots,A_N of length N satisfy all of the following conditions?\n\n0 \\leq A_i \\leq 9\n\nThere exists some i such that A_i=0 holds.\n\nThere exists some i such that A_i=9 holds.\n\nThe answer can be very large, so output it modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^9 + 7.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n2\n\nTwo sequences \\{0,9\\} and \\{9,0\\} satisfy all conditions.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0\n\nSample Input 3\n\n869121\n\nSample Output 3\n\n2511445", "sample_input": "2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02554", "source_text": "Score : 300 points\n\nProblem Statement\n\nHow many integer sequences A_1,A_2,\\ldots,A_N of length N satisfy all of the following conditions?\n\n0 \\leq A_i \\leq 9\n\nThere exists some i such that A_i=0 holds.\n\nThere exists some i such that A_i=9 holds.\n\nThe answer can be very large, so output it modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^9 + 7.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n2\n\nTwo sequences \\{0,9\\} and \\{9,0\\} satisfy all conditions.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0\n\nSample Input 3\n\n869121\n\nSample Output 3\n\n2511445", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7545, "cpu_time_ms": 59, "memory_kb": 5568}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s123435329", "group_id": "codeNet:p02561", "input_text": "module type CapType = sig\n    type t\n    val zero : t\n    val cap_max : t\n    val add : t -> t -> t\n    val sub : t -> t -> t\nend ;;\n\nmodule CapInt : CapType with type t = int = struct\n    type t = int\n    let zero = 0\n    let cap_max = max_int\n    let add = (+)\n    let sub = (-)\nend\n\nmodule type S = sig\n    type t\n    type cap\n\n    val create      : int -> int -> t\n    val add_edge    : t -> int -> int -> cap -> t\n    val get_edge    : t -> int -> int * int * cap * cap\n    val edges       : t -> (int * int * cap * cap) array\n    val change_edge : t -> int -> cap -> cap -> unit\n    val flow        : t -> int -> int -> cap\nend;;\n\nmodule Mf_graph = struct\n    module Make(Cap: CapType) : S with type cap = Cap.t = struct\n        type cap = Cap.t\n\n        type edge = { to_: int; rev: int; mutable cap : cap }\n        type t = int * int * int list array * edge array\n\n        let create n m =\n            n, 0, Array.make n [], Array.init (m * 2) (fun _ -> { to_ = 0; rev = 0; cap = Cap.zero } )\n\n        let get_edge (n, idx, g, pos) i =\n            let _e = pos.(i * 2) in\n            let _re = pos.(_e.rev) in\n            _re.to_, _e.to_, Cap.add _e.cap _re.cap, _re.cap\n\n        let edges ((n, idx, g, pos) as mf) =\n            Array.init (idx / 2) (fun i -> get_edge mf i)\n\n        let change_edge (n, idx, g, pos) i new_cap new_flow =\n            let _e = pos.(i * 2) in\n            let _re = pos.(_e.rev) in\n            _e.cap <- Cap.sub new_cap new_flow;\n            _re.cap <- new_flow\n\n        let add_edge (n, idx, g, pos) from to_ cap =\n            pos.(idx)     <- { to_ = to_;  rev = idx + 1; cap = cap  };\n            pos.(idx + 1) <- { to_ = from; rev = idx;     cap = Cap.zero };\n            g.(from) <- idx :: g.(from);\n            g.(to_)  <- (idx + 1) :: g.(to_);\n            n, idx + 2, g, pos\n\n        let flow mf s t =\n            let flow (n, idx, g, pos) s t flow_limit =\n                let bfs () =\n                    let level = Array.make n (-1) in\n                    level.(s) <- 0;\n\n                    let rec loop fq bq =\n                        match fq with\n                        | [] -> if bq = [] then level else loop (List.rev bq) []\n                        | v :: vs -> (\n                            let rec loop2 bq = function\n                                | [] -> loop vs bq\n                                | e :: es ->\n                                        let e = pos.(e) in\n                                        if e.cap = Cap.zero || level.(e.to_) >= 0 then loop2 bq es else (\n                                            level.(e.to_) <- level.(v) + 1;\n                                            if e.to_ = t then level else loop2 (e.to_ :: bq) es\n                                        )\n                            in\n                            loop2 bq g.(v)\n                        )\n                    in\n                    loop [ s ] []\n                in\n                let rec dfs level iter v up =\n                    if v = s then up else\n                        let level_v = level.(v) in\n                        let rec loop res iis =\n                            iter.(v) <- iis;\n                            match iis with\n                            | [] -> res\n                            | i :: is ->\n                                let e = pos.(i) in\n                                if level_v <= level.(e.to_) || pos.(e.rev).cap = Cap.zero then loop res is else\n                                    let d = dfs level iter e.to_ (min (Cap.sub up res) pos.(e.rev).cap) in\n                                    if d <= Cap.zero then loop res is else (\n                                        pos.(i).cap     <- Cap.add pos.(i).cap d;\n                                        pos.(e.rev).cap <- Cap.sub pos.(e.rev).cap d;\n                                        let res = Cap.add res d in\n                                        if res = up then res else loop res is\n                                    )\n                        in\n                        loop Cap.zero iter.(v)\n                in\n                let rec flow_loop flow =\n                    if flow >= flow_limit then flow else\n                        let level = bfs () in\n                        if level.(t) = -1 then flow else\n                            let iter = Array.copy g in\n                            let rec loop flow =\n                                if flow < flow_limit then (\n                                    let f = dfs level iter t (Cap.sub flow_limit flow) in\n                                    if f = Cap.zero then flow else\n                                        loop (Cap.add flow f)\n                                ) else flow\n                            in\n                            flow_loop (loop flow)\n                in\n                flow_loop Cap.zero\n\n            in\n            flow mf s t Cap.cap_max\n    end\nend;;\n\nScanf.scanf \"%d %d\" (fun n m ->\n    let ss = Array.init n (fun _ -> Scanf.scanf \" %s\" (fun s -> s)) in\n\n    let module MF = Mf_graph.Make (CapInt) in\n    let mf = MF.create (n * m + 2) (n * m * 3) in\n    let s = n * m in\n    let t = n * m + 1 in\n    let rec loop_y y mf =\n        let rec loop_x x mf =\n            if x = m then loop_y (y + 1) mf else\n                let pivot = y * m + x in\n                let mf = if ss.(y).[x] = '#' then mf else (\n                    if (x + y) mod 2 <> 0 then MF.add_edge mf pivot t 1 else (\n                        let mf = MF.add_edge mf s pivot 1 in\n                        let mf = if y > 0     && ss.(y - 1).[x] = '.' then MF.add_edge mf pivot ((y - 1) * m + x) 1 else mf in\n                        let mf = if y < n - 1 && ss.(y + 1).[x] = '.' then MF.add_edge mf pivot ((y + 1) * m + x) 1 else mf in\n                        let mf = if x > 0     && ss.(y).[x - 1] = '.' then MF.add_edge mf pivot (y * m + x - 1)   1 else mf in\n                        let mf = if x < m - 1 && ss.(y).[x + 1] = '.' then MF.add_edge mf pivot (y * m + x + 1)   1 else mf in\n                        mf\n                    )\n                )\n                in\n                loop_x (x + 1) mf\n        in\n        if y = n then mf else loop_x 0 mf\n    in\n    let mf = loop_y 0 mf in\n    let f = MF.flow mf s t in\n    let ar = MF.edges mf in\n    let map = Array.make_matrix n m ' ' in\n    for y = 0 to n - 1 do\n        for x = 0 to m - 1 do\n            map.(y).(x) <- ss.(y).[x]\n        done\n    done;\n    Array.iter (fun (from, to_, c1, c2) -> if c2 > 0 && from <> s && to_ <> t then (\n        let prt p1 c1 p2 c2 =\n            let prt2 p c =\n                let y = p / m in\n                let x = p mod m in\n                map.(y).(x) <- c\n            in\n            prt2 p1 c1; prt2 p2 c2\n        in\n        if from + m = to_  then prt from 'v' to_ '^' else\n        if to_  + m = from then prt from '^' to_ 'v' else\n        if from + 1 = to_  then prt from '>' to_ '<' else\n        if to_  + 1 = from then prt from '<' to_ '>'\n    )) ar;\n    Printf.printf \"%d\\n\" f;\n    Array.iter (fun arr ->\n        Array.iter print_char arr;\n        print_newline ()\n    ) map\n)", "language": "OCaml", "metadata": {"date": 1600738894, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02561.html", "problem_id": "p02561", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02561/input.txt", "sample_output_relpath": "derived/input_output/data/p02561/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02561/OCaml/s123435329.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s123435329", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n#><\nvv#\n^^.\n", "input_to_evaluate": "module type CapType = sig\n    type t\n    val zero : t\n    val cap_max : t\n    val add : t -> t -> t\n    val sub : t -> t -> t\nend ;;\n\nmodule CapInt : CapType with type t = int = struct\n    type t = int\n    let zero = 0\n    let cap_max = max_int\n    let add = (+)\n    let sub = (-)\nend\n\nmodule type S = sig\n    type t\n    type cap\n\n    val create      : int -> int -> t\n    val add_edge    : t -> int -> int -> cap -> t\n    val get_edge    : t -> int -> int * int * cap * cap\n    val edges       : t -> (int * int * cap * cap) array\n    val change_edge : t -> int -> cap -> cap -> unit\n    val flow        : t -> int -> int -> cap\nend;;\n\nmodule Mf_graph = struct\n    module Make(Cap: CapType) : S with type cap = Cap.t = struct\n        type cap = Cap.t\n\n        type edge = { to_: int; rev: int; mutable cap : cap }\n        type t = int * int * int list array * edge array\n\n        let create n m =\n            n, 0, Array.make n [], Array.init (m * 2) (fun _ -> { to_ = 0; rev = 0; cap = Cap.zero } )\n\n        let get_edge (n, idx, g, pos) i =\n            let _e = pos.(i * 2) in\n            let _re = pos.(_e.rev) in\n            _re.to_, _e.to_, Cap.add _e.cap _re.cap, _re.cap\n\n        let edges ((n, idx, g, pos) as mf) =\n            Array.init (idx / 2) (fun i -> get_edge mf i)\n\n        let change_edge (n, idx, g, pos) i new_cap new_flow =\n            let _e = pos.(i * 2) in\n            let _re = pos.(_e.rev) in\n            _e.cap <- Cap.sub new_cap new_flow;\n            _re.cap <- new_flow\n\n        let add_edge (n, idx, g, pos) from to_ cap =\n            pos.(idx)     <- { to_ = to_;  rev = idx + 1; cap = cap  };\n            pos.(idx + 1) <- { to_ = from; rev = idx;     cap = Cap.zero };\n            g.(from) <- idx :: g.(from);\n            g.(to_)  <- (idx + 1) :: g.(to_);\n            n, idx + 2, g, pos\n\n        let flow mf s t =\n            let flow (n, idx, g, pos) s t flow_limit =\n                let bfs () =\n                    let level = Array.make n (-1) in\n                    level.(s) <- 0;\n\n                    let rec loop fq bq =\n                        match fq with\n                        | [] -> if bq = [] then level else loop (List.rev bq) []\n                        | v :: vs -> (\n                            let rec loop2 bq = function\n                                | [] -> loop vs bq\n                                | e :: es ->\n                                        let e = pos.(e) in\n                                        if e.cap = Cap.zero || level.(e.to_) >= 0 then loop2 bq es else (\n                                            level.(e.to_) <- level.(v) + 1;\n                                            if e.to_ = t then level else loop2 (e.to_ :: bq) es\n                                        )\n                            in\n                            loop2 bq g.(v)\n                        )\n                    in\n                    loop [ s ] []\n                in\n                let rec dfs level iter v up =\n                    if v = s then up else\n                        let level_v = level.(v) in\n                        let rec loop res iis =\n                            iter.(v) <- iis;\n                            match iis with\n                            | [] -> res\n                            | i :: is ->\n                                let e = pos.(i) in\n                                if level_v <= level.(e.to_) || pos.(e.rev).cap = Cap.zero then loop res is else\n                                    let d = dfs level iter e.to_ (min (Cap.sub up res) pos.(e.rev).cap) in\n                                    if d <= Cap.zero then loop res is else (\n                                        pos.(i).cap     <- Cap.add pos.(i).cap d;\n                                        pos.(e.rev).cap <- Cap.sub pos.(e.rev).cap d;\n                                        let res = Cap.add res d in\n                                        if res = up then res else loop res is\n                                    )\n                        in\n                        loop Cap.zero iter.(v)\n                in\n                let rec flow_loop flow =\n                    if flow >= flow_limit then flow else\n                        let level = bfs () in\n                        if level.(t) = -1 then flow else\n                            let iter = Array.copy g in\n                            let rec loop flow =\n                                if flow < flow_limit then (\n                                    let f = dfs level iter t (Cap.sub flow_limit flow) in\n                                    if f = Cap.zero then flow else\n                                        loop (Cap.add flow f)\n                                ) else flow\n                            in\n                            flow_loop (loop flow)\n                in\n                flow_loop Cap.zero\n\n            in\n            flow mf s t Cap.cap_max\n    end\nend;;\n\nScanf.scanf \"%d %d\" (fun n m ->\n    let ss = Array.init n (fun _ -> Scanf.scanf \" %s\" (fun s -> s)) in\n\n    let module MF = Mf_graph.Make (CapInt) in\n    let mf = MF.create (n * m + 2) (n * m * 3) in\n    let s = n * m in\n    let t = n * m + 1 in\n    let rec loop_y y mf =\n        let rec loop_x x mf =\n            if x = m then loop_y (y + 1) mf else\n                let pivot = y * m + x in\n                let mf = if ss.(y).[x] = '#' then mf else (\n                    if (x + y) mod 2 <> 0 then MF.add_edge mf pivot t 1 else (\n                        let mf = MF.add_edge mf s pivot 1 in\n                        let mf = if y > 0     && ss.(y - 1).[x] = '.' then MF.add_edge mf pivot ((y - 1) * m + x) 1 else mf in\n                        let mf = if y < n - 1 && ss.(y + 1).[x] = '.' then MF.add_edge mf pivot ((y + 1) * m + x) 1 else mf in\n                        let mf = if x > 0     && ss.(y).[x - 1] = '.' then MF.add_edge mf pivot (y * m + x - 1)   1 else mf in\n                        let mf = if x < m - 1 && ss.(y).[x + 1] = '.' then MF.add_edge mf pivot (y * m + x + 1)   1 else mf in\n                        mf\n                    )\n                )\n                in\n                loop_x (x + 1) mf\n        in\n        if y = n then mf else loop_x 0 mf\n    in\n    let mf = loop_y 0 mf in\n    let f = MF.flow mf s t in\n    let ar = MF.edges mf in\n    let map = Array.make_matrix n m ' ' in\n    for y = 0 to n - 1 do\n        for x = 0 to m - 1 do\n            map.(y).(x) <- ss.(y).[x]\n        done\n    done;\n    Array.iter (fun (from, to_, c1, c2) -> if c2 > 0 && from <> s && to_ <> t then (\n        let prt p1 c1 p2 c2 =\n            let prt2 p c =\n                let y = p / m in\n                let x = p mod m in\n                map.(y).(x) <- c\n            in\n            prt2 p1 c1; prt2 p2 c2\n        in\n        if from + m = to_  then prt from 'v' to_ '^' else\n        if to_  + m = from then prt from '^' to_ 'v' else\n        if from + 1 = to_  then prt from '>' to_ '<' else\n        if to_  + 1 = from then prt from '<' to_ '>'\n    )) ar;\n    Printf.printf \"%d\\n\" f;\n    Array.iter (fun arr ->\n        Array.iter print_char arr;\n        print_newline ()\n    ) map\n)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a grid of N rows and M columns. The square at the i-th row and j-th column will be denoted as (i,j).\nSome of the squares contain an object. All the remaining squares are empty.\nThe state of the grid is represented by strings S_1,S_2,\\cdots,S_N. The square (i,j) contains an object if S_{i,j}= # and is empty if S_{i,j}= ..\n\nConsider placing 1 \\times 2 tiles on the grid. Tiles can be placed vertically or horizontally to cover two adjacent empty squares.\nTiles must not stick out of the grid, and no two different tiles may intersect. Tiles cannot occupy the square with an object.\n\nCalculate the maximum number of tiles that can be placed and any configulation that acheives the maximum.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq M \\leq 100\n\nS_i is a string with length M consists of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nS_1\nS_2\n\\vdots\nS_N\n\nOutput\n\nOn the first line, print the maximum number of tiles that can be placed.\n\nOn the next N lines, print a configulation that achieves the maximum.\nPrecisely, output the strings t_1,t_2,\\cdots,t_N constructed by the following way.\n\nt_i is initialized to S_i.\n\nFor each (i,j), if there is a tile that occupies (i,j) and (i+1,j), change t_{i,j}:=v, t_{i+1,j}:=^.\n\nFor each (i,j), if there is a tile that occupies (i,j) and (i,j+1), change t_{i,j}:=>, t_{i,j+1}:=<.\n\nSee samples for further information.\n\nYou may print any configulation that maximizes the number of tiles.\n\nSample Input 1\n\n3 3\n#..\n..#\n...\n\nSample Output 1\n\n3\n#><\nvv#\n^^.\n\nThe following output is also treated as a correct answer.\n\n3\n#><\nv.#\n^><", "sample_input": "3 3\n#..\n..#\n...\n"}, "reference_outputs": ["3\n#><\nvv#\n^^.\n"], "source_document_id": "p02561", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a grid of N rows and M columns. The square at the i-th row and j-th column will be denoted as (i,j).\nSome of the squares contain an object. All the remaining squares are empty.\nThe state of the grid is represented by strings S_1,S_2,\\cdots,S_N. The square (i,j) contains an object if S_{i,j}= # and is empty if S_{i,j}= ..\n\nConsider placing 1 \\times 2 tiles on the grid. Tiles can be placed vertically or horizontally to cover two adjacent empty squares.\nTiles must not stick out of the grid, and no two different tiles may intersect. Tiles cannot occupy the square with an object.\n\nCalculate the maximum number of tiles that can be placed and any configulation that acheives the maximum.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq M \\leq 100\n\nS_i is a string with length M consists of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nS_1\nS_2\n\\vdots\nS_N\n\nOutput\n\nOn the first line, print the maximum number of tiles that can be placed.\n\nOn the next N lines, print a configulation that achieves the maximum.\nPrecisely, output the strings t_1,t_2,\\cdots,t_N constructed by the following way.\n\nt_i is initialized to S_i.\n\nFor each (i,j), if there is a tile that occupies (i,j) and (i+1,j), change t_{i,j}:=v, t_{i+1,j}:=^.\n\nFor each (i,j), if there is a tile that occupies (i,j) and (i,j+1), change t_{i,j}:=>, t_{i,j+1}:=<.\n\nSee samples for further information.\n\nYou may print any configulation that maximizes the number of tiles.\n\nSample Input 1\n\n3 3\n#..\n..#\n...\n\nSample Output 1\n\n3\n#><\nvv#\n^^.\n\nThe following output is also treated as a correct answer.\n\n3\n#><\nv.#\n^><", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7096, "cpu_time_ms": 44, "memory_kb": 13288}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s446543550", "group_id": "codeNet:p02561", "input_text": "module type CapType = sig\n    type t\n    val zero : t\n    val cap_max : t\n    val add : t -> t -> t\n    val sub : t -> t -> t\n    val to_int : t -> int\nend ;;\n\nmodule CapInt : CapType with type t = int = struct\n    type t = int\n    let zero = 0\n    let cap_max = max_int\n    let add = (+)\n    let sub = (-)\n    let to_int a = a\nend\n\nmodule type S = sig\n    type t\n    type cap\n\n    val create      : int -> int -> t\n    val add_edge    : t -> int -> int -> cap -> t\n    val get_edge    : t -> int -> int * int * cap * cap\n    val edges       : t -> (int * int * cap * cap) array\n    val change_edge : t -> int -> cap -> cap -> unit\n    val flow        : t -> int -> int -> cap\nend;;\n\nmodule Mf_graph = struct\n    module Make(Cap: CapType) : S with type cap = Cap.t = struct\n        type cap = Cap.t\n\n        type edge = { to_: int; rev: int; mutable cap : cap }\n        type t = int * int * int list array * edge array\n\n        let create n m =\n            n, 0, Array.make n [], Array.init (m * 2) (fun _ -> { to_ = 0; rev = 0; cap = Cap.zero } )\n\n        let get_edge (n, idx, g, pos) i =\n            let _e = pos.(i * 2) in\n            let _re = pos.(_e.rev) in\n            _re.to_, _e.to_, Cap.add _e.cap _re.cap, _re.cap\n\n        let edges ((n, idx, g, pos) as mf) =\n            Array.init (idx / 2) (fun i -> get_edge mf i)\n\n        let change_edge (n, idx, g, pos) i new_cap new_flow =\n            let _e = pos.(i * 2) in\n            let _re = pos.(_e.rev) in\n            _e.cap <- Cap.sub new_cap new_flow;\n            _re.cap <- new_flow\n\n        let add_edge (n, idx, g, pos) from to_ cap =\n            pos.(idx)     <- { to_ = to_;  rev = idx + 1; cap = cap  };\n            pos.(idx + 1) <- { to_ = from; rev = idx;     cap = Cap.zero };\n            g.(from) <- idx :: g.(from);\n            g.(to_)  <- (idx + 1) :: g.(to_);\n            n, idx + 2, g, pos\n\n        let flow mf s t =\n            let flow (n, idx, g, pos) s t flow_limit =\n                let bfs () =\n                    let level = Array.make n (-1) in\n                    level.(s) <- 0;\n\n                    let rec loop fq bq =\n                        match fq with\n                        | [] -> if bq = [] then level else loop (List.rev bq) []\n                        | v :: vs -> (\n                            let rec loop2 bq = function\n                                | [] -> loop vs bq\n                                | e :: es ->\n                                        let e = pos.(e) in\n                                        if e.cap = Cap.zero || level.(e.to_) >= 0 then loop2 bq es else (\n                                            level.(e.to_) <- level.(v) + 1;\n                                            if e.to_ = t then level else loop2 (e.to_ :: bq) es\n                                        )\n                            in\n                            loop2 bq g.(v)\n                        )\n                    in\n                    loop [ s ] []\n                in\n                let rec dfs level iter v up =\n                    if v = s then up else\n                        let level_v = level.(v) in\n                        let rec loop res iis =\n                            iter.(v) <- iis;\n                            match iis with\n                            | [] -> res\n                            | i :: is ->\n                                let e = pos.(i) in\n                                if level_v <= level.(e.to_) || pos.(e.rev).cap = Cap.zero then loop res is else\n                                    let d = dfs level iter e.to_ (min (Cap.sub up res) pos.(e.rev).cap) in\n                                    if d <= Cap.zero then loop res is else (\n                                        pos.(i).cap     <- Cap.add pos.(i).cap d;\n                                        pos.(e.rev).cap <- Cap.sub pos.(e.rev).cap d;\n                                        let res = Cap.add res d in\n                                        if res = up then res else loop res is\n                                    )\n                        in\n                        loop Cap.zero iter.(v)\n                in\n                let rec flow_loop flow =\n                    if flow >= flow_limit then flow else\n                        let level = bfs () in\n                        if level.(t) = -1 then flow else\n                            let iter = Array.copy g in\n                            let rec loop flow =\n                                if flow < flow_limit then (\n                                    let f = dfs level iter t (Cap.sub flow_limit flow) in\n                                    if f = Cap.zero then flow else\n                                        loop (Cap.add flow f)\n                                ) else flow\n                            in\n                            flow_loop (loop flow)\n                in\n                flow_loop Cap.zero\n\n            in\n            flow mf s t Cap.cap_max\n    end\nend;;\n\nScanf.scanf \"%d %d\" (fun n m ->\n    let ss = Array.init n (fun _ -> Scanf.scanf \" %s\" (fun s -> s)) in\n\n    let module MF = Mf_graph.Make (CapInt) in\n    let mf = MF.create (n * m + 2) (n * m * 3) in\n    let s = n * m in\n    let t = n * m + 1 in\n    let rec loop_y y mf =\n        let rec loop_x x mf =\n            if x = m then loop_y (y + 1) mf else\n                let pivot = y * m + x in\n                let mf = if ss.(y).[x] = '#' then mf else (\n                    if (x + y) mod 2 <> 0 then MF.add_edge mf pivot t 1 else (\n                        let mf = MF.add_edge mf s pivot 1 in\n                        let mf = if y > 0     && ss.(y - 1).[x] = '.' then MF.add_edge mf pivot ((y - 1) * m + x) 1 else mf in\n                        let mf = if y < n - 1 && ss.(y + 1).[x] = '.' then MF.add_edge mf pivot ((y + 1) * m + x) 1 else mf in\n                        let mf = if x > 0     && ss.(y).[x - 1] = '.' then MF.add_edge mf pivot (y * m + x - 1)   1 else mf in\n                        let mf = if x < m - 1 && ss.(y).[x + 1] = '.' then MF.add_edge mf pivot (y * m + x + 1)   1 else mf in\n                        mf\n                    )\n                )\n                in\n                loop_x (x + 1) mf\n        in\n        if y = n then mf else loop_x 0 mf\n    in\n    let mf = loop_y 0 mf in\n    let f = MF.flow mf s t in\n    let ar = MF.edges mf in\n    let map = Array.make_matrix n m ' ' in\n    for y = 0 to n - 1 do\n        for x = 0 to m - 1 do\n            map.(y).(x) <- ss.(y).[x]\n        done\n    done;\n    Array.iter (fun (from, to_, c1, c2) -> if c2 > 0 && from <> s && to_ <> t then (\n        let prt p1 c1 p2 c2 =\n            let prt2 p c =\n                let y = p / m in\n                let x = p mod m in\n                map.(y).(x) <- c\n            in\n            prt2 p1 c1; prt2 p2 c2\n        in\n        if from + m = to_  then prt from 'v' to_ '^' else\n        if to_  + m = from then prt from '^' to_ 'v' else\n        if from + 1 = to_  then prt from '>' to_ '<' else\n        if to_  + 1 = from then prt from '<' to_ '>'\n    )) ar;\n    Printf.printf \"%d\\n\" f;\n    for y = 0 to n - 1 do\n        for x = 0 to m - 1 do\n            print_char map.(y).(x)\n        done;\n        print_newline ()\n    done\n)", "language": "OCaml", "metadata": {"date": 1600738706, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02561.html", "problem_id": "p02561", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02561/input.txt", "sample_output_relpath": "derived/input_output/data/p02561/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02561/OCaml/s446543550.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s446543550", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n#><\nvv#\n^^.\n", "input_to_evaluate": "module type CapType = sig\n    type t\n    val zero : t\n    val cap_max : t\n    val add : t -> t -> t\n    val sub : t -> t -> t\n    val to_int : t -> int\nend ;;\n\nmodule CapInt : CapType with type t = int = struct\n    type t = int\n    let zero = 0\n    let cap_max = max_int\n    let add = (+)\n    let sub = (-)\n    let to_int a = a\nend\n\nmodule type S = sig\n    type t\n    type cap\n\n    val create      : int -> int -> t\n    val add_edge    : t -> int -> int -> cap -> t\n    val get_edge    : t -> int -> int * int * cap * cap\n    val edges       : t -> (int * int * cap * cap) array\n    val change_edge : t -> int -> cap -> cap -> unit\n    val flow        : t -> int -> int -> cap\nend;;\n\nmodule Mf_graph = struct\n    module Make(Cap: CapType) : S with type cap = Cap.t = struct\n        type cap = Cap.t\n\n        type edge = { to_: int; rev: int; mutable cap : cap }\n        type t = int * int * int list array * edge array\n\n        let create n m =\n            n, 0, Array.make n [], Array.init (m * 2) (fun _ -> { to_ = 0; rev = 0; cap = Cap.zero } )\n\n        let get_edge (n, idx, g, pos) i =\n            let _e = pos.(i * 2) in\n            let _re = pos.(_e.rev) in\n            _re.to_, _e.to_, Cap.add _e.cap _re.cap, _re.cap\n\n        let edges ((n, idx, g, pos) as mf) =\n            Array.init (idx / 2) (fun i -> get_edge mf i)\n\n        let change_edge (n, idx, g, pos) i new_cap new_flow =\n            let _e = pos.(i * 2) in\n            let _re = pos.(_e.rev) in\n            _e.cap <- Cap.sub new_cap new_flow;\n            _re.cap <- new_flow\n\n        let add_edge (n, idx, g, pos) from to_ cap =\n            pos.(idx)     <- { to_ = to_;  rev = idx + 1; cap = cap  };\n            pos.(idx + 1) <- { to_ = from; rev = idx;     cap = Cap.zero };\n            g.(from) <- idx :: g.(from);\n            g.(to_)  <- (idx + 1) :: g.(to_);\n            n, idx + 2, g, pos\n\n        let flow mf s t =\n            let flow (n, idx, g, pos) s t flow_limit =\n                let bfs () =\n                    let level = Array.make n (-1) in\n                    level.(s) <- 0;\n\n                    let rec loop fq bq =\n                        match fq with\n                        | [] -> if bq = [] then level else loop (List.rev bq) []\n                        | v :: vs -> (\n                            let rec loop2 bq = function\n                                | [] -> loop vs bq\n                                | e :: es ->\n                                        let e = pos.(e) in\n                                        if e.cap = Cap.zero || level.(e.to_) >= 0 then loop2 bq es else (\n                                            level.(e.to_) <- level.(v) + 1;\n                                            if e.to_ = t then level else loop2 (e.to_ :: bq) es\n                                        )\n                            in\n                            loop2 bq g.(v)\n                        )\n                    in\n                    loop [ s ] []\n                in\n                let rec dfs level iter v up =\n                    if v = s then up else\n                        let level_v = level.(v) in\n                        let rec loop res iis =\n                            iter.(v) <- iis;\n                            match iis with\n                            | [] -> res\n                            | i :: is ->\n                                let e = pos.(i) in\n                                if level_v <= level.(e.to_) || pos.(e.rev).cap = Cap.zero then loop res is else\n                                    let d = dfs level iter e.to_ (min (Cap.sub up res) pos.(e.rev).cap) in\n                                    if d <= Cap.zero then loop res is else (\n                                        pos.(i).cap     <- Cap.add pos.(i).cap d;\n                                        pos.(e.rev).cap <- Cap.sub pos.(e.rev).cap d;\n                                        let res = Cap.add res d in\n                                        if res = up then res else loop res is\n                                    )\n                        in\n                        loop Cap.zero iter.(v)\n                in\n                let rec flow_loop flow =\n                    if flow >= flow_limit then flow else\n                        let level = bfs () in\n                        if level.(t) = -1 then flow else\n                            let iter = Array.copy g in\n                            let rec loop flow =\n                                if flow < flow_limit then (\n                                    let f = dfs level iter t (Cap.sub flow_limit flow) in\n                                    if f = Cap.zero then flow else\n                                        loop (Cap.add flow f)\n                                ) else flow\n                            in\n                            flow_loop (loop flow)\n                in\n                flow_loop Cap.zero\n\n            in\n            flow mf s t Cap.cap_max\n    end\nend;;\n\nScanf.scanf \"%d %d\" (fun n m ->\n    let ss = Array.init n (fun _ -> Scanf.scanf \" %s\" (fun s -> s)) in\n\n    let module MF = Mf_graph.Make (CapInt) in\n    let mf = MF.create (n * m + 2) (n * m * 3) in\n    let s = n * m in\n    let t = n * m + 1 in\n    let rec loop_y y mf =\n        let rec loop_x x mf =\n            if x = m then loop_y (y + 1) mf else\n                let pivot = y * m + x in\n                let mf = if ss.(y).[x] = '#' then mf else (\n                    if (x + y) mod 2 <> 0 then MF.add_edge mf pivot t 1 else (\n                        let mf = MF.add_edge mf s pivot 1 in\n                        let mf = if y > 0     && ss.(y - 1).[x] = '.' then MF.add_edge mf pivot ((y - 1) * m + x) 1 else mf in\n                        let mf = if y < n - 1 && ss.(y + 1).[x] = '.' then MF.add_edge mf pivot ((y + 1) * m + x) 1 else mf in\n                        let mf = if x > 0     && ss.(y).[x - 1] = '.' then MF.add_edge mf pivot (y * m + x - 1)   1 else mf in\n                        let mf = if x < m - 1 && ss.(y).[x + 1] = '.' then MF.add_edge mf pivot (y * m + x + 1)   1 else mf in\n                        mf\n                    )\n                )\n                in\n                loop_x (x + 1) mf\n        in\n        if y = n then mf else loop_x 0 mf\n    in\n    let mf = loop_y 0 mf in\n    let f = MF.flow mf s t in\n    let ar = MF.edges mf in\n    let map = Array.make_matrix n m ' ' in\n    for y = 0 to n - 1 do\n        for x = 0 to m - 1 do\n            map.(y).(x) <- ss.(y).[x]\n        done\n    done;\n    Array.iter (fun (from, to_, c1, c2) -> if c2 > 0 && from <> s && to_ <> t then (\n        let prt p1 c1 p2 c2 =\n            let prt2 p c =\n                let y = p / m in\n                let x = p mod m in\n                map.(y).(x) <- c\n            in\n            prt2 p1 c1; prt2 p2 c2\n        in\n        if from + m = to_  then prt from 'v' to_ '^' else\n        if to_  + m = from then prt from '^' to_ 'v' else\n        if from + 1 = to_  then prt from '>' to_ '<' else\n        if to_  + 1 = from then prt from '<' to_ '>'\n    )) ar;\n    Printf.printf \"%d\\n\" f;\n    for y = 0 to n - 1 do\n        for x = 0 to m - 1 do\n            print_char map.(y).(x)\n        done;\n        print_newline ()\n    done\n)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a grid of N rows and M columns. The square at the i-th row and j-th column will be denoted as (i,j).\nSome of the squares contain an object. All the remaining squares are empty.\nThe state of the grid is represented by strings S_1,S_2,\\cdots,S_N. The square (i,j) contains an object if S_{i,j}= # and is empty if S_{i,j}= ..\n\nConsider placing 1 \\times 2 tiles on the grid. Tiles can be placed vertically or horizontally to cover two adjacent empty squares.\nTiles must not stick out of the grid, and no two different tiles may intersect. Tiles cannot occupy the square with an object.\n\nCalculate the maximum number of tiles that can be placed and any configulation that acheives the maximum.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq M \\leq 100\n\nS_i is a string with length M consists of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nS_1\nS_2\n\\vdots\nS_N\n\nOutput\n\nOn the first line, print the maximum number of tiles that can be placed.\n\nOn the next N lines, print a configulation that achieves the maximum.\nPrecisely, output the strings t_1,t_2,\\cdots,t_N constructed by the following way.\n\nt_i is initialized to S_i.\n\nFor each (i,j), if there is a tile that occupies (i,j) and (i+1,j), change t_{i,j}:=v, t_{i+1,j}:=^.\n\nFor each (i,j), if there is a tile that occupies (i,j) and (i,j+1), change t_{i,j}:=>, t_{i,j+1}:=<.\n\nSee samples for further information.\n\nYou may print any configulation that maximizes the number of tiles.\n\nSample Input 1\n\n3 3\n#..\n..#\n...\n\nSample Output 1\n\n3\n#><\nvv#\n^^.\n\nThe following output is also treated as a correct answer.\n\n3\n#><\nv.#\n^><", "sample_input": "3 3\n#..\n..#\n...\n"}, "reference_outputs": ["3\n#><\nvv#\n^^.\n"], "source_document_id": "p02561", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a grid of N rows and M columns. The square at the i-th row and j-th column will be denoted as (i,j).\nSome of the squares contain an object. All the remaining squares are empty.\nThe state of the grid is represented by strings S_1,S_2,\\cdots,S_N. The square (i,j) contains an object if S_{i,j}= # and is empty if S_{i,j}= ..\n\nConsider placing 1 \\times 2 tiles on the grid. Tiles can be placed vertically or horizontally to cover two adjacent empty squares.\nTiles must not stick out of the grid, and no two different tiles may intersect. Tiles cannot occupy the square with an object.\n\nCalculate the maximum number of tiles that can be placed and any configulation that acheives the maximum.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq M \\leq 100\n\nS_i is a string with length M consists of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nS_1\nS_2\n\\vdots\nS_N\n\nOutput\n\nOn the first line, print the maximum number of tiles that can be placed.\n\nOn the next N lines, print a configulation that achieves the maximum.\nPrecisely, output the strings t_1,t_2,\\cdots,t_N constructed by the following way.\n\nt_i is initialized to S_i.\n\nFor each (i,j), if there is a tile that occupies (i,j) and (i+1,j), change t_{i,j}:=v, t_{i+1,j}:=^.\n\nFor each (i,j), if there is a tile that occupies (i,j) and (i,j+1), change t_{i,j}:=>, t_{i,j+1}:=<.\n\nSee samples for further information.\n\nYou may print any configulation that maximizes the number of tiles.\n\nSample Input 1\n\n3 3\n#..\n..#\n...\n\nSample Output 1\n\n3\n#><\nvv#\n^^.\n\nThe following output is also treated as a correct answer.\n\n3\n#><\nv.#\n^><", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7185, "cpu_time_ms": 43, "memory_kb": 13292}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s153805862", "group_id": "codeNet:p02561", "input_text": "module type CapType = sig\n    type t\n    val zero : t\n    val cap_max : t\n    val add : t -> t -> t\n    val sub : t -> t -> t\nend ;;\n\nmodule CapInt : CapType with type t = int = struct\n    type t = int\n    let zero = 0\n    let cap_max = max_int\n    let add = (+)\n    let sub = (-)\nend\n\nmodule type S = sig\n    type t\n    type cap\n\n    val create : int -> int -> t\n    val add_edge : t -> int -> int -> cap -> t\n    val edges    : t -> (int * int * cap * cap) array\n    val get_edge : t -> int -> int * int * cap * cap\n    val flow     : t -> int -> int -> cap\nend;;\n\nmodule Mf_graph = struct\n    module Make(Cap: CapType) : S with type cap = Cap.t = struct\n        type cap = Cap.t\n\n        type edge = { to_: int; rev: int; mutable cap : cap }\n        type t = int * int * int list array * edge array\n\n        let create n m =\n            n, 0, Array.make n [], Array.init (m * 2) (fun _ -> { to_ = 0; rev = 0; cap = Cap.zero } )\n\n        let get_edge (n, idx, g, pos) i =\n            let _e = pos.(i * 2) in\n            let _re = pos.(_e.rev) in\n            _re.to_, _e.to_, Cap.add _e.cap _re.cap, _re.cap\n\n        let edges ((n, idx, g, pos) as mf) =\n            Array.init (idx / 2) (fun i -> get_edge mf i)\n\n        let add_edge (n, idx, g, pos) from to_ cap =\n            pos.(idx)     <- { to_ = to_;  rev = idx + 1; cap = cap  };\n            pos.(idx + 1) <- { to_ = from; rev = idx;     cap = Cap.zero };\n            g.(from) <- idx :: g.(from);\n            g.(to_)  <- (idx + 1) :: g.(to_);\n            n, idx + 2, g, pos\n\n        let flow mf s t =\n            let flow (n, idx, g, pos) s t flow_limit =\n                let rec bfs () =\n                    let level = Array.make n (-1) in\n                    level.(s) <- 0;\n\n                    let rec loop fq bq =\n                        match fq with\n                        | [] -> if bq = [] then level else loop (List.rev bq) []\n                        | v :: vs -> (\n                            let rec loop2 bq = function\n                                | [] -> loop vs bq\n                                | e :: es ->\n                                        let e = pos.(e) in\n                                        if e.cap = Cap.zero || level.(e.to_) >= 0 then loop2 bq es else (\n                                            level.(e.to_) <- level.(v) + 1;\n                                            if e.to_ = t then level else loop2 (e.to_ :: bq) es\n                                        )\n                            in\n                            loop2 bq g.(v)\n                        )\n                    in\n                    loop [ s ] []\n                in\n                let rec dfs level iter v up =\n                    if v = s then up else\n                        let level_v = level.(v) in\n                        let rec loop res iis =\n                            iter.(v) <- iis;\n                            match iis with\n                            | [] -> res\n                            | i :: is ->\n                                let e = pos.(i) in\n                                if level_v <= level.(e.to_) || pos.(e.rev).cap = Cap.zero then loop res is else\n                                    let d = dfs level iter e.to_ (min (Cap.sub up res) pos.(e.rev).cap) in\n                                    if d <= Cap.zero then loop res is else (\n                                        pos.(i).cap     <- Cap.add pos.(i).cap d;\n                                        pos.(e.rev).cap <- Cap.sub pos.(e.rev).cap d;\n                                        let res = Cap.add res d in\n                                        if res = up then res else loop res is\n                                    )\n                        in\n                        loop Cap.zero iter.(v)\n                in\n                let rec flow_loop flow =\n                    if flow >= flow_limit then flow else\n                        let level = bfs () in\n                        if level.(t) = -1 then flow else\n                            let iter = Array.copy g in\n                            let rec loop flow =\n                                if flow < flow_limit then (\n                                    let f = dfs level iter t (Cap.sub flow_limit flow) in\n                                    if f = Cap.zero then flow else\n                                        loop (Cap.add flow f)\n                                ) else flow\n                            in\n                            loop flow\n                in\n                flow_loop Cap.zero\n\n            in\n            flow mf s t Cap.cap_max\n    end\nend;;\n\nScanf.scanf \"%d %d\" (fun n m ->\n    let ss = Array.init n (fun _ -> Scanf.scanf \" %s\" (fun s -> s)) in\n\n    let module MF = Mf_graph.Make (CapInt) in\n    let mf = MF.create (n * m + 2) (n * m * 3) in\n    let s = n * m in\n    let t = n * m + 1 in\n    let rec loop_y y mf =\n        let rec loop_x x mf =\n            if x = m then loop_y (y + 1) mf else\n                let pivot = y * m + x in\n                let mf = if ss.(y).[x] = '#' then mf else (\n                    let mf = if (x + y) mod 2 = 0 then MF.add_edge mf s pivot 1\n                                                  else MF.add_edge mf pivot t 1\n                    in\n                    if (x + y) mod 2 <> 0 then mf else (\n                        let mf = if y > 0     && ss.(y - 1).[x] = '.' then MF.add_edge mf pivot ((y - 1) * m + x) 1 else mf in\n                        let mf = if y < n - 1 && ss.(y + 1).[x] = '.' then MF.add_edge mf pivot ((y + 1) * m + x) 1 else mf in\n                        let mf = if x > 0     && ss.(y).[x - 1] = '.' then MF.add_edge mf pivot (y * m + x - 1)   1 else mf in\n                        let mf = if x < m - 1 && ss.(y).[x + 1] = '.' then MF.add_edge mf pivot (y * m + x + 1)   1 else mf in\n                        mf\n                    )\n                )\n                in\n                loop_x (x + 1) mf\n        in\n        if y = n then mf else loop_x 0 mf\n    in\n    let mf = loop_y 0 mf in\n    let f = MF.flow mf s t in\n    let ar = MF.edges mf in\n    let map = Array.make_matrix n m ' ' in\n    for y = 0 to n - 1 do\n        for x = 0 to m - 1 do\n            map.(y).(x) <- ss.(y).[x]\n        done\n    done;\n    Array.iter (fun (from, to_, c1, c2) -> if c2 > 0 && from <> s && to_ <> t then (\n        let prt p1 c1 p2 c2 =\n            let prt2 p c =\n                let y = p / m in\n                let x = p mod m in\n                map.(y).(x) <- c\n            in\n            prt2 p1 c1; prt2 p2 c2\n        in\n        if from + 1 = to_  then prt from '>' to_ '<' else\n        if to_  + 1 = from then prt from '<' to_ '>' else\n        if from + m = to_  then prt from 'v' to_ '^' else\n        if to_  + m = from then prt from '^' to_ 'v'\n    )) ar;\n    Printf.printf \"%d\\n\" f;\n    for y = 0 to n - 1 do\n        for x = 0 to m - 1 do\n            print_char map.(y).(x)\n        done;\n        print_newline ()\n    done\n)", "language": "OCaml", "metadata": {"date": 1600698173, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02561.html", "problem_id": "p02561", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02561/input.txt", "sample_output_relpath": "derived/input_output/data/p02561/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02561/OCaml/s153805862.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s153805862", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n#><\nvv#\n^^.\n", "input_to_evaluate": "module type CapType = sig\n    type t\n    val zero : t\n    val cap_max : t\n    val add : t -> t -> t\n    val sub : t -> t -> t\nend ;;\n\nmodule CapInt : CapType with type t = int = struct\n    type t = int\n    let zero = 0\n    let cap_max = max_int\n    let add = (+)\n    let sub = (-)\nend\n\nmodule type S = sig\n    type t\n    type cap\n\n    val create : int -> int -> t\n    val add_edge : t -> int -> int -> cap -> t\n    val edges    : t -> (int * int * cap * cap) array\n    val get_edge : t -> int -> int * int * cap * cap\n    val flow     : t -> int -> int -> cap\nend;;\n\nmodule Mf_graph = struct\n    module Make(Cap: CapType) : S with type cap = Cap.t = struct\n        type cap = Cap.t\n\n        type edge = { to_: int; rev: int; mutable cap : cap }\n        type t = int * int * int list array * edge array\n\n        let create n m =\n            n, 0, Array.make n [], Array.init (m * 2) (fun _ -> { to_ = 0; rev = 0; cap = Cap.zero } )\n\n        let get_edge (n, idx, g, pos) i =\n            let _e = pos.(i * 2) in\n            let _re = pos.(_e.rev) in\n            _re.to_, _e.to_, Cap.add _e.cap _re.cap, _re.cap\n\n        let edges ((n, idx, g, pos) as mf) =\n            Array.init (idx / 2) (fun i -> get_edge mf i)\n\n        let add_edge (n, idx, g, pos) from to_ cap =\n            pos.(idx)     <- { to_ = to_;  rev = idx + 1; cap = cap  };\n            pos.(idx + 1) <- { to_ = from; rev = idx;     cap = Cap.zero };\n            g.(from) <- idx :: g.(from);\n            g.(to_)  <- (idx + 1) :: g.(to_);\n            n, idx + 2, g, pos\n\n        let flow mf s t =\n            let flow (n, idx, g, pos) s t flow_limit =\n                let rec bfs () =\n                    let level = Array.make n (-1) in\n                    level.(s) <- 0;\n\n                    let rec loop fq bq =\n                        match fq with\n                        | [] -> if bq = [] then level else loop (List.rev bq) []\n                        | v :: vs -> (\n                            let rec loop2 bq = function\n                                | [] -> loop vs bq\n                                | e :: es ->\n                                        let e = pos.(e) in\n                                        if e.cap = Cap.zero || level.(e.to_) >= 0 then loop2 bq es else (\n                                            level.(e.to_) <- level.(v) + 1;\n                                            if e.to_ = t then level else loop2 (e.to_ :: bq) es\n                                        )\n                            in\n                            loop2 bq g.(v)\n                        )\n                    in\n                    loop [ s ] []\n                in\n                let rec dfs level iter v up =\n                    if v = s then up else\n                        let level_v = level.(v) in\n                        let rec loop res iis =\n                            iter.(v) <- iis;\n                            match iis with\n                            | [] -> res\n                            | i :: is ->\n                                let e = pos.(i) in\n                                if level_v <= level.(e.to_) || pos.(e.rev).cap = Cap.zero then loop res is else\n                                    let d = dfs level iter e.to_ (min (Cap.sub up res) pos.(e.rev).cap) in\n                                    if d <= Cap.zero then loop res is else (\n                                        pos.(i).cap     <- Cap.add pos.(i).cap d;\n                                        pos.(e.rev).cap <- Cap.sub pos.(e.rev).cap d;\n                                        let res = Cap.add res d in\n                                        if res = up then res else loop res is\n                                    )\n                        in\n                        loop Cap.zero iter.(v)\n                in\n                let rec flow_loop flow =\n                    if flow >= flow_limit then flow else\n                        let level = bfs () in\n                        if level.(t) = -1 then flow else\n                            let iter = Array.copy g in\n                            let rec loop flow =\n                                if flow < flow_limit then (\n                                    let f = dfs level iter t (Cap.sub flow_limit flow) in\n                                    if f = Cap.zero then flow else\n                                        loop (Cap.add flow f)\n                                ) else flow\n                            in\n                            loop flow\n                in\n                flow_loop Cap.zero\n\n            in\n            flow mf s t Cap.cap_max\n    end\nend;;\n\nScanf.scanf \"%d %d\" (fun n m ->\n    let ss = Array.init n (fun _ -> Scanf.scanf \" %s\" (fun s -> s)) in\n\n    let module MF = Mf_graph.Make (CapInt) in\n    let mf = MF.create (n * m + 2) (n * m * 3) in\n    let s = n * m in\n    let t = n * m + 1 in\n    let rec loop_y y mf =\n        let rec loop_x x mf =\n            if x = m then loop_y (y + 1) mf else\n                let pivot = y * m + x in\n                let mf = if ss.(y).[x] = '#' then mf else (\n                    let mf = if (x + y) mod 2 = 0 then MF.add_edge mf s pivot 1\n                                                  else MF.add_edge mf pivot t 1\n                    in\n                    if (x + y) mod 2 <> 0 then mf else (\n                        let mf = if y > 0     && ss.(y - 1).[x] = '.' then MF.add_edge mf pivot ((y - 1) * m + x) 1 else mf in\n                        let mf = if y < n - 1 && ss.(y + 1).[x] = '.' then MF.add_edge mf pivot ((y + 1) * m + x) 1 else mf in\n                        let mf = if x > 0     && ss.(y).[x - 1] = '.' then MF.add_edge mf pivot (y * m + x - 1)   1 else mf in\n                        let mf = if x < m - 1 && ss.(y).[x + 1] = '.' then MF.add_edge mf pivot (y * m + x + 1)   1 else mf in\n                        mf\n                    )\n                )\n                in\n                loop_x (x + 1) mf\n        in\n        if y = n then mf else loop_x 0 mf\n    in\n    let mf = loop_y 0 mf in\n    let f = MF.flow mf s t in\n    let ar = MF.edges mf in\n    let map = Array.make_matrix n m ' ' in\n    for y = 0 to n - 1 do\n        for x = 0 to m - 1 do\n            map.(y).(x) <- ss.(y).[x]\n        done\n    done;\n    Array.iter (fun (from, to_, c1, c2) -> if c2 > 0 && from <> s && to_ <> t then (\n        let prt p1 c1 p2 c2 =\n            let prt2 p c =\n                let y = p / m in\n                let x = p mod m in\n                map.(y).(x) <- c\n            in\n            prt2 p1 c1; prt2 p2 c2\n        in\n        if from + 1 = to_  then prt from '>' to_ '<' else\n        if to_  + 1 = from then prt from '<' to_ '>' else\n        if from + m = to_  then prt from 'v' to_ '^' else\n        if to_  + m = from then prt from '^' to_ 'v'\n    )) ar;\n    Printf.printf \"%d\\n\" f;\n    for y = 0 to n - 1 do\n        for x = 0 to m - 1 do\n            print_char map.(y).(x)\n        done;\n        print_newline ()\n    done\n)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a grid of N rows and M columns. The square at the i-th row and j-th column will be denoted as (i,j).\nSome of the squares contain an object. All the remaining squares are empty.\nThe state of the grid is represented by strings S_1,S_2,\\cdots,S_N. The square (i,j) contains an object if S_{i,j}= # and is empty if S_{i,j}= ..\n\nConsider placing 1 \\times 2 tiles on the grid. Tiles can be placed vertically or horizontally to cover two adjacent empty squares.\nTiles must not stick out of the grid, and no two different tiles may intersect. Tiles cannot occupy the square with an object.\n\nCalculate the maximum number of tiles that can be placed and any configulation that acheives the maximum.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq M \\leq 100\n\nS_i is a string with length M consists of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nS_1\nS_2\n\\vdots\nS_N\n\nOutput\n\nOn the first line, print the maximum number of tiles that can be placed.\n\nOn the next N lines, print a configulation that achieves the maximum.\nPrecisely, output the strings t_1,t_2,\\cdots,t_N constructed by the following way.\n\nt_i is initialized to S_i.\n\nFor each (i,j), if there is a tile that occupies (i,j) and (i+1,j), change t_{i,j}:=v, t_{i+1,j}:=^.\n\nFor each (i,j), if there is a tile that occupies (i,j) and (i,j+1), change t_{i,j}:=>, t_{i,j+1}:=<.\n\nSee samples for further information.\n\nYou may print any configulation that maximizes the number of tiles.\n\nSample Input 1\n\n3 3\n#..\n..#\n...\n\nSample Output 1\n\n3\n#><\nvv#\n^^.\n\nThe following output is also treated as a correct answer.\n\n3\n#><\nv.#\n^><", "sample_input": "3 3\n#..\n..#\n...\n"}, "reference_outputs": ["3\n#><\nvv#\n^^.\n"], "source_document_id": "p02561", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a grid of N rows and M columns. The square at the i-th row and j-th column will be denoted as (i,j).\nSome of the squares contain an object. All the remaining squares are empty.\nThe state of the grid is represented by strings S_1,S_2,\\cdots,S_N. The square (i,j) contains an object if S_{i,j}= # and is empty if S_{i,j}= ..\n\nConsider placing 1 \\times 2 tiles on the grid. Tiles can be placed vertically or horizontally to cover two adjacent empty squares.\nTiles must not stick out of the grid, and no two different tiles may intersect. Tiles cannot occupy the square with an object.\n\nCalculate the maximum number of tiles that can be placed and any configulation that acheives the maximum.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq M \\leq 100\n\nS_i is a string with length M consists of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nS_1\nS_2\n\\vdots\nS_N\n\nOutput\n\nOn the first line, print the maximum number of tiles that can be placed.\n\nOn the next N lines, print a configulation that achieves the maximum.\nPrecisely, output the strings t_1,t_2,\\cdots,t_N constructed by the following way.\n\nt_i is initialized to S_i.\n\nFor each (i,j), if there is a tile that occupies (i,j) and (i+1,j), change t_{i,j}:=v, t_{i+1,j}:=^.\n\nFor each (i,j), if there is a tile that occupies (i,j) and (i,j+1), change t_{i,j}:=>, t_{i,j+1}:=<.\n\nSee samples for further information.\n\nYou may print any configulation that maximizes the number of tiles.\n\nSample Input 1\n\n3 3\n#..\n..#\n...\n\nSample Output 1\n\n3\n#><\nvv#\n^^.\n\nThe following output is also treated as a correct answer.\n\n3\n#><\nv.#\n^><", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6943, "cpu_time_ms": 32, "memory_kb": 12340}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s051821663", "group_id": "codeNet:p02571", "input_text": "open Core;;\n\nlet s = In_channel.(input_line_exn stdin)\nlet t = In_channel.(input_line_exn stdin)\n\nlet () = \n  let res =\n    let n = String.length s in\n    let m = String.length t in\n    let dist x y =\n      let rec cnt i = if (i < 0) then 0 else (if (Char.equal (String.get x i) (String.get y i)) then 0 else 1) + cnt (i - 1) in\n      cnt ((String.length x) - 1)\n    in\n    List.range 0 (n - m + 1) |>\n    List.map ~f:(fun i -> dist (String.sub ~pos:i ~len:m s) t) |>\n    List.reduce_exn ~f:Int.min\n  in\n  printf \"%d\\n\" res\n;;\n", "language": "OCaml", "metadata": {"date": 1599162411, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s051821663.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s051821663", "user_id": "u411712623"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Core;;\n\nlet s = In_channel.(input_line_exn stdin)\nlet t = In_channel.(input_line_exn stdin)\n\nlet () = \n  let res =\n    let n = String.length s in\n    let m = String.length t in\n    let dist x y =\n      let rec cnt i = if (i < 0) then 0 else (if (Char.equal (String.get x i) (String.get y i)) then 0 else 1) + cnt (i - 1) in\n      cnt ((String.length x) - 1)\n    in\n    List.range 0 (n - m + 1) |>\n    List.map ~f:(fun i -> dist (String.sub ~pos:i ~len:m s) t) |>\n    List.reduce_exn ~f:Int.min\n  in\n  printf \"%d\\n\" res\n;;\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are two strings S and T.\n\nLet us change some of the characters in S so that T will be a substring of S.\n\nAt least how many characters do we need to change?\n\nHere, a substring is a consecutive subsequence. For example, xxx is a substring of yxxxy, but not a substring of xxyxx.\n\nConstraints\n\nThe lengths of S and T are each at least 1 and at most 1000.\n\nThe length of T is at most that of S.\n\nS and T consist of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the minimum number of characters in S that need to be changed.\n\nSample Input 1\n\ncabacc\nabc\n\nSample Output 1\n\n1\n\nFor example, changing the fourth character a in S to c will match the second through fourth characters in S to T.\n\nSince S itself does not have T as its substring, this number of changes - one - is the minimum needed.\n\nSample Input 2\n\ncodeforces\natcoder\n\nSample Output 2\n\n6", "sample_input": "cabacc\nabc\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02571", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are two strings S and T.\n\nLet us change some of the characters in S so that T will be a substring of S.\n\nAt least how many characters do we need to change?\n\nHere, a substring is a consecutive subsequence. For example, xxx is a substring of yxxxy, but not a substring of xxyxx.\n\nConstraints\n\nThe lengths of S and T are each at least 1 and at most 1000.\n\nThe length of T is at most that of S.\n\nS and T consist of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the minimum number of characters in S that need to be changed.\n\nSample Input 1\n\ncabacc\nabc\n\nSample Output 1\n\n1\n\nFor example, changing the fourth character a in S to c will match the second through fourth characters in S to T.\n\nSince S itself does not have T as its substring, this number of changes - one - is the minimum needed.\n\nSample Input 2\n\ncodeforces\natcoder\n\nSample Output 2\n\n6", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 527, "cpu_time_ms": 23, "memory_kb": 13640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s725129274", "group_id": "codeNet:p02578", "input_text": "open Batteries\nopen Printf\n\nlet ($) g f x = g (f x)\n\nlet swap = Tuple2.swap\n\nlet s2i = int_of_string\nlet i2s = string_of_int\nlet s2f = float_of_string\nlet f2s = string_of_float\nlet f2i = int_of_float\nlet i2f = float_of_int \n\nlet c2a = int_of_char\nlet a2c = char_of_int\n\nlet c2i c = c2a c - 48\nlet i2c i = a2c (i + 48)\n\nlet c2s = String.of_char\nlet s2cl = String.to_list\nlet cl2s = String.of_list\n\nlet puts s = print_endline s\nlet putw ?yn:(yn=(\"Yes\", \"No\")) b = puts (if b then fst yn else snd yn)\nlet puti i = puts @@ i2s i\n\n\n\nmodule StaleList = struct\n  include List\n\n  let nmem x l = not @@ mem x l\n\n  let len = length\n  let size = length\n  let nempty l = not @@ is_empty l\n\n  let hdop l = if nempty l then Some (hd l) else None\n\n  (* let taker = drop *)\n  let takewh = take_while\n\n  (* let dropr = take *)\n  let dropwh = drop_while\n\n  let split_by = span\n\n  let chunk = ntake\n\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr f z l = fold_right f l z\n  let foldri f z l = fold_righti f l z\n\n  let partition_to_map f l =\n    foldr (fun x m -> Map.modify_opt (f x) (function\n      | None -> Some [x] \n      | Some [] -> Some [x] \n      | Some vl -> Some (x::vl)) m) Map.empty l;;\n\n  let scanl f z ls =\n    let rec loop acl acc = function\n      | [] -> rev acl\n      | h::t ->\n        let r = f acc h in\n        loop (r::acl) r t\n    in loop [] z ls\n\n  let scanr f z ls =\n    let rec loop acl acc = function\n      | [] -> acl \n      | h::t ->\n        let r = f h acc in\n        loop (r::acl) r t\n    in loop [] z (rev ls)\n\n  (* let scanli = scan_lefti *)\n  (* let scanri = scan_righti *)\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\n\nend\n\nmodule L = StaleList\n\nmodule StaleArray = struct\n  include Array \n\n  let nmem x l = not @@ mem x l\n\n  let len = length\n  let size = length\n  let is_empty r = len r = 0\n  let nempty r = len r > 0\n\n  let take n r = left r n\n  let taker n r = right r n\n\n  let takeb x r =\n    let l = len r in\n    let rec loop i =\n      if i >= l then r\n      else if r.(i) = x then take i r\n      else loop (i + 1)\n    in loop 0\n     \n  (* let takewh = take_while *)\n\n  let drop n r = tail r n\n  let dropr n r = take ((len r) - n) r\n  (* let dropwh = drop_while *)\n\n  let index_of x r =\n    let l = len r in\n    let rec loop i =\n      if i >= l then None\n      else if r.(i) = x then Some i\n      else loop (i + 1)\n    in loop 0\n\n  (* let split_by = span *)\n\n  (* let chunk = ntake *)\n\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr f z l = fold_right f l z\n  let foldri f z l = fold_righti f l z\n\n  (* let partition_to_map f l = *)\n  (*   foldr (fun x m -> Map.modify_opt (f x) (function *)\n  (*     | None -> Some [x]  *)\n  (*     | Some [] -> Some [x]  *)\n  (*     | Some vl -> Some (x::vl)) m) Map.empty l;; *)\n\n  (* let scanl = scan_left *)\n  (* let scanli = scan_lefti *)\n  (* let scanr = scan_right *)\n  (* let scanri = scan_righti *)\n  \n  let concat2 = append\n  \n  let flatmap (f : 'a -> 'b array) a =\n    map f a |> enum |> L.of_enum |> concat\n\n  let zipf = map2\n  (* let zipfi = map2i *)\n\nend\n\nmodule A = StaleArray\n\nmodule StaleString = struct\n  include String\n\n  let len = length\n\n  let replace_chars = map\n  let map = replace\n\n  let maptol f s = L.map f (s2cl s)\n  let maptoli f s = L.map f (s2cl s)\n\n  let zipf f a b = L.zipf f (s2cl a) (s2cl b)\n  let zipfi f a b = L.zipfi f (s2cl a) (s2cl b)\n\n  let mkstr f sep ls =\n    L.foldl (fun acc x -> acc ^ sep ^ (f x)) (f @@ L.hd ls) (List.tl ls)\n\nend\n\nmodule S = StaleString\n\nlet spsp s = S.split_on_char ' ' s\n\n\nmodule StaleSortedSet = struct\n  include Set\n\n  module Make (Ord : Set.OrderedType) = struct\n    include Set.Make(Ord)\n\n    let nmem x st = not @@ mem x st\n\n    let foldl f s z = fold (fun x a -> f a x) z s\n\n    let size = cardinal\n  end\n\n  let nmem x st = not @@ mem x st\n\n  let foldl f s z = fold (fun x a -> f a x) z s\n\n  let size = cardinal\nend\n\nmodule Ss = StaleSortedSet\n\nmodule StaleSortedMap  = struct\n  include Map\n\n  module Make (Ord : Map.OrderedType) = struct\n    include Map.Make(Ord)\n\n    let nmem x st = not @@ mem x st\n\n    let get = find\n    let get_or x d m = find_default d x m\n\n    let size = cardinal\n  end\n\n  let nmem x st = not @@ mem x st\n\n  let get = find\n  let get_or x d m = find_default d x m\n\n  let size = cardinal\nend\n\nmodule Ms = StaleSortedMap\n\n\nmodule StaleRange = struct\n\n  type t = Range of int * int\n\n  let make lb ub = Range (lb, ub)\n\n  let to_list r =\n    let Range (lb, ub) = r in\n    L.make (ub - lb) ((+) lb) \n\n  let to_array r =\n    let Range (lb, ub) = r in\n      A.make (ub - lb) ((+) lb)\n\n  let iter r f = \n    let Range (lb, ub) = r in\n    for i = lb to ub do f i done\n\n  let iter2 r1 r2 f =\n    let Range (lb1, ub1) = r1 and Range (lb2, ub2) = r2 in\n      for i = lb1 to ub2 do\n        for j = lb2 to ub2 do\n          f i j\n        done\n      done\nend\n\nmodule R = StaleRange\n\nlet (---) lb ub = R.make lb ub\nlet (--^) lb ub = R.make lb (ub - 1)\n\nmodule StaleGenericAlgorithms = struct\n\n  let set_power ls =\n    let rec loop ls pls =\n      match ls with\n      | [] -> pls\n      | hd::tl -> loop tl (L.flatmap (fun p -> [p; hd::p]) pls)\n    in loop ls [[]]\n\n  let rec bsearch_max_int f lb ub =\n    if lb >= ub then (if f lb then lb else (lb - 1))\n    else (\n      let m = (lb + ub) / 2 in\n      if f m then bsearch_max_int f (m + 1) ub\n      else bsearch_max_int f lb m\n    )\n\n  let partial_sum n ls =\n    let rec loop s k = function\n      | [] -> s\n      | h::t ->\n        if k >= n then s\n        else loop (s + h) (k + 1) t\n    in\n    loop 0 0 ls\n\nend\n\nmodule Gal = StaleGenericAlgorithms\n\nlet rds () = read_line ()\n\nlet rdi () = s2i @@ rds ()\n\nlet rdhs () = spsp @@ rds ()\nlet rdhi () = rdhs () |> L.map s2i\n\nlet rdhf () = rdhs () |> L.map s2f\n\nlet rdf2 () = match rdhf () with\n| a::b::_ -> (a, b)\n| _ -> (0., 0.)\n\nlet rdf3 () = match rdhf () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0., 0., 0.)\n\nlet rdf4 () = match rdhf () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0., 0., 0., 0.)\n\nlet rds2 () = match rdhs () with\n  | a::b::_ -> (a, b)\n  | _ -> (\"\", \"\")\n\nlet rdi2 () = match rdhi () with\n  | a::b::_ -> (a, b)\n  | _ -> (0, 0)\n\nlet rdi3 () = match rdhi () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0, 0, 0)\n\nlet rdi4 () = match rdhi () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0, 0, 0, 0)\n\nlet rdi5 () = match rdhi () with\n| a::b::c::d::e::_ -> (a, b, c, d, e)\n| _ -> (0, 0, 0, 0, 0)\n\nlet rdv n rf =\n  let rec loop n =\n    if n <= 0 then []\n    else (\n      let s = rf () in\n      s::(loop (n - 1))\n    )\n  in loop n\n\nlet rdvi n = rdv n rdi\nlet rdvi2 n = rdv n rdi2\nlet rdvi3 n = rdv n rdi3\nlet rdvi4 n = rdv n rdi4\n\n\nlet print_list aa = \n  printf \"[ \"; aa |> L.iter (fun a -> printf \"%d \" a); puts \"]\"\n\nlet print_array aa = \n  printf \"[ \"; aa |> A.iter (fun a -> printf \"%d \" a); puts \"]\"\n\nlet print_carray aa = \n  printf \"[ \"; aa |> A.iter (fun a -> printf \"%c \" a); puts \"]\"\n\nlet print_matrix mat =\n  puts \"----\";\n  mat |> A.iter (fun r -> print_carray r);\n  puts \"----\"\n\n\nlet _ =\n  let n = rdi () in\n  let aa = rdhi () in\n\n  let rec steps sum mx = function\n  | [] -> sum\n  | h::t -> \n    if h < mx then\n      let r = mx - h in\n      steps (sum + r) mx t\n    else\n      steps sum h t\n  in\n\n    \n  puti @@ steps 0 0 aa\n", "language": "OCaml", "metadata": {"date": 1598124223, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02578.html", "problem_id": "p02578", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02578/input.txt", "sample_output_relpath": "derived/input_output/data/p02578/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02578/OCaml/s725129274.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s725129274", "user_id": "u970139668"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "open Batteries\nopen Printf\n\nlet ($) g f x = g (f x)\n\nlet swap = Tuple2.swap\n\nlet s2i = int_of_string\nlet i2s = string_of_int\nlet s2f = float_of_string\nlet f2s = string_of_float\nlet f2i = int_of_float\nlet i2f = float_of_int \n\nlet c2a = int_of_char\nlet a2c = char_of_int\n\nlet c2i c = c2a c - 48\nlet i2c i = a2c (i + 48)\n\nlet c2s = String.of_char\nlet s2cl = String.to_list\nlet cl2s = String.of_list\n\nlet puts s = print_endline s\nlet putw ?yn:(yn=(\"Yes\", \"No\")) b = puts (if b then fst yn else snd yn)\nlet puti i = puts @@ i2s i\n\n\n\nmodule StaleList = struct\n  include List\n\n  let nmem x l = not @@ mem x l\n\n  let len = length\n  let size = length\n  let nempty l = not @@ is_empty l\n\n  let hdop l = if nempty l then Some (hd l) else None\n\n  (* let taker = drop *)\n  let takewh = take_while\n\n  (* let dropr = take *)\n  let dropwh = drop_while\n\n  let split_by = span\n\n  let chunk = ntake\n\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr f z l = fold_right f l z\n  let foldri f z l = fold_righti f l z\n\n  let partition_to_map f l =\n    foldr (fun x m -> Map.modify_opt (f x) (function\n      | None -> Some [x] \n      | Some [] -> Some [x] \n      | Some vl -> Some (x::vl)) m) Map.empty l;;\n\n  let scanl f z ls =\n    let rec loop acl acc = function\n      | [] -> rev acl\n      | h::t ->\n        let r = f acc h in\n        loop (r::acl) r t\n    in loop [] z ls\n\n  let scanr f z ls =\n    let rec loop acl acc = function\n      | [] -> acl \n      | h::t ->\n        let r = f h acc in\n        loop (r::acl) r t\n    in loop [] z (rev ls)\n\n  (* let scanli = scan_lefti *)\n  (* let scanri = scan_righti *)\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\n\nend\n\nmodule L = StaleList\n\nmodule StaleArray = struct\n  include Array \n\n  let nmem x l = not @@ mem x l\n\n  let len = length\n  let size = length\n  let is_empty r = len r = 0\n  let nempty r = len r > 0\n\n  let take n r = left r n\n  let taker n r = right r n\n\n  let takeb x r =\n    let l = len r in\n    let rec loop i =\n      if i >= l then r\n      else if r.(i) = x then take i r\n      else loop (i + 1)\n    in loop 0\n     \n  (* let takewh = take_while *)\n\n  let drop n r = tail r n\n  let dropr n r = take ((len r) - n) r\n  (* let dropwh = drop_while *)\n\n  let index_of x r =\n    let l = len r in\n    let rec loop i =\n      if i >= l then None\n      else if r.(i) = x then Some i\n      else loop (i + 1)\n    in loop 0\n\n  (* let split_by = span *)\n\n  (* let chunk = ntake *)\n\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr f z l = fold_right f l z\n  let foldri f z l = fold_righti f l z\n\n  (* let partition_to_map f l = *)\n  (*   foldr (fun x m -> Map.modify_opt (f x) (function *)\n  (*     | None -> Some [x]  *)\n  (*     | Some [] -> Some [x]  *)\n  (*     | Some vl -> Some (x::vl)) m) Map.empty l;; *)\n\n  (* let scanl = scan_left *)\n  (* let scanli = scan_lefti *)\n  (* let scanr = scan_right *)\n  (* let scanri = scan_righti *)\n  \n  let concat2 = append\n  \n  let flatmap (f : 'a -> 'b array) a =\n    map f a |> enum |> L.of_enum |> concat\n\n  let zipf = map2\n  (* let zipfi = map2i *)\n\nend\n\nmodule A = StaleArray\n\nmodule StaleString = struct\n  include String\n\n  let len = length\n\n  let replace_chars = map\n  let map = replace\n\n  let maptol f s = L.map f (s2cl s)\n  let maptoli f s = L.map f (s2cl s)\n\n  let zipf f a b = L.zipf f (s2cl a) (s2cl b)\n  let zipfi f a b = L.zipfi f (s2cl a) (s2cl b)\n\n  let mkstr f sep ls =\n    L.foldl (fun acc x -> acc ^ sep ^ (f x)) (f @@ L.hd ls) (List.tl ls)\n\nend\n\nmodule S = StaleString\n\nlet spsp s = S.split_on_char ' ' s\n\n\nmodule StaleSortedSet = struct\n  include Set\n\n  module Make (Ord : Set.OrderedType) = struct\n    include Set.Make(Ord)\n\n    let nmem x st = not @@ mem x st\n\n    let foldl f s z = fold (fun x a -> f a x) z s\n\n    let size = cardinal\n  end\n\n  let nmem x st = not @@ mem x st\n\n  let foldl f s z = fold (fun x a -> f a x) z s\n\n  let size = cardinal\nend\n\nmodule Ss = StaleSortedSet\n\nmodule StaleSortedMap  = struct\n  include Map\n\n  module Make (Ord : Map.OrderedType) = struct\n    include Map.Make(Ord)\n\n    let nmem x st = not @@ mem x st\n\n    let get = find\n    let get_or x d m = find_default d x m\n\n    let size = cardinal\n  end\n\n  let nmem x st = not @@ mem x st\n\n  let get = find\n  let get_or x d m = find_default d x m\n\n  let size = cardinal\nend\n\nmodule Ms = StaleSortedMap\n\n\nmodule StaleRange = struct\n\n  type t = Range of int * int\n\n  let make lb ub = Range (lb, ub)\n\n  let to_list r =\n    let Range (lb, ub) = r in\n    L.make (ub - lb) ((+) lb) \n\n  let to_array r =\n    let Range (lb, ub) = r in\n      A.make (ub - lb) ((+) lb)\n\n  let iter r f = \n    let Range (lb, ub) = r in\n    for i = lb to ub do f i done\n\n  let iter2 r1 r2 f =\n    let Range (lb1, ub1) = r1 and Range (lb2, ub2) = r2 in\n      for i = lb1 to ub2 do\n        for j = lb2 to ub2 do\n          f i j\n        done\n      done\nend\n\nmodule R = StaleRange\n\nlet (---) lb ub = R.make lb ub\nlet (--^) lb ub = R.make lb (ub - 1)\n\nmodule StaleGenericAlgorithms = struct\n\n  let set_power ls =\n    let rec loop ls pls =\n      match ls with\n      | [] -> pls\n      | hd::tl -> loop tl (L.flatmap (fun p -> [p; hd::p]) pls)\n    in loop ls [[]]\n\n  let rec bsearch_max_int f lb ub =\n    if lb >= ub then (if f lb then lb else (lb - 1))\n    else (\n      let m = (lb + ub) / 2 in\n      if f m then bsearch_max_int f (m + 1) ub\n      else bsearch_max_int f lb m\n    )\n\n  let partial_sum n ls =\n    let rec loop s k = function\n      | [] -> s\n      | h::t ->\n        if k >= n then s\n        else loop (s + h) (k + 1) t\n    in\n    loop 0 0 ls\n\nend\n\nmodule Gal = StaleGenericAlgorithms\n\nlet rds () = read_line ()\n\nlet rdi () = s2i @@ rds ()\n\nlet rdhs () = spsp @@ rds ()\nlet rdhi () = rdhs () |> L.map s2i\n\nlet rdhf () = rdhs () |> L.map s2f\n\nlet rdf2 () = match rdhf () with\n| a::b::_ -> (a, b)\n| _ -> (0., 0.)\n\nlet rdf3 () = match rdhf () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0., 0., 0.)\n\nlet rdf4 () = match rdhf () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0., 0., 0., 0.)\n\nlet rds2 () = match rdhs () with\n  | a::b::_ -> (a, b)\n  | _ -> (\"\", \"\")\n\nlet rdi2 () = match rdhi () with\n  | a::b::_ -> (a, b)\n  | _ -> (0, 0)\n\nlet rdi3 () = match rdhi () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0, 0, 0)\n\nlet rdi4 () = match rdhi () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0, 0, 0, 0)\n\nlet rdi5 () = match rdhi () with\n| a::b::c::d::e::_ -> (a, b, c, d, e)\n| _ -> (0, 0, 0, 0, 0)\n\nlet rdv n rf =\n  let rec loop n =\n    if n <= 0 then []\n    else (\n      let s = rf () in\n      s::(loop (n - 1))\n    )\n  in loop n\n\nlet rdvi n = rdv n rdi\nlet rdvi2 n = rdv n rdi2\nlet rdvi3 n = rdv n rdi3\nlet rdvi4 n = rdv n rdi4\n\n\nlet print_list aa = \n  printf \"[ \"; aa |> L.iter (fun a -> printf \"%d \" a); puts \"]\"\n\nlet print_array aa = \n  printf \"[ \"; aa |> A.iter (fun a -> printf \"%d \" a); puts \"]\"\n\nlet print_carray aa = \n  printf \"[ \"; aa |> A.iter (fun a -> printf \"%c \" a); puts \"]\"\n\nlet print_matrix mat =\n  puts \"----\";\n  mat |> A.iter (fun r -> print_carray r);\n  puts \"----\"\n\n\nlet _ =\n  let n = rdi () in\n  let aa = rdhi () in\n\n  let rec steps sum mx = function\n  | [] -> sum\n  | h::t -> \n    if h < mx then\n      let r = mx - h in\n      steps (sum + r) mx t\n    else\n      steps sum h t\n  in\n\n    \n  puti @@ steps 0 0 aa\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nN persons are standing in a row. The height of the i-th person from the front is A_i.\n\nWe want to have each person stand on a stool of some heights - at least zero - so that the following condition is satisfied for every person:\n\nCondition: Nobody in front of the person is taller than the person. Here, the height of a person includes the stool.\n\nFind the minimum total height of the stools needed to meet this goal.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint the minimum total height of the stools needed to meet the goal.\n\nSample Input 1\n\n5\n2 1 5 4 3\n\nSample Output 1\n\n4\n\nIf the persons stand on stools of heights 0, 1, 0, 1, and 2, respectively, their heights will be 2, 2, 5, 5, and 5, satisfying the condition.\n\nWe cannot meet the goal with a smaller total height of the stools.\n\nSample Input 2\n\n5\n3 3 3 3 3\n\nSample Output 2\n\n0\n\nGiving a stool of height 0 to everyone will work.", "sample_input": "5\n2 1 5 4 3\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02578", "source_text": "Score : 300 points\n\nProblem Statement\n\nN persons are standing in a row. The height of the i-th person from the front is A_i.\n\nWe want to have each person stand on a stool of some heights - at least zero - so that the following condition is satisfied for every person:\n\nCondition: Nobody in front of the person is taller than the person. Here, the height of a person includes the stool.\n\nFind the minimum total height of the stools needed to meet this goal.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 \\ldots A_N\n\nOutput\n\nPrint the minimum total height of the stools needed to meet the goal.\n\nSample Input 1\n\n5\n2 1 5 4 3\n\nSample Output 1\n\n4\n\nIf the persons stand on stools of heights 0, 1, 0, 1, and 2, respectively, their heights will be 2, 2, 5, 5, and 5, satisfying the condition.\n\nWe cannot meet the goal with a smaller total height of the stools.\n\nSample Input 2\n\n5\n3 3 3 3 3\n\nSample Output 2\n\n0\n\nGiving a stool of height 0 to everyone will work.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7218, "cpu_time_ms": 54, "memory_kb": 25712}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s979057850", "group_id": "codeNet:p02582", "input_text": "let s = read_line ()\nlet () = (if s = \"SSS\" then 3 else\nif s = \"RSS\" then 2 else \nif s = \"SSR\" then 2 else 1) |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1597518085, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s979057850.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s979057850", "user_id": "u511870776"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let s = read_line ()\nlet () = (if s = \"SSS\" then 3 else\nif s = \"RSS\" then 2 else \nif s = \"SSR\" then 2 else 1) |> Printf.printf \"%d\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is S, it means it was sunny on the i-th day; if that character is R, it means it was rainy on that day.\n\nFind the maximum number of consecutive rainy days in this period.\n\nConstraints\n\n|S| = 3\n\nEach character of S is S or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of consecutive rainy days in the period.\n\nSample Input 1\n\nRRS\n\nSample Output 1\n\n2\n\nWe had rain on the 1-st and 2-nd days in the period. Here, the maximum number of consecutive rainy days is 2, so we should print 2.\n\nSample Input 2\n\nSSS\n\nSample Output 2\n\n0\n\nIt was sunny throughout the period. We had no rainy days, so we should print 0.\n\nSample Input 3\n\nRSR\n\nSample Output 3\n\n1\n\nWe had rain on the 1-st and 3-rd days - two \"streaks\" of one rainy day, so we should print 1.", "sample_input": "RRS\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02582", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is S, it means it was sunny on the i-th day; if that character is R, it means it was rainy on that day.\n\nFind the maximum number of consecutive rainy days in this period.\n\nConstraints\n\n|S| = 3\n\nEach character of S is S or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of consecutive rainy days in the period.\n\nSample Input 1\n\nRRS\n\nSample Output 1\n\n2\n\nWe had rain on the 1-st and 2-nd days in the period. Here, the maximum number of consecutive rainy days is 2, so we should print 2.\n\nSample Input 2\n\nSSS\n\nSample Output 2\n\n0\n\nIt was sunny throughout the period. We had no rainy days, so we should print 0.\n\nSample Input 3\n\nRSR\n\nSample Output 3\n\n1\n\nWe had rain on the 1-st and 3-rd days - two \"streaks\" of one rainy day, so we should print 1.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 133, "cpu_time_ms": 9, "memory_kb": 3668}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s332102068", "group_id": "codeNet:p02583", "input_text": "open Batteries\nlet get_max a b c = max a @@ max b c\nlet get_others a b c =\n  let max_ = get_max a b c in\n    if a = max_ then (b, c) else\n    if b = max_ then (a, c) else (a, b)\n\n\nlet n = read_int ()\nlet l = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ fun a -> a\n\nlet is_triangle a b c =\n  let cosa = (float_of_int @@ b * b + c * c - a * a) /. (float_of_int @@ 2 * b * c) in\n  -1. < cosa && cosa < 1.\n\n\nlet rec i_loop i result_i =\n\n  let rec j_loop j result_j =\n\n    let rec k_loop k result_k =\n      if k >= n then result_k else (\n        if l.(i) = l.(j) || l.(j) = l.(k) || l.(i) = l.(k) then k_loop (k+1) result_k else\n        if is_triangle l.(i) l.(j) l.(k) then k_loop (k+1) (result_k+1) else k_loop (k+1) result_k\n      )\n    in if j >= n then result_j else j_loop (j+1) (result_j + k_loop (j+1) 0)\n  in if i >= n then result_i else i_loop (i+1) (result_i + j_loop (i+1) 0)\n\nlet _ = Printf.printf \"%d\\n\" @@ i_loop 0 0\n", "language": "OCaml", "metadata": {"date": 1597519067, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s332102068.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s332102068", "user_id": "u511870776"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "open Batteries\nlet get_max a b c = max a @@ max b c\nlet get_others a b c =\n  let max_ = get_max a b c in\n    if a = max_ then (b, c) else\n    if b = max_ then (a, c) else (a, b)\n\n\nlet n = read_int ()\nlet l = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ fun a -> a\n\nlet is_triangle a b c =\n  let cosa = (float_of_int @@ b * b + c * c - a * a) /. (float_of_int @@ 2 * b * c) in\n  -1. < cosa && cosa < 1.\n\n\nlet rec i_loop i result_i =\n\n  let rec j_loop j result_j =\n\n    let rec k_loop k result_k =\n      if k >= n then result_k else (\n        if l.(i) = l.(j) || l.(j) = l.(k) || l.(i) = l.(k) then k_loop (k+1) result_k else\n        if is_triangle l.(i) l.(j) l.(k) then k_loop (k+1) (result_k+1) else k_loop (k+1) result_k\n      )\n    in if j >= n then result_j else j_loop (j+1) (result_j + k_loop (j+1) 0)\n  in if i >= n then result_i else i_loop (i+1) (result_i + j_loop (i+1) 0)\n\nlet _ = Printf.printf \"%d\\n\" @@ i_loop 0 0\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have sticks numbered 1, \\cdots, N. The length of Stick i (1 \\leq i \\leq N) is L_i.\n\nIn how many ways can we choose three of the sticks with different lengths that can form a triangle?\n\nThat is, find the number of triples of integers (i, j, k) (1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nL_i, L_j, and L_k are all different.\n\nThere exists a triangle whose sides have lengths L_i, L_j, and L_k.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 \\cdots L_N\n\nOutput\n\nPrint the number of ways to choose three of the sticks with different lengths that can form a triangle.\n\nSample Input 1\n\n5\n4 4 9 7 5\n\nSample Output 1\n\n5\n\nThe following five triples (i, j, k) satisfy the conditions: (1, 3, 4), (1, 4, 5), (2, 3, 4), (2, 4, 5), and (3, 4, 5).\n\nSample Input 2\n\n6\n4 5 4 3 3 5\n\nSample Output 2\n\n8\n\nWe have two sticks for each of the lengths 3, 4, and 5. To satisfy the first condition, we have to choose one from each length.\n\nThere is a triangle whose sides have lengths 3, 4, and 5, so we have 2 ^ 3 = 8 triples (i, j, k) that satisfy the conditions.\n\nSample Input 3\n\n10\n9 4 6 1 9 6 10 6 6 8\n\nSample Output 3\n\n39\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\n0\n\nNo triple (i, j, k) satisfies 1 \\leq i < j < k \\leq N, so we should print 0.", "sample_input": "5\n4 4 9 7 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02583", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have sticks numbered 1, \\cdots, N. The length of Stick i (1 \\leq i \\leq N) is L_i.\n\nIn how many ways can we choose three of the sticks with different lengths that can form a triangle?\n\nThat is, find the number of triples of integers (i, j, k) (1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nL_i, L_j, and L_k are all different.\n\nThere exists a triangle whose sides have lengths L_i, L_j, and L_k.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 \\cdots L_N\n\nOutput\n\nPrint the number of ways to choose three of the sticks with different lengths that can form a triangle.\n\nSample Input 1\n\n5\n4 4 9 7 5\n\nSample Output 1\n\n5\n\nThe following five triples (i, j, k) satisfy the conditions: (1, 3, 4), (1, 4, 5), (2, 3, 4), (2, 4, 5), and (3, 4, 5).\n\nSample Input 2\n\n6\n4 5 4 3 3 5\n\nSample Output 2\n\n8\n\nWe have two sticks for each of the lengths 3, 4, and 5. To satisfy the first condition, we have to choose one from each length.\n\nThere is a triangle whose sides have lengths 3, 4, and 5, so we have 2 ^ 3 = 8 triples (i, j, k) that satisfy the conditions.\n\nSample Input 3\n\n10\n9 4 6 1 9 6 10 6 6 8\n\nSample Output 3\n\n39\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\n0\n\nNo triple (i, j, k) satisfies 1 \\leq i < j < k \\leq N, so we should print 0.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 928, "cpu_time_ms": 14, "memory_kb": 5780}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s458505348", "group_id": "codeNet:p02586", "input_text": "Scanf.scanf \"%d %d %d\" (fun rr cc k ->\n    let mat = Array.make_matrix rr cc 0 in\n    for i = 1 to k do\n        Scanf.scanf \" %d %d %d\" (fun rr cc v ->\n            mat.(rr - 1).(cc - 1) <- v\n        )\n    done;\n    let max (a:int) (b:int) = if a < b then b else a in\n\n    let prev = Array.make cc 0 in\n    for y = 0 to rr - 1 do\n        let m = mat.(y) in\n        let rec loop x work0 work1 work2 work3 =\n            if x < cc then (\n                let work0 = max work0 prev.(x) in\n                let v = m.(x) in\n                let work3 = max work3 (work2 + v) in\n                let work2 = max work2 (work1 + v) in\n                let work1 = max work1 (work0 + v) in\n                prev.(x) <- max (max work3 work2) (max work1 work0);\n                loop (x + 1) work0 work1 work2 work3\n            )\n        in\n        loop 0 0 0 0 0\n    done;\n    Printf.printf \"%d\\n\" (prev.(cc - 1))\n)", "language": "OCaml", "metadata": {"date": 1597965139, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02586.html", "problem_id": "p02586", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02586/input.txt", "sample_output_relpath": "derived/input_output/data/p02586/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02586/OCaml/s458505348.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s458505348", "user_id": "u342443598"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" (fun rr cc k ->\n    let mat = Array.make_matrix rr cc 0 in\n    for i = 1 to k do\n        Scanf.scanf \" %d %d %d\" (fun rr cc v ->\n            mat.(rr - 1).(cc - 1) <- v\n        )\n    done;\n    let max (a:int) (b:int) = if a < b then b else a in\n\n    let prev = Array.make cc 0 in\n    for y = 0 to rr - 1 do\n        let m = mat.(y) in\n        let rec loop x work0 work1 work2 work3 =\n            if x < cc then (\n                let work0 = max work0 prev.(x) in\n                let v = m.(x) in\n                let work3 = max work3 (work2 + v) in\n                let work2 = max work2 (work1 + v) in\n                let work1 = max work1 (work0 + v) in\n                prev.(x) <- max (max work3 work2) (max work1 work0);\n                loop (x + 1) work0 work1 work2 work3\n            )\n        in\n        loop 0 0 0 0 0\n    done;\n    Printf.printf \"%d\\n\" (prev.(cc - 1))\n)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are K items placed on a grid of squares with R rows and C columns. Let (i, j) denote the square at the i-th row (1 \\leq i \\leq R) and the j-th column (1 \\leq j \\leq C). The i-th item is at (r_i, c_i) and has the value v_i.\n\nTakahashi will begin at (1, 1), the start, and get to (R, C), the goal. When he is at (i, j), he can move to (i + 1, j) or (i, j + 1) (but cannot move to a non-existent square).\n\nHe can pick up items on the squares he visits, including the start and the goal, but at most three for each row. It is allowed to ignore the item on a square he visits.\n\nFind the maximum possible sum of the values of items he picks up.\n\nConstraints\n\n1 \\leq R, C \\leq 3000\n\n1 \\leq K \\leq \\min(2 \\times 10^5, R \\times C)\n\n1 \\leq r_i \\leq R\n\n1 \\leq c_i \\leq C\n\n(r_i, c_i) \\neq (r_j, c_j) (i \\neq j)\n\n1 \\leq v_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR C K\nr_1 c_1 v_1\nr_2 c_2 v_2\n:\nr_K c_K v_K\n\nOutput\n\nPrint the maximum possible sum of the values of items Takahashi picks up.\n\nSample Input 1\n\n2 2 3\n1 1 3\n2 1 4\n1 2 5\n\nSample Output 1\n\n8\n\nHe has two ways to get to the goal:\n\nVisit (1, 1), (1, 2), and (2, 2), in this order. In this case, the total value of the items he can pick up is 3 + 5 = 8.\n\nVisit (1, 1), (2, 1), and (2, 2), in this order. In this case, the total value of the items he can pick up is 3 + 4 = 7.\n\nThus, the maximum possible sum of the values of items he picks up is 8.\n\nSample Input 2\n\n2 5 5\n1 1 3\n2 4 20\n1 2 1\n1 3 4\n1 4 2\n\nSample Output 2\n\n29\n\nWe have four items in the 1-st row. The optimal choices are as follows:\n\nVisit (1, 1) (1, 2), (1, 3), (1, 4), (2, 4), and (2, 5), in this order, and pick up all items except the one on (1, 2). Then, the total value of the items he picks up will be 3 + 4 + 2 + 20 = 29.\n\nSample Input 3\n\n4 5 10\n2 5 12\n1 5 12\n2 3 15\n1 2 20\n1 1 28\n2 4 26\n3 2 27\n4 5 21\n3 5 10\n1 3 10\n\nSample Output 3\n\n142", "sample_input": "2 2 3\n1 1 3\n2 1 4\n1 2 5\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02586", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are K items placed on a grid of squares with R rows and C columns. Let (i, j) denote the square at the i-th row (1 \\leq i \\leq R) and the j-th column (1 \\leq j \\leq C). The i-th item is at (r_i, c_i) and has the value v_i.\n\nTakahashi will begin at (1, 1), the start, and get to (R, C), the goal. When he is at (i, j), he can move to (i + 1, j) or (i, j + 1) (but cannot move to a non-existent square).\n\nHe can pick up items on the squares he visits, including the start and the goal, but at most three for each row. It is allowed to ignore the item on a square he visits.\n\nFind the maximum possible sum of the values of items he picks up.\n\nConstraints\n\n1 \\leq R, C \\leq 3000\n\n1 \\leq K \\leq \\min(2 \\times 10^5, R \\times C)\n\n1 \\leq r_i \\leq R\n\n1 \\leq c_i \\leq C\n\n(r_i, c_i) \\neq (r_j, c_j) (i \\neq j)\n\n1 \\leq v_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR C K\nr_1 c_1 v_1\nr_2 c_2 v_2\n:\nr_K c_K v_K\n\nOutput\n\nPrint the maximum possible sum of the values of items Takahashi picks up.\n\nSample Input 1\n\n2 2 3\n1 1 3\n2 1 4\n1 2 5\n\nSample Output 1\n\n8\n\nHe has two ways to get to the goal:\n\nVisit (1, 1), (1, 2), and (2, 2), in this order. In this case, the total value of the items he can pick up is 3 + 5 = 8.\n\nVisit (1, 1), (2, 1), and (2, 2), in this order. In this case, the total value of the items he can pick up is 3 + 4 = 7.\n\nThus, the maximum possible sum of the values of items he picks up is 8.\n\nSample Input 2\n\n2 5 5\n1 1 3\n2 4 20\n1 2 1\n1 3 4\n1 4 2\n\nSample Output 2\n\n29\n\nWe have four items in the 1-st row. The optimal choices are as follows:\n\nVisit (1, 1) (1, 2), (1, 3), (1, 4), (2, 4), and (2, 5), in this order, and pick up all items except the one on (1, 2). Then, the total value of the items he picks up will be 3 + 4 + 2 + 20 = 29.\n\nSample Input 3\n\n4 5 10\n2 5 12\n1 5 12\n2 3 15\n1 2 20\n1 1 28\n2 4 26\n3 2 27\n4 5 21\n3 5 10\n1 3 10\n\nSample Output 3\n\n142", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 898, "cpu_time_ms": 234, "memory_kb": 77092}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s728383581", "group_id": "codeNet:p02594", "input_text": "open Printf\nopen Scanf\n\nlet solve x =\n  if x >= 30 then \"Yes\" else \"No\"\n\nlet () =\n  scanf \"%d \" solve |> printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1596466358, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s728383581.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s728383581", "user_id": "u388783188"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve x =\n  if x >= 30 then \"Yes\" else \"No\"\n\nlet () =\n  scanf \"%d \" solve |> printf \"%s\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above.\n\nThe current temperature of the room is X degrees Celsius. Will you turn on the air conditioner?\n\nConstraints\n\n-40 \\leq X \\leq 40\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint Yes if you will turn on the air conditioner; print No otherwise.\n\nSample Input 1\n\n25\n\nSample Output 1\n\nNo\n\nSample Input 2\n\n30\n\nSample Output 2\n\nYes", "sample_input": "25\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02594", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above.\n\nThe current temperature of the room is X degrees Celsius. Will you turn on the air conditioner?\n\nConstraints\n\n-40 \\leq X \\leq 40\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint Yes if you will turn on the air conditioner; print No otherwise.\n\nSample Input 1\n\n25\n\nSample Output 1\n\nNo\n\nSample Input 2\n\n30\n\nSample Output 2\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 119, "cpu_time_ms": 8, "memory_kb": 3736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s080169759", "group_id": "codeNet:p02594", "input_text": "open Batteries\nopen Printf\n\nlet ($) g f x = g (f x)\n\nlet swap = Tuple2.swap\n\nlet s2i = int_of_string\nlet i2s = string_of_int\nlet s2f = float_of_string\nlet f2s = string_of_float\nlet c2i = int_of_char\nlet i2c = char_of_int\nlet f2i = int_of_float\nlet i2f = float_of_int \n\nlet c2s = String.of_char\nlet s2cl = String.to_list\nlet cl2s = String.of_list\n\nlet puts s = print_endline s\nlet putw ?yn:(yn=(\"Yes\", \"No\")) b = puts (if b then fst yn else snd yn)\nlet puti i = puts @@ i2s i\n\n\n\nmodule StaleList = struct\n  include List\n\n  let nmem x l = not @@ mem x l\n\n  let len = length\n  let size = length\n  let nempty l = not @@ is_empty l\n\n  let hdop l = if nempty l then Some (hd l) else None\n\n  (* let taker = drop *)\n  let takewh = take_while\n\n  (* let dropr = take *)\n  let dropwh = drop_while\n\n  let split_by = span\n\n  let chunk = ntake\n\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr f z l = fold_right f l z\n  let foldri f z l = fold_righti f l z\n\n  let partition_to_map f l =\n    foldr (fun x m -> Map.modify_opt (f x) (function\n      | None -> Some [x] \n      | Some [] -> Some [x] \n      | Some vl -> Some (x::vl)) m) Map.empty l;;\n\n  let scanl f z ls =\n    let rec loop acl acc = function\n      | [] -> rev acl\n      | h::t ->\n        let r = f acc h in\n        loop (r::acl) r t\n    in loop [] z ls\n\n  let scanr f z ls =\n    let rec loop acl acc = function\n      | [] -> acl \n      | h::t ->\n        let r = f h acc in\n        loop (r::acl) r t\n    in loop [] z (rev ls)\n\n  (* let scanli = scan_lefti *)\n  (* let scanri = scan_righti *)\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\n\nend\n\nmodule L = StaleList\n\nmodule StaleArray = struct\n  include Array \n\n  let nmem x l = not @@ mem x l\n\n  let len = length\n  let size = length\n  let is_empty r = len r = 0\n  let nempty r = len r > 0\n\n  let take n r = left r n\n  let taker n r = right r n\n\n  let takeb x r =\n    let l = len r in\n    let rec loop i =\n      if i >= l then r\n      else if r.(i) = x then take i r\n      else loop (i + 1)\n    in loop 0\n     \n  (* let takewh = take_while *)\n\n  let drop n r = tail r n\n  let dropr n r = take ((len r) - n) r\n  (* let dropwh = drop_while *)\n\n  let index_of x r =\n    let l = len r in\n    let rec loop i =\n      if i >= l then None\n      else if r.(i) = x then Some i\n      else loop (i + 1)\n    in loop 0\n\n  (* let split_by = span *)\n\n  (* let chunk = ntake *)\n\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr f z l = fold_right f l z\n  let foldri f z l = fold_righti f l z\n\n  (* let partition_to_map f l = *)\n  (*   foldr (fun x m -> Map.modify_opt (f x) (function *)\n  (*     | None -> Some [x]  *)\n  (*     | Some [] -> Some [x]  *)\n  (*     | Some vl -> Some (x::vl)) m) Map.empty l;; *)\n\n  (* let scanl = scan_left *)\n  (* let scanli = scan_lefti *)\n  (* let scanr = scan_right *)\n  (* let scanri = scan_righti *)\n  \n  let concat2 = append\n  \n  let flatmap (f : 'a -> 'b array) a =\n    map f a |> enum |> L.of_enum |> concat\n\n  let zipf = map2\n  (* let zipfi = map2i *)\n\nend\n\nmodule A = StaleArray\n\nmodule StaleString = struct\n  include String\n\n  let len = length\n\n  let replace_chars = map\n  let map = replace\n\n  let maptol f s = L.map f (s2cl s)\n  let maptoli f s = L.map f (s2cl s)\n\n  let zipf f a b = L.zipf f (s2cl a) (s2cl b)\n  let zipfi f a b = L.zipfi f (s2cl a) (s2cl b)\n\n  let mkstr f sep ls =\n    L.foldl (fun acc x -> acc ^ sep ^ (f x)) (f @@ L.hd ls) (List.tl ls)\n\nend\n\nmodule S = StaleString\n\nlet spsp s = S.split_on_char ' ' s\n\n\nmodule StaleSortedSet = struct\n  include Set\n\n  module Make (Ord : Set.OrderedType) = struct\n    include Set.Make(Ord)\n\n    let nmem x st = not @@ mem x st\n\n    let foldl f s z = fold (fun x a -> f a x) z s\n\n    let size = cardinal\n  end\n\n  let nmem x st = not @@ mem x st\n\n  let foldl f s z = fold (fun x a -> f a x) z s\n\n  let size = cardinal\nend\n\nmodule Ss = StaleSortedSet\n\nmodule StaleSortedMap  = struct\n  include Map\n\n  module Make (Ord : Map.OrderedType) = struct\n    include Map.Make(Ord)\n\n    let nmem x st = not @@ mem x st\n\n    let get = find\n    let get_or x d m = find_default d x m\n\n    let size = cardinal\n  end\n\n  let nmem x st = not @@ mem x st\n\n  let get = find\n  let get_or x d m = find_default d x m\n\n  let size = cardinal\nend\n\nmodule Ms = StaleSortedMap\n\n\nmodule StaleRange = struct\n\n  type t = Range of int * int\n\n  let make lb ub = Range (lb, ub)\n\n  let to_list r =\n    let Range (lb, ub) = r in\n    L.make (ub - lb) ((+) lb) \n\n  let to_array r =\n    let Range (lb, ub) = r in\n      A.make (ub - lb) ((+) lb)\n\n  let iter r f = \n    let Range (lb, ub) = r in\n    for i = lb to ub do f i done\n\n  let iter2 r1 r2 f =\n    let Range (lb1, ub1) = r1 and Range (lb2, ub2) = r2 in\n      for i = lb1 to ub2 do\n        for j = lb2 to ub2 do\n          f i j\n        done\n      done\nend\n\nmodule R = StaleRange\n\nlet (---) lb ub = R.make lb ub\nlet (--^) lb ub = R.make lb (ub - 1)\n\nmodule StaleGenericAlgorithms = struct\n\n  let set_power ls =\n    let rec loop ls pls =\n      match ls with\n      | [] -> pls\n      | hd::tl -> loop tl (L.flatmap (fun p -> [p; hd::p]) pls)\n    in loop ls [[]]\n\n  let rec bsearch_max_int f lb ub =\n    if lb >= ub then (if f lb then lb else (lb - 1))\n    else (\n      let m = (lb + ub) / 2 in\n      if f m then bsearch_max_int f (m + 1) ub\n      else bsearch_max_int f lb m\n    )\n\n  let partial_sum n ls =\n    let rec loop s k = function\n      | [] -> s\n      | h::t ->\n        if k >= n then s\n        else loop (s + h) (k + 1) t\n    in\n    loop 0 0 ls\n\nend\n\nmodule Gal = StaleGenericAlgorithms\n\nlet rds () = read_line ()\n\nlet rdi () = s2i @@ rds ()\n\nlet rdhs () = spsp @@ rds ()\nlet rdhi () = rdhs () |> L.map s2i\n\nlet rdhf () = rdhs () |> L.map s2f\n\nlet rdf2 () = match rdhf () with\n| a::b::_ -> (a, b)\n| _ -> (0., 0.)\n\nlet rdf3 () = match rdhf () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0., 0., 0.)\n\nlet rdf4 () = match rdhf () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0., 0., 0., 0.)\n\nlet rds2 () = match rdhs () with\n  | a::b::_ -> (a, b)\n  | _ -> (\"\", \"\")\n\nlet rdi2 () = match rdhi () with\n  | a::b::_ -> (a, b)\n  | _ -> (0, 0)\n\nlet rdi3 () = match rdhi () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0, 0, 0)\n\nlet rdi4 () = match rdhi () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0, 0, 0, 0)\n\nlet rdi5 () = match rdhi () with\n| a::b::c::d::e::_ -> (a, b, c, d, e)\n| _ -> (0, 0, 0, 0, 0)\n\nlet rdv n rf =\n  let rec loop n =\n    if n <= 0 then []\n    else (\n      let s = rf () in\n      s::(loop (n - 1))\n    )\n  in loop n\n\nlet rdvi n = rdv n rdi\nlet rdvi2 n = rdv n rdi2\nlet rdvi3 n = rdv n rdi3\nlet rdvi4 n = rdv n rdi4\n\n\nlet print_list aa = \n  printf \"[ \"; aa |> L.iter (fun a -> printf \"%d \" a); puts \"]\"\n\nlet print_array aa = \n  printf \"[ \"; aa |> A.iter (fun a -> printf \"%d \" a); puts \"]\"\n\nlet print_carray aa = \n  printf \"[ \"; aa |> A.iter (fun a -> printf \"%c \" a); puts \"]\"\n\nlet print_matrix mat =\n  puts \"----\";\n  mat |> A.iter (fun r -> print_carray r);\n  puts \"----\"\n\n\nlet _ =\n  let n = rdi () in\n  putw (n = 30);\n  ()\n", "language": "OCaml", "metadata": {"date": 1596416467, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s080169759.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s080169759", "user_id": "u970139668"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "open Batteries\nopen Printf\n\nlet ($) g f x = g (f x)\n\nlet swap = Tuple2.swap\n\nlet s2i = int_of_string\nlet i2s = string_of_int\nlet s2f = float_of_string\nlet f2s = string_of_float\nlet c2i = int_of_char\nlet i2c = char_of_int\nlet f2i = int_of_float\nlet i2f = float_of_int \n\nlet c2s = String.of_char\nlet s2cl = String.to_list\nlet cl2s = String.of_list\n\nlet puts s = print_endline s\nlet putw ?yn:(yn=(\"Yes\", \"No\")) b = puts (if b then fst yn else snd yn)\nlet puti i = puts @@ i2s i\n\n\n\nmodule StaleList = struct\n  include List\n\n  let nmem x l = not @@ mem x l\n\n  let len = length\n  let size = length\n  let nempty l = not @@ is_empty l\n\n  let hdop l = if nempty l then Some (hd l) else None\n\n  (* let taker = drop *)\n  let takewh = take_while\n\n  (* let dropr = take *)\n  let dropwh = drop_while\n\n  let split_by = span\n\n  let chunk = ntake\n\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr f z l = fold_right f l z\n  let foldri f z l = fold_righti f l z\n\n  let partition_to_map f l =\n    foldr (fun x m -> Map.modify_opt (f x) (function\n      | None -> Some [x] \n      | Some [] -> Some [x] \n      | Some vl -> Some (x::vl)) m) Map.empty l;;\n\n  let scanl f z ls =\n    let rec loop acl acc = function\n      | [] -> rev acl\n      | h::t ->\n        let r = f acc h in\n        loop (r::acl) r t\n    in loop [] z ls\n\n  let scanr f z ls =\n    let rec loop acl acc = function\n      | [] -> acl \n      | h::t ->\n        let r = f h acc in\n        loop (r::acl) r t\n    in loop [] z (rev ls)\n\n  (* let scanli = scan_lefti *)\n  (* let scanri = scan_righti *)\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\n\nend\n\nmodule L = StaleList\n\nmodule StaleArray = struct\n  include Array \n\n  let nmem x l = not @@ mem x l\n\n  let len = length\n  let size = length\n  let is_empty r = len r = 0\n  let nempty r = len r > 0\n\n  let take n r = left r n\n  let taker n r = right r n\n\n  let takeb x r =\n    let l = len r in\n    let rec loop i =\n      if i >= l then r\n      else if r.(i) = x then take i r\n      else loop (i + 1)\n    in loop 0\n     \n  (* let takewh = take_while *)\n\n  let drop n r = tail r n\n  let dropr n r = take ((len r) - n) r\n  (* let dropwh = drop_while *)\n\n  let index_of x r =\n    let l = len r in\n    let rec loop i =\n      if i >= l then None\n      else if r.(i) = x then Some i\n      else loop (i + 1)\n    in loop 0\n\n  (* let split_by = span *)\n\n  (* let chunk = ntake *)\n\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr f z l = fold_right f l z\n  let foldri f z l = fold_righti f l z\n\n  (* let partition_to_map f l = *)\n  (*   foldr (fun x m -> Map.modify_opt (f x) (function *)\n  (*     | None -> Some [x]  *)\n  (*     | Some [] -> Some [x]  *)\n  (*     | Some vl -> Some (x::vl)) m) Map.empty l;; *)\n\n  (* let scanl = scan_left *)\n  (* let scanli = scan_lefti *)\n  (* let scanr = scan_right *)\n  (* let scanri = scan_righti *)\n  \n  let concat2 = append\n  \n  let flatmap (f : 'a -> 'b array) a =\n    map f a |> enum |> L.of_enum |> concat\n\n  let zipf = map2\n  (* let zipfi = map2i *)\n\nend\n\nmodule A = StaleArray\n\nmodule StaleString = struct\n  include String\n\n  let len = length\n\n  let replace_chars = map\n  let map = replace\n\n  let maptol f s = L.map f (s2cl s)\n  let maptoli f s = L.map f (s2cl s)\n\n  let zipf f a b = L.zipf f (s2cl a) (s2cl b)\n  let zipfi f a b = L.zipfi f (s2cl a) (s2cl b)\n\n  let mkstr f sep ls =\n    L.foldl (fun acc x -> acc ^ sep ^ (f x)) (f @@ L.hd ls) (List.tl ls)\n\nend\n\nmodule S = StaleString\n\nlet spsp s = S.split_on_char ' ' s\n\n\nmodule StaleSortedSet = struct\n  include Set\n\n  module Make (Ord : Set.OrderedType) = struct\n    include Set.Make(Ord)\n\n    let nmem x st = not @@ mem x st\n\n    let foldl f s z = fold (fun x a -> f a x) z s\n\n    let size = cardinal\n  end\n\n  let nmem x st = not @@ mem x st\n\n  let foldl f s z = fold (fun x a -> f a x) z s\n\n  let size = cardinal\nend\n\nmodule Ss = StaleSortedSet\n\nmodule StaleSortedMap  = struct\n  include Map\n\n  module Make (Ord : Map.OrderedType) = struct\n    include Map.Make(Ord)\n\n    let nmem x st = not @@ mem x st\n\n    let get = find\n    let get_or x d m = find_default d x m\n\n    let size = cardinal\n  end\n\n  let nmem x st = not @@ mem x st\n\n  let get = find\n  let get_or x d m = find_default d x m\n\n  let size = cardinal\nend\n\nmodule Ms = StaleSortedMap\n\n\nmodule StaleRange = struct\n\n  type t = Range of int * int\n\n  let make lb ub = Range (lb, ub)\n\n  let to_list r =\n    let Range (lb, ub) = r in\n    L.make (ub - lb) ((+) lb) \n\n  let to_array r =\n    let Range (lb, ub) = r in\n      A.make (ub - lb) ((+) lb)\n\n  let iter r f = \n    let Range (lb, ub) = r in\n    for i = lb to ub do f i done\n\n  let iter2 r1 r2 f =\n    let Range (lb1, ub1) = r1 and Range (lb2, ub2) = r2 in\n      for i = lb1 to ub2 do\n        for j = lb2 to ub2 do\n          f i j\n        done\n      done\nend\n\nmodule R = StaleRange\n\nlet (---) lb ub = R.make lb ub\nlet (--^) lb ub = R.make lb (ub - 1)\n\nmodule StaleGenericAlgorithms = struct\n\n  let set_power ls =\n    let rec loop ls pls =\n      match ls with\n      | [] -> pls\n      | hd::tl -> loop tl (L.flatmap (fun p -> [p; hd::p]) pls)\n    in loop ls [[]]\n\n  let rec bsearch_max_int f lb ub =\n    if lb >= ub then (if f lb then lb else (lb - 1))\n    else (\n      let m = (lb + ub) / 2 in\n      if f m then bsearch_max_int f (m + 1) ub\n      else bsearch_max_int f lb m\n    )\n\n  let partial_sum n ls =\n    let rec loop s k = function\n      | [] -> s\n      | h::t ->\n        if k >= n then s\n        else loop (s + h) (k + 1) t\n    in\n    loop 0 0 ls\n\nend\n\nmodule Gal = StaleGenericAlgorithms\n\nlet rds () = read_line ()\n\nlet rdi () = s2i @@ rds ()\n\nlet rdhs () = spsp @@ rds ()\nlet rdhi () = rdhs () |> L.map s2i\n\nlet rdhf () = rdhs () |> L.map s2f\n\nlet rdf2 () = match rdhf () with\n| a::b::_ -> (a, b)\n| _ -> (0., 0.)\n\nlet rdf3 () = match rdhf () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0., 0., 0.)\n\nlet rdf4 () = match rdhf () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0., 0., 0., 0.)\n\nlet rds2 () = match rdhs () with\n  | a::b::_ -> (a, b)\n  | _ -> (\"\", \"\")\n\nlet rdi2 () = match rdhi () with\n  | a::b::_ -> (a, b)\n  | _ -> (0, 0)\n\nlet rdi3 () = match rdhi () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0, 0, 0)\n\nlet rdi4 () = match rdhi () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0, 0, 0, 0)\n\nlet rdi5 () = match rdhi () with\n| a::b::c::d::e::_ -> (a, b, c, d, e)\n| _ -> (0, 0, 0, 0, 0)\n\nlet rdv n rf =\n  let rec loop n =\n    if n <= 0 then []\n    else (\n      let s = rf () in\n      s::(loop (n - 1))\n    )\n  in loop n\n\nlet rdvi n = rdv n rdi\nlet rdvi2 n = rdv n rdi2\nlet rdvi3 n = rdv n rdi3\nlet rdvi4 n = rdv n rdi4\n\n\nlet print_list aa = \n  printf \"[ \"; aa |> L.iter (fun a -> printf \"%d \" a); puts \"]\"\n\nlet print_array aa = \n  printf \"[ \"; aa |> A.iter (fun a -> printf \"%d \" a); puts \"]\"\n\nlet print_carray aa = \n  printf \"[ \"; aa |> A.iter (fun a -> printf \"%c \" a); puts \"]\"\n\nlet print_matrix mat =\n  puts \"----\";\n  mat |> A.iter (fun r -> print_carray r);\n  puts \"----\"\n\n\nlet _ =\n  let n = rdi () in\n  putw (n = 30);\n  ()\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above.\n\nThe current temperature of the room is X degrees Celsius. Will you turn on the air conditioner?\n\nConstraints\n\n-40 \\leq X \\leq 40\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint Yes if you will turn on the air conditioner; print No otherwise.\n\nSample Input 1\n\n25\n\nSample Output 1\n\nNo\n\nSample Input 2\n\n30\n\nSample Output 2\n\nYes", "sample_input": "25\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02594", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above.\n\nThe current temperature of the room is X degrees Celsius. Will you turn on the air conditioner?\n\nConstraints\n\n-40 \\leq X \\leq 40\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint Yes if you will turn on the air conditioner; print No otherwise.\n\nSample Input 1\n\n25\n\nSample Output 1\n\nNo\n\nSample Input 2\n\n30\n\nSample Output 2\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6973, "cpu_time_ms": 8, "memory_kb": 5396}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s193550943", "group_id": "codeNet:p02595", "input_text": "open Printf\nopen Scanf\n\nlet id x = x\n\nlet n, d = scanf \"%d %d\\n\" (fun n d -> n, float d)\nlet ary = Array.init n (fun _ -> scanf \"%d %d\\n\" (fun x y -> float x, float y))\n\nlet run () =\n    let n = Array.fold_left (fun n (x, y) -> if x *. x +. y *. y <= d *. d then n + 1 else n) 0 ary in\n    printf \"%d\\n\" n\n\nlet () = run ()\n", "language": "OCaml", "metadata": {"date": 1596416758, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02595.html", "problem_id": "p02595", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02595/input.txt", "sample_output_relpath": "derived/input_output/data/p02595/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02595/OCaml/s193550943.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s193550943", "user_id": "u809832909"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet id x = x\n\nlet n, d = scanf \"%d %d\\n\" (fun n d -> n, float d)\nlet ary = Array.init n (fun _ -> scanf \"%d %d\\n\" (fun x y -> float x, float y))\n\nlet run () =\n    let n = Array.fold_left (fun n (x, y) -> if x *. x +. y *. y <= d *. d then n + 1 else n) 0 ary in\n    printf \"%d\\n\" n\n\nlet () = run ()\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i).\n\nAmong them, we are looking for the points such that the distance from the origin is at most D. How many such points are there?\n\nWe remind you that the distance between the origin and the point (p, q) can be represented as \\sqrt{p^2+q^2}.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n0 \\leq D \\leq 2\\times 10^5\n\n|X_i|,|Y_i| \\leq 2\\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_1 Y_1\n\\vdots\nX_N Y_N\n\nOutput\n\nPrint an integer representing the number of points such that the distance from the origin is at most D.\n\nSample Input 1\n\n4 5\n0 5\n-2 4\n3 4\n4 -4\n\nSample Output 1\n\n3\n\nThe distance between the origin and each of the given points is as follows:\n\n\\sqrt{0^2+5^2}=5\n\n\\sqrt{(-2)^2+4^2}=4.472\\ldots\n\n\\sqrt{3^2+4^2}=5\n\n\\sqrt{4^2+(-4)^2}=5.656\\ldots\n\nThus, we have three points such that the distance from the origin is at most 5.\n\nSample Input 2\n\n12 3\n1 1\n1 1\n1 1\n1 1\n1 2\n1 3\n2 1\n2 2\n2 3\n3 1\n3 2\n3 3\n\nSample Output 2\n\n7\n\nMultiple points may exist at the same coordinates.\n\nSample Input 3\n\n20 100000\n14309 -32939\n-56855 100340\n151364 25430\n103789 -113141\n147404 -136977\n-37006 -30929\n188810 -49557\n13419 70401\n-88280 165170\n-196399 137941\n-176527 -61904\n46659 115261\n-153551 114185\n98784 -6820\n94111 -86268\n-30401 61477\n-55056 7872\n5901 -163796\n138819 -185986\n-69848 -96669\n\nSample Output 3\n\n6", "sample_input": "4 5\n0 5\n-2 4\n3 4\n4 -4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02595", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have N points in the two-dimensional plane. The coordinates of the i-th point are (X_i,Y_i).\n\nAmong them, we are looking for the points such that the distance from the origin is at most D. How many such points are there?\n\nWe remind you that the distance between the origin and the point (p, q) can be represented as \\sqrt{p^2+q^2}.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n0 \\leq D \\leq 2\\times 10^5\n\n|X_i|,|Y_i| \\leq 2\\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_1 Y_1\n\\vdots\nX_N Y_N\n\nOutput\n\nPrint an integer representing the number of points such that the distance from the origin is at most D.\n\nSample Input 1\n\n4 5\n0 5\n-2 4\n3 4\n4 -4\n\nSample Output 1\n\n3\n\nThe distance between the origin and each of the given points is as follows:\n\n\\sqrt{0^2+5^2}=5\n\n\\sqrt{(-2)^2+4^2}=4.472\\ldots\n\n\\sqrt{3^2+4^2}=5\n\n\\sqrt{4^2+(-4)^2}=5.656\\ldots\n\nThus, we have three points such that the distance from the origin is at most 5.\n\nSample Input 2\n\n12 3\n1 1\n1 1\n1 1\n1 1\n1 2\n1 3\n2 1\n2 2\n2 3\n3 1\n3 2\n3 3\n\nSample Output 2\n\n7\n\nMultiple points may exist at the same coordinates.\n\nSample Input 3\n\n20 100000\n14309 -32939\n-56855 100340\n151364 25430\n103789 -113141\n147404 -136977\n-37006 -30929\n188810 -49557\n13419 70401\n-88280 165170\n-196399 137941\n-176527 -61904\n46659 115261\n-153551 114185\n98784 -6820\n94111 -86268\n-30401 61477\n-55056 7872\n5901 -163796\n138819 -185986\n-69848 -96669\n\nSample Output 3\n\n6", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 323, "cpu_time_ms": 112, "memory_kb": 19180}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s663470171", "group_id": "codeNet:p02597", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let cs = Array.init n @@ fun _ -> Scanf.scanf \"%c\" Fun.id in\n  let reds = Array.make (n + 1) 0 in (* th以上の赤 *)\n  let whites = Array.make (n + 1) 0 in (* th未満の白 *)\n  for i = 0 to n - 1 do\n    match cs.(i) with\n    | 'R' -> reds.(i) <- reds.(i) + 1\n    | 'W' -> whites.(i + 1) <- whites.(i + 1) + 1\n  done;\n  for i = n - 1 downto 0 do\n    reds.(i) <- reds.(i) + reds.(i + 1)\n  done;\n  for i = 0 to n - 1 do\n    whites.(i + 1) <- whites.(i) + whites.(i + 1)\n  done;\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left min max_int @@\n  Array.init (n + 1) @@ fun i -> max reds.(i) whites.(i)", "language": "OCaml", "metadata": {"date": 1596423491, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02597.html", "problem_id": "p02597", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02597/input.txt", "sample_output_relpath": "derived/input_output/data/p02597/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02597/OCaml/s663470171.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s663470171", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let cs = Array.init n @@ fun _ -> Scanf.scanf \"%c\" Fun.id in\n  let reds = Array.make (n + 1) 0 in (* th以上の赤 *)\n  let whites = Array.make (n + 1) 0 in (* th未満の白 *)\n  for i = 0 to n - 1 do\n    match cs.(i) with\n    | 'R' -> reds.(i) <- reds.(i) + 1\n    | 'W' -> whites.(i + 1) <- whites.(i + 1) + 1\n  done;\n  for i = n - 1 downto 0 do\n    reds.(i) <- reds.(i) + reds.(i + 1)\n  done;\n  for i = 0 to n - 1 do\n    whites.(i + 1) <- whites.(i) + whites.(i + 1)\n  done;\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left min max_int @@\n  Array.init (n + 1) @@ fun i -> max reds.(i) whites.(i)", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 44, "memory_kb": 12292}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s974144324", "group_id": "codeNet:p02598", "input_text": "let n, k = Scanf.scanf \"%d %d\\n\" (fun n k -> n, k)\nlet a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun i -> i))\n\nlet rec f l r =\n  if r <= l then r\n  else\n    let m = (l + r) / 2 in\n    let k' = Array.fold_left (fun i j -> i + (j - 1) / m) 0 a in\n    if k < k' then f (m + 1) r\n    else f l m\n\nlet () = Printf.printf \"%d\\n\" (f 1 1000000000)\n", "language": "OCaml", "metadata": {"date": 1597287769, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02598.html", "problem_id": "p02598", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02598/input.txt", "sample_output_relpath": "derived/input_output/data/p02598/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02598/OCaml/s974144324.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s974144324", "user_id": "u752907799"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let n, k = Scanf.scanf \"%d %d\\n\" (fun n k -> n, k)\nlet a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun i -> i))\n\nlet rec f l r =\n  if r <= l then r\n  else\n    let m = (l + r) / 2 in\n    let k' = Array.fold_left (fun i j -> i + (j - 1) / m) 0 a in\n    if k < k' then f (m + 1) r\n    else f l m\n\nlet () = Printf.printf \"%d\\n\" (f 1 1000000000)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N logs of lengths A_1,A_2,\\cdots A_N.\n\nWe can cut these logs at most K times in total. When a log of length L is cut at a point whose distance from an end of the log is t (0<t<L), it becomes two logs of lengths t and L-t.\n\nFind the shortest possible length of the longest log after at most K cuts, and print it after rounding up to an integer.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 10^9\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint an integer representing the answer.\n\nSample Input 1\n\n2 3\n7 9\n\nSample Output 1\n\n4\n\nFirst, we will cut the log of length 7 at a point whose distance from an end of the log is 3.5, resulting in two logs of length 3.5 each.\n\nNext, we will cut the log of length 9 at a point whose distance from an end of the log is 3, resulting in two logs of length 3 and 6.\n\nLastly, we will cut the log of length 6 at a point whose distance from an end of the log is 3.3, resulting in two logs of length 3.3 and 2.7.\n\nIn this case, the longest length of a log will be 3.5, which is the shortest possible result. After rounding up to an integer, the output should be 4.\n\nSample Input 2\n\n3 0\n3 4 5\n\nSample Output 2\n\n5\n\nSample Input 3\n\n10 10\n158260522 877914575 602436426 24979445 861648772 623690081 433933447 476190629 262703497 211047202\n\nSample Output 3\n\n292638192", "sample_input": "2 3\n7 9\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02598", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N logs of lengths A_1,A_2,\\cdots A_N.\n\nWe can cut these logs at most K times in total. When a log of length L is cut at a point whose distance from an end of the log is t (0<t<L), it becomes two logs of lengths t and L-t.\n\nFind the shortest possible length of the longest log after at most K cuts, and print it after rounding up to an integer.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 10^9\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint an integer representing the answer.\n\nSample Input 1\n\n2 3\n7 9\n\nSample Output 1\n\n4\n\nFirst, we will cut the log of length 7 at a point whose distance from an end of the log is 3.5, resulting in two logs of length 3.5 each.\n\nNext, we will cut the log of length 9 at a point whose distance from an end of the log is 3, resulting in two logs of length 3 and 6.\n\nLastly, we will cut the log of length 6 at a point whose distance from an end of the log is 3.3, resulting in two logs of length 3.3 and 2.7.\n\nIn this case, the longest length of a log will be 3.5, which is the shortest possible result. After rounding up to an integer, the output should be 4.\n\nSample Input 2\n\n3 0\n3 4 5\n\nSample Output 2\n\n5\n\nSample Input 3\n\n10 10\n158260522 877914575 602436426 24979445 861648772 623690081 433933447 476190629 262703497 211047202\n\nSample Output 3\n\n292638192", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 343, "cpu_time_ms": 115, "memory_kb": 7472}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s753663401", "group_id": "codeNet:p02599", "input_text": "(* 0-indexedなBIT *)\nmodule FenwickTree = struct\n  (* 可換モノイド *)\n  module type CommutativeMonoid = sig\n    type t\n    val e : t\n    val op : t -> t -> t\n  end\n\n  module Make (CM : CommutativeMonoid)\n  : sig\n    type t\n    (* n要素の単位元からなるBITを作る *)\n    val make : int -> t\n    (* 添字iの要素にはf iが入ったn要素のBITを作る *)\n    val init : int -> (int -> CM.t) -> t\n    (* 与えられたリストの要素が入ったBITを作る *)\n    val of_list : CM.t list -> t\n    (* i番目の要素にxを加える *)\n    val accumulate : t -> int -> CM.t -> unit\n\n    (* 添字が[0, i)の範囲の要素を全て加えた値を求める *)\n    val query : t -> int -> CM.t\n  end\n  = struct\n    type t = CM.t array\n\n    let make n = Array.make n CM.e\n\n    let initialize a =\n      for i = 0 to Array.length a - 1 do\n        if i lor (i + 1) < Array.length a then\n          a.(i lor (i + 1)) <- CM.op a.(i) a.(i lor (i + 1))\n      done\n\n    let init n f =\n      let a = Array.init n f in\n      initialize a; a\n\n    let of_list l =\n      let a = Array.of_list l in\n      initialize a; a\n\n    let rec accumulate a i x =\n      if i < Array.length a then begin\n        a.(i) <- CM.op x a.(i);\n        accumulate a (i lor (i + 1)) x\n      end\n\n    let rec query acc a i =\n      if i < 0\n      then acc\n      else query (CM.op acc a.(i)) a ((i land (i + 1)) - 1)\n    let query a i = query CM.e a (i - 1)\n  end\nend\n\nmodule SumBIT = FenwickTree.Make (struct\n  type t = int\n  let e = 0\n  let op = ( + )\nend)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n q ->\n  let cs = Array.init n @@ fun _ -> Scanf.scanf \"%d \" pred in\n  let lrs = Array.init q @@ fun i -> Scanf.scanf \"%d %d\\n\" @@ fun l r -> i, l - 1, r - 1 in\n  Array.sort (fun (_, _, r) (_, _, r') -> compare r r') lrs;\n  let r = ref 0 in\n  let ans = Array.make q 0 in\n  let bit = SumBIT.make (n + 2) in\n  let prev = Array.make n (n + 1) in\n  Array.iter (fun (i, l, right) ->\n    while !r <= right do\n      SumBIT.accumulate bit !r 1;\n      SumBIT.accumulate bit prev.(cs.(!r)) (-1);\n      prev.(cs.(!r)) <- !r;\n      incr r\n    done;\n    ans.(i) <- SumBIT.query bit (!r + 1) - SumBIT.query bit l) lrs;\n  Array.iter (Printf.printf \"%d\\n\") ans", "language": "OCaml", "metadata": {"date": 1596424181, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s753663401.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s753663401", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n3\n1\n", "input_to_evaluate": "(* 0-indexedなBIT *)\nmodule FenwickTree = struct\n  (* 可換モノイド *)\n  module type CommutativeMonoid = sig\n    type t\n    val e : t\n    val op : t -> t -> t\n  end\n\n  module Make (CM : CommutativeMonoid)\n  : sig\n    type t\n    (* n要素の単位元からなるBITを作る *)\n    val make : int -> t\n    (* 添字iの要素にはf iが入ったn要素のBITを作る *)\n    val init : int -> (int -> CM.t) -> t\n    (* 与えられたリストの要素が入ったBITを作る *)\n    val of_list : CM.t list -> t\n    (* i番目の要素にxを加える *)\n    val accumulate : t -> int -> CM.t -> unit\n\n    (* 添字が[0, i)の範囲の要素を全て加えた値を求める *)\n    val query : t -> int -> CM.t\n  end\n  = struct\n    type t = CM.t array\n\n    let make n = Array.make n CM.e\n\n    let initialize a =\n      for i = 0 to Array.length a - 1 do\n        if i lor (i + 1) < Array.length a then\n          a.(i lor (i + 1)) <- CM.op a.(i) a.(i lor (i + 1))\n      done\n\n    let init n f =\n      let a = Array.init n f in\n      initialize a; a\n\n    let of_list l =\n      let a = Array.of_list l in\n      initialize a; a\n\n    let rec accumulate a i x =\n      if i < Array.length a then begin\n        a.(i) <- CM.op x a.(i);\n        accumulate a (i lor (i + 1)) x\n      end\n\n    let rec query acc a i =\n      if i < 0\n      then acc\n      else query (CM.op acc a.(i)) a ((i land (i + 1)) - 1)\n    let query a i = query CM.e a (i - 1)\n  end\nend\n\nmodule SumBIT = FenwickTree.Make (struct\n  type t = int\n  let e = 0\n  let op = ( + )\nend)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n q ->\n  let cs = Array.init n @@ fun _ -> Scanf.scanf \"%d \" pred in\n  let lrs = Array.init q @@ fun i -> Scanf.scanf \"%d %d\\n\" @@ fun l r -> i, l - 1, r - 1 in\n  Array.sort (fun (_, _, r) (_, _, r') -> compare r r') lrs;\n  let r = ref 0 in\n  let ans = Array.make q 0 in\n  let bit = SumBIT.make (n + 2) in\n  let prev = Array.make n (n + 1) in\n  Array.iter (fun (i, l, right) ->\n    while !r <= right do\n      SumBIT.accumulate bit !r 1;\n      SumBIT.accumulate bit prev.(cs.(!r)) (-1);\n      prev.(cs.(!r)) <- !r;\n      incr r\n    done;\n    ans.(i) <- SumBIT.query bit (!r + 1) - SumBIT.query bit l) lrs;\n  Array.iter (Printf.printf \"%d\\n\") ans", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2227, "cpu_time_ms": 1020, "memory_kb": 43204}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s590017642", "group_id": "codeNet:p02600", "input_text": "open Batteries\nopen Printf\n\nlet ($) g f x = g (f x)\n\nlet swap = Tuple2.swap\n\nlet s2i = int_of_string\nlet i2s = string_of_int\nlet s2f = float_of_string\nlet f2s = string_of_float\nlet c2i = int_of_char\nlet i2c = char_of_int\nlet f2i = int_of_float\nlet i2f = float_of_int \n\nlet c2s = String.of_char\nlet s2cl = String.to_list\nlet cl2s = String.of_list\n\nlet puts s = print_endline s\nlet putw ?yn:(yn=(\"Yes\", \"No\")) b = puts (if b then fst yn else snd yn)\nlet puti i = puts @@ i2s i\n\n\n\nmodule StaleList = struct\n  include List\n\n  let nmem x l = not @@ mem x l\n\n  let len = length\n  let size = length\n  let nempty l = not @@ is_empty l\n\n  let hdop l = if nempty l then Some (hd l) else None\n\n  (* let taker = drop *)\n  let takewh = take_while\n\n  (* let dropr = take *)\n  let dropwh = drop_while\n\n  let split_by = span\n\n  let chunk = ntake\n\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr f z l = fold_right f l z\n  let foldri f z l = fold_righti f l z\n\n  let partition_to_map f l =\n    foldr (fun x m -> Map.modify_opt (f x) (function\n      | None -> Some [x] \n      | Some [] -> Some [x] \n      | Some vl -> Some (x::vl)) m) Map.empty l;;\n\n  let scanl f z ls =\n    let rec loop acl acc = function\n      | [] -> rev acl\n      | h::t ->\n        let r = f acc h in\n        loop (r::acl) r t\n    in loop [] z ls\n\n  let scanr f z ls =\n    let rec loop acl acc = function\n      | [] -> acl \n      | h::t ->\n        let r = f h acc in\n        loop (r::acl) r t\n    in loop [] z (rev ls)\n\n  (* let scanli = scan_lefti *)\n  (* let scanri = scan_righti *)\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\n\nend\n\nmodule L = StaleList\n\nmodule StaleArray = struct\n  include Array \n\n  let nmem x l = not @@ mem x l\n\n  let len = length\n  let size = length\n  let is_empty r = len r = 0\n  let nempty r = len r > 0\n\n  let take n r = left r n\n  let taker n r = right r n\n\n  let takeb x r =\n    let l = len r in\n    let rec loop i =\n      if i >= l then r\n      else if r.(i) = x then take i r\n      else loop (i + 1)\n    in loop 0\n     \n  (* let takewh = take_while *)\n\n  let drop n r = tail r n\n  let dropr n r = take ((len r) - n) r\n  (* let dropwh = drop_while *)\n\n  let index_of x r =\n    let l = len r in\n    let rec loop i =\n      if i >= l then None\n      else if r.(i) = x then Some i\n      else loop (i + 1)\n    in loop 0\n\n  (* let split_by = span *)\n\n  (* let chunk = ntake *)\n\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr f z l = fold_right f l z\n  let foldri f z l = fold_righti f l z\n\n  (* let partition_to_map f l = *)\n  (*   foldr (fun x m -> Map.modify_opt (f x) (function *)\n  (*     | None -> Some [x]  *)\n  (*     | Some [] -> Some [x]  *)\n  (*     | Some vl -> Some (x::vl)) m) Map.empty l;; *)\n\n  (* let scanl = scan_left *)\n  (* let scanli = scan_lefti *)\n  (* let scanr = scan_right *)\n  (* let scanri = scan_righti *)\n  \n  let concat2 = append\n  \n  let flatmap (f : 'a -> 'b array) a =\n    map f a |> enum |> L.of_enum |> concat\n\n  let zipf = map2\n  (* let zipfi = map2i *)\n\nend\n\nmodule A = StaleArray\n\nmodule StaleString = struct\n  include String\n\n  let len = length\n\n  let replace_chars = map\n  let map = replace\n\n  let maptol f s = L.map f (s2cl s)\n  let maptoli f s = L.map f (s2cl s)\n\n  let zipf f a b = L.zipf f (s2cl a) (s2cl b)\n  let zipfi f a b = L.zipfi f (s2cl a) (s2cl b)\n\n  let mkstr f sep ls =\n    L.foldl (fun acc x -> acc ^ sep ^ (f x)) (f @@ L.hd ls) (List.tl ls)\n\nend\n\nmodule S = StaleString\n\nlet spsp s = S.split_on_char ' ' s\n\n\nmodule StaleSortedSet = struct\n  include Set\n\n  module Make (Ord : Set.OrderedType) = struct\n    include Set.Make(Ord)\n\n    let nmem x st = not @@ mem x st\n\n    let foldl f s z = fold (fun x a -> f a x) z s\n\n    let size = cardinal\n  end\n\n  let nmem x st = not @@ mem x st\n\n  let foldl f s z = fold (fun x a -> f a x) z s\n\n  let size = cardinal\nend\n\nmodule Ss = StaleSortedSet\n\nmodule StaleSortedMap  = struct\n  include Map\n\n  module Make (Ord : Map.OrderedType) = struct\n    include Map.Make(Ord)\n\n    let nmem x st = not @@ mem x st\n\n    let get = find\n    let get_or x d m = find_default d x m\n\n    let size = cardinal\n  end\n\n  let nmem x st = not @@ mem x st\n\n  let get = find\n  let get_or x d m = find_default d x m\n\n  let size = cardinal\nend\n\nmodule Ms = StaleSortedMap\n\n\nmodule StaleRange = struct\n\n  type t = Range of int * int\n\n  let make lb ub = Range (lb, ub)\n\n  let to_list r =\n    let Range (lb, ub) = r in\n    L.make (ub - lb) ((+) lb) \n\n  let to_array r =\n    let Range (lb, ub) = r in\n      A.make (ub - lb) ((+) lb)\n\n  let iter r f = \n    let Range (lb, ub) = r in\n    for i = lb to ub do f i done\n\n  let iter2 r1 r2 f =\n    let Range (lb1, ub1) = r1 and Range (lb2, ub2) = r2 in\n      for i = lb1 to ub2 do\n        for j = lb2 to ub2 do\n          f i j\n        done\n      done\nend\n\nmodule R = StaleRange\n\nlet (---) lb ub = R.make lb ub\nlet (--^) lb ub = R.make lb (ub - 1)\n\nmodule StaleGenericAlgorithms = struct\n\n  let set_power ls =\n    let rec loop ls pls =\n      match ls with\n      | [] -> pls\n      | hd::tl -> loop tl (L.flatmap (fun p -> [p; hd::p]) pls)\n    in loop ls [[]]\n\n  let rec bsearch_max_int f lb ub =\n    if lb >= ub then (if f lb then lb else (lb - 1))\n    else (\n      let m = (lb + ub) / 2 in\n      if f m then bsearch_max_int f (m + 1) ub\n      else bsearch_max_int f lb m\n    )\n\n  let partial_sum n ls =\n    let rec loop s k = function\n      | [] -> s\n      | h::t ->\n        if k >= n then s\n        else loop (s + h) (k + 1) t\n    in\n    loop 0 0 ls\n\nend\n\nmodule Gal = StaleGenericAlgorithms\n\nlet rds () = read_line ()\n\nlet rdi () = s2i @@ rds ()\n\nlet rdhs () = spsp @@ rds ()\nlet rdhi () = rdhs () |> L.map s2i\n\nlet rdhf () = rdhs () |> L.map s2f\n\nlet rdf2 () = match rdhf () with\n| a::b::_ -> (a, b)\n| _ -> (0., 0.)\n\nlet rdf3 () = match rdhf () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0., 0., 0.)\n\nlet rdf4 () = match rdhf () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0., 0., 0., 0.)\n\nlet rds2 () = match rdhs () with\n  | a::b::_ -> (a, b)\n  | _ -> (\"\", \"\")\n\nlet rdi2 () = match rdhi () with\n  | a::b::_ -> (a, b)\n  | _ -> (0, 0)\n\nlet rdi3 () = match rdhi () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0, 0, 0)\n\nlet rdi4 () = match rdhi () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0, 0, 0, 0)\n\nlet rdi5 () = match rdhi () with\n| a::b::c::d::e::_ -> (a, b, c, d, e)\n| _ -> (0, 0, 0, 0, 0)\n\nlet rdv n rf =\n  let rec loop n =\n    if n <= 0 then []\n    else (\n      let s = rf () in\n      s::(loop (n - 1))\n    )\n  in loop n\n\nlet rdvi n = rdv n rdi\nlet rdvi2 n = rdv n rdi2\nlet rdvi3 n = rdv n rdi3\nlet rdvi4 n = rdv n rdi4\n\n\nlet print_list aa = \n  printf \"[ \"; aa |> L.iter (fun a -> printf \"%d \" a); puts \"]\"\n\nlet print_array aa = \n  printf \"[ \"; aa |> A.iter (fun a -> printf \"%d \" a); puts \"]\"\n\nlet print_carray aa = \n  printf \"[ \"; aa |> A.iter (fun a -> printf \"%c \" a); puts \"]\"\n\nlet print_matrix mat =\n  puts \"----\";\n  mat |> A.iter (fun r -> print_carray r);\n  puts \"----\"\n\n\nlet _ =\n  let x = rdi () in\n  let q = 8 - ((x - 400) / 200) in\n  puti q;\n  ()\n", "language": "OCaml", "metadata": {"date": 1595725365, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s590017642.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s590017642", "user_id": "u970139668"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "open Batteries\nopen Printf\n\nlet ($) g f x = g (f x)\n\nlet swap = Tuple2.swap\n\nlet s2i = int_of_string\nlet i2s = string_of_int\nlet s2f = float_of_string\nlet f2s = string_of_float\nlet c2i = int_of_char\nlet i2c = char_of_int\nlet f2i = int_of_float\nlet i2f = float_of_int \n\nlet c2s = String.of_char\nlet s2cl = String.to_list\nlet cl2s = String.of_list\n\nlet puts s = print_endline s\nlet putw ?yn:(yn=(\"Yes\", \"No\")) b = puts (if b then fst yn else snd yn)\nlet puti i = puts @@ i2s i\n\n\n\nmodule StaleList = struct\n  include List\n\n  let nmem x l = not @@ mem x l\n\n  let len = length\n  let size = length\n  let nempty l = not @@ is_empty l\n\n  let hdop l = if nempty l then Some (hd l) else None\n\n  (* let taker = drop *)\n  let takewh = take_while\n\n  (* let dropr = take *)\n  let dropwh = drop_while\n\n  let split_by = span\n\n  let chunk = ntake\n\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr f z l = fold_right f l z\n  let foldri f z l = fold_righti f l z\n\n  let partition_to_map f l =\n    foldr (fun x m -> Map.modify_opt (f x) (function\n      | None -> Some [x] \n      | Some [] -> Some [x] \n      | Some vl -> Some (x::vl)) m) Map.empty l;;\n\n  let scanl f z ls =\n    let rec loop acl acc = function\n      | [] -> rev acl\n      | h::t ->\n        let r = f acc h in\n        loop (r::acl) r t\n    in loop [] z ls\n\n  let scanr f z ls =\n    let rec loop acl acc = function\n      | [] -> acl \n      | h::t ->\n        let r = f h acc in\n        loop (r::acl) r t\n    in loop [] z (rev ls)\n\n  (* let scanli = scan_lefti *)\n  (* let scanri = scan_righti *)\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\n\nend\n\nmodule L = StaleList\n\nmodule StaleArray = struct\n  include Array \n\n  let nmem x l = not @@ mem x l\n\n  let len = length\n  let size = length\n  let is_empty r = len r = 0\n  let nempty r = len r > 0\n\n  let take n r = left r n\n  let taker n r = right r n\n\n  let takeb x r =\n    let l = len r in\n    let rec loop i =\n      if i >= l then r\n      else if r.(i) = x then take i r\n      else loop (i + 1)\n    in loop 0\n     \n  (* let takewh = take_while *)\n\n  let drop n r = tail r n\n  let dropr n r = take ((len r) - n) r\n  (* let dropwh = drop_while *)\n\n  let index_of x r =\n    let l = len r in\n    let rec loop i =\n      if i >= l then None\n      else if r.(i) = x then Some i\n      else loop (i + 1)\n    in loop 0\n\n  (* let split_by = span *)\n\n  (* let chunk = ntake *)\n\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr f z l = fold_right f l z\n  let foldri f z l = fold_righti f l z\n\n  (* let partition_to_map f l = *)\n  (*   foldr (fun x m -> Map.modify_opt (f x) (function *)\n  (*     | None -> Some [x]  *)\n  (*     | Some [] -> Some [x]  *)\n  (*     | Some vl -> Some (x::vl)) m) Map.empty l;; *)\n\n  (* let scanl = scan_left *)\n  (* let scanli = scan_lefti *)\n  (* let scanr = scan_right *)\n  (* let scanri = scan_righti *)\n  \n  let concat2 = append\n  \n  let flatmap (f : 'a -> 'b array) a =\n    map f a |> enum |> L.of_enum |> concat\n\n  let zipf = map2\n  (* let zipfi = map2i *)\n\nend\n\nmodule A = StaleArray\n\nmodule StaleString = struct\n  include String\n\n  let len = length\n\n  let replace_chars = map\n  let map = replace\n\n  let maptol f s = L.map f (s2cl s)\n  let maptoli f s = L.map f (s2cl s)\n\n  let zipf f a b = L.zipf f (s2cl a) (s2cl b)\n  let zipfi f a b = L.zipfi f (s2cl a) (s2cl b)\n\n  let mkstr f sep ls =\n    L.foldl (fun acc x -> acc ^ sep ^ (f x)) (f @@ L.hd ls) (List.tl ls)\n\nend\n\nmodule S = StaleString\n\nlet spsp s = S.split_on_char ' ' s\n\n\nmodule StaleSortedSet = struct\n  include Set\n\n  module Make (Ord : Set.OrderedType) = struct\n    include Set.Make(Ord)\n\n    let nmem x st = not @@ mem x st\n\n    let foldl f s z = fold (fun x a -> f a x) z s\n\n    let size = cardinal\n  end\n\n  let nmem x st = not @@ mem x st\n\n  let foldl f s z = fold (fun x a -> f a x) z s\n\n  let size = cardinal\nend\n\nmodule Ss = StaleSortedSet\n\nmodule StaleSortedMap  = struct\n  include Map\n\n  module Make (Ord : Map.OrderedType) = struct\n    include Map.Make(Ord)\n\n    let nmem x st = not @@ mem x st\n\n    let get = find\n    let get_or x d m = find_default d x m\n\n    let size = cardinal\n  end\n\n  let nmem x st = not @@ mem x st\n\n  let get = find\n  let get_or x d m = find_default d x m\n\n  let size = cardinal\nend\n\nmodule Ms = StaleSortedMap\n\n\nmodule StaleRange = struct\n\n  type t = Range of int * int\n\n  let make lb ub = Range (lb, ub)\n\n  let to_list r =\n    let Range (lb, ub) = r in\n    L.make (ub - lb) ((+) lb) \n\n  let to_array r =\n    let Range (lb, ub) = r in\n      A.make (ub - lb) ((+) lb)\n\n  let iter r f = \n    let Range (lb, ub) = r in\n    for i = lb to ub do f i done\n\n  let iter2 r1 r2 f =\n    let Range (lb1, ub1) = r1 and Range (lb2, ub2) = r2 in\n      for i = lb1 to ub2 do\n        for j = lb2 to ub2 do\n          f i j\n        done\n      done\nend\n\nmodule R = StaleRange\n\nlet (---) lb ub = R.make lb ub\nlet (--^) lb ub = R.make lb (ub - 1)\n\nmodule StaleGenericAlgorithms = struct\n\n  let set_power ls =\n    let rec loop ls pls =\n      match ls with\n      | [] -> pls\n      | hd::tl -> loop tl (L.flatmap (fun p -> [p; hd::p]) pls)\n    in loop ls [[]]\n\n  let rec bsearch_max_int f lb ub =\n    if lb >= ub then (if f lb then lb else (lb - 1))\n    else (\n      let m = (lb + ub) / 2 in\n      if f m then bsearch_max_int f (m + 1) ub\n      else bsearch_max_int f lb m\n    )\n\n  let partial_sum n ls =\n    let rec loop s k = function\n      | [] -> s\n      | h::t ->\n        if k >= n then s\n        else loop (s + h) (k + 1) t\n    in\n    loop 0 0 ls\n\nend\n\nmodule Gal = StaleGenericAlgorithms\n\nlet rds () = read_line ()\n\nlet rdi () = s2i @@ rds ()\n\nlet rdhs () = spsp @@ rds ()\nlet rdhi () = rdhs () |> L.map s2i\n\nlet rdhf () = rdhs () |> L.map s2f\n\nlet rdf2 () = match rdhf () with\n| a::b::_ -> (a, b)\n| _ -> (0., 0.)\n\nlet rdf3 () = match rdhf () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0., 0., 0.)\n\nlet rdf4 () = match rdhf () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0., 0., 0., 0.)\n\nlet rds2 () = match rdhs () with\n  | a::b::_ -> (a, b)\n  | _ -> (\"\", \"\")\n\nlet rdi2 () = match rdhi () with\n  | a::b::_ -> (a, b)\n  | _ -> (0, 0)\n\nlet rdi3 () = match rdhi () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0, 0, 0)\n\nlet rdi4 () = match rdhi () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0, 0, 0, 0)\n\nlet rdi5 () = match rdhi () with\n| a::b::c::d::e::_ -> (a, b, c, d, e)\n| _ -> (0, 0, 0, 0, 0)\n\nlet rdv n rf =\n  let rec loop n =\n    if n <= 0 then []\n    else (\n      let s = rf () in\n      s::(loop (n - 1))\n    )\n  in loop n\n\nlet rdvi n = rdv n rdi\nlet rdvi2 n = rdv n rdi2\nlet rdvi3 n = rdv n rdi3\nlet rdvi4 n = rdv n rdi4\n\n\nlet print_list aa = \n  printf \"[ \"; aa |> L.iter (fun a -> printf \"%d \" a); puts \"]\"\n\nlet print_array aa = \n  printf \"[ \"; aa |> A.iter (fun a -> printf \"%d \" a); puts \"]\"\n\nlet print_carray aa = \n  printf \"[ \"; aa |> A.iter (fun a -> printf \"%c \" a); puts \"]\"\n\nlet print_matrix mat =\n  puts \"----\";\n  mat |> A.iter (fun r -> print_carray r);\n  puts \"----\"\n\n\nlet _ =\n  let x = rdi () in\n  let q = 8 - ((x - 400) / 200) in\n  puti q;\n  ()\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 7001, "cpu_time_ms": 9, "memory_kb": 5560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s798409404", "group_id": "codeNet:p02601", "input_text": "let a, b, c = Scanf.sscanf (read_line()) \"%d %d %d\" (fun a b c -> a,b,c)\nlet k = read_int ()\n\nlet rec loop red green blue i =\n  if blue > green && green > red then \"Yes\" else \n  if i >= k then \"No\" else (\n    if red >= green then (loop red (green*2) blue (i+1)) else\n    loop red green (blue*2) (i+1)\n  )\n\nlet () = print_endline @@ loop a b c 0\n", "language": "OCaml", "metadata": {"date": 1595726109, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s798409404.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s798409404", "user_id": "u511870776"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let a, b, c = Scanf.sscanf (read_line()) \"%d %d %d\" (fun a b c -> a,b,c)\nlet k = read_int ()\n\nlet rec loop red green blue i =\n  if blue > green && green > red then \"Yes\" else \n  if i >= k then \"No\" else (\n    if red >= green then (loop red (green*2) blue (i+1)) else\n    loop red green (blue*2) (i+1)\n  )\n\nlet () = print_endline @@ loop a b c 0\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nM-kun has the following three cards:\n\nA red card with the integer A.\n\nA green card with the integer B.\n\nA blue card with the integer C.\n\nHe is a genius magician who can do the following operation at most K times:\n\nChoose one of the three cards and multiply the written integer by 2.\n\nHis magic is successful if both of the following conditions are satisfied after the operations:\n\nThe integer on the green card is strictly greater than the integer on the red card.\n\nThe integer on the blue card is strictly greater than the integer on the green card.\n\nDetermine whether the magic can be successful.\n\nConstraints\n\n1 \\leq A, B, C \\leq 7\n\n1 \\leq K \\leq 7\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\nK\n\nOutput\n\nIf the magic can be successful, print Yes; otherwise, print No.\n\nSample Input 1\n\n7 2 5\n3\n\nSample Output 1\n\nYes\n\nThe magic will be successful if, for example, he does the following operations:\n\nFirst, choose the blue card. The integers on the red, green, and blue cards are now 7, 2, and 10, respectively.\n\nSecond, choose the green card. The integers on the red, green, and blue cards are now 7, 4, and 10, respectively.\n\nThird, choose the green card. The integers on the red, green, and blue cards are now 7, 8, and 10, respectively.\n\nSample Input 2\n\n7 4 2\n3\n\nSample Output 2\n\nNo\n\nHe has no way to succeed in the magic with at most three operations.", "sample_input": "7 2 5\n3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02601", "source_text": "Score: 200 points\n\nProblem Statement\n\nM-kun has the following three cards:\n\nA red card with the integer A.\n\nA green card with the integer B.\n\nA blue card with the integer C.\n\nHe is a genius magician who can do the following operation at most K times:\n\nChoose one of the three cards and multiply the written integer by 2.\n\nHis magic is successful if both of the following conditions are satisfied after the operations:\n\nThe integer on the green card is strictly greater than the integer on the red card.\n\nThe integer on the blue card is strictly greater than the integer on the green card.\n\nDetermine whether the magic can be successful.\n\nConstraints\n\n1 \\leq A, B, C \\leq 7\n\n1 \\leq K \\leq 7\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\nK\n\nOutput\n\nIf the magic can be successful, print Yes; otherwise, print No.\n\nSample Input 1\n\n7 2 5\n3\n\nSample Output 1\n\nYes\n\nThe magic will be successful if, for example, he does the following operations:\n\nFirst, choose the blue card. The integers on the red, green, and blue cards are now 7, 2, and 10, respectively.\n\nSecond, choose the green card. The integers on the red, green, and blue cards are now 7, 4, and 10, respectively.\n\nThird, choose the green card. The integers on the red, green, and blue cards are now 7, 8, and 10, respectively.\n\nSample Input 2\n\n7 4 2\n3\n\nSample Output 2\n\nNo\n\nHe has no way to succeed in the magic with at most three operations.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 345, "cpu_time_ms": 6, "memory_kb": 3728}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s951618358", "group_id": "codeNet:p02607", "input_text": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  let arr = Array.init n @@ fun i -> Scanf.scanf \"%d \" @@ fun d -> (i+1, d) in\n  Printf.printf \"%d\\n\"\n    (Array.fold_left (fun s (i,d) -> if i mod 2 = 1 && d mod 2 = 1 then s + 1 else s) 0 arr)", "language": "OCaml", "metadata": {"date": 1595899154, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02607.html", "problem_id": "p02607", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02607/input.txt", "sample_output_relpath": "derived/input_output/data/p02607/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02607/OCaml/s951618358.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s951618358", "user_id": "u307426615"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  let arr = Array.init n @@ fun i -> Scanf.scanf \"%d \" @@ fun d -> (i+1, d) in\n  Printf.printf \"%d\\n\"\n    (Array.fold_left (fun s (i,d) -> if i mod 2 = 1 && d mod 2 = 1 then s + 1 else s) 0 arr)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have N squares assigned the numbers 1,2,3,\\ldots,N. Each square has an integer written on it, and the integer written on Square i is a_i.\n\nHow many squares i satisfy both of the following conditions?\n\nThe assigned number, i, is odd.\n\nThe written integer is odd.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, a_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\cdots a_N\n\nOutput\n\nPrint the number of squares that satisfy both of the conditions.\n\nSample Input 1\n\n5\n1 3 4 5 7\n\nSample Output 1\n\n2\n\nTwo squares, Square 1 and 5, satisfy both of the conditions.\n\nFor Square 2 and 4, the assigned numbers are not odd.\n\nFor Square 3, the written integer is not odd.\n\nSample Input 2\n\n15\n13 76 46 15 50 98 93 77 31 43 84 90 6 24 14\n\nSample Output 2\n\n3", "sample_input": "5\n1 3 4 5 7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02607", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have N squares assigned the numbers 1,2,3,\\ldots,N. Each square has an integer written on it, and the integer written on Square i is a_i.\n\nHow many squares i satisfy both of the following conditions?\n\nThe assigned number, i, is odd.\n\nThe written integer is odd.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, a_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\cdots a_N\n\nOutput\n\nPrint the number of squares that satisfy both of the conditions.\n\nSample Input 1\n\n5\n1 3 4 5 7\n\nSample Output 1\n\n2\n\nTwo squares, Square 1 and 5, satisfy both of the conditions.\n\nFor Square 2 and 4, the assigned numbers are not odd.\n\nFor Square 3, the written integer is not odd.\n\nSample Input 2\n\n15\n13 76 46 15 50 98 93 77 31 43 84 90 6 24 14\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 236, "cpu_time_ms": 6, "memory_kb": 3772}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s523610145", "group_id": "codeNet:p02607", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left ( + ) 0 @@\n  Array.init n @@ fun i -> Scanf.scanf \"%d \" @@ fun a ->\n    if i mod 2 = 0 && a mod 2 = 1 then 1 else 0", "language": "OCaml", "metadata": {"date": 1594518081, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02607.html", "problem_id": "p02607", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02607/input.txt", "sample_output_relpath": "derived/input_output/data/p02607/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02607/OCaml/s523610145.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s523610145", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left ( + ) 0 @@\n  Array.init n @@ fun i -> Scanf.scanf \"%d \" @@ fun a ->\n    if i mod 2 = 0 && a mod 2 = 1 then 1 else 0", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have N squares assigned the numbers 1,2,3,\\ldots,N. Each square has an integer written on it, and the integer written on Square i is a_i.\n\nHow many squares i satisfy both of the following conditions?\n\nThe assigned number, i, is odd.\n\nThe written integer is odd.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, a_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\cdots a_N\n\nOutput\n\nPrint the number of squares that satisfy both of the conditions.\n\nSample Input 1\n\n5\n1 3 4 5 7\n\nSample Output 1\n\n2\n\nTwo squares, Square 1 and 5, satisfy both of the conditions.\n\nFor Square 2 and 4, the assigned numbers are not odd.\n\nFor Square 3, the written integer is not odd.\n\nSample Input 2\n\n15\n13 76 46 15 50 98 93 77 31 43 84 90 6 24 14\n\nSample Output 2\n\n3", "sample_input": "5\n1 3 4 5 7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02607", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have N squares assigned the numbers 1,2,3,\\ldots,N. Each square has an integer written on it, and the integer written on Square i is a_i.\n\nHow many squares i satisfy both of the following conditions?\n\nThe assigned number, i, is odd.\n\nThe written integer is odd.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, a_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\cdots a_N\n\nOutput\n\nPrint the number of squares that satisfy both of the conditions.\n\nSample Input 1\n\n5\n1 3 4 5 7\n\nSample Output 1\n\n2\n\nTwo squares, Square 1 and 5, satisfy both of the conditions.\n\nFor Square 2 and 4, the assigned numbers are not odd.\n\nFor Square 3, the written integer is not odd.\n\nSample Input 2\n\n15\n13 76 46 15 50 98 93 77 31 43 84 90 6 24 14\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 199, "cpu_time_ms": 9, "memory_kb": 3832}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s728349005", "group_id": "codeNet:p02607", "input_text": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = if n <= m then  List.range n `To m else []\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nmodule ModOp = struct\n  let prime = 1_000_000_007\n  let (-) a b = (a + prime - b) mod prime\n  let (+) a b = (a + b) mod prime\n  let ( * ) a b = (a * b) mod prime\n\n  let rec pow x n =\n    if n = 0 then 1\n    else if n mod 2 = 0 then pow (x*x) (n/2)\n    else x * pow (x*x) (n/2)\nend\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list ?sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list ?sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list ?sep conv);\n  arr\n\nlet atoi c = Char.code c - Char.code '0'\nlet itoa n = Char.chr (n + Char.code '0')\n\nlet rec powerset = function\n  | [] -> [[]]\n  | hd::tl ->\n    let pws =  powerset tl in\n    pws @ ListL.map pws ~f:(fun pw -> hd::pw)\n\nlet permutations l =\n  let rec interleave x = function\n    | [] -> [[x]]\n    | (hd::tl) as l ->\n      (x::l) :: (interleave x tl |> ListL.map ~f:(fun l -> hd::l)) in\n  let rec aux = function\n    | [] -> [[]]\n    | a::rest ->\n      aux rest |> ListL.map ~f:(interleave a) |> List.concat in\n  aux l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet n = scan \"%d\" id\nlet a = scan_list ~sep:' ' Int.of_string\n\nlet () =\n  0::(ListL.mapi a ~f:(fun i v ->\n      if i mod 2 = 0 && v mod 2 = 1 then 1 else 0\n    ))\n  |> List.sum\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1594515891, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02607.html", "problem_id": "p02607", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02607/input.txt", "sample_output_relpath": "derived/input_output/data/p02607/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02607/OCaml/s728349005.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s728349005", "user_id": "u802614675"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = if n <= m then  List.range n `To m else []\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nmodule ModOp = struct\n  let prime = 1_000_000_007\n  let (-) a b = (a + prime - b) mod prime\n  let (+) a b = (a + b) mod prime\n  let ( * ) a b = (a * b) mod prime\n\n  let rec pow x n =\n    if n = 0 then 1\n    else if n mod 2 = 0 then pow (x*x) (n/2)\n    else x * pow (x*x) (n/2)\nend\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list ?sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list ?sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list ?sep conv);\n  arr\n\nlet atoi c = Char.code c - Char.code '0'\nlet itoa n = Char.chr (n + Char.code '0')\n\nlet rec powerset = function\n  | [] -> [[]]\n  | hd::tl ->\n    let pws =  powerset tl in\n    pws @ ListL.map pws ~f:(fun pw -> hd::pw)\n\nlet permutations l =\n  let rec interleave x = function\n    | [] -> [[x]]\n    | (hd::tl) as l ->\n      (x::l) :: (interleave x tl |> ListL.map ~f:(fun l -> hd::l)) in\n  let rec aux = function\n    | [] -> [[]]\n    | a::rest ->\n      aux rest |> ListL.map ~f:(interleave a) |> List.concat in\n  aux l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet n = scan \"%d\" id\nlet a = scan_list ~sep:' ' Int.of_string\n\nlet () =\n  0::(ListL.mapi a ~f:(fun i v ->\n      if i mod 2 = 0 && v mod 2 = 1 then 1 else 0\n    ))\n  |> List.sum\n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have N squares assigned the numbers 1,2,3,\\ldots,N. Each square has an integer written on it, and the integer written on Square i is a_i.\n\nHow many squares i satisfy both of the following conditions?\n\nThe assigned number, i, is odd.\n\nThe written integer is odd.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, a_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\cdots a_N\n\nOutput\n\nPrint the number of squares that satisfy both of the conditions.\n\nSample Input 1\n\n5\n1 3 4 5 7\n\nSample Output 1\n\n2\n\nTwo squares, Square 1 and 5, satisfy both of the conditions.\n\nFor Square 2 and 4, the assigned numbers are not odd.\n\nFor Square 3, the written integer is not odd.\n\nSample Input 2\n\n15\n13 76 46 15 50 98 93 77 31 43 84 90 6 24 14\n\nSample Output 2\n\n3", "sample_input": "5\n1 3 4 5 7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02607", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have N squares assigned the numbers 1,2,3,\\ldots,N. Each square has an integer written on it, and the integer written on Square i is a_i.\n\nHow many squares i satisfy both of the following conditions?\n\nThe assigned number, i, is odd.\n\nThe written integer is odd.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, a_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\cdots a_N\n\nOutput\n\nPrint the number of squares that satisfy both of the conditions.\n\nSample Input 1\n\n5\n1 3 4 5 7\n\nSample Output 1\n\n2\n\nTwo squares, Square 1 and 5, satisfy both of the conditions.\n\nFor Square 2 and 4, the assigned numbers are not odd.\n\nFor Square 3, the written integer is not odd.\n\nSample Input 2\n\n15\n13 76 46 15 50 98 93 77 31 43 84 90 6 24 14\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2355, "cpu_time_ms": 10, "memory_kb": 5476}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s736447513", "group_id": "codeNet:p02608", "input_text": "let n = Scanf.sscanf (read_line ()) \"%d\" @@ fun n -> n\n\nlet arr = Array.make 10001 0\n\nlet () =\n  for i = 1 to 50 do\n    for j = 1 to 50 do\n      for k = 1 to 50 do\n        let t = i * i + j * j + k * k + i * j + j * k + k * i in\n        if t <= 10000 then arr.(t - 1) <- arr.(t - 1) + 1;\n      done\n    done\n  done;\n  for i = 1 to n do\n    Printf.printf \"%d\\n\" arr.(i - 1)\n  done", "language": "OCaml", "metadata": {"date": 1594516377, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02608.html", "problem_id": "p02608", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02608/input.txt", "sample_output_relpath": "derived/input_output/data/p02608/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02608/OCaml/s736447513.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s736447513", "user_id": "u811309788"}, "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": "let n = Scanf.sscanf (read_line ()) \"%d\" @@ fun n -> n\n\nlet arr = Array.make 10001 0\n\nlet () =\n  for i = 1 to 50 do\n    for j = 1 to 50 do\n      for k = 1 to 50 do\n        let t = i * i + j * j + k * k + i * j + j * k + k * i in\n        if t <= 10000 then arr.(t - 1) <- arr.(t - 1) + 1;\n      done\n    done\n  done;\n  for i = 1 to n do\n    Printf.printf \"%d\\n\" arr.(i - 1)\n  done", "problem_context": "Score : 300 points\n\nProblem Statement\n\nLet f(n) be the number of triples of integers (x,y,z) that satisfy both of the following conditions:\n\n1 \\leq x,y,z\n\nx^2 + y^2 + z^2 + xy + yz + zx = n\n\nGiven an integer N, find each of f(1),f(2),f(3),\\ldots,f(N).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(i).\n\nSample Input 1\n\n20\n\nSample Output 1\n\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n\nFor n=6, only (1,1,1) satisfies both of the conditions. Thus, f(6) = 1.\n\nFor n=11, three triples, (1,1,2), (1,2,1), and (2,1,1), satisfy both of the conditions. Thus, f(6) = 3.\n\nFor n=17, three triples, (1,2,2), (2,1,2), and (2,2,1), satisfy both of the conditions. Thus, f(17) = 3.\n\nFor n=18, three triples, (1,1,3), (1,3,1), and (3,1,1), satisfy both of the conditions. Thus, f(18) = 3.", "sample_input": "20\n"}, "reference_outputs": ["0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n"], "source_document_id": "p02608", "source_text": "Score : 300 points\n\nProblem Statement\n\nLet f(n) be the number of triples of integers (x,y,z) that satisfy both of the following conditions:\n\n1 \\leq x,y,z\n\nx^2 + y^2 + z^2 + xy + yz + zx = n\n\nGiven an integer N, find each of f(1),f(2),f(3),\\ldots,f(N).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(i).\n\nSample Input 1\n\n20\n\nSample Output 1\n\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n3\n0\n0\n0\n0\n0\n3\n3\n0\n0\n\nFor n=6, only (1,1,1) satisfies both of the conditions. Thus, f(6) = 1.\n\nFor n=11, three triples, (1,1,2), (1,2,1), and (2,1,1), satisfy both of the conditions. Thus, f(6) = 3.\n\nFor n=17, three triples, (1,2,2), (2,1,2), and (2,2,1), satisfy both of the conditions. Thus, f(17) = 3.\n\nFor n=18, three triples, (1,1,3), (1,3,1), and (3,1,1), satisfy both of the conditions. Thus, f(18) = 3.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 379, "cpu_time_ms": 12, "memory_kb": 5564}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s138340550", "group_id": "codeNet:p02609", "input_text": "Scanf.scanf \"%d %s\" (fun n x ->\n    let rec loop i acc =\n        if i = n then acc else\n            if x.[i] = '1' then loop (i + 1) (acc + 1)\n                           else loop (i + 1) acc\n    in\n    let bits = loop 0 0 in\n    let calc i =\n        let initialmod =\n            if bits = 1 && x.[i] = '1' then 0 else\n            if bits = 0 && x.[i] = '0' then 0 else\n                let bits = if x.[i] = '1' then bits - 1 else bits + 1 in\n                let rec loop pos rest =\n                    if pos = n then rest else\n                        let rest = rest * 2 + (if x.[pos] = '1' then 1 else 0) in\n                        let rest = if i = pos then rest lxor 1 else rest in\n                        let rest = rest mod bits in\n                        loop (pos + 1) rest\n                in\n                loop 0 0\n        in\n        let popcount a =\n            let rec loop rest acc =\n                if rest = 0 then acc else loop (rest lsr 1) (acc + (rest land 1))\n            in\n            loop a 0\n        in\n        let rec phase2 md count =\n            if md = 0 then count else\n                let md = md mod (popcount md) in\n                phase2 md (count + 1)\n        in\n        phase2 initialmod 1\n    in\n    for i = 0 to n - 1 do\n        Printf.printf \"%d\\n\" @@ calc i\n    done\n)", "language": "OCaml", "metadata": {"date": 1594516859, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02609.html", "problem_id": "p02609", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02609/input.txt", "sample_output_relpath": "derived/input_output/data/p02609/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02609/OCaml/s138340550.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s138340550", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2\n1\n1\n", "input_to_evaluate": "Scanf.scanf \"%d %s\" (fun n x ->\n    let rec loop i acc =\n        if i = n then acc else\n            if x.[i] = '1' then loop (i + 1) (acc + 1)\n                           else loop (i + 1) acc\n    in\n    let bits = loop 0 0 in\n    let calc i =\n        let initialmod =\n            if bits = 1 && x.[i] = '1' then 0 else\n            if bits = 0 && x.[i] = '0' then 0 else\n                let bits = if x.[i] = '1' then bits - 1 else bits + 1 in\n                let rec loop pos rest =\n                    if pos = n then rest else\n                        let rest = rest * 2 + (if x.[pos] = '1' then 1 else 0) in\n                        let rest = if i = pos then rest lxor 1 else rest in\n                        let rest = rest mod bits in\n                        loop (pos + 1) rest\n                in\n                loop 0 0\n        in\n        let popcount a =\n            let rec loop rest acc =\n                if rest = 0 then acc else loop (rest lsr 1) (acc + (rest land 1))\n            in\n            loop a 0\n        in\n        let rec phase2 md count =\n            if md = 0 then count else\n                let md = md mod (popcount md) in\n                phase2 md (count + 1)\n        in\n        phase2 initialmod 1\n    in\n    for i = 0 to n - 1 do\n        Printf.printf \"%d\\n\" @@ calc i\n    done\n)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nLet \\mathrm{popcount}(n) be the number of 1s in the binary representation of n.\nFor example, \\mathrm{popcount}(3) = 2, \\mathrm{popcount}(7) = 3, and \\mathrm{popcount}(0) = 0.\n\nLet f(n) be the number of times the following operation will be done when we repeat it until n becomes 0: \"replace n with the remainder when n is divided by \\mathrm{popcount}(n).\" (It can be proved that, under the constraints of this problem, n always becomes 0 after a finite number of operations.)\n\nFor example, when n=7, it becomes 0 after two operations, as follows:\n\n\\mathrm{popcount}(7)=3, so we divide 7 by 3 and replace it with the remainder, 1.\n\n\\mathrm{popcount}(1)=1, so we divide 1 by 1 and replace it with the remainder, 0.\n\nYou are given an integer X with N digits in binary.\nFor each integer i such that 1 \\leq i \\leq N, let X_i be what X becomes when the i-th bit from the top is inverted.\nFind f(X_1), f(X_2), \\ldots, f(X_N).\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nX is an integer with N digits in binary, possibly with leading zeros.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(X_i).\n\nSample Input 1\n\n3\n011\n\nSample Output 1\n\n2\n1\n1\n\nX_1 = 7, which will change as follows: 7 \\rightarrow 1 \\rightarrow 0. Thus, f(7) = 2.\n\nX_2 = 1, which will change as follows: 1 \\rightarrow 0. Thus, f(1) = 1.\n\nX_3 = 2, which will change as follows: 2 \\rightarrow 0. Thus, f(2) = 1.\n\nSample Input 2\n\n23\n00110111001011011001110\n\nSample Output 2\n\n2\n1\n2\n2\n1\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n1\n3", "sample_input": "3\n011\n"}, "reference_outputs": ["2\n1\n1\n"], "source_document_id": "p02609", "source_text": "Score : 400 points\n\nProblem Statement\n\nLet \\mathrm{popcount}(n) be the number of 1s in the binary representation of n.\nFor example, \\mathrm{popcount}(3) = 2, \\mathrm{popcount}(7) = 3, and \\mathrm{popcount}(0) = 0.\n\nLet f(n) be the number of times the following operation will be done when we repeat it until n becomes 0: \"replace n with the remainder when n is divided by \\mathrm{popcount}(n).\" (It can be proved that, under the constraints of this problem, n always becomes 0 after a finite number of operations.)\n\nFor example, when n=7, it becomes 0 after two operations, as follows:\n\n\\mathrm{popcount}(7)=3, so we divide 7 by 3 and replace it with the remainder, 1.\n\n\\mathrm{popcount}(1)=1, so we divide 1 by 1 and replace it with the remainder, 0.\n\nYou are given an integer X with N digits in binary.\nFor each integer i such that 1 \\leq i \\leq N, let X_i be what X becomes when the i-th bit from the top is inverted.\nFind f(X_1), f(X_2), \\ldots, f(X_N).\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nX is an integer with N digits in binary, possibly with leading zeros.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX\n\nOutput\n\nPrint N lines. The i-th line should contain the value f(X_i).\n\nSample Input 1\n\n3\n011\n\nSample Output 1\n\n2\n1\n1\n\nX_1 = 7, which will change as follows: 7 \\rightarrow 1 \\rightarrow 0. Thus, f(7) = 2.\n\nX_2 = 1, which will change as follows: 1 \\rightarrow 0. Thus, f(1) = 1.\n\nX_3 = 2, which will change as follows: 2 \\rightarrow 0. Thus, f(2) = 1.\n\nSample Input 2\n\n23\n00110111001011011001110\n\nSample Output 2\n\n2\n1\n2\n2\n1\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n2\n1\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1308, "cpu_time_ms": 2205, "memory_kb": 5624}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s893985005", "group_id": "codeNet:p02613", "input_text": "(* unihernandez22\n * https://atcoder.jp/contests/abc173/tasks/abc173_b\n * implementation\n * *)\n\ninclude Printf;;\n\nScanf.scanf \"%d\\n\" @@ fun n ->\n    let s = Array.init n @@ fun _ -> Scanf.scanf \"%s\\n\" @@ fun x -> x in\n    let c = Array.init 4 @@ fun _ -> ref 0 in\n    for i = 0 to n-1 do\n        if s.(i) = \"AC\" then c.(0) := !(c.(0)) + 1\n        else if s.(i) = \"WA\" then c.(1) := !(c.(1)) + 1\n        else if s.(i) = \"TLE\" then c.(2) := !(c.(2)) + 1\n        else c.(3) := !(c.(3)) + 1\n    done;\n    printf \"AC x %d\\n\"  !(c.(0));\n    printf \"WA x %d\\n\"  !(c.(1));\n    printf \"TLE x %d\\n\" !(c.(2));\n    printf \"RE x %d\\n\"  !(c.(3));\n", "language": "OCaml", "metadata": {"date": 1595694114, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s893985005.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s893985005", "user_id": "u878654696"}, "prompt_components": {"gold_output": "AC x 3\nWA x 1\nTLE x 2\nRE x 0\n", "input_to_evaluate": "(* unihernandez22\n * https://atcoder.jp/contests/abc173/tasks/abc173_b\n * implementation\n * *)\n\ninclude Printf;;\n\nScanf.scanf \"%d\\n\" @@ fun n ->\n    let s = Array.init n @@ fun _ -> Scanf.scanf \"%s\\n\" @@ fun x -> x in\n    let c = Array.init 4 @@ fun _ -> ref 0 in\n    for i = 0 to n-1 do\n        if s.(i) = \"AC\" then c.(0) := !(c.(0)) + 1\n        else if s.(i) = \"WA\" then c.(1) := !(c.(1)) + 1\n        else if s.(i) = \"TLE\" then c.(2) := !(c.(2)) + 1\n        else c.(3) := !(c.(3)) + 1\n    done;\n    printf \"AC x %d\\n\"  !(c.(0));\n    printf \"WA x %d\\n\"  !(c.(1));\n    printf \"TLE x %d\\n\" !(c.(2));\n    printf \"RE x %d\\n\"  !(c.(3));\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 0", "sample_input": "6\nAC\nTLE\nAC\nAC\nWA\nTLE\n"}, "reference_outputs": ["AC x 3\nWA x 1\nTLE x 2\nRE x 0\n"], "source_document_id": "p02613", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 633, "cpu_time_ms": 36, "memory_kb": 8544}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s812890603", "group_id": "codeNet:p02613", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let a = Array.make 4 0 in\n  for i = 0 to n - 1 do\n    let i = Scanf.scanf \"%s\\n\" @@ function\n      | \"AC\" -> 0\n      | \"WA\" -> 1\n      | \"TLE\" -> 2\n      | \"RE\" -> 3 in\n    a.(i) <- 1 + a.(i)\n  done;\n  Printf.printf \"AC x %d\\nWA x %d\\nTLE x %d\\nRE x %d\\n\" a.(0) a.(1) a.(2) a.(3)", "language": "OCaml", "metadata": {"date": 1594003381, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s812890603.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s812890603", "user_id": "u504158101"}, "prompt_components": {"gold_output": "AC x 3\nWA x 1\nTLE x 2\nRE x 0\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let a = Array.make 4 0 in\n  for i = 0 to n - 1 do\n    let i = Scanf.scanf \"%s\\n\" @@ function\n      | \"AC\" -> 0\n      | \"WA\" -> 1\n      | \"TLE\" -> 2\n      | \"RE\" -> 3 in\n    a.(i) <- 1 + a.(i)\n  done;\n  Printf.printf \"AC x %d\\nWA x %d\\nTLE x %d\\nRE x %d\\n\" a.(0) a.(1) a.(2) a.(3)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 0", "sample_input": "6\nAC\nTLE\nAC\nAC\nWA\nTLE\n"}, "reference_outputs": ["AC x 3\nWA x 1\nTLE x 2\nRE x 0\n"], "source_document_id": "p02613", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 321, "cpu_time_ms": 30, "memory_kb": 5880}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s680035764", "group_id": "codeNet:p02615", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n    Array.sort compare a;\n\n    let sum = if n = 2 then a.(n - 1) else\n                    Array.fold_left (+) 0 a - a.(0) - a.(1) + a.(n - 2)\n    in\n\n    Printf.printf \"%d\\n\" sum\n)", "language": "OCaml", "metadata": {"date": 1593998963, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s680035764.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s680035764", "user_id": "u342443598"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n    Array.sort compare a;\n\n    let sum = if n = 2 then a.(n - 1) else\n                    Array.fold_left (+) 0 a - a.(0) - a.(1) + a.(n - 2)\n    in\n\n    Printf.printf \"%d\\n\" sum\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 111, "memory_kb": 7564}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s928798466", "group_id": "codeNet:p02615", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n    Array.sort compare a;\n\n    Printf.printf \"%d\\n\" @@ Array.fold_left (+) 0 a - a.(0)\n)\n", "language": "OCaml", "metadata": {"date": 1593998420, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s928798466.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s928798466", "user_id": "u342443598"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n    Array.sort compare a;\n\n    Printf.printf \"%d\\n\" @@ Array.fold_left (+) 0 a - a.(0)\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 113, "memory_kb": 7516}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s714976556", "group_id": "codeNet:p02621", "input_text": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun a ->\n  Printf.printf \"%d\\n\" (a + a*a + a*a*a)", "language": "OCaml", "metadata": {"date": 1593718332, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02621.html", "problem_id": "p02621", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02621/input.txt", "sample_output_relpath": "derived/input_output/data/p02621/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02621/OCaml/s714976556.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s714976556", "user_id": "u307426615"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun a ->\n  Printf.printf \"%d\\n\" (a + a*a + a*a*a)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "sample_input": "2\n"}, "reference_outputs": ["14\n"], "source_document_id": "p02621", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 82, "cpu_time_ms": 9, "memory_kb": 3788}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s482591784", "group_id": "codeNet:p02621", "input_text": "let () = Scanf.scanf \"%d\" @@ fun a -> Printf.printf \"%d\\n\" @@ a + a * a + a * a * a", "language": "OCaml", "metadata": {"date": 1593401347, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02621.html", "problem_id": "p02621", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02621/input.txt", "sample_output_relpath": "derived/input_output/data/p02621/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02621/OCaml/s482591784.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s482591784", "user_id": "u052332717"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\" @@ fun a -> Printf.printf \"%d\\n\" @@ a + a * a + a * a * a", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "sample_input": "2\n"}, "reference_outputs": ["14\n"], "source_document_id": "p02621", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 83, "cpu_time_ms": 7, "memory_kb": 3844}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s517723779", "group_id": "codeNet:p02621", "input_text": "let a = read_int()\nlet _ = (a + a * a + a*a*a)|> print_int", "language": "OCaml", "metadata": {"date": 1593306038, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02621.html", "problem_id": "p02621", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02621/input.txt", "sample_output_relpath": "derived/input_output/data/p02621/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02621/OCaml/s517723779.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s517723779", "user_id": "u511870776"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "let a = read_int()\nlet _ = (a + a * a + a*a*a)|> print_int", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "sample_input": "2\n"}, "reference_outputs": ["14\n"], "source_document_id": "p02621", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 58, "cpu_time_ms": 8, "memory_kb": 3688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s559823936", "group_id": "codeNet:p02628", "input_text": "Printf.printf \"%d\\n\" @@\nScanf.scanf \"%d %d\\n\" @@ fun n k ->\n    let a = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun i -> i in\n    Array.sort (-) a;\n    let ans = ref 0 in\n    for i = 0 to k-1 do\n        ans := !ans + a.(i)\n    done;\n    !ans;;\n", "language": "OCaml", "metadata": {"date": 1593673080, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02628.html", "problem_id": "p02628", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02628/input.txt", "sample_output_relpath": "derived/input_output/data/p02628/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02628/OCaml/s559823936.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s559823936", "user_id": "u878654696"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "Printf.printf \"%d\\n\" @@\nScanf.scanf \"%d %d\\n\" @@ fun n k ->\n    let a = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun i -> i in\n    Array.sort (-) a;\n    let ans = ref 0 in\n    for i = 0 to k-1 do\n        ans := !ans + a.(i)\n    done;\n    !ans;;\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA shop sells N kinds of fruits, Fruit 1, \\ldots, N, at prices of p_1, \\ldots, p_N yen per item, respectively. (Yen is the currency of Japan.)\n\nHere, we will choose K kinds of fruits and buy one of each chosen kind. Find the minimum possible total price of those fruits.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 1000\n\n1 \\leq p_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\np_1 p_2 \\ldots p_N\n\nOutput\n\nPrint an integer representing the minimum possible total price of fruits.\n\nSample Input 1\n\n5 3\n50 100 80 120 80\n\nSample Output 1\n\n210\n\nThis shop sells Fruit 1, 2, 3, 4, and 5 for 50 yen, 100 yen, 80 yen, 120 yen, and 80 yen, respectively.\n\nThe minimum total price for three kinds of fruits is 50 + 80 + 80 = 210 yen when choosing Fruit 1, 3, and 5.\n\nSample Input 2\n\n1 1\n1000\n\nSample Output 2\n\n1000", "sample_input": "5 3\n50 100 80 120 80\n"}, "reference_outputs": ["210\n"], "source_document_id": "p02628", "source_text": "Score : 200 points\n\nProblem Statement\n\nA shop sells N kinds of fruits, Fruit 1, \\ldots, N, at prices of p_1, \\ldots, p_N yen per item, respectively. (Yen is the currency of Japan.)\n\nHere, we will choose K kinds of fruits and buy one of each chosen kind. Find the minimum possible total price of those fruits.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 1000\n\n1 \\leq p_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\np_1 p_2 \\ldots p_N\n\nOutput\n\nPrint an integer representing the minimum possible total price of fruits.\n\nSample Input 1\n\n5 3\n50 100 80 120 80\n\nSample Output 1\n\n210\n\nThis shop sells Fruit 1, 2, 3, 4, and 5 for 50 yen, 100 yen, 80 yen, 120 yen, and 80 yen, respectively.\n\nThe minimum total price for three kinds of fruits is 50 + 80 + 80 = 210 yen when choosing Fruit 1, 3, and 5.\n\nSample Input 2\n\n1 1\n1000\n\nSample Output 2\n\n1000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 250, "cpu_time_ms": 11, "memory_kb": 4132}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s035533454", "group_id": "codeNet:p02628", "input_text": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let ps = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun p -> p in\n  Array.sort compare ps;\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left ( + ) 0 @@\n  Array.sub ps 0 k\n", "language": "OCaml", "metadata": {"date": 1592794546, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02628.html", "problem_id": "p02628", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02628/input.txt", "sample_output_relpath": "derived/input_output/data/p02628/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02628/OCaml/s035533454.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s035533454", "user_id": "u504158101"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let ps = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun p -> p in\n  Array.sort compare ps;\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left ( + ) 0 @@\n  Array.sub ps 0 k\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA shop sells N kinds of fruits, Fruit 1, \\ldots, N, at prices of p_1, \\ldots, p_N yen per item, respectively. (Yen is the currency of Japan.)\n\nHere, we will choose K kinds of fruits and buy one of each chosen kind. Find the minimum possible total price of those fruits.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 1000\n\n1 \\leq p_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\np_1 p_2 \\ldots p_N\n\nOutput\n\nPrint an integer representing the minimum possible total price of fruits.\n\nSample Input 1\n\n5 3\n50 100 80 120 80\n\nSample Output 1\n\n210\n\nThis shop sells Fruit 1, 2, 3, 4, and 5 for 50 yen, 100 yen, 80 yen, 120 yen, and 80 yen, respectively.\n\nThe minimum total price for three kinds of fruits is 50 + 80 + 80 = 210 yen when choosing Fruit 1, 3, and 5.\n\nSample Input 2\n\n1 1\n1000\n\nSample Output 2\n\n1000", "sample_input": "5 3\n50 100 80 120 80\n"}, "reference_outputs": ["210\n"], "source_document_id": "p02628", "source_text": "Score : 200 points\n\nProblem Statement\n\nA shop sells N kinds of fruits, Fruit 1, \\ldots, N, at prices of p_1, \\ldots, p_N yen per item, respectively. (Yen is the currency of Japan.)\n\nHere, we will choose K kinds of fruits and buy one of each chosen kind. Find the minimum possible total price of those fruits.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 1000\n\n1 \\leq p_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\np_1 p_2 \\ldots p_N\n\nOutput\n\nPrint an integer representing the minimum possible total price of fruits.\n\nSample Input 1\n\n5 3\n50 100 80 120 80\n\nSample Output 1\n\n210\n\nThis shop sells Fruit 1, 2, 3, 4, and 5 for 50 yen, 100 yen, 80 yen, 120 yen, and 80 yen, respectively.\n\nThe minimum total price for three kinds of fruits is 50 + 80 + 80 = 210 yen when choosing Fruit 1, 3, and 5.\n\nSample Input 2\n\n1 1\n1000\n\nSample Output 2\n\n1000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 215, "cpu_time_ms": 6, "memory_kb": 4088}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s388248580", "group_id": "codeNet:p02630", "input_text": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  let arr = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun d -> d in\n  Scanf.scanf \"%d\\n\" @@ fun q ->\n  let brr = Array.init q @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun b c -> (b, c) in\n  for i = 0 to q - 1 do\n    let (b, c) = brr.(i) in\n    let _ = Array.mapi (fun i a -> if a = b then arr.(i) <- c else arr.(i) <- a) arr in\n    Printf.printf \"%d\\n\" (Array.fold_left (+) 0 arr)\n  done;", "language": "OCaml", "metadata": {"date": 1593816021, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s388248580.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s388248580", "user_id": "u307426615"}, "prompt_components": {"gold_output": "11\n12\n16\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  let arr = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun d -> d in\n  Scanf.scanf \"%d\\n\" @@ fun q ->\n  let brr = Array.init q @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun b c -> (b, c) in\n  for i = 0 to q - 1 do\n    let (b, c) = brr.(i) in\n    let _ = Array.mapi (fun i a -> if a = b then arr.(i) <- c else arr.(i) <- a) arr in\n    Printf.printf \"%d\\n\" (Array.fold_left (+) 0 arr)\n  done;", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 430, "cpu_time_ms": 2206, "memory_kb": 24248}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s543337576", "group_id": "codeNet:p02630", "input_text": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = if n <= m then  List.range n `To m else []\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nmodule ModOp = struct\n  let prime = 1_000_000_007\n  let (-) a b = (a + prime - b) mod prime\n  let (+) a b = (a + b) mod prime\n  let ( * ) a b = (a * b) mod prime\n\n  let rec pow x n =\n    if n = 0 then 1\n    else if n mod 2 = 0 then pow (x*x) (n/2)\n    else x * pow (x*x) (n/2)\nend\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list ?sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list ?sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list ?sep conv);\n  arr\n\nlet atoi c = Char.code c - Char.code '0'\nlet itoa n = Char.chr (n + Char.code '0')\n\nlet rec powerset = function\n  | [] -> [[]]\n  | hd::tl ->\n    let pws =  powerset tl in\n    pws @ ListL.map pws ~f:(fun pw -> hd::pw)\n\nlet permutations l =\n  let rec interleave x = function\n    | [] -> [[x]]\n    | (hd::tl) as l ->\n      (x::l) :: (interleave x tl |> ListL.map ~f:(fun l -> hd::l)) in\n  let rec aux = function\n    | [] -> [[]]\n    | a::rest ->\n      aux rest |> ListL.map ~f:(interleave a) |> List.concat in\n  aux l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet n = scan \"%d\" id\nlet a = scan_list ~sep:' ' Int.of_string\nlet q = scan \"%d\" id\nlet bc = scan_lines q \"%d %d\" Tuple2.make\n\nlet () =\n  let h = Hashtbl.create n in\n  ListL.iter a ~f:(fun a ->\n      Hashtbl.modify_def 0 a succ h);\n  let total = a |> List.sum in\n  ListL.fold_left bc ~init:total ~f:(fun total (b,c) ->\n      let n = Hashtbl.find_default h b 0 in\n      let total = total - b*n + c*n in\n      Printf.printf \"%d\\n\" total;\n      Hashtbl.remove_all h b;\n      Hashtbl.modify_def 0 c ((+) n) h; total\n    ) |> ignore\n", "language": "OCaml", "metadata": {"date": 1592789825, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s543337576.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s543337576", "user_id": "u802614675"}, "prompt_components": {"gold_output": "11\n12\n16\n", "input_to_evaluate": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = if n <= m then  List.range n `To m else []\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nmodule ModOp = struct\n  let prime = 1_000_000_007\n  let (-) a b = (a + prime - b) mod prime\n  let (+) a b = (a + b) mod prime\n  let ( * ) a b = (a * b) mod prime\n\n  let rec pow x n =\n    if n = 0 then 1\n    else if n mod 2 = 0 then pow (x*x) (n/2)\n    else x * pow (x*x) (n/2)\nend\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list ?sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list ?sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list ?sep conv);\n  arr\n\nlet atoi c = Char.code c - Char.code '0'\nlet itoa n = Char.chr (n + Char.code '0')\n\nlet rec powerset = function\n  | [] -> [[]]\n  | hd::tl ->\n    let pws =  powerset tl in\n    pws @ ListL.map pws ~f:(fun pw -> hd::pw)\n\nlet permutations l =\n  let rec interleave x = function\n    | [] -> [[x]]\n    | (hd::tl) as l ->\n      (x::l) :: (interleave x tl |> ListL.map ~f:(fun l -> hd::l)) in\n  let rec aux = function\n    | [] -> [[]]\n    | a::rest ->\n      aux rest |> ListL.map ~f:(interleave a) |> List.concat in\n  aux l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet n = scan \"%d\" id\nlet a = scan_list ~sep:' ' Int.of_string\nlet q = scan \"%d\" id\nlet bc = scan_lines q \"%d %d\" Tuple2.make\n\nlet () =\n  let h = Hashtbl.create n in\n  ListL.iter a ~f:(fun a ->\n      Hashtbl.modify_def 0 a succ h);\n  let total = a |> List.sum in\n  ListL.fold_left bc ~init:total ~f:(fun total (b,c) ->\n      let n = Hashtbl.find_default h b 0 in\n      let total = total - b*n + c*n in\n      Printf.printf \"%d\\n\" total;\n      Hashtbl.remove_all h b;\n      Hashtbl.modify_def 0 c ((+) n) h; total\n    ) |> ignore\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2679, "cpu_time_ms": 198, "memory_kb": 24828}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s063066203", "group_id": "codeNet:p02631", "input_text": "open Batteries\nlet n = read_int ()\nlet a = read_line () |> String.split_on_char ' ' |> List.map int_of_string\nlet all = List.fold_left (fun a b -> a lxor b) 0 a\nlet rec loop lst =\n  match lst with\n  | [] -> print_string \"\\n\"\n  | first :: rest ->\n    Printf.printf \"%d \" (all lxor first); loop rest\nlet _ = loop a", "language": "OCaml", "metadata": {"date": 1592923238, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02631.html", "problem_id": "p02631", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02631/input.txt", "sample_output_relpath": "derived/input_output/data/p02631/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02631/OCaml/s063066203.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s063066203", "user_id": "u511870776"}, "prompt_components": {"gold_output": "26 5 7 22\n", "input_to_evaluate": "open Batteries\nlet n = read_int ()\nlet a = read_line () |> String.split_on_char ' ' |> List.map int_of_string\nlet all = List.fold_left (fun a b -> a lxor b) 0 a\nlet rec loop lst =\n  match lst with\n  | [] -> print_string \"\\n\"\n  | first :: rest ->\n    Printf.printf \"%d \" (all lxor first); loop rest\nlet _ = loop a", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N Snuke Cats numbered 1, 2, \\ldots, N, where N is even.\n\nEach Snuke Cat wears a red scarf, on which his favorite non-negative integer is written.\n\nRecently, they learned the operation called xor (exclusive OR).\n\nWhat is xor?\n\nFor n non-negative integers x_1, x_2, \\ldots, x_n, their xor, x_1~\\textrm{xor}~x_2~\\textrm{xor}~\\ldots~\\textrm{xor}~x_n is defined as follows:\n\nWhen x_1~\\textrm{xor}~x_2~\\textrm{xor}~\\ldots~\\textrm{xor}~x_n is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if the number of integers among x_1, x_2, \\ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.\n\nFor example, 3~\\textrm{xor}~5 = 6.\n\nThey wanted to use this operation quickly, so each of them calculated the xor of the integers written on their scarfs except his scarf.\n\nWe know that the xor calculated by Snuke Cat i, that is, the xor of the integers written on the scarfs except the scarf of Snuke Cat i is a_i.\nUsing this information, restore the integer written on the scarf of each Snuke Cat.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 200000\n\nN is even.\n\n0 \\leq a_i \\leq 10^9\n\nThere exists a combination of integers on the scarfs that is consistent with the given information.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_N\n\nOutput\n\nPrint a line containing N integers separated with space.\n\nThe i-th of the integers from the left should represent the integer written on the scarf of Snuke Cat i.\n\nIf there are multiple possible solutions, you may print any of them.\n\nSample Input 1\n\n4\n20 11 9 24\n\nSample Output 1\n\n26 5 7 22\n\n5~\\textrm{xor}~7~\\textrm{xor}~22 = 20\n\n26~\\textrm{xor}~7~\\textrm{xor}~22 = 11\n\n26~\\textrm{xor}~5~\\textrm{xor}~22 = 9\n\n26~\\textrm{xor}~5~\\textrm{xor}~7 = 24\n\nThus, this output is consistent with the given information.", "sample_input": "4\n20 11 9 24\n"}, "reference_outputs": ["26 5 7 22\n"], "source_document_id": "p02631", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N Snuke Cats numbered 1, 2, \\ldots, N, where N is even.\n\nEach Snuke Cat wears a red scarf, on which his favorite non-negative integer is written.\n\nRecently, they learned the operation called xor (exclusive OR).\n\nWhat is xor?\n\nFor n non-negative integers x_1, x_2, \\ldots, x_n, their xor, x_1~\\textrm{xor}~x_2~\\textrm{xor}~\\ldots~\\textrm{xor}~x_n is defined as follows:\n\nWhen x_1~\\textrm{xor}~x_2~\\textrm{xor}~\\ldots~\\textrm{xor}~x_n is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if the number of integers among x_1, x_2, \\ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.\n\nFor example, 3~\\textrm{xor}~5 = 6.\n\nThey wanted to use this operation quickly, so each of them calculated the xor of the integers written on their scarfs except his scarf.\n\nWe know that the xor calculated by Snuke Cat i, that is, the xor of the integers written on the scarfs except the scarf of Snuke Cat i is a_i.\nUsing this information, restore the integer written on the scarf of each Snuke Cat.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 200000\n\nN is even.\n\n0 \\leq a_i \\leq 10^9\n\nThere exists a combination of integers on the scarfs that is consistent with the given information.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_N\n\nOutput\n\nPrint a line containing N integers separated with space.\n\nThe i-th of the integers from the left should represent the integer written on the scarf of Snuke Cat i.\n\nIf there are multiple possible solutions, you may print any of them.\n\nSample Input 1\n\n4\n20 11 9 24\n\nSample Output 1\n\n26 5 7 22\n\n5~\\textrm{xor}~7~\\textrm{xor}~22 = 20\n\n26~\\textrm{xor}~7~\\textrm{xor}~22 = 11\n\n26~\\textrm{xor}~5~\\textrm{xor}~22 = 9\n\n26~\\textrm{xor}~5~\\textrm{xor}~7 = 24\n\nThus, this output is consistent with the given information.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 312, "cpu_time_ms": 117, "memory_kb": 26256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s053771847", "group_id": "codeNet:p02632", "input_text": "Scanf.scanf \"%d %s\" (fun k s ->\n    let n = String.length s in\n    let z = 1_000_000_007 in\n    let extgcd x y =\n        let rec eg r0 r1 a0 a1 b0 b1 =\n            if r1 = 0 then a0 else\n                let q1 = r0 / r1 in\n                eg r1 (r0 mod r1) a1 (a0 - q1 * a1) b1 (b0 - q1 * b1)\n        in\n        eg x y 1 0 0 1\n    in\n    let inv x y = (* 1/x in mod y *)\n        let c = extgcd x y in\n        if c < 0 then c + y else c\n    in\n    let ( +@) a b = (a + b) mod z in\n    let ( *@) a b = (a * b) mod z in\n    let ( /@) a b = a *@ inv b z in\n    let rec loop i pre acc =\n        if i > k then acc else loop (i + 1) (pre *@ (25 * (n + i)) /@ (1 + i)) (acc *@ 26 +@ pre)\n    in\n    loop 0 1 0 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1592799329, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02632.html", "problem_id": "p02632", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02632/input.txt", "sample_output_relpath": "derived/input_output/data/p02632/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02632/OCaml/s053771847.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s053771847", "user_id": "u342443598"}, "prompt_components": {"gold_output": "575111451\n", "input_to_evaluate": "Scanf.scanf \"%d %s\" (fun k s ->\n    let n = String.length s in\n    let z = 1_000_000_007 in\n    let extgcd x y =\n        let rec eg r0 r1 a0 a1 b0 b1 =\n            if r1 = 0 then a0 else\n                let q1 = r0 / r1 in\n                eg r1 (r0 mod r1) a1 (a0 - q1 * a1) b1 (b0 - q1 * b1)\n        in\n        eg x y 1 0 0 1\n    in\n    let inv x y = (* 1/x in mod y *)\n        let c = extgcd x y in\n        if c < 0 then c + y else c\n    in\n    let ( +@) a b = (a + b) mod z in\n    let ( *@) a b = (a * b) mod z in\n    let ( /@) a b = a *@ inv b z in\n    let rec loop i pre acc =\n        if i > k then acc else loop (i + 1) (pre *@ (25 * (n + i)) /@ (1 + i)) (acc *@ 26 +@ pre)\n    in\n    loop 0 1 0 |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score: 600 points\n\nProblem Statement\n\nHow many strings can be obtained by applying the following operation on a string S exactly K times: \"choose one lowercase English letter and insert it somewhere\"?\n\nThe answer can be enormous, so print it modulo (10^9+7).\n\nConstraints\n\nK is an integer between 1 and 10^6 (inclusive).\n\nS is a string of length between 1 and 10^6 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nS\n\nOutput\n\nPrint the number of strings satisfying the condition, modulo (10^9+7).\n\nSample Input 1\n\n5\noof\n\nSample Output 1\n\n575111451\n\nFor example, we can obtain proofend, moonwolf, and onionpuf, while we cannot obtain oofsix, oofelevennn, voxafolt, or fooooooo.\n\nSample Input 2\n\n37564\nwhydidyoudesertme\n\nSample Output 2\n\n318008117", "sample_input": "5\noof\n"}, "reference_outputs": ["575111451\n"], "source_document_id": "p02632", "source_text": "Score: 600 points\n\nProblem Statement\n\nHow many strings can be obtained by applying the following operation on a string S exactly K times: \"choose one lowercase English letter and insert it somewhere\"?\n\nThe answer can be enormous, so print it modulo (10^9+7).\n\nConstraints\n\nK is an integer between 1 and 10^6 (inclusive).\n\nS is a string of length between 1 and 10^6 (inclusive) consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nS\n\nOutput\n\nPrint the number of strings satisfying the condition, modulo (10^9+7).\n\nSample Input 1\n\n5\noof\n\nSample Output 1\n\n575111451\n\nFor example, we can obtain proofend, moonwolf, and onionpuf, while we cannot obtain oofsix, oofelevennn, voxafolt, or fooooooo.\n\nSample Input 2\n\n37564\nwhydidyoudesertme\n\nSample Output 2\n\n318008117", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 314, "memory_kb": 6908}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s326112349", "group_id": "codeNet:p02639", "input_text": "(* Vicfred\n * https://atcoder.jp/contests/abc170/tasks/abc170_a\n * implementation\n * *)\nopen Printf\nopen Scanf\n\nlet main =\n    let xs = Array.init 5 @@ fun _ -> scanf\"%d \" @@ fun x -> x in\n    for i = 0 to 4 do\n        if xs.(i) = 0 then\n            printf \"%d\\n\" @@ i + 1\n    done\n\n", "language": "OCaml", "metadata": {"date": 1593394658, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s326112349.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s326112349", "user_id": "u737840172"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(* Vicfred\n * https://atcoder.jp/contests/abc170/tasks/abc170_a\n * implementation\n * *)\nopen Printf\nopen Scanf\n\nlet main =\n    let xs = Array.init 5 @@ fun _ -> scanf\"%d \" @@ fun x -> x in\n    for i = 0 to 4 do\n        if xs.(i) = 0 then\n            printf \"%d\\n\" @@ i + 1\n    done\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have five variables x_1, x_2, x_3, x_4, and x_5.\n\nThe variable x_i was initially assigned a value of i.\n\nSnuke chose one of these variables and assigned it 0.\n\nYou are given the values of the five variables after this assignment.\n\nFind out which variable Snuke assigned 0.\n\nConstraints\n\nThe values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 x_2 x_3 x_4 x_5\n\nOutput\n\nIf the variable Snuke assigned 0 was x_i, print the integer i.\n\nSample Input 1\n\n0 2 3 4 5\n\nSample Output 1\n\n1\n\nIn this case, Snuke assigned 0 to x_1, so we should print 1.\n\nSample Input 2\n\n1 2 0 4 5\n\nSample Output 2\n\n3", "sample_input": "0 2 3 4 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02639", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have five variables x_1, x_2, x_3, x_4, and x_5.\n\nThe variable x_i was initially assigned a value of i.\n\nSnuke chose one of these variables and assigned it 0.\n\nYou are given the values of the five variables after this assignment.\n\nFind out which variable Snuke assigned 0.\n\nConstraints\n\nThe values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 x_2 x_3 x_4 x_5\n\nOutput\n\nIf the variable Snuke assigned 0 was x_i, print the integer i.\n\nSample Input 1\n\n0 2 3 4 5\n\nSample Output 1\n\n1\n\nIn this case, Snuke assigned 0 to x_1, so we should print 1.\n\nSample Input 2\n\n1 2 0 4 5\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 283, "cpu_time_ms": 4, "memory_kb": 3784}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s738231031", "group_id": "codeNet:p02639", "input_text": "(* Vicfred\n * https://atcoder.jp/contests/abc170/tasks/abc170_a\n * implementation\n * *)\nopen Printf\nopen Scanf\n\nlet solve a b c d e = 15 - a - b - c - d - e\n\nlet main =\n    scanf \"%d %d %d %d %d\" solve |> printf \"%d\\n\"\n\n", "language": "OCaml", "metadata": {"date": 1593394114, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s738231031.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s738231031", "user_id": "u737840172"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(* Vicfred\n * https://atcoder.jp/contests/abc170/tasks/abc170_a\n * implementation\n * *)\nopen Printf\nopen Scanf\n\nlet solve a b c d e = 15 - a - b - c - d - e\n\nlet main =\n    scanf \"%d %d %d %d %d\" solve |> printf \"%d\\n\"\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have five variables x_1, x_2, x_3, x_4, and x_5.\n\nThe variable x_i was initially assigned a value of i.\n\nSnuke chose one of these variables and assigned it 0.\n\nYou are given the values of the five variables after this assignment.\n\nFind out which variable Snuke assigned 0.\n\nConstraints\n\nThe values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 x_2 x_3 x_4 x_5\n\nOutput\n\nIf the variable Snuke assigned 0 was x_i, print the integer i.\n\nSample Input 1\n\n0 2 3 4 5\n\nSample Output 1\n\n1\n\nIn this case, Snuke assigned 0 to x_1, so we should print 1.\n\nSample Input 2\n\n1 2 0 4 5\n\nSample Output 2\n\n3", "sample_input": "0 2 3 4 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02639", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have five variables x_1, x_2, x_3, x_4, and x_5.\n\nThe variable x_i was initially assigned a value of i.\n\nSnuke chose one of these variables and assigned it 0.\n\nYou are given the values of the five variables after this assignment.\n\nFind out which variable Snuke assigned 0.\n\nConstraints\n\nThe values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 x_2 x_3 x_4 x_5\n\nOutput\n\nIf the variable Snuke assigned 0 was x_i, print the integer i.\n\nSample Input 1\n\n0 2 3 4 5\n\nSample Output 1\n\n1\n\nIn this case, Snuke assigned 0 to x_1, so we should print 1.\n\nSample Input 2\n\n1 2 0 4 5\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 220, "cpu_time_ms": 3, "memory_kb": 3828}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s711151811", "group_id": "codeNet:p02639", "input_text": "let read_ints () =\n  let str = read_line() in\n  List.map (fun x -> int_of_string x) (Str.split (Str.regexp \" +\") str)\n;;\n\nlet rec sum lst =\n  match lst with\n  |[] -> 0\n  |h :: t -> h + sum t\n;;\n\nlet x = read_ints() in\nprint_endline (string_of_int (15 - sum x))\n", "language": "OCaml", "metadata": {"date": 1592741713, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s711151811.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s711151811", "user_id": "u222846612"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let read_ints () =\n  let str = read_line() in\n  List.map (fun x -> int_of_string x) (Str.split (Str.regexp \" +\") str)\n;;\n\nlet rec sum lst =\n  match lst with\n  |[] -> 0\n  |h :: t -> h + sum t\n;;\n\nlet x = read_ints() in\nprint_endline (string_of_int (15 - sum x))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have five variables x_1, x_2, x_3, x_4, and x_5.\n\nThe variable x_i was initially assigned a value of i.\n\nSnuke chose one of these variables and assigned it 0.\n\nYou are given the values of the five variables after this assignment.\n\nFind out which variable Snuke assigned 0.\n\nConstraints\n\nThe values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 x_2 x_3 x_4 x_5\n\nOutput\n\nIf the variable Snuke assigned 0 was x_i, print the integer i.\n\nSample Input 1\n\n0 2 3 4 5\n\nSample Output 1\n\n1\n\nIn this case, Snuke assigned 0 to x_1, so we should print 1.\n\nSample Input 2\n\n1 2 0 4 5\n\nSample Output 2\n\n3", "sample_input": "0 2 3 4 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02639", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have five variables x_1, x_2, x_3, x_4, and x_5.\n\nThe variable x_i was initially assigned a value of i.\n\nSnuke chose one of these variables and assigned it 0.\n\nYou are given the values of the five variables after this assignment.\n\nFind out which variable Snuke assigned 0.\n\nConstraints\n\nThe values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 x_2 x_3 x_4 x_5\n\nOutput\n\nIf the variable Snuke assigned 0 was x_i, print the integer i.\n\nSample Input 1\n\n0 2 3 4 5\n\nSample Output 1\n\n1\n\nIn this case, Snuke assigned 0 to x_1, so we should print 1.\n\nSample Input 2\n\n1 2 0 4 5\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 261, "cpu_time_ms": 8, "memory_kb": 3684}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s401539098", "group_id": "codeNet:p02639", "input_text": "module Weighted01DirectedGraph\n  (* 道の表現 *)\n  (Path : sig\n    type t\n    (* 辺の名前 *)\n    type edge\n    (* 長さ0の道 *)\n    val nil : t\n    (* 道の後ろに辺を付け足した道 *)\n    val snoc : t -> edge -> t\n  end) :\nsig\n  val bfs01 :\n    (* 頂点数 *)\n    int ->\n    (* 辺の名前が付いた隣接リスト *)\n    (* 辺の重さが0ならfalse，1ならtrue *)\n    ('v -> ('v * Path.edge * bool) list) ->\n    (* 始点 *)\n    'v ->\n    (* 最短経路を返す関数 辿り着けなければNoneを返す） *)\n    ('v -> Path.t option)\nend =\nstruct\n  let bfs01 n es s =\n    (* 始点sからの経路 *)\n    let d = Hashtbl.create n in\n    (* 現在BFSで走査している頂点のリスト *)\n    let vps = ref [(s, Path.nil)] in\n    let rec bfs t =\n      match Hashtbl.find_opt d t, !vps with\n      (* もう既に全ての頂点までの経路が分かっている *)\n      | None, [] -> None\n      (* 既に終点までの経路が分かっているので返す *)\n      | Some _ as ans, _ -> ans\n      (* 終点までの経路が分かっていないので，01BFSを続行 *)\n      | None, _ :: _ -> vps := List.fold_left dfs [] !vps; bfs t\n    (* 重さ0の辺をDFSで縮約 *)\n    and dfs vps (v, p) =\n      if Hashtbl.mem d v then vps\n      else begin\n        Hashtbl.add d v p;\n        List.fold_left (fun vps (u, e, b) ->\n          if b\n          then (u, Path.snoc p e) :: vps\n          else dfs vps (u, Path.snoc p e)) vps (es v)\n      end\n    in bfs\nend\n\nmodule G = Weighted01DirectedGraph\n(struct\n  type t = int\n  type edge = int\n  let nil = 0\n  let snoc = ( + )\nend)\n\ntype dir = Neutral | Left | Right | Up | Down\n\nlet () = Scanf.scanf \"%d %d %d\\n%d %d %d %d\\n\" @@ fun h w k x1 y1 x2 y2 ->\n  let x1 = x1 - 1 in\n  let x2 = x2 - 1 in\n  let y1 = y1 - 1 in\n  let y2 = y2 - 1 in\n  let css = Array.init h @@ fun _ -> Scanf.scanf \"%s\\n\" Fun.id in\n  let d = G.bfs01 (h * w * 40) (fun (i, j, s, dir) ->\n    List.filter_map (fun (i, j, dir') ->\n      if i < 0 || h <= i || j < 0 || w <= j || css.(i).[j] = '@'\n      then None\n      else if (dir = Neutral || dir = dir') && s < k\n      then Some ((i, j, s + 1, dir'), 0, false)\n      else Some ((i, j, 1, dir'), 1, true))\n    [(i - 1, j, Up); (i + 1, j, Down); (i, j - 1, Left); (i, j + 1, Right)])\n    (x1, y1, 0, Neutral) in\n  Printf.printf \"%d\\n\" @@\n  max (-1) @@\n  succ @@\n  Array.fold_left (List.fold_left min) max_int @@\n  Array.init k @@ fun s ->\n    let s = s + 1 in\n    List.map (fun o -> Option.value ~default:max_int o)\n    [ d (x2, y2, s, Left); d (x2, y2, s, Right); d (x2, y2, s, Up); d (x2, y2, s, Down) ]\n\n", "language": "OCaml", "metadata": {"date": 1592189204, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s401539098.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s401539098", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "module Weighted01DirectedGraph\n  (* 道の表現 *)\n  (Path : sig\n    type t\n    (* 辺の名前 *)\n    type edge\n    (* 長さ0の道 *)\n    val nil : t\n    (* 道の後ろに辺を付け足した道 *)\n    val snoc : t -> edge -> t\n  end) :\nsig\n  val bfs01 :\n    (* 頂点数 *)\n    int ->\n    (* 辺の名前が付いた隣接リスト *)\n    (* 辺の重さが0ならfalse，1ならtrue *)\n    ('v -> ('v * Path.edge * bool) list) ->\n    (* 始点 *)\n    'v ->\n    (* 最短経路を返す関数 辿り着けなければNoneを返す） *)\n    ('v -> Path.t option)\nend =\nstruct\n  let bfs01 n es s =\n    (* 始点sからの経路 *)\n    let d = Hashtbl.create n in\n    (* 現在BFSで走査している頂点のリスト *)\n    let vps = ref [(s, Path.nil)] in\n    let rec bfs t =\n      match Hashtbl.find_opt d t, !vps with\n      (* もう既に全ての頂点までの経路が分かっている *)\n      | None, [] -> None\n      (* 既に終点までの経路が分かっているので返す *)\n      | Some _ as ans, _ -> ans\n      (* 終点までの経路が分かっていないので，01BFSを続行 *)\n      | None, _ :: _ -> vps := List.fold_left dfs [] !vps; bfs t\n    (* 重さ0の辺をDFSで縮約 *)\n    and dfs vps (v, p) =\n      if Hashtbl.mem d v then vps\n      else begin\n        Hashtbl.add d v p;\n        List.fold_left (fun vps (u, e, b) ->\n          if b\n          then (u, Path.snoc p e) :: vps\n          else dfs vps (u, Path.snoc p e)) vps (es v)\n      end\n    in bfs\nend\n\nmodule G = Weighted01DirectedGraph\n(struct\n  type t = int\n  type edge = int\n  let nil = 0\n  let snoc = ( + )\nend)\n\ntype dir = Neutral | Left | Right | Up | Down\n\nlet () = Scanf.scanf \"%d %d %d\\n%d %d %d %d\\n\" @@ fun h w k x1 y1 x2 y2 ->\n  let x1 = x1 - 1 in\n  let x2 = x2 - 1 in\n  let y1 = y1 - 1 in\n  let y2 = y2 - 1 in\n  let css = Array.init h @@ fun _ -> Scanf.scanf \"%s\\n\" Fun.id in\n  let d = G.bfs01 (h * w * 40) (fun (i, j, s, dir) ->\n    List.filter_map (fun (i, j, dir') ->\n      if i < 0 || h <= i || j < 0 || w <= j || css.(i).[j] = '@'\n      then None\n      else if (dir = Neutral || dir = dir') && s < k\n      then Some ((i, j, s + 1, dir'), 0, false)\n      else Some ((i, j, 1, dir'), 1, true))\n    [(i - 1, j, Up); (i + 1, j, Down); (i, j - 1, Left); (i, j + 1, Right)])\n    (x1, y1, 0, Neutral) in\n  Printf.printf \"%d\\n\" @@\n  max (-1) @@\n  succ @@\n  Array.fold_left (List.fold_left min) max_int @@\n  Array.init k @@ fun s ->\n    let s = s + 1 in\n    List.map (fun o -> Option.value ~default:max_int o)\n    [ d (x2, y2, s, Left); d (x2, y2, s, Right); d (x2, y2, s, Up); d (x2, y2, s, Down) ]\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have five variables x_1, x_2, x_3, x_4, and x_5.\n\nThe variable x_i was initially assigned a value of i.\n\nSnuke chose one of these variables and assigned it 0.\n\nYou are given the values of the five variables after this assignment.\n\nFind out which variable Snuke assigned 0.\n\nConstraints\n\nThe values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 x_2 x_3 x_4 x_5\n\nOutput\n\nIf the variable Snuke assigned 0 was x_i, print the integer i.\n\nSample Input 1\n\n0 2 3 4 5\n\nSample Output 1\n\n1\n\nIn this case, Snuke assigned 0 to x_1, so we should print 1.\n\nSample Input 2\n\n1 2 0 4 5\n\nSample Output 2\n\n3", "sample_input": "0 2 3 4 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02639", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have five variables x_1, x_2, x_3, x_4, and x_5.\n\nThe variable x_i was initially assigned a value of i.\n\nSnuke chose one of these variables and assigned it 0.\n\nYou are given the values of the five variables after this assignment.\n\nFind out which variable Snuke assigned 0.\n\nConstraints\n\nThe values of x_1, x_2, x_3, x_4, and x_5 given as input are a possible outcome of the assignment by Snuke.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 x_2 x_3 x_4 x_5\n\nOutput\n\nIf the variable Snuke assigned 0 was x_i, print the integer i.\n\nSample Input 1\n\n0 2 3 4 5\n\nSample Output 1\n\n1\n\nIn this case, Snuke assigned 0 to x_1, so we should print 1.\n\nSample Input 2\n\n1 2 0 4 5\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2612, "cpu_time_ms": 3, "memory_kb": 3820}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s046472198", "group_id": "codeNet:p02640", "input_text": "let () =\n  let rec tsurukame x y z =\n    if x * 4 + y * 2 = z then \"Yes\"\n    else if x < 0 then \"No\"\n    else tsurukame (x-1) (y+1) z in\n  Scanf.scanf \"%d %d\\n\" @@ fun x y ->\n  Printf.printf \"%s\" (tsurukame x 0 y)", "language": "OCaml", "metadata": {"date": 1593719725, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s046472198.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s046472198", "user_id": "u307426615"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n  let rec tsurukame x y z =\n    if x * 4 + y * 2 = z then \"Yes\"\n    else if x < 0 then \"No\"\n    else tsurukame (x-1) (y+1) z in\n  Scanf.scanf \"%d %d\\n\" @@ fun x y ->\n  Printf.printf \"%s\" (tsurukame x 0 y)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "sample_input": "3 8\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02640", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are some animals in a garden. Each of them is a crane with two legs or a turtle with four legs.\n\nTakahashi says: \"there are X animals in total in the garden, and they have Y legs in total.\" Determine whether there is a combination of numbers of cranes and turtles in which this statement is correct.\n\nConstraints\n\n1 \\leq X \\leq 100\n\n1 \\leq Y \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf there is a combination of numbers of cranes and turtles in which the statement is correct, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 8\n\nSample Output 1\n\nYes\n\nThe statement \"there are 3 animals in total in the garden, and they have 8 legs in total\" is correct if there are two cranes and one turtle. Thus, there is a combination of numbers of cranes and turtles in which the statement is correct.\n\nSample Input 2\n\n2 100\n\nSample Output 2\n\nNo\n\nThere is no combination of numbers of cranes and turtles in which this statement is correct.\n\nSample Input 3\n\n1 2\n\nSample Output 3\n\nYes\n\nWe also consider the case in which there are only cranes or only turtles.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 213, "cpu_time_ms": 9, "memory_kb": 3732}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s740030035", "group_id": "codeNet:p02644", "input_text": "module WeightedDirectedGraph\n  (* 辺の重み *)\n  (Weight : sig\n    type t\n    val zero : t\n    val compare : t -> t -> int\n  end)\n  (* 経路長を優先度としたヒープの実装 *)\n  (Heap : sig\n    type t\n    type elt (* 頂点に相当 *)\n    type key = Weight.t (* 経路長に相当 *)\n    (* ヒープが空ならNoneを，\n       そうでなければ経路長が最小となるbindingを一つ以上返す\n       返したbindingは全てヒープから削除される *)\n    val take_min_bindings : t -> (key * elt list) option\n    (* ヒープにbindingを追加する\n       既に同じ頂点についてのbindingが追加されていたら，\n       経路長の短い方だけを残しても良いし，何も考えずに追加してもよい．\n       前者の実装ならダイクストラ法の実装が時間計算量O((V + E) log V)，\n       空間計算量O(V)に改善する *)\n    val add : t -> key -> elt -> unit\n  end)\n  (* 頂点を添字，経路長を要素とした配列の実装 *)\n  (Array : sig\n    type t\n    type key = Heap.elt\n    type elt = Heap.key\n    val get : t -> key -> elt\n    val set : t -> key -> elt -> unit\n  end)\n: sig\n  type weight = Array.elt\n  type vertex = Array.key\n\n  (* ダイクストラ法で最短経路を求める関数 *)\n  val shortest_path :\n    (* 空なヒープ *)\n    Heap.t ->\n    (* 全ての頂点についての経路長が無限大で初期化された配列\n       Array.getした時に極端に大きな経路長が返ってくる実装でも良いし，\n       Not_foundが投げられる実装でも良い *)\n    Array.t ->\n    (* 最短経路を求めたいグラフの，ある頂点から伸びる辺に対してのイテレータ *)\n    (vertex -> (vertex -> (weight -> weight) (* 辺を通った際のコストを加算する関数 *) -> unit) -> unit) ->\n    (* 始点 *)\n    vertex ->\n    (* 終点を受け取って，始点からの最短距離を返す関数\n       始点から辿り着けない場合，無限大を返すかNot_foundを投げる（Arrayの実装依存）\n       この関数を覚えておけば，呼び出しごとの途中までの計算結果がシェアされる *)\n    (vertex -> weight)\nend\n= struct\n  type weight = Array.elt\n  type vertex = Array.key\n\n  let shortest_path q d es s =\n    (* 始点への経路長を0にする *)\n    Array.set d s Weight.zero;\n    (* 既に最短距離が確定した辺へのクエリを高速化するため，\n       ヒープの最小要素をメモしておく *)\n    let min_bindings = ref (Some (Weight.zero, [s])) in\n    let rec dijkstra t =\n      match !min_bindings with\n      (* もう既に全ての頂点までの距離が分かっている *)\n      | None -> Array.get d t\n      | Some (w, us) ->\n          match Array.get d t with\n          (* 既に終点までの距離が分かっているので返す *)\n          | x when 0 <= Weight.compare w x -> x\n          (* 終点までの距離が分かっていないので，ダイクストラ法を続行 *)\n          | _ | exception Not_found ->\n              List.iter (fun u ->\n                (* 未だ頂点uを訪れていない *)\n                if 0 <= Weight.compare (Array.get d u) w then\n                  es u @@ fun v f ->\n                    (* uからvに伸びる辺を通った際の経路長 *)\n                    let c = f w in\n                    if 0 < Weight.compare (Array.get d v) c then\n                      (Heap.add q c v; Array.set d v c)) us;\n              min_bindings := Heap.take_min_bindings q;\n              dijkstra t in\n    dijkstra\nend\n\nmodule Int = struct\n  type t = int\n  let zero = 0\n  let compare = compare\nend\n\nmodule IntMap = Map.Make (Int)\n\nmodule G = WeightedDirectedGraph (Int)\n  (struct\n    type t = int array list IntMap.t ref\n    type key = int\n    type elt = int array\n    let take_min_bindings q =\n      match IntMap.min_binding !q with\n      | exception Not_found -> None\n      | (w, _) as p -> q := IntMap.remove w !q; Some p\n    let add q w v  =\n      q := IntMap.update w (fun vs -> Some (v :: Option.value ~default:[] vs)) !q\n  end)\n  (struct\n    type t = (int, Bigarray.int_elt, Bigarray.c_layout) Bigarray.Genarray.t\n    type elt = int\n    type key = int array\n    let get = Bigarray.Genarray.get\n    let set = Bigarray.Genarray.set\n  end)\n\nlet () = Scanf.scanf \"%d %d %d\\n%d %d %d %d\\n\" @@ fun h w k x1 y1 x2 y2 ->\n  let css = Array.init h @@ fun _ -> Scanf.scanf \"%s\\n\" Fun.id in\n  let dx = [| 1; 0; -1; 0 |] in\n  let dy = [| 0; 1; 0; -1 |] in\n  let d = G.shortest_path (ref IntMap.empty)\n    (let d = Bigarray.Genarray.create Bigarray.int Bigarray.c_layout [| h; w; 4 |] in Bigarray.Genarray.fill d max_int; d)\n    (fun [| i; j; dir |] f ->\n      f [| i; j; (dir + 1) mod 4 |] (fun c -> c + k - 1 - (c + k - 1) mod k);\n      let i = i + dx.(dir) in\n      let j = j + dy.(dir) in\n      if 0 <= i && i < h && 0 <= j && j < w && css.(i).[j] <> '@' then\n        f [| i; j; dir |] succ)\n    [| x1 - 1; y1 - 1; 0 |] in\n  Printf.printf \"%d\\n\" @@\n  (fun x -> if max_int <= x then -1 else (x + k - 1) / k) @@\n  Array.fold_left min max_int @@\n  Array.init 4 @@ fun dir -> d [| x2 - 1; y2 - 1; dir |]\n", "language": "OCaml", "metadata": {"date": 1592352889, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s740030035.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s740030035", "user_id": "u504158101"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "module WeightedDirectedGraph\n  (* 辺の重み *)\n  (Weight : sig\n    type t\n    val zero : t\n    val compare : t -> t -> int\n  end)\n  (* 経路長を優先度としたヒープの実装 *)\n  (Heap : sig\n    type t\n    type elt (* 頂点に相当 *)\n    type key = Weight.t (* 経路長に相当 *)\n    (* ヒープが空ならNoneを，\n       そうでなければ経路長が最小となるbindingを一つ以上返す\n       返したbindingは全てヒープから削除される *)\n    val take_min_bindings : t -> (key * elt list) option\n    (* ヒープにbindingを追加する\n       既に同じ頂点についてのbindingが追加されていたら，\n       経路長の短い方だけを残しても良いし，何も考えずに追加してもよい．\n       前者の実装ならダイクストラ法の実装が時間計算量O((V + E) log V)，\n       空間計算量O(V)に改善する *)\n    val add : t -> key -> elt -> unit\n  end)\n  (* 頂点を添字，経路長を要素とした配列の実装 *)\n  (Array : sig\n    type t\n    type key = Heap.elt\n    type elt = Heap.key\n    val get : t -> key -> elt\n    val set : t -> key -> elt -> unit\n  end)\n: sig\n  type weight = Array.elt\n  type vertex = Array.key\n\n  (* ダイクストラ法で最短経路を求める関数 *)\n  val shortest_path :\n    (* 空なヒープ *)\n    Heap.t ->\n    (* 全ての頂点についての経路長が無限大で初期化された配列\n       Array.getした時に極端に大きな経路長が返ってくる実装でも良いし，\n       Not_foundが投げられる実装でも良い *)\n    Array.t ->\n    (* 最短経路を求めたいグラフの，ある頂点から伸びる辺に対してのイテレータ *)\n    (vertex -> (vertex -> (weight -> weight) (* 辺を通った際のコストを加算する関数 *) -> unit) -> unit) ->\n    (* 始点 *)\n    vertex ->\n    (* 終点を受け取って，始点からの最短距離を返す関数\n       始点から辿り着けない場合，無限大を返すかNot_foundを投げる（Arrayの実装依存）\n       この関数を覚えておけば，呼び出しごとの途中までの計算結果がシェアされる *)\n    (vertex -> weight)\nend\n= struct\n  type weight = Array.elt\n  type vertex = Array.key\n\n  let shortest_path q d es s =\n    (* 始点への経路長を0にする *)\n    Array.set d s Weight.zero;\n    (* 既に最短距離が確定した辺へのクエリを高速化するため，\n       ヒープの最小要素をメモしておく *)\n    let min_bindings = ref (Some (Weight.zero, [s])) in\n    let rec dijkstra t =\n      match !min_bindings with\n      (* もう既に全ての頂点までの距離が分かっている *)\n      | None -> Array.get d t\n      | Some (w, us) ->\n          match Array.get d t with\n          (* 既に終点までの距離が分かっているので返す *)\n          | x when 0 <= Weight.compare w x -> x\n          (* 終点までの距離が分かっていないので，ダイクストラ法を続行 *)\n          | _ | exception Not_found ->\n              List.iter (fun u ->\n                (* 未だ頂点uを訪れていない *)\n                if 0 <= Weight.compare (Array.get d u) w then\n                  es u @@ fun v f ->\n                    (* uからvに伸びる辺を通った際の経路長 *)\n                    let c = f w in\n                    if 0 < Weight.compare (Array.get d v) c then\n                      (Heap.add q c v; Array.set d v c)) us;\n              min_bindings := Heap.take_min_bindings q;\n              dijkstra t in\n    dijkstra\nend\n\nmodule Int = struct\n  type t = int\n  let zero = 0\n  let compare = compare\nend\n\nmodule IntMap = Map.Make (Int)\n\nmodule G = WeightedDirectedGraph (Int)\n  (struct\n    type t = int array list IntMap.t ref\n    type key = int\n    type elt = int array\n    let take_min_bindings q =\n      match IntMap.min_binding !q with\n      | exception Not_found -> None\n      | (w, _) as p -> q := IntMap.remove w !q; Some p\n    let add q w v  =\n      q := IntMap.update w (fun vs -> Some (v :: Option.value ~default:[] vs)) !q\n  end)\n  (struct\n    type t = (int, Bigarray.int_elt, Bigarray.c_layout) Bigarray.Genarray.t\n    type elt = int\n    type key = int array\n    let get = Bigarray.Genarray.get\n    let set = Bigarray.Genarray.set\n  end)\n\nlet () = Scanf.scanf \"%d %d %d\\n%d %d %d %d\\n\" @@ fun h w k x1 y1 x2 y2 ->\n  let css = Array.init h @@ fun _ -> Scanf.scanf \"%s\\n\" Fun.id in\n  let dx = [| 1; 0; -1; 0 |] in\n  let dy = [| 0; 1; 0; -1 |] in\n  let d = G.shortest_path (ref IntMap.empty)\n    (let d = Bigarray.Genarray.create Bigarray.int Bigarray.c_layout [| h; w; 4 |] in Bigarray.Genarray.fill d max_int; d)\n    (fun [| i; j; dir |] f ->\n      f [| i; j; (dir + 1) mod 4 |] (fun c -> c + k - 1 - (c + k - 1) mod k);\n      let i = i + dx.(dir) in\n      let j = j + dy.(dir) in\n      if 0 <= i && i < h && 0 <= j && j < w && css.(i).[j] <> '@' then\n        f [| i; j; dir |] succ)\n    [| x1 - 1; y1 - 1; 0 |] in\n  Printf.printf \"%d\\n\" @@\n  (fun x -> if max_int <= x then -1 else (x + k - 1) / k) @@\n  Array.fold_left min max_int @@\n  Array.init 4 @@ fun dir -> d [| x2 - 1; y2 - 1; dir |]\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5175, "cpu_time_ms": 565, "memory_kb": 59376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s579942021", "group_id": "codeNet:p02644", "input_text": "module Weighted01DirectedGraph\n  (* 道の表現 *)\n  (Path : sig\n    type t\n    (* 辺の名前 *)\n    type edge\n    (* 長さ0の道 *)\n    val nil : t\n    (* 道の後ろに辺を付け足した道 *)\n    val snoc : t -> edge -> t\n  end) :\nsig\n  val bfs01 :\n    (* 頂点数 *)\n    int ->\n    (* 辺の名前が付いた隣接リスト *)\n    (* 辺の重さが0ならfalse，1ならtrue *)\n    ('v -> ('v * Path.edge * bool) list) ->\n    (* 始点 *)\n    'v ->\n    (* 最短経路を返す関数 辿り着けなければNoneを返す） *)\n    ('v -> Path.t option)\nend =\nstruct\n  let bfs01 n es s =\n    (* 始点sからの経路 *)\n    let d = Hashtbl.create n in\n    (* 現在BFSで走査している頂点のリスト *)\n    let vps = ref [(s, Path.nil)] in\n    let rec bfs t =\n      match Hashtbl.find_opt d t, !vps with\n      (* もう既に全ての頂点までの経路が分かっている *)\n      | None, [] -> None\n      (* 既に終点までの経路が分かっているので返す *)\n      | Some _ as ans, _ -> ans\n      (* 終点までの経路が分かっていないので，01BFSを続行 *)\n      | None, _ :: _ -> vps := List.fold_left dfs [] !vps; bfs t\n    (* 重さ0の辺をDFSで縮約 *)\n    and dfs vps (v, p) =\n      if Hashtbl.mem d v then vps\n      else begin\n        Hashtbl.add d v p;\n        List.fold_left (fun vps (u, e, b) ->\n          if b\n          then (u, Path.snoc p e) :: vps\n          else dfs vps (u, Path.snoc p e)) vps (es v)\n      end\n    in bfs\nend\n\nmodule G = Weighted01DirectedGraph\n(struct\n  type t = int\n  type edge = int\n  let nil = 0\n  let snoc = ( + )\nend)\n\ntype dir = Neutral | Left | Right | Up | Down\n\nlet () = Scanf.scanf \"%d %d %d\\n%d %d %d %d\\n\" @@ fun h w k x1 y1 x2 y2 ->\n  let x1 = x1 - 1 in\n  let x2 = x2 - 1 in\n  let y1 = y1 - 1 in\n  let y2 = y2 - 1 in\n  let css = Array.init h @@ fun _ -> Scanf.scanf \"%s\\n\" Fun.id in\n  let d = G.bfs01 (h * w * 40) (fun (i, j, s, dir) ->\n    List.filter_map (fun (i, j, dir') ->\n      if i < 0 || h <= i || j < 0 || w <= j || css.(i).[j] = '@'\n      then None\n      else if (dir = Neutral || dir = dir') && s < k\n      then Some ((i, j, s + 1, dir'), 0, false)\n      else Some ((i, j, 1, dir'), 1, true))\n    [(i - 1, j, Up); (i + 1, j, Down); (i, j - 1, Left); (i, j + 1, Right)])\n    (x1, y1, 0, Neutral) in\n  Printf.printf \"%d\\n\" @@\n  max (-1) @@\n  succ @@\n  Array.fold_left (List.fold_left min) max_int @@\n  Array.init k @@ fun s ->\n    let s = s + 1 in\n    List.map (fun o -> Option.value ~default:max_int o)\n    [ d (x2, y2, s, Left); d (x2, y2, s, Right); d (x2, y2, s, Up); d (x2, y2, s, Down) ]\n\n", "language": "OCaml", "metadata": {"date": 1592189227, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s579942021.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s579942021", "user_id": "u504158101"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "module Weighted01DirectedGraph\n  (* 道の表現 *)\n  (Path : sig\n    type t\n    (* 辺の名前 *)\n    type edge\n    (* 長さ0の道 *)\n    val nil : t\n    (* 道の後ろに辺を付け足した道 *)\n    val snoc : t -> edge -> t\n  end) :\nsig\n  val bfs01 :\n    (* 頂点数 *)\n    int ->\n    (* 辺の名前が付いた隣接リスト *)\n    (* 辺の重さが0ならfalse，1ならtrue *)\n    ('v -> ('v * Path.edge * bool) list) ->\n    (* 始点 *)\n    'v ->\n    (* 最短経路を返す関数 辿り着けなければNoneを返す） *)\n    ('v -> Path.t option)\nend =\nstruct\n  let bfs01 n es s =\n    (* 始点sからの経路 *)\n    let d = Hashtbl.create n in\n    (* 現在BFSで走査している頂点のリスト *)\n    let vps = ref [(s, Path.nil)] in\n    let rec bfs t =\n      match Hashtbl.find_opt d t, !vps with\n      (* もう既に全ての頂点までの経路が分かっている *)\n      | None, [] -> None\n      (* 既に終点までの経路が分かっているので返す *)\n      | Some _ as ans, _ -> ans\n      (* 終点までの経路が分かっていないので，01BFSを続行 *)\n      | None, _ :: _ -> vps := List.fold_left dfs [] !vps; bfs t\n    (* 重さ0の辺をDFSで縮約 *)\n    and dfs vps (v, p) =\n      if Hashtbl.mem d v then vps\n      else begin\n        Hashtbl.add d v p;\n        List.fold_left (fun vps (u, e, b) ->\n          if b\n          then (u, Path.snoc p e) :: vps\n          else dfs vps (u, Path.snoc p e)) vps (es v)\n      end\n    in bfs\nend\n\nmodule G = Weighted01DirectedGraph\n(struct\n  type t = int\n  type edge = int\n  let nil = 0\n  let snoc = ( + )\nend)\n\ntype dir = Neutral | Left | Right | Up | Down\n\nlet () = Scanf.scanf \"%d %d %d\\n%d %d %d %d\\n\" @@ fun h w k x1 y1 x2 y2 ->\n  let x1 = x1 - 1 in\n  let x2 = x2 - 1 in\n  let y1 = y1 - 1 in\n  let y2 = y2 - 1 in\n  let css = Array.init h @@ fun _ -> Scanf.scanf \"%s\\n\" Fun.id in\n  let d = G.bfs01 (h * w * 40) (fun (i, j, s, dir) ->\n    List.filter_map (fun (i, j, dir') ->\n      if i < 0 || h <= i || j < 0 || w <= j || css.(i).[j] = '@'\n      then None\n      else if (dir = Neutral || dir = dir') && s < k\n      then Some ((i, j, s + 1, dir'), 0, false)\n      else Some ((i, j, 1, dir'), 1, true))\n    [(i - 1, j, Up); (i + 1, j, Down); (i, j - 1, Left); (i, j + 1, Right)])\n    (x1, y1, 0, Neutral) in\n  Printf.printf \"%d\\n\" @@\n  max (-1) @@\n  succ @@\n  Array.fold_left (List.fold_left min) max_int @@\n  Array.init k @@ fun s ->\n    let s = s + 1 in\n    List.map (fun o -> Option.value ~default:max_int o)\n    [ d (x2, y2, s, Left); d (x2, y2, s, Right); d (x2, y2, s, Up); d (x2, y2, s, Down) ]\n\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2612, "cpu_time_ms": 3344, "memory_kb": 1275476}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s208431957", "group_id": "codeNet:p02644", "input_text": "module Weighted01DirectedGraph\n  (* 道の表現 *)\n  (Path : sig\n    type t\n    (* 辺の名前 *)\n    type edge\n    (* 長さ0の道 *)\n    val nil : t\n    (* 道の後ろに辺を付け足した道 *)\n    val snoc : t -> edge -> t\n  end) :\nsig\n  val bfs01 :\n    (* 頂点数 *)\n    int ->\n    (* 辺の名前が付いた隣接リスト *)\n    (* 辺の重さが0ならfalse，1ならtrue *)\n    ('v -> ('v * Path.edge * bool) list) ->\n    (* 始点 *)\n    'v ->\n    (* 最短経路を返す関数 辿り着けなければNoneを返す） *)\n    ('v -> Path.t option)\nend =\nstruct\n  let bfs01 n es s =\n    (* 始点sからの経路 *)\n    let d = Hashtbl.create n in\n    (* 現在BFSで走査している頂点のリスト *)\n    let vps = ref [(s, Path.nil)] in\n    let rec bfs t =\n      match Hashtbl.find_opt d t, !vps with\n      (* もう既に全ての頂点までの経路が分かっている *)\n      | None, [] -> None\n      (* 既に終点までの経路が分かっているので返す *)\n      | Some _ as ans, _ -> ans\n      (* 終点までの経路が分かっていないので，01BFSを続行 *)\n      | None, _ :: _ -> vps := List.fold_left dfs [] !vps; bfs t\n    (* 重さ0の辺をDFSで縮約 *)\n    and dfs vps (v, p) =\n      if Hashtbl.mem d v then vps\n      else begin\n        Hashtbl.add d v p;\n        List.fold_left (fun vps (u, e, b) ->\n          if b\n          then (u, Path.snoc p e) :: vps\n          else dfs vps (u, Path.snoc p e)) vps (es v)\n      end\n    in bfs\nend\n\nmodule G = Weighted01DirectedGraph\n(struct\n  type t = int\n  type edge = int\n  let nil = 0\n  let snoc = ( + )\nend)\n\ntype dir = Neutral | Left | Right | Up | Down\n\nlet () = Scanf.scanf \"%d %d %d\\n%d %d %d %d\\n\" @@ fun h w k x1 y1 x2 y2 ->\n  let x1 = x1 - 1 in\n  let x2 = x2 - 1 in\n  let y1 = y1 - 1 in\n  let y2 = y2 - 1 in\n  let css = Array.init h @@ fun _ -> Scanf.scanf \"%s\\n\" Fun.id in\n  let d = G.bfs01 (h * w * 400) (fun (i, j, s, dir) ->\n    List.filter_map (fun (i, j, dir') ->\n      if i < 0 || h <= i || j < 0 || w <= j || css.(i).[j] = '@'\n      then None\n      else if (dir = Neutral || dir = dir') && s < k\n      then Some ((i, j, s + 1, dir'), 0, false)\n      else Some ((i, j, 1, dir'), 1, true))\n    [(i - 1, j, Up); (i + 1, j, Down); (i, j - 1, Left); (i, j + 1, Right)])\n    (x1, y1, 0, Neutral) in\n  Printf.printf \"%d\\n\" @@\n  max (-1) @@\n  succ @@\n  Array.fold_left (List.fold_left min) max_int @@\n  Array.init k @@ fun s ->\n    let s = s + 1 in\n    List.map (fun o -> Option.value ~default:max_int o)\n    [ d (x2, y2, s, Left); d (x2, y2, s, Right); d (x2, y2, s, Up); d (x2, y2, s, Down) ]\n\n", "language": "OCaml", "metadata": {"date": 1592189144, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s208431957.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s208431957", "user_id": "u504158101"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "module Weighted01DirectedGraph\n  (* 道の表現 *)\n  (Path : sig\n    type t\n    (* 辺の名前 *)\n    type edge\n    (* 長さ0の道 *)\n    val nil : t\n    (* 道の後ろに辺を付け足した道 *)\n    val snoc : t -> edge -> t\n  end) :\nsig\n  val bfs01 :\n    (* 頂点数 *)\n    int ->\n    (* 辺の名前が付いた隣接リスト *)\n    (* 辺の重さが0ならfalse，1ならtrue *)\n    ('v -> ('v * Path.edge * bool) list) ->\n    (* 始点 *)\n    'v ->\n    (* 最短経路を返す関数 辿り着けなければNoneを返す） *)\n    ('v -> Path.t option)\nend =\nstruct\n  let bfs01 n es s =\n    (* 始点sからの経路 *)\n    let d = Hashtbl.create n in\n    (* 現在BFSで走査している頂点のリスト *)\n    let vps = ref [(s, Path.nil)] in\n    let rec bfs t =\n      match Hashtbl.find_opt d t, !vps with\n      (* もう既に全ての頂点までの経路が分かっている *)\n      | None, [] -> None\n      (* 既に終点までの経路が分かっているので返す *)\n      | Some _ as ans, _ -> ans\n      (* 終点までの経路が分かっていないので，01BFSを続行 *)\n      | None, _ :: _ -> vps := List.fold_left dfs [] !vps; bfs t\n    (* 重さ0の辺をDFSで縮約 *)\n    and dfs vps (v, p) =\n      if Hashtbl.mem d v then vps\n      else begin\n        Hashtbl.add d v p;\n        List.fold_left (fun vps (u, e, b) ->\n          if b\n          then (u, Path.snoc p e) :: vps\n          else dfs vps (u, Path.snoc p e)) vps (es v)\n      end\n    in bfs\nend\n\nmodule G = Weighted01DirectedGraph\n(struct\n  type t = int\n  type edge = int\n  let nil = 0\n  let snoc = ( + )\nend)\n\ntype dir = Neutral | Left | Right | Up | Down\n\nlet () = Scanf.scanf \"%d %d %d\\n%d %d %d %d\\n\" @@ fun h w k x1 y1 x2 y2 ->\n  let x1 = x1 - 1 in\n  let x2 = x2 - 1 in\n  let y1 = y1 - 1 in\n  let y2 = y2 - 1 in\n  let css = Array.init h @@ fun _ -> Scanf.scanf \"%s\\n\" Fun.id in\n  let d = G.bfs01 (h * w * 400) (fun (i, j, s, dir) ->\n    List.filter_map (fun (i, j, dir') ->\n      if i < 0 || h <= i || j < 0 || w <= j || css.(i).[j] = '@'\n      then None\n      else if (dir = Neutral || dir = dir') && s < k\n      then Some ((i, j, s + 1, dir'), 0, false)\n      else Some ((i, j, 1, dir'), 1, true))\n    [(i - 1, j, Up); (i + 1, j, Down); (i, j - 1, Left); (i, j + 1, Right)])\n    (x1, y1, 0, Neutral) in\n  Printf.printf \"%d\\n\" @@\n  max (-1) @@\n  succ @@\n  Array.fold_left (List.fold_left min) max_int @@\n  Array.init k @@ fun s ->\n    let s = s + 1 in\n    List.map (fun o -> Option.value ~default:max_int o)\n    [ d (x2, y2, s, Left); d (x2, y2, s, Right); d (x2, y2, s, Up); d (x2, y2, s, Down) ]\n\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2613, "cpu_time_ms": 19, "memory_kb": 7524}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s392345816", "group_id": "codeNet:p02648", "input_text": "let rec range a b = if a >= b then Seq.empty else fun () -> Seq.Cons (a, range (a+1) b)\n\nlet n = Scanf.scanf \"%d\" Fun.id\nlet vw = List.init n (fun _ -> Scanf.scanf \" %d %d\" (fun v w -> v, w))\nlet varr = List.to_seq vw |> Seq.map fst |> Array.of_seq\nlet warr = List.to_seq vw |> Seq.map snd |> Array.of_seq\n\nlet rec items arr x =\n  if x = 1 then [arr.(0)]\n  else arr.(x-1) :: items arr (x / 2)\n\nlet enumerate t lim va wa =\n  let ve = Array.make (1 lsl t) 0 in\n  let we = Array.make (1 lsl t) 0 in\n  range 0 (1 lsl t) |> Seq.iter (fun b ->\n    let ws = range 0 t |> Seq.fold_left (fun ws i ->\n      if b land (1 lsl i) > 0 then ws + wa.(i) else ws) 0 in\n    if ws <= lim then (\n      let vs = range 0 t |> Seq.fold_left (fun vs i ->\n        if b land (1 lsl i) > 0 then vs + va.(i) else vs) 0 in\n      we.(b) <- ws;\n      ve.(b) <- vs;\n  ));\n  (ve, we)\n\nlet solve x l =\n  let module A = Array in\n  let vs = A.of_list @@ items varr x in\n  let ws = A.of_list @@ items warr x in\n  let t = A.length vs in\n\n  let lvs = A.sub vs 0 (t/2) in\n  let rvs = A.sub vs (t/2) (t-t/2) in\n  let lws = A.sub ws 0 (t/2) in\n  let rws = A.sub ws (t/2) (t-t/2) in\n\n  let ve1, we1 = enumerate (t/2) l lvs lws in\n  let ve2, we2 = enumerate (t-t/2) l rvs rws in\n\n  let ans = ref 0 in\n  for i = 0 to (1 lsl (t/2)) - 1 do\n    let v1 = ve1.(i) in\n    let w1 = we1.(i) in\n    for j = 0 to (1 lsl (t-t/2)) - 1 do\n      let v2 = ve2.(j) in\n      let w2 = we2.(j) in\n      if w1 + w2 <= l then\n        ans := max !ans (v1 + v2);\n    done;\n  done;\n  !ans\n\nlet () =\n  Scanf.scanf \" %d\" @@ fun q ->\n  for i = 1 to q do\n    Scanf.scanf \" %d %d\" solve\n    |> Printf.printf \"%d\\n\"\n  done\n", "language": "OCaml", "metadata": {"date": 1592162392, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02648.html", "problem_id": "p02648", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02648/input.txt", "sample_output_relpath": "derived/input_output/data/p02648/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02648/OCaml/s392345816.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s392345816", "user_id": "u798181098"}, "prompt_components": {"gold_output": "0\n3\n3\n", "input_to_evaluate": "let rec range a b = if a >= b then Seq.empty else fun () -> Seq.Cons (a, range (a+1) b)\n\nlet n = Scanf.scanf \"%d\" Fun.id\nlet vw = List.init n (fun _ -> Scanf.scanf \" %d %d\" (fun v w -> v, w))\nlet varr = List.to_seq vw |> Seq.map fst |> Array.of_seq\nlet warr = List.to_seq vw |> Seq.map snd |> Array.of_seq\n\nlet rec items arr x =\n  if x = 1 then [arr.(0)]\n  else arr.(x-1) :: items arr (x / 2)\n\nlet enumerate t lim va wa =\n  let ve = Array.make (1 lsl t) 0 in\n  let we = Array.make (1 lsl t) 0 in\n  range 0 (1 lsl t) |> Seq.iter (fun b ->\n    let ws = range 0 t |> Seq.fold_left (fun ws i ->\n      if b land (1 lsl i) > 0 then ws + wa.(i) else ws) 0 in\n    if ws <= lim then (\n      let vs = range 0 t |> Seq.fold_left (fun vs i ->\n        if b land (1 lsl i) > 0 then vs + va.(i) else vs) 0 in\n      we.(b) <- ws;\n      ve.(b) <- vs;\n  ));\n  (ve, we)\n\nlet solve x l =\n  let module A = Array in\n  let vs = A.of_list @@ items varr x in\n  let ws = A.of_list @@ items warr x in\n  let t = A.length vs in\n\n  let lvs = A.sub vs 0 (t/2) in\n  let rvs = A.sub vs (t/2) (t-t/2) in\n  let lws = A.sub ws 0 (t/2) in\n  let rws = A.sub ws (t/2) (t-t/2) in\n\n  let ve1, we1 = enumerate (t/2) l lvs lws in\n  let ve2, we2 = enumerate (t-t/2) l rvs rws in\n\n  let ans = ref 0 in\n  for i = 0 to (1 lsl (t/2)) - 1 do\n    let v1 = ve1.(i) in\n    let w1 = we1.(i) in\n    for j = 0 to (1 lsl (t-t/2)) - 1 do\n      let v2 = ve2.(j) in\n      let w2 = we2.(j) in\n      if w1 + w2 <= l then\n        ans := max !ans (v1 + v2);\n    done;\n  done;\n  !ans\n\nlet () =\n  Scanf.scanf \" %d\" @@ fun q ->\n  for i = 1 to q do\n    Scanf.scanf \" %d %d\" solve\n    |> Printf.printf \"%d\\n\"\n  done\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nWe have a rooted binary tree with N vertices, where the vertices are numbered 1 to N.\nVertex 1 is the root, and the parent of Vertex i (i \\geq 2) is Vertex \\left[ \\frac{i}{2} \\right].\n\nEach vertex has one item in it. The item in Vertex i has a value of V_i and a weight of W_i.\nNow, process the following query Q times:\n\nGiven are a vertex v of the tree and a positive integer L.\nLet us choose some (possibly none) of the items in v and the ancestors of v so that their total weight is at most L.\nFind the maximum possible total value of the chosen items.\n\nHere, Vertex u is said to be an ancestor of Vertex v when u is an indirect parent of v, that is, there exists a sequence of vertices w_1,w_2,\\ldots,w_k (k\\geq 2) where w_1=v, w_k=u, and w_{i+1} is the parent of w_i for each i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N < 2^{18}\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq V_i \\leq 10^5\n\n1 \\leq W_i \\leq 10^5\n\nFor the values v and L given in each query, 1 \\leq v \\leq N and 1 \\leq L \\leq 10^5.\n\nInput\n\nLet v_i and L_i be the values v and L given in the i-th query.\nThen, Input is given from Standard Input in the following format:\n\nN\nV_1 W_1\n:\nV_N W_N\nQ\nv_1 L_1\n:\nv_Q L_Q\n\nOutput\n\nFor each integer i from 1 through Q,\nthe i-th line should contain the response to the i-th query.\n\nSample Input 1\n\n3\n1 2\n2 3\n3 4\n3\n1 1\n2 5\n3 5\n\nSample Output 1\n\n0\n3\n3\n\nIn the first query, we are given only one choice: the item with (V, W)=(1,2). Since L = 1, we cannot actually choose it, so our response should be 0.\n\nIn the second query, we are given two choices: the items with (V, W)=(1,2) and (V, W)=(2,3). Since L = 5, we can choose both of them, so our response should be 3.\n\nSample Input 2\n\n15\n123 119\n129 120\n132 112\n126 109\n118 103\n115 109\n102 100\n130 120\n105 105\n132 115\n104 102\n107 107\n127 116\n121 104\n121 115\n8\n8 234\n9 244\n10 226\n11 227\n12 240\n13 237\n14 206\n15 227\n\nSample Output 2\n\n256\n255\n250\n247\n255\n259\n223\n253", "sample_input": "3\n1 2\n2 3\n3 4\n3\n1 1\n2 5\n3 5\n"}, "reference_outputs": ["0\n3\n3\n"], "source_document_id": "p02648", "source_text": "Score : 700 points\n\nProblem Statement\n\nWe have a rooted binary tree with N vertices, where the vertices are numbered 1 to N.\nVertex 1 is the root, and the parent of Vertex i (i \\geq 2) is Vertex \\left[ \\frac{i}{2} \\right].\n\nEach vertex has one item in it. The item in Vertex i has a value of V_i and a weight of W_i.\nNow, process the following query Q times:\n\nGiven are a vertex v of the tree and a positive integer L.\nLet us choose some (possibly none) of the items in v and the ancestors of v so that their total weight is at most L.\nFind the maximum possible total value of the chosen items.\n\nHere, Vertex u is said to be an ancestor of Vertex v when u is an indirect parent of v, that is, there exists a sequence of vertices w_1,w_2,\\ldots,w_k (k\\geq 2) where w_1=v, w_k=u, and w_{i+1} is the parent of w_i for each i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N < 2^{18}\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq V_i \\leq 10^5\n\n1 \\leq W_i \\leq 10^5\n\nFor the values v and L given in each query, 1 \\leq v \\leq N and 1 \\leq L \\leq 10^5.\n\nInput\n\nLet v_i and L_i be the values v and L given in the i-th query.\nThen, Input is given from Standard Input in the following format:\n\nN\nV_1 W_1\n:\nV_N W_N\nQ\nv_1 L_1\n:\nv_Q L_Q\n\nOutput\n\nFor each integer i from 1 through Q,\nthe i-th line should contain the response to the i-th query.\n\nSample Input 1\n\n3\n1 2\n2 3\n3 4\n3\n1 1\n2 5\n3 5\n\nSample Output 1\n\n0\n3\n3\n\nIn the first query, we are given only one choice: the item with (V, W)=(1,2). Since L = 1, we cannot actually choose it, so our response should be 0.\n\nIn the second query, we are given two choices: the items with (V, W)=(1,2) and (V, W)=(2,3). Since L = 5, we can choose both of them, so our response should be 3.\n\nSample Input 2\n\n15\n123 119\n129 120\n132 112\n126 109\n118 103\n115 109\n102 100\n130 120\n105 105\n132 115\n104 102\n107 107\n127 116\n121 104\n121 115\n8\n8 234\n9 244\n10 226\n11 227\n12 240\n13 237\n14 206\n15 227\n\nSample Output 2\n\n256\n255\n250\n247\n255\n259\n223\n253", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1648, "cpu_time_ms": 3309, "memory_kb": 45100}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s884022669", "group_id": "codeNet:p02648", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let vs = Array.make n 0 in\n  let ws = Array.make n 0 in\n  for i = 0 to n - 1 do\n    Scanf.scanf \"%d %d\\n\" @@ fun v w ->\n      vs.(i) <- v;\n      ws.(i) <- w\n  done;\n  Scanf.scanf \"%d\\n\" @@ fun q ->\n    let vls = Array.init q @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun v l -> v, l in\n    let maxl = Array.fold_right (fun (_, l) -> max l) vls min_int in\n    let n' = min n ((1 lsl 10) - 1) in\n    let dp = Bigarray.Array2.create Bigarray.int Bigarray.c_layout (n' + 1) (maxl + 1) in\n    Bigarray.Array2.fill (Bigarray.Array2.sub_left dp 0 1) 0;\n    for i = 1 to n' do\n      let v = Array.unsafe_get vs (i - 1) in\n      let w = Array.unsafe_get ws (i - 1) in\n      Bigarray.Array2.blit\n        (Bigarray.Array2.sub_left dp (i lsr 1) 1)\n        (Bigarray.Array2.sub_left dp i 1);\n      for j = w to maxl do\n        let d = Bigarray.Array2.unsafe_get dp (i lsr 1) j in\n        let d' = v + Bigarray.Array2.unsafe_get dp (i lsr 1) (j - w) in\n        if d < d' then Bigarray.Array2.unsafe_set dp i j d'\n      done\n    done;\n    let rec solve l i s m =\n      if l < 0\n      then m\n      else if i <= n'\n      then max m (s + Bigarray.Array2.unsafe_get dp i l)\n      else solve l (i lsr 1) s @@ solve (l - Array.unsafe_get ws (i - 1)) (i lsr 1) (s + Array.unsafe_get vs (i - 1)) m in\n    Array.iter (fun (v, l) -> Printf.printf \"%d\\n\" @@ solve l v 0 min_int) vls\n\n", "language": "OCaml", "metadata": {"date": 1592160568, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02648.html", "problem_id": "p02648", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02648/input.txt", "sample_output_relpath": "derived/input_output/data/p02648/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02648/OCaml/s884022669.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s884022669", "user_id": "u504158101"}, "prompt_components": {"gold_output": "0\n3\n3\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let vs = Array.make n 0 in\n  let ws = Array.make n 0 in\n  for i = 0 to n - 1 do\n    Scanf.scanf \"%d %d\\n\" @@ fun v w ->\n      vs.(i) <- v;\n      ws.(i) <- w\n  done;\n  Scanf.scanf \"%d\\n\" @@ fun q ->\n    let vls = Array.init q @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun v l -> v, l in\n    let maxl = Array.fold_right (fun (_, l) -> max l) vls min_int in\n    let n' = min n ((1 lsl 10) - 1) in\n    let dp = Bigarray.Array2.create Bigarray.int Bigarray.c_layout (n' + 1) (maxl + 1) in\n    Bigarray.Array2.fill (Bigarray.Array2.sub_left dp 0 1) 0;\n    for i = 1 to n' do\n      let v = Array.unsafe_get vs (i - 1) in\n      let w = Array.unsafe_get ws (i - 1) in\n      Bigarray.Array2.blit\n        (Bigarray.Array2.sub_left dp (i lsr 1) 1)\n        (Bigarray.Array2.sub_left dp i 1);\n      for j = w to maxl do\n        let d = Bigarray.Array2.unsafe_get dp (i lsr 1) j in\n        let d' = v + Bigarray.Array2.unsafe_get dp (i lsr 1) (j - w) in\n        if d < d' then Bigarray.Array2.unsafe_set dp i j d'\n      done\n    done;\n    let rec solve l i s m =\n      if l < 0\n      then m\n      else if i <= n'\n      then max m (s + Bigarray.Array2.unsafe_get dp i l)\n      else solve l (i lsr 1) s @@ solve (l - Array.unsafe_get ws (i - 1)) (i lsr 1) (s + Array.unsafe_get vs (i - 1)) m in\n    Array.iter (fun (v, l) -> Printf.printf \"%d\\n\" @@ solve l v 0 min_int) vls\n\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nWe have a rooted binary tree with N vertices, where the vertices are numbered 1 to N.\nVertex 1 is the root, and the parent of Vertex i (i \\geq 2) is Vertex \\left[ \\frac{i}{2} \\right].\n\nEach vertex has one item in it. The item in Vertex i has a value of V_i and a weight of W_i.\nNow, process the following query Q times:\n\nGiven are a vertex v of the tree and a positive integer L.\nLet us choose some (possibly none) of the items in v and the ancestors of v so that their total weight is at most L.\nFind the maximum possible total value of the chosen items.\n\nHere, Vertex u is said to be an ancestor of Vertex v when u is an indirect parent of v, that is, there exists a sequence of vertices w_1,w_2,\\ldots,w_k (k\\geq 2) where w_1=v, w_k=u, and w_{i+1} is the parent of w_i for each i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N < 2^{18}\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq V_i \\leq 10^5\n\n1 \\leq W_i \\leq 10^5\n\nFor the values v and L given in each query, 1 \\leq v \\leq N and 1 \\leq L \\leq 10^5.\n\nInput\n\nLet v_i and L_i be the values v and L given in the i-th query.\nThen, Input is given from Standard Input in the following format:\n\nN\nV_1 W_1\n:\nV_N W_N\nQ\nv_1 L_1\n:\nv_Q L_Q\n\nOutput\n\nFor each integer i from 1 through Q,\nthe i-th line should contain the response to the i-th query.\n\nSample Input 1\n\n3\n1 2\n2 3\n3 4\n3\n1 1\n2 5\n3 5\n\nSample Output 1\n\n0\n3\n3\n\nIn the first query, we are given only one choice: the item with (V, W)=(1,2). Since L = 1, we cannot actually choose it, so our response should be 0.\n\nIn the second query, we are given two choices: the items with (V, W)=(1,2) and (V, W)=(2,3). Since L = 5, we can choose both of them, so our response should be 3.\n\nSample Input 2\n\n15\n123 119\n129 120\n132 112\n126 109\n118 103\n115 109\n102 100\n130 120\n105 105\n132 115\n104 102\n107 107\n127 116\n121 104\n121 115\n8\n8 234\n9 244\n10 226\n11 227\n12 240\n13 237\n14 206\n15 227\n\nSample Output 2\n\n256\n255\n250\n247\n255\n259\n223\n253", "sample_input": "3\n1 2\n2 3\n3 4\n3\n1 1\n2 5\n3 5\n"}, "reference_outputs": ["0\n3\n3\n"], "source_document_id": "p02648", "source_text": "Score : 700 points\n\nProblem Statement\n\nWe have a rooted binary tree with N vertices, where the vertices are numbered 1 to N.\nVertex 1 is the root, and the parent of Vertex i (i \\geq 2) is Vertex \\left[ \\frac{i}{2} \\right].\n\nEach vertex has one item in it. The item in Vertex i has a value of V_i and a weight of W_i.\nNow, process the following query Q times:\n\nGiven are a vertex v of the tree and a positive integer L.\nLet us choose some (possibly none) of the items in v and the ancestors of v so that their total weight is at most L.\nFind the maximum possible total value of the chosen items.\n\nHere, Vertex u is said to be an ancestor of Vertex v when u is an indirect parent of v, that is, there exists a sequence of vertices w_1,w_2,\\ldots,w_k (k\\geq 2) where w_1=v, w_k=u, and w_{i+1} is the parent of w_i for each i.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N < 2^{18}\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq V_i \\leq 10^5\n\n1 \\leq W_i \\leq 10^5\n\nFor the values v and L given in each query, 1 \\leq v \\leq N and 1 \\leq L \\leq 10^5.\n\nInput\n\nLet v_i and L_i be the values v and L given in the i-th query.\nThen, Input is given from Standard Input in the following format:\n\nN\nV_1 W_1\n:\nV_N W_N\nQ\nv_1 L_1\n:\nv_Q L_Q\n\nOutput\n\nFor each integer i from 1 through Q,\nthe i-th line should contain the response to the i-th query.\n\nSample Input 1\n\n3\n1 2\n2 3\n3 4\n3\n1 1\n2 5\n3 5\n\nSample Output 1\n\n0\n3\n3\n\nIn the first query, we are given only one choice: the item with (V, W)=(1,2). Since L = 1, we cannot actually choose it, so our response should be 0.\n\nIn the second query, we are given two choices: the items with (V, W)=(1,2) and (V, W)=(2,3). Since L = 5, we can choose both of them, so our response should be 3.\n\nSample Input 2\n\n15\n123 119\n129 120\n132 112\n126 109\n118 103\n115 109\n102 100\n130 120\n105 105\n132 115\n104 102\n107 107\n127 116\n121 104\n121 115\n8\n8 234\n9 244\n10 226\n11 227\n12 240\n13 237\n14 206\n15 227\n\nSample Output 2\n\n256\n255\n250\n247\n255\n259\n223\n253", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1395, "cpu_time_ms": 2442, "memory_kb": 814076}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s453497715", "group_id": "codeNet:p02657", "input_text": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = if n <= m then  List.range n `To m else []\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (0 ++^ n)\n\nlet scan_list ?sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\nlet scan_array ?sep cnv = Array.of_list @@ scan_list ?sep cnv\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list ?sep conv);\n  arr\n\nlet atoi c = Char.code c - Char.code '0'\nlet itoa n = Char.chr (n + Char.code '0')\n\nlet between n x m = n <= x && x < m\n\n\n(* ===== MAIN ===== *)\n\nlet x, y = scan \"%d %d\" (fun x y -> x, y)\n\nlet () =\n  Printf.printf \"%d\\n\" (x*y)\n", "language": "OCaml", "metadata": {"date": 1593971510, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s453497715.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s453497715", "user_id": "u106804623"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = if n <= m then  List.range n `To m else []\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (0 ++^ n)\n\nlet scan_list ?sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\nlet scan_array ?sep cnv = Array.of_list @@ scan_list ?sep cnv\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list ?sep conv);\n  arr\n\nlet atoi c = Char.code c - Char.code '0'\nlet itoa n = Char.chr (n + Char.code '0')\n\nlet between n x m = n <= x && x < m\n\n\n(* ===== MAIN ===== *)\n\nlet x, y = scan \"%d %d\" (fun x y -> x, y)\n\nlet () =\n  Printf.printf \"%d\\n\" (x*y)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nCompute A \\times B.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the value A \\times B as an integer.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\nWe have 2 \\times 5 = 10.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\n10000", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02657", "source_text": "Score : 100 points\n\nProblem Statement\n\nCompute A \\times B.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the value A \\times B as an integer.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\nWe have 2 \\times 5 = 10.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\n10000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1177, "cpu_time_ms": 13, "memory_kb": 5436}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s803786733", "group_id": "codeNet:p02657", "input_text": "let () = Scanf.scanf \"%d %d\" (fun a b -> Printf.printf \"%d\\n\" (a*b))\n", "language": "OCaml", "metadata": {"date": 1591405256, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s803786733.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s803786733", "user_id": "u052332717"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\" (fun a b -> Printf.printf \"%d\\n\" (a*b))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nCompute A \\times B.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the value A \\times B as an integer.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\nWe have 2 \\times 5 = 10.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\n10000", "sample_input": "2 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02657", "source_text": "Score : 100 points\n\nProblem Statement\n\nCompute A \\times B.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the value A \\times B as an integer.\n\nSample Input 1\n\n2 5\n\nSample Output 1\n\n10\n\nWe have 2 \\times 5 = 10.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\n10000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 69, "cpu_time_ms": 4, "memory_kb": 3760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s334332605", "group_id": "codeNet:p02661", "input_text": "(*\n * forall l r (p : forall n, l < n <= r -> bool),\n *   ( exists m,\n *     l < m <= r /\\ forall n H, p n H = true <-> m <= n ) ->\n *   { m |\n *     l < m <= r /\\ forall n H, p n H = true <-> m <= n }\n *)\nlet rec lower_bound l r p =\n  if r <= 1 + l\n  then r\n  else let m = (l + r) / 2 in\n       if p m\n       then lower_bound l m p\n       else lower_bound m r p\n\nlet rec upper_bound l r p =\n  if r <= 1 + l\n  then l\n  else let m = (l + r) / 2 in\n       if p m \n       then upper_bound m r p\n       else upper_bound l m p\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let abs = Array.init n @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun a b -> a, b in\n  let r = \n    upper_bound 0 10000000000 @@ fun m ->\n      (n + 1) / 2 <=\n        Array.fold_left (fun acc (_, b) ->\n          acc + if m <= b then 1 else 0) 0 abs in\n  let l =\n    lower_bound 0 10000000000 (fun m ->\n      ( <= ) ((n + 1) / 2) @@\n      Array.fold_left (fun acc (a, _) ->\n        acc + if a <= m then 1 else 0) 0 abs) in\n  Printf.printf \"%d\\n\" @@\n  if n mod 2 = 1\n  then r - l + 1\n  else\n    2 * r\n    - (if (n + 3) / 2 <=\n      Array.fold_left (fun acc (_, b) ->\n        acc + if r <= b then 1 else 0) 0 abs then 0 else 1)\n    - 2 * l\n    - (if (n + 3) / 2 <=\n      Array.fold_left (fun acc (a, _) ->\n        acc + if a <= l then 1 else 0) 0 abs then 0 else 1)\n    + 1\n", "language": "OCaml", "metadata": {"date": 1590979678, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02661.html", "problem_id": "p02661", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02661/input.txt", "sample_output_relpath": "derived/input_output/data/p02661/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02661/OCaml/s334332605.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s334332605", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(*\n * forall l r (p : forall n, l < n <= r -> bool),\n *   ( exists m,\n *     l < m <= r /\\ forall n H, p n H = true <-> m <= n ) ->\n *   { m |\n *     l < m <= r /\\ forall n H, p n H = true <-> m <= n }\n *)\nlet rec lower_bound l r p =\n  if r <= 1 + l\n  then r\n  else let m = (l + r) / 2 in\n       if p m\n       then lower_bound l m p\n       else lower_bound m r p\n\nlet rec upper_bound l r p =\n  if r <= 1 + l\n  then l\n  else let m = (l + r) / 2 in\n       if p m \n       then upper_bound m r p\n       else upper_bound l m p\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let abs = Array.init n @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun a b -> a, b in\n  let r = \n    upper_bound 0 10000000000 @@ fun m ->\n      (n + 1) / 2 <=\n        Array.fold_left (fun acc (_, b) ->\n          acc + if m <= b then 1 else 0) 0 abs in\n  let l =\n    lower_bound 0 10000000000 (fun m ->\n      ( <= ) ((n + 1) / 2) @@\n      Array.fold_left (fun acc (a, _) ->\n        acc + if a <= m then 1 else 0) 0 abs) in\n  Printf.printf \"%d\\n\" @@\n  if n mod 2 = 1\n  then r - l + 1\n  else\n    2 * r\n    - (if (n + 3) / 2 <=\n      Array.fold_left (fun acc (_, b) ->\n        acc + if r <= b then 1 else 0) 0 abs then 0 else 1)\n    - 2 * l\n    - (if (n + 3) / 2 <=\n      Array.fold_left (fun acc (a, _) ->\n        acc + if a <= l then 1 else 0) 0 abs then 0 else 1)\n    + 1\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N integers X_1, X_2, \\cdots, X_N, and we know that A_i \\leq X_i \\leq B_i.\nFind the number of different values that the median of X_1, X_2, \\cdots, X_N can take.\n\nNotes\n\nThe median of X_1, X_2, \\cdots, X_N is defined as follows. Let x_1, x_2, \\cdots, x_N be the result of sorting X_1, X_2, \\cdots, X_N in ascending order.\n\nIf N is odd, the median is x_{(N+1)/2};\n\nif N is even, the median is (x_{N/2} + x_{N/2+1}) / 2.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\nA_2 B_2\n:\nA_N B_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2\n1 2\n2 3\n\nSample Output 1\n\n3\n\nIf X_1 = 1 and X_2 = 2, the median is \\frac{3}{2};\n\nif X_1 = 1 and X_2 = 3, the median is 2;\n\nif X_1 = 2 and X_2 = 2, the median is 2;\n\nif X_1 = 2 and X_2 = 3, the median is \\frac{5}{2}.\n\nThus, the median can take three values: \\frac{3}{2}, 2, and \\frac{5}{2}.\n\nSample Input 2\n\n3\n100 100\n10 10000\n1 1000000000\n\nSample Output 2\n\n9991", "sample_input": "2\n1 2\n2 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02661", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N integers X_1, X_2, \\cdots, X_N, and we know that A_i \\leq X_i \\leq B_i.\nFind the number of different values that the median of X_1, X_2, \\cdots, X_N can take.\n\nNotes\n\nThe median of X_1, X_2, \\cdots, X_N is defined as follows. Let x_1, x_2, \\cdots, x_N be the result of sorting X_1, X_2, \\cdots, X_N in ascending order.\n\nIf N is odd, the median is x_{(N+1)/2};\n\nif N is even, the median is (x_{N/2} + x_{N/2+1}) / 2.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\nA_2 B_2\n:\nA_N B_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2\n1 2\n2 3\n\nSample Output 1\n\n3\n\nIf X_1 = 1 and X_2 = 2, the median is \\frac{3}{2};\n\nif X_1 = 1 and X_2 = 3, the median is 2;\n\nif X_1 = 2 and X_2 = 2, the median is 2;\n\nif X_1 = 2 and X_2 = 3, the median is \\frac{5}{2}.\n\nThus, the median can take three values: \\frac{3}{2}, 2, and \\frac{5}{2}.\n\nSample Input 2\n\n3\n100 100\n10 10000\n1 1000000000\n\nSample Output 2\n\n9991", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 192, "memory_kb": 12568}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s665412026", "group_id": "codeNet:p02662", "input_text": "Scanf.scanf \"%d %d\" (fun n s ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n\n    let m = 998244353 in\n    let ( +@) a b = (a + b) mod m in\n\n    let rec loop i dp =\n        if i = n then dp.(s) else (\n            let ndp = Array.map (fun a -> a +@ a) dp in\n            let c = a.(i) in\n            for j = 0 to s - c do\n                ndp.(j + c) <- ndp.(j + c) +@ dp.(j)\n            done;\n            loop (i + 1) ndp\n        )\n    in\n    let dp = Array.make (s + 1) 0 in\n    let () = dp.(0) <- 1 in\n    loop 0 dp |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1590981175, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02662.html", "problem_id": "p02662", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02662/input.txt", "sample_output_relpath": "derived/input_output/data/p02662/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02662/OCaml/s665412026.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s665412026", "user_id": "u342443598"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n s ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n\n    let m = 998244353 in\n    let ( +@) a b = (a + b) mod m in\n\n    let rec loop i dp =\n        if i = n then dp.(s) else (\n            let ndp = Array.map (fun a -> a +@ a) dp in\n            let c = a.(i) in\n            for j = 0 to s - c do\n                ndp.(j + c) <- ndp.(j + c) +@ dp.(j)\n            done;\n            loop (i + 1) ndp\n        )\n    in\n    let dp = Array.make (s + 1) 0 in\n    let () = dp.(0) <- 1 in\n    loop 0 dp |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven are a sequence of N positive integers A_1, A_2, \\ldots, A_N and another positive integer S.\n\nFor a non-empty subset T of the set \\{1, 2, \\ldots , N \\}, let us define f(T) as follows:\n\nf(T) is the number of different non-empty subsets \\{x_1, x_2, \\ldots , x_k \\} of T such that A_{x_1}+A_{x_2}+\\cdots +A_{x_k} = S.\n\nFind the sum of f(T) over all 2^N-1 subsets T of \\{1, 2, \\ldots , N \\}. Since the sum can be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3000\n\n1 \\leq S \\leq 3000\n\n1 \\leq A_i \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN S\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the sum of f(T) modulo 998244353.\n\nSample Input 1\n\n3 4\n2 2 4\n\nSample Output 1\n\n6\n\nFor each T, the value of f(T) is shown below. The sum of these values is 6.\n\nf(\\{1\\}) = 0\n\nf(\\{2\\}) = 0\n\nf(\\{3\\}) = 1 (One subset \\{3\\} satisfies the condition.)\n\nf(\\{1, 2\\}) = 1 (\\{1, 2\\})\n\nf(\\{2, 3\\}) = 1 (\\{3\\})\n\nf(\\{1, 3\\}) = 1 (\\{3\\})\n\nf(\\{1, 2, 3\\}) = 2 (\\{1, 2\\}, \\{3\\})\n\nSample Input 2\n\n5 8\n9 9 9 9 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n10 10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 3\n\n3296", "sample_input": "3 4\n2 2 4\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02662", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven are a sequence of N positive integers A_1, A_2, \\ldots, A_N and another positive integer S.\n\nFor a non-empty subset T of the set \\{1, 2, \\ldots , N \\}, let us define f(T) as follows:\n\nf(T) is the number of different non-empty subsets \\{x_1, x_2, \\ldots , x_k \\} of T such that A_{x_1}+A_{x_2}+\\cdots +A_{x_k} = S.\n\nFind the sum of f(T) over all 2^N-1 subsets T of \\{1, 2, \\ldots , N \\}. Since the sum can be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3000\n\n1 \\leq S \\leq 3000\n\n1 \\leq A_i \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN S\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the sum of f(T) modulo 998244353.\n\nSample Input 1\n\n3 4\n2 2 4\n\nSample Output 1\n\n6\n\nFor each T, the value of f(T) is shown below. The sum of these values is 6.\n\nf(\\{1\\}) = 0\n\nf(\\{2\\}) = 0\n\nf(\\{3\\}) = 1 (One subset \\{3\\} satisfies the condition.)\n\nf(\\{1, 2\\}) = 1 (\\{1, 2\\})\n\nf(\\{2, 3\\}) = 1 (\\{3\\})\n\nf(\\{1, 3\\}) = 1 (\\{3\\})\n\nf(\\{1, 2, 3\\}) = 2 (\\{1, 2\\}, \\{3\\})\n\nSample Input 2\n\n5 8\n9 9 9 9 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n10 10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 3\n\n3296", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 112, "memory_kb": 18436}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s681398923", "group_id": "codeNet:p02662", "input_text": "Scanf.scanf \"%d %d\" (fun n s ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n\n    let m = 998244353 in\n    let ( +@) a b = (a + b) mod m in\n    let ( *@) a b = (a * b) mod m in\n\n    let module M = Map.Make (struct type t = int let compare = compare end) in\n    let dp = Array.make (s + 1) M.empty in\n    let () = dp.(0) <- M.add 0 1 M.empty in\n\n    for i = 0 to n - 1 do\n        for j = s - a.(i) downto 0 do\n            dp.(j + a.(i)) <-\n                M.fold (fun k v acc ->\n                    M.add (k + 1) (v +@ try M.find (k + 1) acc with _ -> 0) acc) dp.(j) dp.(j + a.(i))\n        done\n    done;\n    let powmod a b =\n        let rec loop r i acc =\n            if i = 0 then acc else\n                loop (r *@ r) (i lsr 1) (if i land 1 = 1 then acc *@ r else acc)\n        in\n        loop a b 1\n    in\n    M.fold (fun k v acc -> acc +@ v *@ powmod 2 (n - k)) dp.(s) 0 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1590976579, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02662.html", "problem_id": "p02662", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02662/input.txt", "sample_output_relpath": "derived/input_output/data/p02662/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02662/OCaml/s681398923.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s681398923", "user_id": "u342443598"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n s ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n\n    let m = 998244353 in\n    let ( +@) a b = (a + b) mod m in\n    let ( *@) a b = (a * b) mod m in\n\n    let module M = Map.Make (struct type t = int let compare = compare end) in\n    let dp = Array.make (s + 1) M.empty in\n    let () = dp.(0) <- M.add 0 1 M.empty in\n\n    for i = 0 to n - 1 do\n        for j = s - a.(i) downto 0 do\n            dp.(j + a.(i)) <-\n                M.fold (fun k v acc ->\n                    M.add (k + 1) (v +@ try M.find (k + 1) acc with _ -> 0) acc) dp.(j) dp.(j + a.(i))\n        done\n    done;\n    let powmod a b =\n        let rec loop r i acc =\n            if i = 0 then acc else\n                loop (r *@ r) (i lsr 1) (if i land 1 = 1 then acc *@ r else acc)\n        in\n        loop a b 1\n    in\n    M.fold (fun k v acc -> acc +@ v *@ powmod 2 (n - k)) dp.(s) 0 |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven are a sequence of N positive integers A_1, A_2, \\ldots, A_N and another positive integer S.\n\nFor a non-empty subset T of the set \\{1, 2, \\ldots , N \\}, let us define f(T) as follows:\n\nf(T) is the number of different non-empty subsets \\{x_1, x_2, \\ldots , x_k \\} of T such that A_{x_1}+A_{x_2}+\\cdots +A_{x_k} = S.\n\nFind the sum of f(T) over all 2^N-1 subsets T of \\{1, 2, \\ldots , N \\}. Since the sum can be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3000\n\n1 \\leq S \\leq 3000\n\n1 \\leq A_i \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN S\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the sum of f(T) modulo 998244353.\n\nSample Input 1\n\n3 4\n2 2 4\n\nSample Output 1\n\n6\n\nFor each T, the value of f(T) is shown below. The sum of these values is 6.\n\nf(\\{1\\}) = 0\n\nf(\\{2\\}) = 0\n\nf(\\{3\\}) = 1 (One subset \\{3\\} satisfies the condition.)\n\nf(\\{1, 2\\}) = 1 (\\{1, 2\\})\n\nf(\\{2, 3\\}) = 1 (\\{3\\})\n\nf(\\{1, 3\\}) = 1 (\\{3\\})\n\nf(\\{1, 2, 3\\}) = 2 (\\{1, 2\\}, \\{3\\})\n\nSample Input 2\n\n5 8\n9 9 9 9 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n10 10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 3\n\n3296", "sample_input": "3 4\n2 2 4\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02662", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven are a sequence of N positive integers A_1, A_2, \\ldots, A_N and another positive integer S.\n\nFor a non-empty subset T of the set \\{1, 2, \\ldots , N \\}, let us define f(T) as follows:\n\nf(T) is the number of different non-empty subsets \\{x_1, x_2, \\ldots , x_k \\} of T such that A_{x_1}+A_{x_2}+\\cdots +A_{x_k} = S.\n\nFind the sum of f(T) over all 2^N-1 subsets T of \\{1, 2, \\ldots , N \\}. Since the sum can be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3000\n\n1 \\leq S \\leq 3000\n\n1 \\leq A_i \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN S\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the sum of f(T) modulo 998244353.\n\nSample Input 1\n\n3 4\n2 2 4\n\nSample Output 1\n\n6\n\nFor each T, the value of f(T) is shown below. The sum of these values is 6.\n\nf(\\{1\\}) = 0\n\nf(\\{2\\}) = 0\n\nf(\\{3\\}) = 1 (One subset \\{3\\} satisfies the condition.)\n\nf(\\{1, 2\\}) = 1 (\\{1, 2\\})\n\nf(\\{2, 3\\}) = 1 (\\{3\\})\n\nf(\\{1, 3\\}) = 1 (\\{3\\})\n\nf(\\{1, 2, 3\\}) = 2 (\\{1, 2\\}, \\{3\\})\n\nSample Input 2\n\n5 8\n9 9 9 9 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n10 10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 3\n\n3296", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 925, "cpu_time_ms": 2206, "memory_kb": 14860}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s664064371", "group_id": "codeNet:p02663", "input_text": "let () = Scanf.scanf \"%d %d %d %d %d\\n\" @@ fun h1 m1 h2 m2 k ->\n  Printf.printf \"%d\\n\" @@\n  max 0 @@ 60 * (h2 - h1) + (m2 - m1) - k\n\n", "language": "OCaml", "metadata": {"date": 1590887061, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s664064371.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s664064371", "user_id": "u504158101"}, "prompt_components": {"gold_output": "270\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d %d %d\\n\" @@ fun h1 m1 h2 m2 k ->\n  Printf.printf \"%d\\n\" @@\n  max 0 @@ 60 * (h2 - h1) + (m2 - m1) - k\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 133, "cpu_time_ms": 3, "memory_kb": 3796}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s417662169", "group_id": "codeNet:p02664", "input_text": "open Batteries\nopen Printf\n\nlet ($) g f x = g (f x)\n\nmodule MyList = struct\n  include List\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr = fold_right\n  let foldri = fold_righti\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\nend\n\nmodule L = MyList\n\nlet swap = Tuple2.swap\n\nlet atoi = int_of_string\nlet itoa = string_of_int\nlet atof = float_of_string\nlet ftoa = string_of_float\nlet ctoi = int_of_char\nlet itoc = char_of_int\n\nlet stocl = String.to_list\nlet cltos = String.of_list\nlet spsp s = String.split_on_char ' ' s\n\nmodule MyString = struct\n  include String\n\n  let soc = split_on_char\n\n  let map' f s = L.map f (stocl s)\n  let mapi' f s = L.map f (stocl s)\n\n  let zipf f a b = L.zipf f (stocl a) (stocl b)\n  let zipfi f a b = L.zipfi f (stocl a) (stocl b)\n\n  let mkstr f sep ls =\n    L.foldl (fun acc x -> acc ^ sep ^ (f x)) (f @@ L.hd ls) (List.tl ls)\nend\n\nmodule S = MyString\n\nmodule MySet = struct\n  include Set\n\n  let fold' f s z = fold f z s\nend\n\nmodule St = MySet\n\nmodule MyMap = struct\n  include Map\n\n  let apply = find\n  let apply_or = find_default\nend\n\nmodule Mp = MyMap\n\n\nlet rds () = read_line ()\n\nlet rdi () = atoi @@ rds ()\n\nlet rdhs () = spsp @@ rds ()\nlet rdhi () = rdhs () |> L.map atoi\n\nlet rdi2 () = match rdhi () with\n  | a::b::_ -> (a, b)\n  | _ -> (0, 0)\n\nlet rdi3 () = match rdhi () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0, 0, 0)\n\nlet rdi4 () = match rdhi () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0, 0, 0, 0)\n\nlet rdi5 () = match rdhi () with\n| a::b::c::d::e::_ -> (a, b, c, d, e)\n| _ -> (0, 0, 0, 0, 0)\n\nlet rdv n rdf =\n  let rec rdv' n =\n    if n <= 0 then []\n    else (\n      let s = rdf () in\n      s::(rdv' (n - 1))\n    )\n  in rdv' n\n\nlet rdvi n = rdv n rdi\nlet rdvi2 n = rdv n rdi2\nlet rdvi3 n = rdv n rdi3\nlet rdvi4 n = rdv n rdi4\n\nlet puts s = print_endline s\nlet putyn b = puts (if b then \"Yes\" else \"No\")\nlet puti i = puts @@ itoa i\n\nlet set_power ls =\n  let rec set_power' ls pls =\n    match ls with\n    | [] -> pls\n    | hd::tl -> set_power' tl (L.flatmap (fun p -> [p; hd::p]) pls)\n  in set_power' ls [[]]\n\n\nlet rdhf () = rdhs () |> L.map atof\nlet rdf4 () = match rdhf () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0., 0., 0., 0.)\n\n\nmodule Graph = struct\n\n  type 'a t = { nb : (int, int St.t) Mp.t; vdt : (int, 'a) Mp.t }\n\n  let nothing = { nb = Mp.empty; vdt = Mp.empty }\n\n  let add_edge (e : int * int) g =\n    let (v1, v2) = e in\n    let nbvs = g.nb |> Mp.apply_or St.empty v1 in\n    let nb1 = g.nb |> Mp.add v1 (nbvs |> St.add v2) in\n    { g with nb = nb1 }\n\n  let add_uedge e g =\n    add_edge e (add_edge (swap e) g)\n\n  let from_edges es =\n    es |> L.foldl (fun g e -> add_edge e g) nothing\n\n  let from_uedges es =\n    es |> L.foldl (fun g e -> add_uedge e g) nothing\n\n\nend\n\nmodule G = Graph\n\n\nlet _ =\n  let t = rds () in\n  let result = S.replace_chars (fun c ->\n    match c with\n    | '?' -> \"D\"\n    | x -> S.of_char x\n  ) t in\n  puts result\n;;\n", "language": "OCaml", "metadata": {"date": 1590896819, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s417662169.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s417662169", "user_id": "u970139668"}, "prompt_components": {"gold_output": "PDPDPDP\n", "input_to_evaluate": "open Batteries\nopen Printf\n\nlet ($) g f x = g (f x)\n\nmodule MyList = struct\n  include List\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr = fold_right\n  let foldri = fold_righti\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\nend\n\nmodule L = MyList\n\nlet swap = Tuple2.swap\n\nlet atoi = int_of_string\nlet itoa = string_of_int\nlet atof = float_of_string\nlet ftoa = string_of_float\nlet ctoi = int_of_char\nlet itoc = char_of_int\n\nlet stocl = String.to_list\nlet cltos = String.of_list\nlet spsp s = String.split_on_char ' ' s\n\nmodule MyString = struct\n  include String\n\n  let soc = split_on_char\n\n  let map' f s = L.map f (stocl s)\n  let mapi' f s = L.map f (stocl s)\n\n  let zipf f a b = L.zipf f (stocl a) (stocl b)\n  let zipfi f a b = L.zipfi f (stocl a) (stocl b)\n\n  let mkstr f sep ls =\n    L.foldl (fun acc x -> acc ^ sep ^ (f x)) (f @@ L.hd ls) (List.tl ls)\nend\n\nmodule S = MyString\n\nmodule MySet = struct\n  include Set\n\n  let fold' f s z = fold f z s\nend\n\nmodule St = MySet\n\nmodule MyMap = struct\n  include Map\n\n  let apply = find\n  let apply_or = find_default\nend\n\nmodule Mp = MyMap\n\n\nlet rds () = read_line ()\n\nlet rdi () = atoi @@ rds ()\n\nlet rdhs () = spsp @@ rds ()\nlet rdhi () = rdhs () |> L.map atoi\n\nlet rdi2 () = match rdhi () with\n  | a::b::_ -> (a, b)\n  | _ -> (0, 0)\n\nlet rdi3 () = match rdhi () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0, 0, 0)\n\nlet rdi4 () = match rdhi () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0, 0, 0, 0)\n\nlet rdi5 () = match rdhi () with\n| a::b::c::d::e::_ -> (a, b, c, d, e)\n| _ -> (0, 0, 0, 0, 0)\n\nlet rdv n rdf =\n  let rec rdv' n =\n    if n <= 0 then []\n    else (\n      let s = rdf () in\n      s::(rdv' (n - 1))\n    )\n  in rdv' n\n\nlet rdvi n = rdv n rdi\nlet rdvi2 n = rdv n rdi2\nlet rdvi3 n = rdv n rdi3\nlet rdvi4 n = rdv n rdi4\n\nlet puts s = print_endline s\nlet putyn b = puts (if b then \"Yes\" else \"No\")\nlet puti i = puts @@ itoa i\n\nlet set_power ls =\n  let rec set_power' ls pls =\n    match ls with\n    | [] -> pls\n    | hd::tl -> set_power' tl (L.flatmap (fun p -> [p; hd::p]) pls)\n  in set_power' ls [[]]\n\n\nlet rdhf () = rdhs () |> L.map atof\nlet rdf4 () = match rdhf () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0., 0., 0., 0.)\n\n\nmodule Graph = struct\n\n  type 'a t = { nb : (int, int St.t) Mp.t; vdt : (int, 'a) Mp.t }\n\n  let nothing = { nb = Mp.empty; vdt = Mp.empty }\n\n  let add_edge (e : int * int) g =\n    let (v1, v2) = e in\n    let nbvs = g.nb |> Mp.apply_or St.empty v1 in\n    let nb1 = g.nb |> Mp.add v1 (nbvs |> St.add v2) in\n    { g with nb = nb1 }\n\n  let add_uedge e g =\n    add_edge e (add_edge (swap e) g)\n\n  let from_edges es =\n    es |> L.foldl (fun g e -> add_edge e g) nothing\n\n  let from_uedges es =\n    es |> L.foldl (fun g e -> add_uedge e g) nothing\n\n\nend\n\nmodule G = Graph\n\n\nlet _ =\n  let t = rds () in\n  let result = S.replace_chars (fun c ->\n    match c with\n    | '?' -> \"D\"\n    | x -> S.of_char x\n  ) t in\n  puts result\n;;\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFor a string S consisting of the uppercase English letters P and D, let the doctoral and postdoctoral quotient of S be the total number of occurrences of D and PD in S as contiguous substrings. For example, if S = PPDDP, it contains two occurrences of D and one occurrence of PD as contiguous substrings, so the doctoral and postdoctoral quotient of S is 3.\n\nWe have a string T consisting of P, D, and ?.\n\nAmong the strings that can be obtained by replacing each ? in T with P or D, find one with the maximum possible doctoral and postdoctoral quotient.\n\nConstraints\n\n1 \\leq |T| \\leq 2 \\times 10^5\n\nT consists of P, D, and ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\n\nOutput\n\nPrint one string with the maximum possible doctoral and postdoctoral quotient among the strings that can be obtained by replacing each ? in T with P or D.\nIf there are multiple such strings, you may print any of them.\n\nSample Input 1\n\nPD?D??P\n\nSample Output 1\n\nPDPDPDP\n\nThis string contains three occurrences of D and three occurrences of PD as contiguous substrings, so its doctoral and postdoctoral quotient is 6, which is the maximum doctoral and postdoctoral quotient of a string obtained by replacing each ? in T with P or D.\n\nSample Input 2\n\nP?P?\n\nSample Output 2\n\nPDPD", "sample_input": "PD?D??P\n"}, "reference_outputs": ["PDPDPDP\n"], "source_document_id": "p02664", "source_text": "Score : 200 points\n\nProblem Statement\n\nFor a string S consisting of the uppercase English letters P and D, let the doctoral and postdoctoral quotient of S be the total number of occurrences of D and PD in S as contiguous substrings. For example, if S = PPDDP, it contains two occurrences of D and one occurrence of PD as contiguous substrings, so the doctoral and postdoctoral quotient of S is 3.\n\nWe have a string T consisting of P, D, and ?.\n\nAmong the strings that can be obtained by replacing each ? in T with P or D, find one with the maximum possible doctoral and postdoctoral quotient.\n\nConstraints\n\n1 \\leq |T| \\leq 2 \\times 10^5\n\nT consists of P, D, and ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\n\nOutput\n\nPrint one string with the maximum possible doctoral and postdoctoral quotient among the strings that can be obtained by replacing each ? in T with P or D.\nIf there are multiple such strings, you may print any of them.\n\nSample Input 1\n\nPD?D??P\n\nSample Output 1\n\nPDPDPDP\n\nThis string contains three occurrences of D and three occurrences of PD as contiguous substrings, so its doctoral and postdoctoral quotient is 6, which is the maximum doctoral and postdoctoral quotient of a string obtained by replacing each ? in T with P or D.\n\nSample Input 2\n\nP?P?\n\nSample Output 2\n\nPDPD", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2936, "cpu_time_ms": 27, "memory_kb": 14272}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s268571909", "group_id": "codeNet:p02664", "input_text": "open Batteries\nopen Printf\n\nlet ($) g f x = g (f x)\n\nmodule MyList = struct\n  include List\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr = fold_right\n  let foldri = fold_righti\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\nend\n\nmodule L = MyList\n\nlet swap = Tuple2.swap\n\nlet atoi = int_of_string\nlet itoa = string_of_int\nlet atof = float_of_string\nlet ftoa = string_of_float\nlet ctoi = int_of_char\nlet itoc = char_of_int\n\nlet stocl = String.to_list\nlet cltos = String.of_list\nlet spsp s = String.split_on_char ' ' s\n\nmodule MyString = struct\n  include String\n\n  let soc = split_on_char\n\n  let map' f s = L.map f (stocl s)\n  let mapi' f s = L.map f (stocl s)\n\n  let zipf f a b = L.zipf f (stocl a) (stocl b)\n  let zipfi f a b = L.zipfi f (stocl a) (stocl b)\n\n  let mkstr f sep ls =\n    L.foldl (fun acc x -> acc ^ sep ^ (f x)) (f @@ L.hd ls) (List.tl ls)\nend\n\nmodule S = MyString\n\nmodule MySet = struct\n  include Set\n\n  let fold' f s z = fold f z s\nend\n\nmodule St = MySet\n\nmodule MyMap = struct\n  include Map\n\n  let apply = find\n  let apply_or = find_default\nend\n\nmodule Mp = MyMap\n\n\nlet rds () = read_line ()\n\nlet rdi () = atoi @@ rds ()\n\nlet rdhs () = spsp @@ rds ()\nlet rdhi () = rdhs () |> L.map atoi\n\nlet rdi2 () = match rdhi () with\n  | a::b::_ -> (a, b)\n  | _ -> (0, 0)\n\nlet rdi3 () = match rdhi () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0, 0, 0)\n\nlet rdi4 () = match rdhi () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0, 0, 0, 0)\n\nlet rdi5 () = match rdhi () with\n| a::b::c::d::e::_ -> (a, b, c, d, e)\n| _ -> (0, 0, 0, 0, 0)\n\nlet rdv n rdf =\n  let rec rdv' n =\n    if n <= 0 then []\n    else (\n      let s = rdf () in\n      s::(rdv' (n - 1))\n    )\n  in rdv' n\n\nlet rdvi n = rdv n rdi\nlet rdvi2 n = rdv n rdi2\nlet rdvi3 n = rdv n rdi3\nlet rdvi4 n = rdv n rdi4\n\nlet puts s = print_endline s\nlet putyn b = puts (if b then \"Yes\" else \"No\")\nlet puti i = puts @@ itoa i\n\nlet set_power ls =\n  let rec set_power' ls pls =\n    match ls with\n    | [] -> pls\n    | hd::tl -> set_power' tl (L.flatmap (fun p -> [p; hd::p]) pls)\n  in set_power' ls [[]]\n\n\nlet rdhf () = rdhs () |> L.map atof\nlet rdf4 () = match rdhf () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0., 0., 0., 0.)\n\n\nmodule Graph = struct\n\n  type 'a t = { nb : (int, int St.t) Mp.t; vdt : (int, 'a) Mp.t }\n\n  let nothing = { nb = Mp.empty; vdt = Mp.empty }\n\n  let add_edge (e : int * int) g =\n    let (v1, v2) = e in\n    let nbvs = g.nb |> Mp.apply_or St.empty v1 in\n    let nb1 = g.nb |> Mp.add v1 (nbvs |> St.add v2) in\n    { g with nb = nb1 }\n\n  let add_uedge e g =\n    add_edge e (add_edge (swap e) g)\n\n  let from_edges es =\n    es |> L.foldl (fun g e -> add_edge e g) nothing\n\n  let from_uedges es =\n    es |> L.foldl (fun g e -> add_uedge e g) nothing\n\n\nend\n\nmodule G = Graph\n\n\nlet _ =\n  let t = rds () in\n  let spt = stocl t in\n  let rec pdpd sl = function\n    | [] -> sl\n    | h::m::t when m = '?' -> \n      if h = 'P' then pdpd ('P'::'D'::sl) t else pdpd ('D'::'D'::sl) t\n    | h::t when h = '?' -> pdpd ('D'::sl) t \n    | h::t -> pdpd (h::sl) t\n  in\n  let sl = L.rev @@ pdpd [] spt in\n  let result = cltos sl in\n  puts result\n;;\n", "language": "OCaml", "metadata": {"date": 1590890231, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s268571909.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s268571909", "user_id": "u970139668"}, "prompt_components": {"gold_output": "PDPDPDP\n", "input_to_evaluate": "open Batteries\nopen Printf\n\nlet ($) g f x = g (f x)\n\nmodule MyList = struct\n  include List\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr = fold_right\n  let foldri = fold_righti\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\nend\n\nmodule L = MyList\n\nlet swap = Tuple2.swap\n\nlet atoi = int_of_string\nlet itoa = string_of_int\nlet atof = float_of_string\nlet ftoa = string_of_float\nlet ctoi = int_of_char\nlet itoc = char_of_int\n\nlet stocl = String.to_list\nlet cltos = String.of_list\nlet spsp s = String.split_on_char ' ' s\n\nmodule MyString = struct\n  include String\n\n  let soc = split_on_char\n\n  let map' f s = L.map f (stocl s)\n  let mapi' f s = L.map f (stocl s)\n\n  let zipf f a b = L.zipf f (stocl a) (stocl b)\n  let zipfi f a b = L.zipfi f (stocl a) (stocl b)\n\n  let mkstr f sep ls =\n    L.foldl (fun acc x -> acc ^ sep ^ (f x)) (f @@ L.hd ls) (List.tl ls)\nend\n\nmodule S = MyString\n\nmodule MySet = struct\n  include Set\n\n  let fold' f s z = fold f z s\nend\n\nmodule St = MySet\n\nmodule MyMap = struct\n  include Map\n\n  let apply = find\n  let apply_or = find_default\nend\n\nmodule Mp = MyMap\n\n\nlet rds () = read_line ()\n\nlet rdi () = atoi @@ rds ()\n\nlet rdhs () = spsp @@ rds ()\nlet rdhi () = rdhs () |> L.map atoi\n\nlet rdi2 () = match rdhi () with\n  | a::b::_ -> (a, b)\n  | _ -> (0, 0)\n\nlet rdi3 () = match rdhi () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0, 0, 0)\n\nlet rdi4 () = match rdhi () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0, 0, 0, 0)\n\nlet rdi5 () = match rdhi () with\n| a::b::c::d::e::_ -> (a, b, c, d, e)\n| _ -> (0, 0, 0, 0, 0)\n\nlet rdv n rdf =\n  let rec rdv' n =\n    if n <= 0 then []\n    else (\n      let s = rdf () in\n      s::(rdv' (n - 1))\n    )\n  in rdv' n\n\nlet rdvi n = rdv n rdi\nlet rdvi2 n = rdv n rdi2\nlet rdvi3 n = rdv n rdi3\nlet rdvi4 n = rdv n rdi4\n\nlet puts s = print_endline s\nlet putyn b = puts (if b then \"Yes\" else \"No\")\nlet puti i = puts @@ itoa i\n\nlet set_power ls =\n  let rec set_power' ls pls =\n    match ls with\n    | [] -> pls\n    | hd::tl -> set_power' tl (L.flatmap (fun p -> [p; hd::p]) pls)\n  in set_power' ls [[]]\n\n\nlet rdhf () = rdhs () |> L.map atof\nlet rdf4 () = match rdhf () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0., 0., 0., 0.)\n\n\nmodule Graph = struct\n\n  type 'a t = { nb : (int, int St.t) Mp.t; vdt : (int, 'a) Mp.t }\n\n  let nothing = { nb = Mp.empty; vdt = Mp.empty }\n\n  let add_edge (e : int * int) g =\n    let (v1, v2) = e in\n    let nbvs = g.nb |> Mp.apply_or St.empty v1 in\n    let nb1 = g.nb |> Mp.add v1 (nbvs |> St.add v2) in\n    { g with nb = nb1 }\n\n  let add_uedge e g =\n    add_edge e (add_edge (swap e) g)\n\n  let from_edges es =\n    es |> L.foldl (fun g e -> add_edge e g) nothing\n\n  let from_uedges es =\n    es |> L.foldl (fun g e -> add_uedge e g) nothing\n\n\nend\n\nmodule G = Graph\n\n\nlet _ =\n  let t = rds () in\n  let spt = stocl t in\n  let rec pdpd sl = function\n    | [] -> sl\n    | h::m::t when m = '?' -> \n      if h = 'P' then pdpd ('P'::'D'::sl) t else pdpd ('D'::'D'::sl) t\n    | h::t when h = '?' -> pdpd ('D'::sl) t \n    | h::t -> pdpd (h::sl) t\n  in\n  let sl = L.rev @@ pdpd [] spt in\n  let result = cltos sl in\n  puts result\n;;\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFor a string S consisting of the uppercase English letters P and D, let the doctoral and postdoctoral quotient of S be the total number of occurrences of D and PD in S as contiguous substrings. For example, if S = PPDDP, it contains two occurrences of D and one occurrence of PD as contiguous substrings, so the doctoral and postdoctoral quotient of S is 3.\n\nWe have a string T consisting of P, D, and ?.\n\nAmong the strings that can be obtained by replacing each ? in T with P or D, find one with the maximum possible doctoral and postdoctoral quotient.\n\nConstraints\n\n1 \\leq |T| \\leq 2 \\times 10^5\n\nT consists of P, D, and ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\n\nOutput\n\nPrint one string with the maximum possible doctoral and postdoctoral quotient among the strings that can be obtained by replacing each ? in T with P or D.\nIf there are multiple such strings, you may print any of them.\n\nSample Input 1\n\nPD?D??P\n\nSample Output 1\n\nPDPDPDP\n\nThis string contains three occurrences of D and three occurrences of PD as contiguous substrings, so its doctoral and postdoctoral quotient is 6, which is the maximum doctoral and postdoctoral quotient of a string obtained by replacing each ? in T with P or D.\n\nSample Input 2\n\nP?P?\n\nSample Output 2\n\nPDPD", "sample_input": "PD?D??P\n"}, "reference_outputs": ["PDPDPDP\n"], "source_document_id": "p02664", "source_text": "Score : 200 points\n\nProblem Statement\n\nFor a string S consisting of the uppercase English letters P and D, let the doctoral and postdoctoral quotient of S be the total number of occurrences of D and PD in S as contiguous substrings. For example, if S = PPDDP, it contains two occurrences of D and one occurrence of PD as contiguous substrings, so the doctoral and postdoctoral quotient of S is 3.\n\nWe have a string T consisting of P, D, and ?.\n\nAmong the strings that can be obtained by replacing each ? in T with P or D, find one with the maximum possible doctoral and postdoctoral quotient.\n\nConstraints\n\n1 \\leq |T| \\leq 2 \\times 10^5\n\nT consists of P, D, and ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\n\nOutput\n\nPrint one string with the maximum possible doctoral and postdoctoral quotient among the strings that can be obtained by replacing each ? in T with P or D.\nIf there are multiple such strings, you may print any of them.\n\nSample Input 1\n\nPD?D??P\n\nSample Output 1\n\nPDPDPDP\n\nThis string contains three occurrences of D and three occurrences of PD as contiguous substrings, so its doctoral and postdoctoral quotient is 6, which is the maximum doctoral and postdoctoral quotient of a string obtained by replacing each ? in T with P or D.\n\nSample Input 2\n\nP?P?\n\nSample Output 2\n\nPDPD", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3139, "cpu_time_ms": 32, "memory_kb": 19752}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s409939481", "group_id": "codeNet:p02664", "input_text": "open Batteries\nlet t = Scanf.sscanf (read_line()) \"%s\" (fun t -> t)\n(* 文字列をcharのlistにする *)\nlet explode s = List.init (String.length s) (String.get s)\nlet rec loop result lst =\n  match lst with\n  | [] -> result |> List.rev\n  | first :: [] -> if first = '?' then loop ('D' :: result) [] else loop (first :: result) []\n  | first :: rest ->\n    if first = '?' then loop ('D' :: result) (rest) else\n    loop (first :: result) (rest)\nlet r = loop [] @@ explode t |> Array.of_list\n(* charのlistをstringに *)\nlet _ = print_endline @@ String.init (Array.length r) @@ fun a -> r.(a)\n", "language": "OCaml", "metadata": {"date": 1590888612, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s409939481.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s409939481", "user_id": "u511870776"}, "prompt_components": {"gold_output": "PDPDPDP\n", "input_to_evaluate": "open Batteries\nlet t = Scanf.sscanf (read_line()) \"%s\" (fun t -> t)\n(* 文字列をcharのlistにする *)\nlet explode s = List.init (String.length s) (String.get s)\nlet rec loop result lst =\n  match lst with\n  | [] -> result |> List.rev\n  | first :: [] -> if first = '?' then loop ('D' :: result) [] else loop (first :: result) []\n  | first :: rest ->\n    if first = '?' then loop ('D' :: result) (rest) else\n    loop (first :: result) (rest)\nlet r = loop [] @@ explode t |> Array.of_list\n(* charのlistをstringに *)\nlet _ = print_endline @@ String.init (Array.length r) @@ fun a -> r.(a)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFor a string S consisting of the uppercase English letters P and D, let the doctoral and postdoctoral quotient of S be the total number of occurrences of D and PD in S as contiguous substrings. For example, if S = PPDDP, it contains two occurrences of D and one occurrence of PD as contiguous substrings, so the doctoral and postdoctoral quotient of S is 3.\n\nWe have a string T consisting of P, D, and ?.\n\nAmong the strings that can be obtained by replacing each ? in T with P or D, find one with the maximum possible doctoral and postdoctoral quotient.\n\nConstraints\n\n1 \\leq |T| \\leq 2 \\times 10^5\n\nT consists of P, D, and ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\n\nOutput\n\nPrint one string with the maximum possible doctoral and postdoctoral quotient among the strings that can be obtained by replacing each ? in T with P or D.\nIf there are multiple such strings, you may print any of them.\n\nSample Input 1\n\nPD?D??P\n\nSample Output 1\n\nPDPDPDP\n\nThis string contains three occurrences of D and three occurrences of PD as contiguous substrings, so its doctoral and postdoctoral quotient is 6, which is the maximum doctoral and postdoctoral quotient of a string obtained by replacing each ? in T with P or D.\n\nSample Input 2\n\nP?P?\n\nSample Output 2\n\nPDPD", "sample_input": "PD?D??P\n"}, "reference_outputs": ["PDPDPDP\n"], "source_document_id": "p02664", "source_text": "Score : 200 points\n\nProblem Statement\n\nFor a string S consisting of the uppercase English letters P and D, let the doctoral and postdoctoral quotient of S be the total number of occurrences of D and PD in S as contiguous substrings. For example, if S = PPDDP, it contains two occurrences of D and one occurrence of PD as contiguous substrings, so the doctoral and postdoctoral quotient of S is 3.\n\nWe have a string T consisting of P, D, and ?.\n\nAmong the strings that can be obtained by replacing each ? in T with P or D, find one with the maximum possible doctoral and postdoctoral quotient.\n\nConstraints\n\n1 \\leq |T| \\leq 2 \\times 10^5\n\nT consists of P, D, and ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\n\nOutput\n\nPrint one string with the maximum possible doctoral and postdoctoral quotient among the strings that can be obtained by replacing each ? in T with P or D.\nIf there are multiple such strings, you may print any of them.\n\nSample Input 1\n\nPD?D??P\n\nSample Output 1\n\nPDPDPDP\n\nThis string contains three occurrences of D and three occurrences of PD as contiguous substrings, so its doctoral and postdoctoral quotient is 6, which is the maximum doctoral and postdoctoral quotient of a string obtained by replacing each ? in T with P or D.\n\nSample Input 2\n\nP?P?\n\nSample Output 2\n\nPDPD", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 592, "cpu_time_ms": 39, "memory_kb": 22600}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s776207721", "group_id": "codeNet:p02664", "input_text": "let () =\n  let s = Bytes.of_string @@ read_line () in\n  if Bytes.get s (Bytes.length s - 1) = '?' then\n    s.[Bytes.length s - 1] <- 'D';\n  for i = Bytes.length s - 2 downto 0 do\n    if Bytes.get s i = '?' then\n      s.[i] <- if Bytes.get s (i + 1) = 'D' then 'P' else 'D'\n  done;\n  print_endline @@ Bytes.to_string s\n\n", "language": "OCaml", "metadata": {"date": 1590887463, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s776207721.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s776207721", "user_id": "u504158101"}, "prompt_components": {"gold_output": "PDPDPDP\n", "input_to_evaluate": "let () =\n  let s = Bytes.of_string @@ read_line () in\n  if Bytes.get s (Bytes.length s - 1) = '?' then\n    s.[Bytes.length s - 1] <- 'D';\n  for i = Bytes.length s - 2 downto 0 do\n    if Bytes.get s i = '?' then\n      s.[i] <- if Bytes.get s (i + 1) = 'D' then 'P' else 'D'\n  done;\n  print_endline @@ Bytes.to_string s\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFor a string S consisting of the uppercase English letters P and D, let the doctoral and postdoctoral quotient of S be the total number of occurrences of D and PD in S as contiguous substrings. For example, if S = PPDDP, it contains two occurrences of D and one occurrence of PD as contiguous substrings, so the doctoral and postdoctoral quotient of S is 3.\n\nWe have a string T consisting of P, D, and ?.\n\nAmong the strings that can be obtained by replacing each ? in T with P or D, find one with the maximum possible doctoral and postdoctoral quotient.\n\nConstraints\n\n1 \\leq |T| \\leq 2 \\times 10^5\n\nT consists of P, D, and ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\n\nOutput\n\nPrint one string with the maximum possible doctoral and postdoctoral quotient among the strings that can be obtained by replacing each ? in T with P or D.\nIf there are multiple such strings, you may print any of them.\n\nSample Input 1\n\nPD?D??P\n\nSample Output 1\n\nPDPDPDP\n\nThis string contains three occurrences of D and three occurrences of PD as contiguous substrings, so its doctoral and postdoctoral quotient is 6, which is the maximum doctoral and postdoctoral quotient of a string obtained by replacing each ? in T with P or D.\n\nSample Input 2\n\nP?P?\n\nSample Output 2\n\nPDPD", "sample_input": "PD?D??P\n"}, "reference_outputs": ["PDPDPDP\n"], "source_document_id": "p02664", "source_text": "Score : 200 points\n\nProblem Statement\n\nFor a string S consisting of the uppercase English letters P and D, let the doctoral and postdoctoral quotient of S be the total number of occurrences of D and PD in S as contiguous substrings. For example, if S = PPDDP, it contains two occurrences of D and one occurrence of PD as contiguous substrings, so the doctoral and postdoctoral quotient of S is 3.\n\nWe have a string T consisting of P, D, and ?.\n\nAmong the strings that can be obtained by replacing each ? in T with P or D, find one with the maximum possible doctoral and postdoctoral quotient.\n\nConstraints\n\n1 \\leq |T| \\leq 2 \\times 10^5\n\nT consists of P, D, and ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\n\nOutput\n\nPrint one string with the maximum possible doctoral and postdoctoral quotient among the strings that can be obtained by replacing each ? in T with P or D.\nIf there are multiple such strings, you may print any of them.\n\nSample Input 1\n\nPD?D??P\n\nSample Output 1\n\nPDPDPDP\n\nThis string contains three occurrences of D and three occurrences of PD as contiguous substrings, so its doctoral and postdoctoral quotient is 6, which is the maximum doctoral and postdoctoral quotient of a string obtained by replacing each ? in T with P or D.\n\nSample Input 2\n\nP?P?\n\nSample Output 2\n\nPDPD", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 319, "cpu_time_ms": 10, "memory_kb": 4516}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s635129348", "group_id": "codeNet:p02665", "input_text": "let split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\nlet n = Scanf.sscanf (read_line ()) \"%d\" @@ fun n -> n\nlet a = read_line () |> split_string ~pattern:\" \" |> List.map int_of_string\n\nlet rec range res acc = match res, acc with\n  | [], _ -> failwith \"program error\"\n  | res, [] -> res\n  | (l, r) :: _, x :: xs -> range (((l + 1) / 2 + x, r + x) :: res) xs\nlet range = function\n  | [] -> failwith \"program error\"\n  | x :: xs -> range [(x, x)] xs\n\nlet rec build sum prev rs ns = match rs, ns with\n  | _, [] -> sum\n  | (l, r) :: rs, n :: ns -> let t = min (prev * 2) r in build (sum + t) (t - n) rs ns\n  | _ -> failwith \"program error\"\n\nlet () =\n  let acc = range (List.rev a) in\n  match acc, a with\n    | x :: xs, n :: ns -> Printf.printf \"%d\\n\" @@ if fst x = 1 then build 1 1 xs ns else -1\n    | _ -> failwith \"program error\"", "language": "OCaml", "metadata": {"date": 1593561744, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s635129348.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s635129348", "user_id": "u811309788"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "let split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\nlet n = Scanf.sscanf (read_line ()) \"%d\" @@ fun n -> n\nlet a = read_line () |> split_string ~pattern:\" \" |> List.map int_of_string\n\nlet rec range res acc = match res, acc with\n  | [], _ -> failwith \"program error\"\n  | res, [] -> res\n  | (l, r) :: _, x :: xs -> range (((l + 1) / 2 + x, r + x) :: res) xs\nlet range = function\n  | [] -> failwith \"program error\"\n  | x :: xs -> range [(x, x)] xs\n\nlet rec build sum prev rs ns = match rs, ns with\n  | _, [] -> sum\n  | (l, r) :: rs, n :: ns -> let t = min (prev * 2) r in build (sum + t) (t - n) rs ns\n  | _ -> failwith \"program error\"\n\nlet () =\n  let acc = range (List.rev a) in\n  match acc, a with\n    | x :: xs, n :: ns -> Printf.printf \"%d\\n\" @@ if fst x = 1 then build 1 1 xs ns else -1\n    | _ -> failwith \"program error\"", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 837, "cpu_time_ms": 59, "memory_kb": 22224}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s649261984", "group_id": "codeNet:p02669", "input_text": "open Num;;\n\nScanf.scanf \"%d\" (fun t ->\n    let module M = Map.Make (struct type t = int let compare = compare end) in\n    for i = 1 to t do\n        Scanf.scanf \" %d %d %d %d %d\" (fun n a b c d ->\n            let rec calc =\n                let map = ref (M.add 0 (Int 0) (M.singleton 1 (Int d))) in\n                fun k ->\n                if M.mem k !map then M.find k !map else (\n                    let ans = Int k */ Int d in\n                    let ans = List.fold_left (fun acc i ->\n                        if (k + i) mod 2 <> 0 then acc else\n                            min_num acc (calc ((k + i) / 2) +/ Int a +/ Int d */ Int (abs i))\n                            ) ans [ -1; 0 ]\n                    in\n                    let ans = List.fold_left (fun acc i ->\n                        if (k + i) mod 3 <> 0 then acc else\n                            min_num acc (calc ((k + i) / 3) +/ Int b +/ Int d */ Int (abs i))\n                            ) ans [ -1; 0; 1 ]\n                    in\n                    let ans = List.fold_left (fun acc i ->\n                        if (k + i) mod 5 <> 0 then acc else\n                            min_num acc (calc ((k + i) / 5) +/ Int c +/ Int d */ Int ( abs i))\n                            ) ans [ -2; -1; 0; 1; 2 ]\n                    in\n                    map := M.add k ans !map;\n                    ans\n                  )\n            in\n            Printf.printf \"%s\\n\" @@ string_of_num (calc n)\n        )\n    done\n)", "language": "OCaml", "metadata": {"date": 1594089439, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02669.html", "problem_id": "p02669", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02669/input.txt", "sample_output_relpath": "derived/input_output/data/p02669/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02669/OCaml/s649261984.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s649261984", "user_id": "u342443598"}, "prompt_components": {"gold_output": "20\n19\n26\n3821859835\n23441258666\n", "input_to_evaluate": "open Num;;\n\nScanf.scanf \"%d\" (fun t ->\n    let module M = Map.Make (struct type t = int let compare = compare end) in\n    for i = 1 to t do\n        Scanf.scanf \" %d %d %d %d %d\" (fun n a b c d ->\n            let rec calc =\n                let map = ref (M.add 0 (Int 0) (M.singleton 1 (Int d))) in\n                fun k ->\n                if M.mem k !map then M.find k !map else (\n                    let ans = Int k */ Int d in\n                    let ans = List.fold_left (fun acc i ->\n                        if (k + i) mod 2 <> 0 then acc else\n                            min_num acc (calc ((k + i) / 2) +/ Int a +/ Int d */ Int (abs i))\n                            ) ans [ -1; 0 ]\n                    in\n                    let ans = List.fold_left (fun acc i ->\n                        if (k + i) mod 3 <> 0 then acc else\n                            min_num acc (calc ((k + i) / 3) +/ Int b +/ Int d */ Int (abs i))\n                            ) ans [ -1; 0; 1 ]\n                    in\n                    let ans = List.fold_left (fun acc i ->\n                        if (k + i) mod 5 <> 0 then acc else\n                            min_num acc (calc ((k + i) / 5) +/ Int c +/ Int d */ Int ( abs i))\n                            ) ans [ -2; -1; 0; 1; 2 ]\n                    in\n                    map := M.add k ans !map;\n                    ans\n                  )\n            in\n            Printf.printf \"%s\\n\" @@ string_of_num (calc n)\n        )\n    done\n)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou start with the number 0 and you want to reach the number N.\n\nYou can change the number, paying a certain amount of coins, with the following operations:\n\nMultiply the number by 2, paying A coins.\n\nMultiply the number by 3, paying B coins.\n\nMultiply the number by 5, paying C coins.\n\nIncrease or decrease the number by 1, paying D coins.\n\nYou can perform these operations in arbitrary order and an arbitrary number of times.\n\nWhat is the minimum number of coins you need to reach N?\n\nYou have to solve T testcases.\n\nConstraints\n\n1 \\le T \\le 10\n\n1 \\le N \\le 10^{18}\n\n1 \\le A, B, C, D \\le 10^9\n\nAll numbers N, A, B, C, D are integers.\n\nInput\n\nThe input is given from Standard Input. The first line of the input is\n\nT\n\nThen, T lines follow describing the T testcases.\nEach of the T lines has the format\n\nN A B C D\n\nOutput\n\nFor each testcase, print the answer on Standard Output followed by a newline.\n\nSample Input 1\n\n5\n11 1 2 4 8\n11 1 2 2 8\n32 10 8 5 4\n29384293847243 454353412 332423423 934923490 1\n900000000000000000 332423423 454353412 934923490 987654321\n\nSample Output 1\n\n20\n19\n26\n3821859835\n23441258666\n\nFor the first testcase, a sequence of moves that achieves the minimum cost of 20 is:\n\nInitially x = 0.\n\nPay 8 to increase by 1 (x = 1).\n\nPay 1 to multiply by 2 (x = 2).\n\nPay 1 to multiply by 2 (x = 4).\n\nPay 2 to multiply by 3 (x = 12).\n\nPay 8 to decrease by 1 (x = 11).\n\nFor the second testcase, a sequence of moves that achieves the minimum cost of 19 is:\n\nInitially x = 0.\n\nPay 8 to increase by 1 (x = 1).\n\nPay 1 to multiply by 2 (x = 2).\n\nPay 2 to multiply by 5 (x = 10).\n\nPay 8 to increase by 1 (x = 11).", "sample_input": "5\n11 1 2 4 8\n11 1 2 2 8\n32 10 8 5 4\n29384293847243 454353412 332423423 934923490 1\n900000000000000000 332423423 454353412 934923490 987654321\n"}, "reference_outputs": ["20\n19\n26\n3821859835\n23441258666\n"], "source_document_id": "p02669", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou start with the number 0 and you want to reach the number N.\n\nYou can change the number, paying a certain amount of coins, with the following operations:\n\nMultiply the number by 2, paying A coins.\n\nMultiply the number by 3, paying B coins.\n\nMultiply the number by 5, paying C coins.\n\nIncrease or decrease the number by 1, paying D coins.\n\nYou can perform these operations in arbitrary order and an arbitrary number of times.\n\nWhat is the minimum number of coins you need to reach N?\n\nYou have to solve T testcases.\n\nConstraints\n\n1 \\le T \\le 10\n\n1 \\le N \\le 10^{18}\n\n1 \\le A, B, C, D \\le 10^9\n\nAll numbers N, A, B, C, D are integers.\n\nInput\n\nThe input is given from Standard Input. The first line of the input is\n\nT\n\nThen, T lines follow describing the T testcases.\nEach of the T lines has the format\n\nN A B C D\n\nOutput\n\nFor each testcase, print the answer on Standard Output followed by a newline.\n\nSample Input 1\n\n5\n11 1 2 4 8\n11 1 2 2 8\n32 10 8 5 4\n29384293847243 454353412 332423423 934923490 1\n900000000000000000 332423423 454353412 934923490 987654321\n\nSample Output 1\n\n20\n19\n26\n3821859835\n23441258666\n\nFor the first testcase, a sequence of moves that achieves the minimum cost of 20 is:\n\nInitially x = 0.\n\nPay 8 to increase by 1 (x = 1).\n\nPay 1 to multiply by 2 (x = 2).\n\nPay 1 to multiply by 2 (x = 4).\n\nPay 2 to multiply by 3 (x = 12).\n\nPay 8 to decrease by 1 (x = 11).\n\nFor the second testcase, a sequence of moves that achieves the minimum cost of 19 is:\n\nInitially x = 0.\n\nPay 8 to increase by 1 (x = 1).\n\nPay 1 to multiply by 2 (x = 2).\n\nPay 2 to multiply by 5 (x = 10).\n\nPay 8 to increase by 1 (x = 11).", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1466, "cpu_time_ms": 163, "memory_kb": 7776}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s271273207", "group_id": "codeNet:p02675", "input_text": "open Batteries\nopen Printf\n\nlet ($) g f x = g (f x)\n\nmodule MyList = struct\n  include List\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr = fold_right\n  let foldri = fold_righti\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\nend\n\nmodule L = MyList\n\nlet atoi = int_of_string\nlet itoa = string_of_int\nlet atof = float_of_string\nlet ftoa = string_of_float\nlet ctoi = int_of_char\nlet itoc = char_of_int\n\nlet stocl = String.to_list\nlet cltos = String.of_list\nlet spsp s = String.split_on_char ' ' s\n\nmodule MyString = struct\n  include String\n\n  let map' f s = L.map f (stocl s)\n  let mapi' f s = L.map f (stocl s)\n\n  let zipf f a b = L.zipf f (stocl a) (stocl b)\n  let zipfi f a b = L.zipfi f (stocl a) (stocl b)\n\n  let mkstr f sep ls =\n    L.foldl (fun acc x -> acc ^ sep ^ (f x)) (f @@ L.hd ls) (List.tl ls)\nend\n\nmodule S = MyString\n\nlet rds () = read_line ()\n\nlet rdi () = atoi @@ rds ()\n\nlet rdhs () = spsp @@ rds ()\nlet rdhi () = rdhs () |> L.map atoi\n\nlet rdi2 () = match rdhi () with\n  | a::b::_ -> (a, b)\n  | _ -> (0, 0)\n\nlet rdi3 () = match rdhi () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0, 0, 0)\n\nlet rdi4 () = match rdhi () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0, 0, 0, 0)\n\nlet rdv n rdf =\n  let rec rdv' n =\n    if n <= 0 then []\n    else (\n      let s = rdf () in\n      s::(rdv' (n - 1))\n    )\n  in rdv' n\n\nlet rdvi n = rdv n rdi\nlet rdvi2 n = rdv n rdi2\nlet rdvi3 n = rdv n rdi3\nlet rdvi4 n = rdv n rdi4\n\nlet puts s = print_endline s\nlet putyn b = puts (if b then \"Yes\" else \"No\")\nlet puti i = puts @@ itoa i\n\nlet set_power ls =\n  let rec set_power' ls pls =\n    match ls with\n    | [] -> pls\n    | hd::tl -> set_power' tl (L.flatmap (fun p -> [p; hd::p]) pls)\n  in set_power' ls [[]]\n\nlet _ =\n  let n = rdi () in\n  let hpb = match n mod 10 with\n  | 3 -> \"bon\"\n  | 0 | 1 | 6 | 8 -> \"pon\"\n  | _ -> \"hon\"\n  in puts hpb;;\n\n", "language": "OCaml", "metadata": {"date": 1589763833, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s271273207.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s271273207", "user_id": "u970139668"}, "prompt_components": {"gold_output": "pon\n", "input_to_evaluate": "open Batteries\nopen Printf\n\nlet ($) g f x = g (f x)\n\nmodule MyList = struct\n  include List\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr = fold_right\n  let foldri = fold_righti\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\nend\n\nmodule L = MyList\n\nlet atoi = int_of_string\nlet itoa = string_of_int\nlet atof = float_of_string\nlet ftoa = string_of_float\nlet ctoi = int_of_char\nlet itoc = char_of_int\n\nlet stocl = String.to_list\nlet cltos = String.of_list\nlet spsp s = String.split_on_char ' ' s\n\nmodule MyString = struct\n  include String\n\n  let map' f s = L.map f (stocl s)\n  let mapi' f s = L.map f (stocl s)\n\n  let zipf f a b = L.zipf f (stocl a) (stocl b)\n  let zipfi f a b = L.zipfi f (stocl a) (stocl b)\n\n  let mkstr f sep ls =\n    L.foldl (fun acc x -> acc ^ sep ^ (f x)) (f @@ L.hd ls) (List.tl ls)\nend\n\nmodule S = MyString\n\nlet rds () = read_line ()\n\nlet rdi () = atoi @@ rds ()\n\nlet rdhs () = spsp @@ rds ()\nlet rdhi () = rdhs () |> L.map atoi\n\nlet rdi2 () = match rdhi () with\n  | a::b::_ -> (a, b)\n  | _ -> (0, 0)\n\nlet rdi3 () = match rdhi () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0, 0, 0)\n\nlet rdi4 () = match rdhi () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0, 0, 0, 0)\n\nlet rdv n rdf =\n  let rec rdv' n =\n    if n <= 0 then []\n    else (\n      let s = rdf () in\n      s::(rdv' (n - 1))\n    )\n  in rdv' n\n\nlet rdvi n = rdv n rdi\nlet rdvi2 n = rdv n rdi2\nlet rdvi3 n = rdv n rdi3\nlet rdvi4 n = rdv n rdi4\n\nlet puts s = print_endline s\nlet putyn b = puts (if b then \"Yes\" else \"No\")\nlet puti i = puts @@ itoa i\n\nlet set_power ls =\n  let rec set_power' ls pls =\n    match ls with\n    | [] -> pls\n    | hd::tl -> set_power' tl (L.flatmap (fun p -> [p; hd::p]) pls)\n  in set_power' ls [[]]\n\nlet _ =\n  let n = rdi () in\n  let hpb = match n mod 10 with\n  | 3 -> \"bon\"\n  | 0 | 1 | 6 | 8 -> \"pon\"\n  | _ -> \"hon\"\n  in puts hpb;;\n\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nThe cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese.\n\nWhen counting pencils in Japanese, the counter word \"本\" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of \"本\" in the phrase \"N 本\" for a positive integer N not exceeding 999 is as follows:\n\nhon when the digit in the one's place of N is 2, 4, 5, 7, or 9;\n\npon when the digit in the one's place of N is 0, 1, 6 or 8;\n\nbon when the digit in the one's place of N is 3.\n\nGiven N, print the pronunciation of \"本\" in the phrase \"N 本\".\n\nConstraints\n\nN is a positive integer not exceeding 999.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n16\n\nSample Output 1\n\npon\n\nThe digit in the one's place of 16 is 6, so the \"本\" in \"16 本\" is pronounced pon.\n\nSample Input 2\n\n2\n\nSample Output 2\n\nhon\n\nSample Input 3\n\n183\n\nSample Output 3\n\nbon", "sample_input": "16\n"}, "reference_outputs": ["pon\n"], "source_document_id": "p02675", "source_text": "Score: 100 points\n\nProblem Statement\n\nThe cat Snuke wants to play a popular Japanese game called ÅtCoder, so Iroha has decided to teach him Japanese.\n\nWhen counting pencils in Japanese, the counter word \"本\" follows the number. The pronunciation of this word varies depending on the number. Specifically, the pronunciation of \"本\" in the phrase \"N 本\" for a positive integer N not exceeding 999 is as follows:\n\nhon when the digit in the one's place of N is 2, 4, 5, 7, or 9;\n\npon when the digit in the one's place of N is 0, 1, 6 or 8;\n\nbon when the digit in the one's place of N is 3.\n\nGiven N, print the pronunciation of \"本\" in the phrase \"N 本\".\n\nConstraints\n\nN is a positive integer not exceeding 999.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n16\n\nSample Output 1\n\npon\n\nThe digit in the one's place of 16 is 6, so the \"本\" in \"16 本\" is pronounced pon.\n\nSample Input 2\n\n2\n\nSample Output 2\n\nhon\n\nSample Input 3\n\n183\n\nSample Output 3\n\nbon", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1874, "cpu_time_ms": 7, "memory_kb": 5172}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s788247475", "group_id": "codeNet:p02676", "input_text": "open Scanf\nopen Printf\n\nlet triple_dots k s =\n  if String.length s <= k then s\n  else String.sub s 0 k ^ \"...\"\n\nlet k,s = sscanf (read_line ()) \"%d %s\" (fun k  s -> (k,s))\nlet () = printf \"%s\\n\" (triple_dots k s)", "language": "OCaml", "metadata": {"date": 1596638122, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s788247475.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s788247475", "user_id": "u272377260"}, "prompt_components": {"gold_output": "nikoand...\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet triple_dots k s =\n  if String.length s <= k then s\n  else String.sub s 0 k ^ \"...\"\n\nlet k,s = sscanf (read_line ()) \"%d %s\" (fun k  s -> (k,s))\nlet () = printf \"%s\\n\" (triple_dots k s)", "problem_context": "Score: 200 points\n\nProblem Statement\n\nWe have a string S consisting of lowercase English letters.\n\nIf the length of S is at most K, print S without change.\n\nIf the length of S exceeds K, extract the first K characters in S, append ... to the end of them, and print the result.\n\nConstraints\n\nK is an integer between 1 and 100 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nS\n\nOutput\n\nPrint a string as stated in Problem Statement.\n\nSample Input 1\n\n7\nnikoandsolstice\n\nSample Output 1\n\nnikoand...\n\nnikoandsolstice has a length of 15, which exceeds K=7.\n\nWe should extract the first 7 characters in this string, append ... to the end of them, and print the result nikoand....\n\nSample Input 2\n\n40\nferelibenterhominesidquodvoluntcredunt\n\nSample Output 2\n\nferelibenterhominesidquodvoluntcredunt\n\nThe famous quote from Gaius Julius Caesar.", "sample_input": "7\nnikoandsolstice\n"}, "reference_outputs": ["nikoand...\n"], "source_document_id": "p02676", "source_text": "Score: 200 points\n\nProblem Statement\n\nWe have a string S consisting of lowercase English letters.\n\nIf the length of S is at most K, print S without change.\n\nIf the length of S exceeds K, extract the first K characters in S, append ... to the end of them, and print the result.\n\nConstraints\n\nK is an integer between 1 and 100 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nS\n\nOutput\n\nPrint a string as stated in Problem Statement.\n\nSample Input 1\n\n7\nnikoandsolstice\n\nSample Output 1\n\nnikoand...\n\nnikoandsolstice has a length of 15, which exceeds K=7.\n\nWe should extract the first 7 characters in this string, append ... to the end of them, and print the result nikoand....\n\nSample Input 2\n\n40\nferelibenterhominesidquodvoluntcredunt\n\nSample Output 2\n\nferelibenterhominesidquodvoluntcredunt\n\nThe famous quote from Gaius Julius Caesar.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 212, "cpu_time_ms": 9, "memory_kb": 3720}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s214511596", "group_id": "codeNet:p02676", "input_text": "let k = read_int () in\nlet str = read_line () in\nif String.length str <= k then\n  print_endline str\nelse\n  print_endline ((Str.string_before str k) ^ \"...\")\n", "language": "OCaml", "metadata": {"date": 1592745031, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s214511596.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s214511596", "user_id": "u222846612"}, "prompt_components": {"gold_output": "nikoand...\n", "input_to_evaluate": "let k = read_int () in\nlet str = read_line () in\nif String.length str <= k then\n  print_endline str\nelse\n  print_endline ((Str.string_before str k) ^ \"...\")\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nWe have a string S consisting of lowercase English letters.\n\nIf the length of S is at most K, print S without change.\n\nIf the length of S exceeds K, extract the first K characters in S, append ... to the end of them, and print the result.\n\nConstraints\n\nK is an integer between 1 and 100 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nS\n\nOutput\n\nPrint a string as stated in Problem Statement.\n\nSample Input 1\n\n7\nnikoandsolstice\n\nSample Output 1\n\nnikoand...\n\nnikoandsolstice has a length of 15, which exceeds K=7.\n\nWe should extract the first 7 characters in this string, append ... to the end of them, and print the result nikoand....\n\nSample Input 2\n\n40\nferelibenterhominesidquodvoluntcredunt\n\nSample Output 2\n\nferelibenterhominesidquodvoluntcredunt\n\nThe famous quote from Gaius Julius Caesar.", "sample_input": "7\nnikoandsolstice\n"}, "reference_outputs": ["nikoand...\n"], "source_document_id": "p02676", "source_text": "Score: 200 points\n\nProblem Statement\n\nWe have a string S consisting of lowercase English letters.\n\nIf the length of S is at most K, print S without change.\n\nIf the length of S exceeds K, extract the first K characters in S, append ... to the end of them, and print the result.\n\nConstraints\n\nK is an integer between 1 and 100 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nS\n\nOutput\n\nPrint a string as stated in Problem Statement.\n\nSample Input 1\n\n7\nnikoandsolstice\n\nSample Output 1\n\nnikoand...\n\nnikoandsolstice has a length of 15, which exceeds K=7.\n\nWe should extract the first 7 characters in this string, append ... to the end of them, and print the result nikoand....\n\nSample Input 2\n\n40\nferelibenterhominesidquodvoluntcredunt\n\nSample Output 2\n\nferelibenterhominesidquodvoluntcredunt\n\nThe famous quote from Gaius Julius Caesar.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 157, "cpu_time_ms": 9, "memory_kb": 3556}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s959491340", "group_id": "codeNet:p02676", "input_text": "open Base\nopen Stdio\n\nlet () =\n  match In_channel.input_line In_channel.stdin with\n  | None -> failwith \"cannot read input\"\n  | Some k -> let k = Int.of_string k in\n    match In_channel.input_line In_channel.stdin with\n    | None -> failwith \"cannot read input\"\n    | Some x -> let length = String.length x in\n      if length <= k\n      then print_endline x\n      else print_endline ((String.sub x ~pos:0 ~len:k) ^ \"...\")\n\n", "language": "OCaml", "metadata": {"date": 1589839191, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s959491340.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s959491340", "user_id": "u368970787"}, "prompt_components": {"gold_output": "nikoand...\n", "input_to_evaluate": "open Base\nopen Stdio\n\nlet () =\n  match In_channel.input_line In_channel.stdin with\n  | None -> failwith \"cannot read input\"\n  | Some k -> let k = Int.of_string k in\n    match In_channel.input_line In_channel.stdin with\n    | None -> failwith \"cannot read input\"\n    | Some x -> let length = String.length x in\n      if length <= k\n      then print_endline x\n      else print_endline ((String.sub x ~pos:0 ~len:k) ^ \"...\")\n\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nWe have a string S consisting of lowercase English letters.\n\nIf the length of S is at most K, print S without change.\n\nIf the length of S exceeds K, extract the first K characters in S, append ... to the end of them, and print the result.\n\nConstraints\n\nK is an integer between 1 and 100 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nS\n\nOutput\n\nPrint a string as stated in Problem Statement.\n\nSample Input 1\n\n7\nnikoandsolstice\n\nSample Output 1\n\nnikoand...\n\nnikoandsolstice has a length of 15, which exceeds K=7.\n\nWe should extract the first 7 characters in this string, append ... to the end of them, and print the result nikoand....\n\nSample Input 2\n\n40\nferelibenterhominesidquodvoluntcredunt\n\nSample Output 2\n\nferelibenterhominesidquodvoluntcredunt\n\nThe famous quote from Gaius Julius Caesar.", "sample_input": "7\nnikoandsolstice\n"}, "reference_outputs": ["nikoand...\n"], "source_document_id": "p02676", "source_text": "Score: 200 points\n\nProblem Statement\n\nWe have a string S consisting of lowercase English letters.\n\nIf the length of S is at most K, print S without change.\n\nIf the length of S exceeds K, extract the first K characters in S, append ... to the end of them, and print the result.\n\nConstraints\n\nK is an integer between 1 and 100 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nS\n\nOutput\n\nPrint a string as stated in Problem Statement.\n\nSample Input 1\n\n7\nnikoandsolstice\n\nSample Output 1\n\nnikoand...\n\nnikoandsolstice has a length of 15, which exceeds K=7.\n\nWe should extract the first 7 characters in this string, append ... to the end of them, and print the result nikoand....\n\nSample Input 2\n\n40\nferelibenterhominesidquodvoluntcredunt\n\nSample Output 2\n\nferelibenterhominesidquodvoluntcredunt\n\nThe famous quote from Gaius Julius Caesar.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 423, "cpu_time_ms": 8, "memory_kb": 5728}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s999710377", "group_id": "codeNet:p02677", "input_text": "let read_floats () =\n  let str = read_line() in\n  List.map (fun x -> float_of_string x) (Str.split (Str.regexp \" +\") str)\n;;\n\nlet input = read_floats() in\nlet a = List.nth input 0 in\nlet b = List.nth input 1 in\nlet h = List.nth input 2 in\nlet m = List.nth input 3 in\nlet pi = acos (-1.) in\nlet x1 = a *. cos (h /. 12. *. 2. *. pi +. m /. 720. *. 2. *. pi) in\nlet y1 = a *. sin (h /. 12. *. 2. *. pi +. m /. 720. *. 2. *. pi) in\nlet x2 = b *. cos (m /. 60. *. 2. *. pi) in\nlet y2 = b *. sin (m /. 60. *. 2. *. pi) in\nlet sqx = (x1 -. x2) *. (x1 -. x2) in\nlet sqy = (y1 -. y2) *. (y1 -. y2) in\nprint_endline (string_of_float (sqrt (sqx +. sqy)))\n", "language": "OCaml", "metadata": {"date": 1592745570, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s999710377.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s999710377", "user_id": "u222846612"}, "prompt_components": {"gold_output": "5.00000000000000000000\n", "input_to_evaluate": "let read_floats () =\n  let str = read_line() in\n  List.map (fun x -> float_of_string x) (Str.split (Str.regexp \" +\") str)\n;;\n\nlet input = read_floats() in\nlet a = List.nth input 0 in\nlet b = List.nth input 1 in\nlet h = List.nth input 2 in\nlet m = List.nth input 3 in\nlet pi = acos (-1.) in\nlet x1 = a *. cos (h /. 12. *. 2. *. pi +. m /. 720. *. 2. *. pi) in\nlet y1 = a *. sin (h /. 12. *. 2. *. pi +. m /. 720. *. 2. *. pi) in\nlet x2 = b *. cos (m /. 60. *. 2. *. pi) in\nlet y2 = b *. sin (m /. 60. *. 2. *. pi) in\nlet sqx = (x1 -. x2) *. (x1 -. x2) in\nlet sqy = (y1 -. y2) *. (y1 -. y2) in\nprint_endline (string_of_float (sqrt (sqx +. sqy)))\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nConsider an analog clock whose hour and minute hands are A and B centimeters long, respectively.\n\nAn endpoint of the hour hand and an endpoint of the minute hand are fixed at the same point, around which each hand rotates clockwise at constant angular velocity. It takes the hour and minute hands 12 hours and 1 hour to make one full rotation, respectively.\n\nAt 0 o'clock, the two hands overlap each other. H hours and M minutes later, what is the distance in centimeters between the unfixed endpoints of the hands?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 1000\n\n0 \\leq H \\leq 11\n\n0 \\leq M \\leq 59\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B H M\n\nOutput\n\nPrint the answer without units. Your output will be accepted when its absolute or relative error from the correct value is at most 10^{-9}.\n\nSample Input 1\n\n3 4 9 0\n\nSample Output 1\n\n5.00000000000000000000\n\nThe two hands will be in the positions shown in the figure below, so the answer is 5 centimeters.\n\nSample Input 2\n\n3 4 10 40\n\nSample Output 2\n\n4.56425719433005567605\n\nThe two hands will be in the positions shown in the figure below. Note that each hand always rotates at constant angular velocity.", "sample_input": "3 4 9 0\n"}, "reference_outputs": ["5.00000000000000000000\n"], "source_document_id": "p02677", "source_text": "Score: 300 points\n\nProblem Statement\n\nConsider an analog clock whose hour and minute hands are A and B centimeters long, respectively.\n\nAn endpoint of the hour hand and an endpoint of the minute hand are fixed at the same point, around which each hand rotates clockwise at constant angular velocity. It takes the hour and minute hands 12 hours and 1 hour to make one full rotation, respectively.\n\nAt 0 o'clock, the two hands overlap each other. H hours and M minutes later, what is the distance in centimeters between the unfixed endpoints of the hands?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 1000\n\n0 \\leq H \\leq 11\n\n0 \\leq M \\leq 59\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B H M\n\nOutput\n\nPrint the answer without units. Your output will be accepted when its absolute or relative error from the correct value is at most 10^{-9}.\n\nSample Input 1\n\n3 4 9 0\n\nSample Output 1\n\n5.00000000000000000000\n\nThe two hands will be in the positions shown in the figure below, so the answer is 5 centimeters.\n\nSample Input 2\n\n3 4 10 40\n\nSample Output 2\n\n4.56425719433005567605\n\nThe two hands will be in the positions shown in the figure below. Note that each hand always rotates at constant angular velocity.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 644, "cpu_time_ms": 8, "memory_kb": 4272}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s179962635", "group_id": "codeNet:p02677", "input_text": "let (a, b, h, m) = Scanf.sscanf (read_line ()) \"%d %d %d %d\" @@ fun a b h m -> (a, b, h, m)\n\nlet pi = 3.14159265358\n\nlet () =\n  let t = 2. *. (float h /. 12. +. float m /. 60. /.12.) in\n  let s = 2. *. (float m /. 60.) in\n  let diff = ref (t -. s) in\n  if !diff < 0. then diff := -1. *. !diff;\n  let c2 = (float @@ a * a) +. (float @@ b * b) -. (float @@ 2 * a * b) *. cos (!diff *. pi) in\n  print_float @@ sqrt c2;\n", "language": "OCaml", "metadata": {"date": 1589764630, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s179962635.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s179962635", "user_id": "u811309788"}, "prompt_components": {"gold_output": "5.00000000000000000000\n", "input_to_evaluate": "let (a, b, h, m) = Scanf.sscanf (read_line ()) \"%d %d %d %d\" @@ fun a b h m -> (a, b, h, m)\n\nlet pi = 3.14159265358\n\nlet () =\n  let t = 2. *. (float h /. 12. +. float m /. 60. /.12.) in\n  let s = 2. *. (float m /. 60.) in\n  let diff = ref (t -. s) in\n  if !diff < 0. then diff := -1. *. !diff;\n  let c2 = (float @@ a * a) +. (float @@ b * b) -. (float @@ 2 * a * b) *. cos (!diff *. pi) in\n  print_float @@ sqrt c2;\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nConsider an analog clock whose hour and minute hands are A and B centimeters long, respectively.\n\nAn endpoint of the hour hand and an endpoint of the minute hand are fixed at the same point, around which each hand rotates clockwise at constant angular velocity. It takes the hour and minute hands 12 hours and 1 hour to make one full rotation, respectively.\n\nAt 0 o'clock, the two hands overlap each other. H hours and M minutes later, what is the distance in centimeters between the unfixed endpoints of the hands?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 1000\n\n0 \\leq H \\leq 11\n\n0 \\leq M \\leq 59\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B H M\n\nOutput\n\nPrint the answer without units. Your output will be accepted when its absolute or relative error from the correct value is at most 10^{-9}.\n\nSample Input 1\n\n3 4 9 0\n\nSample Output 1\n\n5.00000000000000000000\n\nThe two hands will be in the positions shown in the figure below, so the answer is 5 centimeters.\n\nSample Input 2\n\n3 4 10 40\n\nSample Output 2\n\n4.56425719433005567605\n\nThe two hands will be in the positions shown in the figure below. Note that each hand always rotates at constant angular velocity.", "sample_input": "3 4 9 0\n"}, "reference_outputs": ["5.00000000000000000000\n"], "source_document_id": "p02677", "source_text": "Score: 300 points\n\nProblem Statement\n\nConsider an analog clock whose hour and minute hands are A and B centimeters long, respectively.\n\nAn endpoint of the hour hand and an endpoint of the minute hand are fixed at the same point, around which each hand rotates clockwise at constant angular velocity. It takes the hour and minute hands 12 hours and 1 hour to make one full rotation, respectively.\n\nAt 0 o'clock, the two hands overlap each other. H hours and M minutes later, what is the distance in centimeters between the unfixed endpoints of the hands?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 1000\n\n0 \\leq H \\leq 11\n\n0 \\leq M \\leq 59\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B H M\n\nOutput\n\nPrint the answer without units. Your output will be accepted when its absolute or relative error from the correct value is at most 10^{-9}.\n\nSample Input 1\n\n3 4 9 0\n\nSample Output 1\n\n5.00000000000000000000\n\nThe two hands will be in the positions shown in the figure below, so the answer is 5 centimeters.\n\nSample Input 2\n\n3 4 10 40\n\nSample Output 2\n\n4.56425719433005567605\n\nThe two hands will be in the positions shown in the figure below. Note that each hand always rotates at constant angular velocity.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 416, "cpu_time_ms": 10, "memory_kb": 4336}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s835854974", "group_id": "codeNet:p02678", "input_text": "open Batteries\nopen Printf\n\nlet ($) g f x = g (f x)\n\nmodule MyList = struct\n  include List\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr = fold_right\n  let foldri = fold_righti\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\nend\n\nmodule L = MyList\n\nlet swap = Tuple2.swap\n\nlet atoi = int_of_string\nlet itoa = string_of_int\nlet atof = float_of_string\nlet ftoa = string_of_float\nlet ctoi = int_of_char\nlet itoc = char_of_int\n\nlet stocl = String.to_list\nlet cltos = String.of_list\nlet spsp s = String.split_on_char ' ' s\n\nmodule MyString = struct\n  include String\n\n  let map' f s = L.map f (stocl s)\n  let mapi' f s = L.map f (stocl s)\n\n  let zipf f a b = L.zipf f (stocl a) (stocl b)\n  let zipfi f a b = L.zipfi f (stocl a) (stocl b)\n\n  let mkstr f sep ls =\n    L.foldl (fun acc x -> acc ^ sep ^ (f x)) (f @@ L.hd ls) (List.tl ls)\nend\n\nmodule S = MyString\n\nmodule MySet (Ord : Set.OrderedType) = struct\n  include Set.Make(Ord)\n\n  let fold' f s z = fold f z s\nend\n\nmodule St = MySet\n\nmodule MyMap (Ord : Map.OrderedType) = struct\n  include Map.Make(Ord)\n\n  let apply = find\n  let apply_or = find_default\nend\n\nmodule Mp = MyMap\n\n\nlet rds () = read_line ()\n\nlet rdi () = atoi @@ rds ()\n\nlet rdhs () = spsp @@ rds ()\nlet rdhi () = rdhs () |> L.map atoi\n\nlet rdi2 () = match rdhi () with\n  | a::b::_ -> (a, b)\n  | _ -> (0, 0)\n\nlet rdi3 () = match rdhi () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0, 0, 0)\n\nlet rdi4 () = match rdhi () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0, 0, 0, 0)\n\nlet rdv n rdf =\n  let rec rdv' n =\n    if n <= 0 then []\n    else (\n      let s = rdf () in\n      s::(rdv' (n - 1))\n    )\n  in rdv' n\n\nlet rdvi n = rdv n rdi\nlet rdvi2 n = rdv n rdi2\nlet rdvi3 n = rdv n rdi3\nlet rdvi4 n = rdv n rdi4\n\nlet puts s = print_endline s\nlet putyn b = puts (if b then \"Yes\" else \"No\")\nlet puti i = puts @@ itoa i\n\nlet set_power ls =\n  let rec set_power' ls pls =\n    match ls with\n    | [] -> pls\n    | hd::tl -> set_power' tl (L.flatmap (fun p -> [p; hd::p]) pls)\n  in set_power' ls [[]]\n\n\nlet rdhf () = rdhs () |> L.map atof\nlet rdf4 () = match rdhf () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0., 0., 0., 0.)\n\n\nmodule Graph = struct\n  module Vs = St(Int)\n  module Vm = Mp(Int)\n\n  type 'a t = { nb : Vs.t Vm.t; vdt : 'a Vm.t }\n\n  let nothing = { nb = Vm.empty; vdt = Vm.empty }\n\n  let add_edge (e : int * int) g =\n    let (v1, v2) = e in\n    let nbvs = g.nb |> Vm.apply_or Vs.empty v1 in\n    let nb1 = g.nb |> Vm.add v1 (nbvs |> Vs.add v2) in\n    { g with nb = nb1 }\n\n  let add_uedge e g =\n    add_edge e (add_edge (swap e) g)\n\n  let from_edges es =\n    es |> L.foldl (fun g e -> add_edge e g) nothing\n\n  let from_uedges es =\n    es |> L.foldl (fun g e -> add_uedge e g) nothing\n\n\nend\n\nmodule G = Graph\nmodule Vs = G.Vs\nmodule Vm = G.Vm\n\nlet _ =\n  let (n, m) = rdi2 () in\n  let es = rdv m rdi2 in\n  let graph = G.from_uedges es in\n\n  let expand v vp =\n    let nb = (graph.nb |> Vm.apply v) in\n    nb |> Vs.fold' (fun nbv (nfr, cvp) ->\n      if Vm.mem nbv cvp then\n        (nfr, cvp)\n      else\n        (nfr |> Vs.add nbv,\n          cvp |> Vm.add nbv v)\n    ) (Vs.empty, vp) in\n  \n  let rec march fr vp =\n    if Vs.is_empty fr then\n      vp\n    else\n      let (nfr, nvp) =\n        fr |> Vs.fold' (fun v (nfr, cvp) ->\n          let (nfr1, nvp) = expand v cvp in\n          (Vs.union nfr nfr1, nvp)\n        ) (Vs.empty, vp)\n      in\n      march nfr nvp \n  in\n\n  let rvp = march (Vs.singleton 1) (Vm.singleton 1 0) in\n  let result = L.tl @@ Vm.bindings rvp in\n\n  puts \"Yes\";\n  result |> L.iter (fun (v, p)-> puti p)\n;;\n", "language": "OCaml", "metadata": {"date": 1590860340, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s835854974.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s835854974", "user_id": "u970139668"}, "prompt_components": {"gold_output": "Yes\n1\n2\n2\n", "input_to_evaluate": "open Batteries\nopen Printf\n\nlet ($) g f x = g (f x)\n\nmodule MyList = struct\n  include List\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr = fold_right\n  let foldri = fold_righti\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\nend\n\nmodule L = MyList\n\nlet swap = Tuple2.swap\n\nlet atoi = int_of_string\nlet itoa = string_of_int\nlet atof = float_of_string\nlet ftoa = string_of_float\nlet ctoi = int_of_char\nlet itoc = char_of_int\n\nlet stocl = String.to_list\nlet cltos = String.of_list\nlet spsp s = String.split_on_char ' ' s\n\nmodule MyString = struct\n  include String\n\n  let map' f s = L.map f (stocl s)\n  let mapi' f s = L.map f (stocl s)\n\n  let zipf f a b = L.zipf f (stocl a) (stocl b)\n  let zipfi f a b = L.zipfi f (stocl a) (stocl b)\n\n  let mkstr f sep ls =\n    L.foldl (fun acc x -> acc ^ sep ^ (f x)) (f @@ L.hd ls) (List.tl ls)\nend\n\nmodule S = MyString\n\nmodule MySet (Ord : Set.OrderedType) = struct\n  include Set.Make(Ord)\n\n  let fold' f s z = fold f z s\nend\n\nmodule St = MySet\n\nmodule MyMap (Ord : Map.OrderedType) = struct\n  include Map.Make(Ord)\n\n  let apply = find\n  let apply_or = find_default\nend\n\nmodule Mp = MyMap\n\n\nlet rds () = read_line ()\n\nlet rdi () = atoi @@ rds ()\n\nlet rdhs () = spsp @@ rds ()\nlet rdhi () = rdhs () |> L.map atoi\n\nlet rdi2 () = match rdhi () with\n  | a::b::_ -> (a, b)\n  | _ -> (0, 0)\n\nlet rdi3 () = match rdhi () with\n| a::b::c::_ -> (a, b, c)\n| _ -> (0, 0, 0)\n\nlet rdi4 () = match rdhi () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0, 0, 0, 0)\n\nlet rdv n rdf =\n  let rec rdv' n =\n    if n <= 0 then []\n    else (\n      let s = rdf () in\n      s::(rdv' (n - 1))\n    )\n  in rdv' n\n\nlet rdvi n = rdv n rdi\nlet rdvi2 n = rdv n rdi2\nlet rdvi3 n = rdv n rdi3\nlet rdvi4 n = rdv n rdi4\n\nlet puts s = print_endline s\nlet putyn b = puts (if b then \"Yes\" else \"No\")\nlet puti i = puts @@ itoa i\n\nlet set_power ls =\n  let rec set_power' ls pls =\n    match ls with\n    | [] -> pls\n    | hd::tl -> set_power' tl (L.flatmap (fun p -> [p; hd::p]) pls)\n  in set_power' ls [[]]\n\n\nlet rdhf () = rdhs () |> L.map atof\nlet rdf4 () = match rdhf () with\n| a::b::c::d::_ -> (a, b, c, d)\n| _ -> (0., 0., 0., 0.)\n\n\nmodule Graph = struct\n  module Vs = St(Int)\n  module Vm = Mp(Int)\n\n  type 'a t = { nb : Vs.t Vm.t; vdt : 'a Vm.t }\n\n  let nothing = { nb = Vm.empty; vdt = Vm.empty }\n\n  let add_edge (e : int * int) g =\n    let (v1, v2) = e in\n    let nbvs = g.nb |> Vm.apply_or Vs.empty v1 in\n    let nb1 = g.nb |> Vm.add v1 (nbvs |> Vs.add v2) in\n    { g with nb = nb1 }\n\n  let add_uedge e g =\n    add_edge e (add_edge (swap e) g)\n\n  let from_edges es =\n    es |> L.foldl (fun g e -> add_edge e g) nothing\n\n  let from_uedges es =\n    es |> L.foldl (fun g e -> add_uedge e g) nothing\n\n\nend\n\nmodule G = Graph\nmodule Vs = G.Vs\nmodule Vm = G.Vm\n\nlet _ =\n  let (n, m) = rdi2 () in\n  let es = rdv m rdi2 in\n  let graph = G.from_uedges es in\n\n  let expand v vp =\n    let nb = (graph.nb |> Vm.apply v) in\n    nb |> Vs.fold' (fun nbv (nfr, cvp) ->\n      if Vm.mem nbv cvp then\n        (nfr, cvp)\n      else\n        (nfr |> Vs.add nbv,\n          cvp |> Vm.add nbv v)\n    ) (Vs.empty, vp) in\n  \n  let rec march fr vp =\n    if Vs.is_empty fr then\n      vp\n    else\n      let (nfr, nvp) =\n        fr |> Vs.fold' (fun v (nfr, cvp) ->\n          let (nfr1, nvp) = expand v cvp in\n          (Vs.union nfr nfr1, nvp)\n        ) (Vs.empty, vp)\n      in\n      march nfr nvp \n  in\n\n  let rvp = march (Vs.singleton 1) (Vm.singleton 1 0) in\n  let result = L.tl @@ Vm.bindings rvp in\n\n  puts \"Yes\";\n  result |> L.iter (fun (v, p)-> puti p)\n;;\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3565, "cpu_time_ms": 1549, "memory_kb": 63144}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s365945747", "group_id": "codeNet:p02678", "input_text": "module WeightedDirectedGraph\n: sig\n  (* 配列を用いたダイクストラ法の実装\n     単純な速さでは一番だが，インターフェースが不便 *)\n  module ByArray : sig\n    module Make :\n      functor\n      (* 辺の重さ *)\n      (Weight : sig\n        type t\n        val inf : t\n        val zero : t\n        val ( + ) : t -> t -> t\n        val compare : t -> t -> int\n      end)\n      (* 道の表現 *)\n      (Path : sig\n        type t\n        (* 辺の名前 *)\n        type edge\n        (* 長さ0の道 *)\n        val nil : t\n        (* 道の後ろに辺を付け足した道 *)\n        val snoc : t -> edge -> t\n      end) ->\n        sig\n          type 'a church_list = { fold : 'b. ('a -> 'b -> 'b) -> 'b -> 'b }\n\n          (* 頂点を[0, n)の自然数に限定したグラフに対してのダイクストラ法\n             時間計算量O(E log E)なので，疎なグラフなら速い *)\n          val dijkstra :\n          (* 頂点数n *)\n          int ->\n          (* 隣接リスト *)\n          (int -> (int * Weight.t * Path.edge) church_list) ->\n          (* 始点 *)\n          int ->\n          (* 始点からの最短距離と，その経路を返す関数\n             始点から辿り着けなければ(inf, Path.nil)を返す\n             この関数を覚えておけば，呼び出しごとの途中までの計算結果がシェアされる *)\n          (int -> Weight.t * Path.t)\n\n          (* 頂点を[0, n)の自然数に限定したグラフに対してのダイクストラ法\n             時間計算量O(V^2)なので，密なグラフなら速い *)\n          val dijkstra_dense :\n          (* 頂点数n *)\n          int ->\n          (* 隣接リスト *)\n          (int -> (int * Weight.t * Path.edge) church_list) ->\n          (* 始点 *)\n          int ->\n          (* 始点からの最短距離と，その経路を返す関数\n             始点から辿り着けなければ(inf, Path.nil)を返す\n             この関数を覚えておけば，呼び出しごとの途中までの計算結果がシェアされる *)\n          (int -> Weight.t * Path.t)\n      end\n  end\n\n  (* ハッシュテーブルを用いたダイクストラ法の実装\n     配列を用いた実装よりは扱いやすいインターフェースを持つ\n     ハッシュ関数を上手く選べば配列を用いた実装より1.5倍遅い程度ですむ *)\n  module ByHashtbl : sig\n    module Make :\n      functor\n      (* 頂点 *)\n      (Vertex : Hashtbl.HashedType)\n      (* 辺の重さ *)\n      (Weight : sig\n        type t\n        val inf : t\n        val zero : t\n        val ( + ) : t -> t -> t\n        val compare : t -> t -> int\n      end)\n      (* 道の表現 *)\n      (Path : sig\n        type t\n        (* 辺の名前 *)\n        type edge\n        (* 長さ0の道 *)\n        val nil : t\n        (* 道の後ろに辺を付け足した道 *)\n        val snoc : t -> edge -> t\n      end) ->\n      sig\n        type 'a church_list = { fold : 'b. ('a -> 'b -> 'b) -> 'b -> 'b }\n\n        val dijkstra :\n        (* 頂点数（Hashtbl.tを用いるので目安程度） *)\n        int ->\n        (* 隣接リスト *)\n        (Vertex.t -> (Vertex.t * Weight.t * Path.edge) church_list) ->\n        (* 始点 *)\n        Vertex.t ->\n        (* 始点からの最短距離と，その経路を返す関数\n           始点から辿り着けなければNot_foundを投げる\n           この関数を覚えておけば，呼び出しごとの途中までの計算結果がシェアされる *)\n        (Vertex.t -> Weight.t * Path.t)\n      end\n  end\n\n  (* Mapを用いたダイクストラ法の実装\n     配列を用いた実装より4倍ぐらい遅いが，\n     一番扱いやすいインターフェースを持ち，無限グラフにも対応可能 *)\n  module ByMap : sig\n    module Make :\n      functor\n      (* 頂点 *)\n      (Vertex : Map.OrderedType)\n      (* 辺の重み *)\n      (Weight : sig\n        type t\n        val zero : t\n        val ( + ) : t -> t -> t\n        val compare : t -> t -> int\n      end)\n      (* 道の表現 *)\n      (Path : sig\n        type t\n        (* 辺の名前 *)\n        type edge\n        (* 長さ0の道 *)\n        val nil : t\n        (* 道の後ろに辺を付け足した道 *)\n        val snoc : t -> edge -> t\n      end) ->\n      sig\n        type 'a church_list = { fold : 'b. ('a -> 'b -> 'b) -> 'b -> 'b }\n\n        val dijkstra :\n        (* 隣接リスト *)\n        (Vertex.t -> (Vertex.t * Weight.t * Path.edge) church_list) ->\n        (* 始点 *)\n        Vertex.t ->\n        (* 始点からの最短距離と，その経路を返す関数\n           始点から辿り着けなければNot_foundを投げる\n           この関数を覚えておけば，呼び出しごとの途中までの計算結果がシェアされる *)\n        (Vertex.t -> Weight.t * Path.t)\n      end\n  end\nend\n= struct\n  module type Weight = sig\n    type t\n    val zero : t\n    val ( + ) : t -> t -> t\n    val compare : t -> t -> int\n  end\n\n  module type Path = sig\n    type t\n    type edge\n    val nil : t\n    val snoc : t -> edge -> t\n  end\n\n  (* 最短距離を格納するデータ構造を抽象化したダイクストラ法の実装 *)\n  module Core\n    (W : Weight)\n    (P : Path)\n    (* グラフの頂点を添字とした配列 *)\n    (VArray : sig\n      type t\n      type vertex (* グラフの頂点 *)\n      val find : t -> vertex -> W.t * P.t (* 最短距離が格納されていなければNot_foundを投げる *)\n      val update : t -> vertex -> W.t * P.t -> unit\n    end) =\n  struct\n    type 'a church_list = { fold : 'b. ('a -> 'b -> 'b) -> 'b -> 'b }\n\n    module WMap = Map.Make (W)\n\n    let dijkstra d es s =\n      VArray.update d s (W.zero, P.nil);\n      let q = ref (WMap.singleton W.zero [s]) in\n      (* 既に最短距離が確定した辺へのクエリを高速化するため，\n         ヒープの最小要素をメモしておく *)\n      let min_binding_opt = ref (Some (W.zero, [s])) in\n      let rec dijkstra_aux t =\n        match !min_binding_opt with\n        (* もう既に全ての頂点までの距離が分かっている *)\n        | None -> VArray.find d t\n        | Some (w, us) ->\n            match VArray.find d t with\n            (* 既に終点までの距離が分かっているので返す *)\n            | (x, _) as ans when W.compare x w <= 0 -> ans\n            (* 終点までの距離が分かっていないので，ダイクストラ法を続行 *)\n            | _ | exception Not_found ->\n                q := WMap.remove w !q;\n                Fun.flip List.iter us (fun u ->\n                  match VArray.find d u with\n                  | (d, _) when 0 < W.compare w d -> ()\n                  | (_, p) ->\n                      (* 未だ頂点uを訪れていない *)\n                      Fun.flip (es u).fold () @@ fun (v, c, e) () ->\n                        let open W in\n                        match VArray.find d v with\n                        | (d, _) when W.compare d (w + c) <= 0 -> ()\n                        | _ | exception Not_found ->\n                            VArray.update d v (w + c, P.snoc p e);\n                            q := WMap.update (w + c) (fun vs -> Some (v :: Option.value ~default:[] vs)) !q);\n                min_binding_opt := WMap.min_binding_opt !q;\n                dijkstra_aux t in\n      dijkstra_aux\n  end\n\n  module ByArray = struct\n    module Make (W : sig include Weight val inf : t end) (P : Path) = struct\n      module C = Core (W) (P) (struct\n        type t = (W.t * P.t) array\n        type vertex = int\n        let find = Array.get\n        let update = Array.set\n      end)\n      include C\n\n      let dijkstra n e s = C.dijkstra (Array.make n (W.inf, P.nil)) e s\n\n      let dijkstra_dense n es s =\n        let d = Array.make n W.inf in\n        let r = Array.make n P.nil in\n        d.(s) <- W.zero;\n        let rec dijkstra_dense_aux = function\n          | [] -> ()\n          | v :: vs ->\n              let u, us = List.fold_left (fun (u, us) v ->\n                if W.compare d.(u) d.(v) < 0\n                then (u, v :: us)\n                else (v, u :: us)) (v, []) vs in\n              (es u).fold (fun (v, c, e) () ->\n                let open W in\n                if 0 < W.compare d.(v) (d.(u) + c) then\n                  (d.(v) <- d.(u) + c; r.(v) <- P.snoc r.(u) e)) ();\n              dijkstra_dense_aux us in\n        dijkstra_dense_aux (List.init n Fun.id);\n        fun v -> (d.(v), r.(v))\n      end\n  end\n\n  module ByHashtbl = struct\n    module Make (V : Hashtbl.HashedType) (W : Weight) (P : Path) = struct\n      module VHash = Hashtbl.Make (V)\n      module C = Core (W) (P) (struct\n        type t = (W.t * P.t) VHash.t\n        type vertex = V.t\n        let find = VHash.find\n        let update = VHash.replace\n      end)\n      include C\n\n      let dijkstra n e s = C.dijkstra (VHash.create n) e s\n    end\n  end\n\n  module ByMap = struct\n    module Make (V : Map.OrderedType) (W : Weight) (P : Path) = struct\n      module VMap = Map.Make (V)\n      module C = Core (W) (P) (struct\n        type t = (W.t * P.t) VMap.t ref\n        type vertex = V.t\n        let find d v = VMap.find v !d\n        let update d v w = d := VMap.add v w !d\n      end)\n      include C\n\n      let dijkstra e s = C.dijkstra (ref VMap.empty) e s\n    end\n  end\nend\n\nmodule IntWeightedDirectedGraphByArray = struct\n  module Make \n    (Path : sig\n      type t\n      (* 辺の名前 *)\n      type edge\n      (* 長さ0の道 *)\n      val nil : t\n      (* 道の後ろに辺を付け足した道 *)\n      val snoc : t -> edge -> t\n    end)\n  = struct\n    include (WeightedDirectedGraph.ByArray.Make (struct\n      type t = int\n      let zero = 0\n      let inf = max_int\n      let ( + ) = ( + )\n      let compare = compare\n    end) (Path))\n\n    (* 辺の重さがごく小さい整数の場合は，Mapをキュー代わりに使うより配列を使った方が効率的\n       時間計算量はO(E+VW)，空間計算量はO(E+W) *)\n    let dijkstra_special :\n      (* 頂点数n *)\n      int ->\n      (* 辺の重さの上限W *)\n      int ->\n      (* 頂点uを受け取って，\n         uから伸びる辺の終点vと重さwの組みのリストを返す関数\n         辺の重さwはW以下でなくてはならない *)\n      (int -> (int * int * Path.edge) church_list) ->\n      (* 始点 *)\n      int ->\n      (* 始点からの最短距離と，その経路を返す関数\n         始点から辿り着けなければ(inf, Path.nil)を返す\n         この関数を覚えておけば，呼び出しごとの途中までの計算結果がシェアされる *)\n      (int -> int * Path.t)\n    = fun n mw es s ->\n      (* 各頂点への最短距離を格納するやつ *)\n      let d = Array.make n max_int in\n      (* 各頂点への最短経路を格納するやつ *)\n      let r = Array.make n Path.nil in\n      (* キュー *)\n      let q = Array.make (mw + 1) [] in\n      (* ヒープの最小要素の重み *)\n      let w = ref 0 in\n      (* ヒープの最小要素がどのインデックスに対応するか *)\n      let i = ref 0 in\n      (* ヒープに格納されている要素の数 *)\n      let m = ref 1 in\n      d.(s) <- 0;\n      q.(0) <- [s];\n      let rec dijkstra_aux t =\n        (* 既に終点までの距離が分かっているので返す *)\n        if !m <= 0 || d.(t) <= !w then (d.(t), r.(t)) else\n        match q.(!i) with\n        (* ヒープには重さがwの要素は無かった *)\n        | [] ->\n            incr w;\n            incr i;\n            if mw < !i then i := 0;\n            dijkstra_aux t\n        (* ヒープには重さwの要素uが存在する *)\n        | u :: us ->\n            (* ヒープから重さwの要素を削除する *)\n            decr m;\n            q.(!i) <- us;\n            if !w <= d.(u) then\n              (* 未だ頂点uを訪れていない *)\n              (es u).fold (fun (v, c, e) () ->\n                if !w + c < d.(v) then begin\n                  d.(v) <- !w + c; (* 頂点vの重さを緩和 *)\n                  r.(v) <- Path.snoc r.(u) e;\n                  (* ヒープにvを追加する *)\n                  let j = !i + c - if !i + c <= mw then 0 else mw + 1 in\n                  q.(j) <- v :: q.(j);\n                  incr m\n                end) ();\n            dijkstra_aux t in\n      dijkstra_aux\n  end\nend\n\nmodule G = IntWeightedDirectedGraphByArray.Make\n  (struct\n    type t = int\n    type edge = int\n    let nil = 0\n    let snoc _ e = e\n  end)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let es = Array.make n [] in\n  for i = 0 to m - 1 do\n    Scanf.scanf \"%d %d\\n\" @@ fun a b ->\n      es.(a - 1) <- b - 1 :: es.(a - 1);\n      es.(b - 1) <- a - 1 :: es.(b - 1);\n  done;\n  let d = G.dijkstra n (fun u -> { G.fold = fun f ->\n    List.fold_right (fun v -> f (v, 1, u + 1)) es.(u) }) 0 in\n  if List.exists (fun (d, _) -> d = max_int) @@ List.init n d\n  then print_endline \"No\"\n  else begin\n    print_endline \"Yes\";\n    for i = 1 to n - 1 do\n      Printf.printf \"%d\\n\" @@ snd @@ d i\n    done\n  end\n", "language": "OCaml", "metadata": {"date": 1589859408, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s365945747.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s365945747", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Yes\n1\n2\n2\n", "input_to_evaluate": "module WeightedDirectedGraph\n: sig\n  (* 配列を用いたダイクストラ法の実装\n     単純な速さでは一番だが，インターフェースが不便 *)\n  module ByArray : sig\n    module Make :\n      functor\n      (* 辺の重さ *)\n      (Weight : sig\n        type t\n        val inf : t\n        val zero : t\n        val ( + ) : t -> t -> t\n        val compare : t -> t -> int\n      end)\n      (* 道の表現 *)\n      (Path : sig\n        type t\n        (* 辺の名前 *)\n        type edge\n        (* 長さ0の道 *)\n        val nil : t\n        (* 道の後ろに辺を付け足した道 *)\n        val snoc : t -> edge -> t\n      end) ->\n        sig\n          type 'a church_list = { fold : 'b. ('a -> 'b -> 'b) -> 'b -> 'b }\n\n          (* 頂点を[0, n)の自然数に限定したグラフに対してのダイクストラ法\n             時間計算量O(E log E)なので，疎なグラフなら速い *)\n          val dijkstra :\n          (* 頂点数n *)\n          int ->\n          (* 隣接リスト *)\n          (int -> (int * Weight.t * Path.edge) church_list) ->\n          (* 始点 *)\n          int ->\n          (* 始点からの最短距離と，その経路を返す関数\n             始点から辿り着けなければ(inf, Path.nil)を返す\n             この関数を覚えておけば，呼び出しごとの途中までの計算結果がシェアされる *)\n          (int -> Weight.t * Path.t)\n\n          (* 頂点を[0, n)の自然数に限定したグラフに対してのダイクストラ法\n             時間計算量O(V^2)なので，密なグラフなら速い *)\n          val dijkstra_dense :\n          (* 頂点数n *)\n          int ->\n          (* 隣接リスト *)\n          (int -> (int * Weight.t * Path.edge) church_list) ->\n          (* 始点 *)\n          int ->\n          (* 始点からの最短距離と，その経路を返す関数\n             始点から辿り着けなければ(inf, Path.nil)を返す\n             この関数を覚えておけば，呼び出しごとの途中までの計算結果がシェアされる *)\n          (int -> Weight.t * Path.t)\n      end\n  end\n\n  (* ハッシュテーブルを用いたダイクストラ法の実装\n     配列を用いた実装よりは扱いやすいインターフェースを持つ\n     ハッシュ関数を上手く選べば配列を用いた実装より1.5倍遅い程度ですむ *)\n  module ByHashtbl : sig\n    module Make :\n      functor\n      (* 頂点 *)\n      (Vertex : Hashtbl.HashedType)\n      (* 辺の重さ *)\n      (Weight : sig\n        type t\n        val inf : t\n        val zero : t\n        val ( + ) : t -> t -> t\n        val compare : t -> t -> int\n      end)\n      (* 道の表現 *)\n      (Path : sig\n        type t\n        (* 辺の名前 *)\n        type edge\n        (* 長さ0の道 *)\n        val nil : t\n        (* 道の後ろに辺を付け足した道 *)\n        val snoc : t -> edge -> t\n      end) ->\n      sig\n        type 'a church_list = { fold : 'b. ('a -> 'b -> 'b) -> 'b -> 'b }\n\n        val dijkstra :\n        (* 頂点数（Hashtbl.tを用いるので目安程度） *)\n        int ->\n        (* 隣接リスト *)\n        (Vertex.t -> (Vertex.t * Weight.t * Path.edge) church_list) ->\n        (* 始点 *)\n        Vertex.t ->\n        (* 始点からの最短距離と，その経路を返す関数\n           始点から辿り着けなければNot_foundを投げる\n           この関数を覚えておけば，呼び出しごとの途中までの計算結果がシェアされる *)\n        (Vertex.t -> Weight.t * Path.t)\n      end\n  end\n\n  (* Mapを用いたダイクストラ法の実装\n     配列を用いた実装より4倍ぐらい遅いが，\n     一番扱いやすいインターフェースを持ち，無限グラフにも対応可能 *)\n  module ByMap : sig\n    module Make :\n      functor\n      (* 頂点 *)\n      (Vertex : Map.OrderedType)\n      (* 辺の重み *)\n      (Weight : sig\n        type t\n        val zero : t\n        val ( + ) : t -> t -> t\n        val compare : t -> t -> int\n      end)\n      (* 道の表現 *)\n      (Path : sig\n        type t\n        (* 辺の名前 *)\n        type edge\n        (* 長さ0の道 *)\n        val nil : t\n        (* 道の後ろに辺を付け足した道 *)\n        val snoc : t -> edge -> t\n      end) ->\n      sig\n        type 'a church_list = { fold : 'b. ('a -> 'b -> 'b) -> 'b -> 'b }\n\n        val dijkstra :\n        (* 隣接リスト *)\n        (Vertex.t -> (Vertex.t * Weight.t * Path.edge) church_list) ->\n        (* 始点 *)\n        Vertex.t ->\n        (* 始点からの最短距離と，その経路を返す関数\n           始点から辿り着けなければNot_foundを投げる\n           この関数を覚えておけば，呼び出しごとの途中までの計算結果がシェアされる *)\n        (Vertex.t -> Weight.t * Path.t)\n      end\n  end\nend\n= struct\n  module type Weight = sig\n    type t\n    val zero : t\n    val ( + ) : t -> t -> t\n    val compare : t -> t -> int\n  end\n\n  module type Path = sig\n    type t\n    type edge\n    val nil : t\n    val snoc : t -> edge -> t\n  end\n\n  (* 最短距離を格納するデータ構造を抽象化したダイクストラ法の実装 *)\n  module Core\n    (W : Weight)\n    (P : Path)\n    (* グラフの頂点を添字とした配列 *)\n    (VArray : sig\n      type t\n      type vertex (* グラフの頂点 *)\n      val find : t -> vertex -> W.t * P.t (* 最短距離が格納されていなければNot_foundを投げる *)\n      val update : t -> vertex -> W.t * P.t -> unit\n    end) =\n  struct\n    type 'a church_list = { fold : 'b. ('a -> 'b -> 'b) -> 'b -> 'b }\n\n    module WMap = Map.Make (W)\n\n    let dijkstra d es s =\n      VArray.update d s (W.zero, P.nil);\n      let q = ref (WMap.singleton W.zero [s]) in\n      (* 既に最短距離が確定した辺へのクエリを高速化するため，\n         ヒープの最小要素をメモしておく *)\n      let min_binding_opt = ref (Some (W.zero, [s])) in\n      let rec dijkstra_aux t =\n        match !min_binding_opt with\n        (* もう既に全ての頂点までの距離が分かっている *)\n        | None -> VArray.find d t\n        | Some (w, us) ->\n            match VArray.find d t with\n            (* 既に終点までの距離が分かっているので返す *)\n            | (x, _) as ans when W.compare x w <= 0 -> ans\n            (* 終点までの距離が分かっていないので，ダイクストラ法を続行 *)\n            | _ | exception Not_found ->\n                q := WMap.remove w !q;\n                Fun.flip List.iter us (fun u ->\n                  match VArray.find d u with\n                  | (d, _) when 0 < W.compare w d -> ()\n                  | (_, p) ->\n                      (* 未だ頂点uを訪れていない *)\n                      Fun.flip (es u).fold () @@ fun (v, c, e) () ->\n                        let open W in\n                        match VArray.find d v with\n                        | (d, _) when W.compare d (w + c) <= 0 -> ()\n                        | _ | exception Not_found ->\n                            VArray.update d v (w + c, P.snoc p e);\n                            q := WMap.update (w + c) (fun vs -> Some (v :: Option.value ~default:[] vs)) !q);\n                min_binding_opt := WMap.min_binding_opt !q;\n                dijkstra_aux t in\n      dijkstra_aux\n  end\n\n  module ByArray = struct\n    module Make (W : sig include Weight val inf : t end) (P : Path) = struct\n      module C = Core (W) (P) (struct\n        type t = (W.t * P.t) array\n        type vertex = int\n        let find = Array.get\n        let update = Array.set\n      end)\n      include C\n\n      let dijkstra n e s = C.dijkstra (Array.make n (W.inf, P.nil)) e s\n\n      let dijkstra_dense n es s =\n        let d = Array.make n W.inf in\n        let r = Array.make n P.nil in\n        d.(s) <- W.zero;\n        let rec dijkstra_dense_aux = function\n          | [] -> ()\n          | v :: vs ->\n              let u, us = List.fold_left (fun (u, us) v ->\n                if W.compare d.(u) d.(v) < 0\n                then (u, v :: us)\n                else (v, u :: us)) (v, []) vs in\n              (es u).fold (fun (v, c, e) () ->\n                let open W in\n                if 0 < W.compare d.(v) (d.(u) + c) then\n                  (d.(v) <- d.(u) + c; r.(v) <- P.snoc r.(u) e)) ();\n              dijkstra_dense_aux us in\n        dijkstra_dense_aux (List.init n Fun.id);\n        fun v -> (d.(v), r.(v))\n      end\n  end\n\n  module ByHashtbl = struct\n    module Make (V : Hashtbl.HashedType) (W : Weight) (P : Path) = struct\n      module VHash = Hashtbl.Make (V)\n      module C = Core (W) (P) (struct\n        type t = (W.t * P.t) VHash.t\n        type vertex = V.t\n        let find = VHash.find\n        let update = VHash.replace\n      end)\n      include C\n\n      let dijkstra n e s = C.dijkstra (VHash.create n) e s\n    end\n  end\n\n  module ByMap = struct\n    module Make (V : Map.OrderedType) (W : Weight) (P : Path) = struct\n      module VMap = Map.Make (V)\n      module C = Core (W) (P) (struct\n        type t = (W.t * P.t) VMap.t ref\n        type vertex = V.t\n        let find d v = VMap.find v !d\n        let update d v w = d := VMap.add v w !d\n      end)\n      include C\n\n      let dijkstra e s = C.dijkstra (ref VMap.empty) e s\n    end\n  end\nend\n\nmodule IntWeightedDirectedGraphByArray = struct\n  module Make \n    (Path : sig\n      type t\n      (* 辺の名前 *)\n      type edge\n      (* 長さ0の道 *)\n      val nil : t\n      (* 道の後ろに辺を付け足した道 *)\n      val snoc : t -> edge -> t\n    end)\n  = struct\n    include (WeightedDirectedGraph.ByArray.Make (struct\n      type t = int\n      let zero = 0\n      let inf = max_int\n      let ( + ) = ( + )\n      let compare = compare\n    end) (Path))\n\n    (* 辺の重さがごく小さい整数の場合は，Mapをキュー代わりに使うより配列を使った方が効率的\n       時間計算量はO(E+VW)，空間計算量はO(E+W) *)\n    let dijkstra_special :\n      (* 頂点数n *)\n      int ->\n      (* 辺の重さの上限W *)\n      int ->\n      (* 頂点uを受け取って，\n         uから伸びる辺の終点vと重さwの組みのリストを返す関数\n         辺の重さwはW以下でなくてはならない *)\n      (int -> (int * int * Path.edge) church_list) ->\n      (* 始点 *)\n      int ->\n      (* 始点からの最短距離と，その経路を返す関数\n         始点から辿り着けなければ(inf, Path.nil)を返す\n         この関数を覚えておけば，呼び出しごとの途中までの計算結果がシェアされる *)\n      (int -> int * Path.t)\n    = fun n mw es s ->\n      (* 各頂点への最短距離を格納するやつ *)\n      let d = Array.make n max_int in\n      (* 各頂点への最短経路を格納するやつ *)\n      let r = Array.make n Path.nil in\n      (* キュー *)\n      let q = Array.make (mw + 1) [] in\n      (* ヒープの最小要素の重み *)\n      let w = ref 0 in\n      (* ヒープの最小要素がどのインデックスに対応するか *)\n      let i = ref 0 in\n      (* ヒープに格納されている要素の数 *)\n      let m = ref 1 in\n      d.(s) <- 0;\n      q.(0) <- [s];\n      let rec dijkstra_aux t =\n        (* 既に終点までの距離が分かっているので返す *)\n        if !m <= 0 || d.(t) <= !w then (d.(t), r.(t)) else\n        match q.(!i) with\n        (* ヒープには重さがwの要素は無かった *)\n        | [] ->\n            incr w;\n            incr i;\n            if mw < !i then i := 0;\n            dijkstra_aux t\n        (* ヒープには重さwの要素uが存在する *)\n        | u :: us ->\n            (* ヒープから重さwの要素を削除する *)\n            decr m;\n            q.(!i) <- us;\n            if !w <= d.(u) then\n              (* 未だ頂点uを訪れていない *)\n              (es u).fold (fun (v, c, e) () ->\n                if !w + c < d.(v) then begin\n                  d.(v) <- !w + c; (* 頂点vの重さを緩和 *)\n                  r.(v) <- Path.snoc r.(u) e;\n                  (* ヒープにvを追加する *)\n                  let j = !i + c - if !i + c <= mw then 0 else mw + 1 in\n                  q.(j) <- v :: q.(j);\n                  incr m\n                end) ();\n            dijkstra_aux t in\n      dijkstra_aux\n  end\nend\n\nmodule G = IntWeightedDirectedGraphByArray.Make\n  (struct\n    type t = int\n    type edge = int\n    let nil = 0\n    let snoc _ e = e\n  end)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let es = Array.make n [] in\n  for i = 0 to m - 1 do\n    Scanf.scanf \"%d %d\\n\" @@ fun a b ->\n      es.(a - 1) <- b - 1 :: es.(a - 1);\n      es.(b - 1) <- a - 1 :: es.(b - 1);\n  done;\n  let d = G.dijkstra n (fun u -> { G.fold = fun f ->\n    List.fold_right (fun v -> f (v, 1, u + 1)) es.(u) }) 0 in\n  if List.exists (fun (d, _) -> d = max_int) @@ List.init n d\n  then print_endline \"No\"\n  else begin\n    print_endline \"Yes\";\n    for i = 1 to n - 1 do\n      Printf.printf \"%d\\n\" @@ snd @@ d i\n    done\n  end\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 13089, "cpu_time_ms": 333, "memory_kb": 28236}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s242241369", "group_id": "codeNet:p02679", "input_text": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list ?sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list ?sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list ?sep conv);\n  arr\n\nlet atoi c = Char.code c - Char.code '0'\n\nlet rec powerset = function\n  | [] -> [[]]\n  | hd::tl ->\n    let pws =  powerset tl in\n    pws @ ListL.map pws ~f:(fun pw -> hd::pw)\n\nlet permutations l =\n  let rec interleave x = function\n    | [] -> [[x]]\n    | (hd::tl) as l ->\n      (x::l) :: (interleave x tl |> ListL.map ~f:(fun l -> hd::l)) in\n  let rec aux = function\n    | [] -> [[]]\n    | a::rest ->\n      aux rest |> ListL.map ~f:(interleave a) |> List.concat in\n  aux l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nmodule ModOp = struct\n  let prime = 1_000_000_007\n  let (+) a b = (a + b) mod prime\n  let (-) a b = (a + prime - b) mod prime\n  let ( * ) a b = (a * b) mod prime\n\n  let rec pow x n =\n    if n = 0 then 1\n    else if n mod 2 = 0 then pow (x*x) (n/2)\n    else x * pow (x*x) (n/2)\nend\n\nlet n = scan \"%d\" id\nlet ls = scan_lines n \"%d %d\" Tuple2.make\n\nlet rec gcd a b =\n  if b = 0 then a\n  else gcd b (a mod b)\n\nlet () =\n  let open ModOp in\n  let (ks, ms) = ListL.partition ls ~f:(fun (a,b) -> a = 0 && b = 0) in\n  let ms = ListL.map ms ~f:(fun (a, b) ->\n      if a = 0 then (0,1)\n      else if b = 0 then (1,0)\n      else\n        let m = gcd (abs a) (abs b) in\n        if a < 0 then (-a/m, -b/m)\n        else (a/m, b/m)) in\n  let h0 = Hashtbl.create n in\n  let h1 = Hashtbl.create n in\n  ListL.iter ms ~f:(fun (a,b) ->\n      if b <= 0 then Hashtbl.modify_def 0 (a,b) succ h0\n      else Hashtbl.modify_def 0 (b,-a) succ h1);\n  Hashtbl.map (fun (a,b) n ->\n      let x = Hashtbl.find_default h1 (a,b) 0 in\n      pow 2 n + pow 2 x - 1) h0\n  |> Hashtbl.to_list |> List.map Tuple2.second\n  |> ListL.fold_left ~init:1 ~f:( * )\n  |> ((+) (List.length ks - 1))\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1591939452, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02679.html", "problem_id": "p02679", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02679/input.txt", "sample_output_relpath": "derived/input_output/data/p02679/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02679/OCaml/s242241369.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s242241369", "user_id": "u802614675"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list ?sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list ?sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list ?sep conv);\n  arr\n\nlet atoi c = Char.code c - Char.code '0'\n\nlet rec powerset = function\n  | [] -> [[]]\n  | hd::tl ->\n    let pws =  powerset tl in\n    pws @ ListL.map pws ~f:(fun pw -> hd::pw)\n\nlet permutations l =\n  let rec interleave x = function\n    | [] -> [[x]]\n    | (hd::tl) as l ->\n      (x::l) :: (interleave x tl |> ListL.map ~f:(fun l -> hd::l)) in\n  let rec aux = function\n    | [] -> [[]]\n    | a::rest ->\n      aux rest |> ListL.map ~f:(interleave a) |> List.concat in\n  aux l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nmodule ModOp = struct\n  let prime = 1_000_000_007\n  let (+) a b = (a + b) mod prime\n  let (-) a b = (a + prime - b) mod prime\n  let ( * ) a b = (a * b) mod prime\n\n  let rec pow x n =\n    if n = 0 then 1\n    else if n mod 2 = 0 then pow (x*x) (n/2)\n    else x * pow (x*x) (n/2)\nend\n\nlet n = scan \"%d\" id\nlet ls = scan_lines n \"%d %d\" Tuple2.make\n\nlet rec gcd a b =\n  if b = 0 then a\n  else gcd b (a mod b)\n\nlet () =\n  let open ModOp in\n  let (ks, ms) = ListL.partition ls ~f:(fun (a,b) -> a = 0 && b = 0) in\n  let ms = ListL.map ms ~f:(fun (a, b) ->\n      if a = 0 then (0,1)\n      else if b = 0 then (1,0)\n      else\n        let m = gcd (abs a) (abs b) in\n        if a < 0 then (-a/m, -b/m)\n        else (a/m, b/m)) in\n  let h0 = Hashtbl.create n in\n  let h1 = Hashtbl.create n in\n  ListL.iter ms ~f:(fun (a,b) ->\n      if b <= 0 then Hashtbl.modify_def 0 (a,b) succ h0\n      else Hashtbl.modify_def 0 (b,-a) succ h1);\n  Hashtbl.map (fun (a,b) n ->\n      let x = Hashtbl.find_default h1 (a,b) 0 in\n      pow 2 n + pow 2 x - 1) h0\n  |> Hashtbl.to_list |> List.map Tuple2.second\n  |> ListL.fold_left ~init:1 ~f:( * )\n  |> ((+) (List.length ks - 1))\n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score: 500 points\n\nProblem Statement\n\nWe have caught N sardines. The deliciousness and fragrantness of the i-th sardine is A_i and B_i, respectively.\n\nWe will choose one or more of these sardines and put them into a cooler. However, two sardines on bad terms cannot be chosen at the same time.\n\nThe i-th and j-th sardines (i \\neq j) are on bad terms if and only if A_i \\cdot A_j + B_i \\cdot B_j = 0.\n\nIn how many ways can we choose the set of sardines to put into the cooler? Since the count can be enormous, print it modulo 1000000007.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n-10^{18} \\leq A_i, B_i \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the count modulo 1000000007.\n\nSample Input 1\n\n3\n1 2\n-1 1\n2 -1\n\nSample Output 1\n\n5\n\nThere are five ways to choose the set of sardines, as follows:\n\nThe 1-st\n\nThe 1-st and 2-nd\n\nThe 2-nd\n\nThe 2-nd and 3-rd\n\nThe 3-rd\n\nSample Input 2\n\n10\n3 2\n3 2\n-1 1\n2 -1\n-3 -9\n-8 12\n7 7\n8 1\n8 2\n8 4\n\nSample Output 2\n\n479", "sample_input": "3\n1 2\n-1 1\n2 -1\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02679", "source_text": "Score: 500 points\n\nProblem Statement\n\nWe have caught N sardines. The deliciousness and fragrantness of the i-th sardine is A_i and B_i, respectively.\n\nWe will choose one or more of these sardines and put them into a cooler. However, two sardines on bad terms cannot be chosen at the same time.\n\nThe i-th and j-th sardines (i \\neq j) are on bad terms if and only if A_i \\cdot A_j + B_i \\cdot B_j = 0.\n\nIn how many ways can we choose the set of sardines to put into the cooler? Since the count can be enormous, print it modulo 1000000007.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n-10^{18} \\leq A_i, B_i \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the count modulo 1000000007.\n\nSample Input 1\n\n3\n1 2\n-1 1\n2 -1\n\nSample Output 1\n\n5\n\nThere are five ways to choose the set of sardines, as follows:\n\nThe 1-st\n\nThe 1-st and 2-nd\n\nThe 2-nd\n\nThe 2-nd and 3-rd\n\nThe 3-rd\n\nSample Input 2\n\n10\n3 2\n3 2\n-1 1\n2 -1\n-3 -9\n-8 12\n7 7\n8 1\n8 2\n8 4\n\nSample Output 2\n\n479", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2977, "cpu_time_ms": 490, "memory_kb": 57712}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s491039990", "group_id": "codeNet:p02679", "input_text": "let rec gcd n m =\n  if m = 0 then n else gcd m (n mod m)\n\nlet m = 1000000007\nlet ( +^ ) x y = (x + y) mod m\nlet ( -^ ) x y = x +^ (m - y)\nlet ( *^ ) x y = (x * y) mod m\n\nlet rec power ( * ) e m n =\n  if n <= 0 then e\n  else power ( * ) (if n land 1 = 0 then e else m * e) (m * m) (n lsr 1)\n\ntype quotient = Nan | Zero | Inf | Quotient of int * int\n\nlet quotient_of_intpair = function\n  | (0, 0) -> Nan\n  | (0, _) -> Zero\n  | (_, 0) -> Inf\n  | (a, b) ->\n      let d = gcd (abs a) (abs b) in\n      if b < 0\n      then Quotient (~- a / d, ~-b / d)\n      else Quotient (a / d, b / d)\n\nlet inv = function\n  | Zero -> Inf\n  | Inf -> Zero\n  | Quotient (a, b) -> Quotient (b * compare 0 a, abs a)\n\nmodule QuotientMap = Map.Make (struct\n  type t = quotient\n  let compare = compare\nend)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let abs = List.init n @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun a b -> quotient_of_intpair (a, b) in\n  let zeros, m =\n    List.fold_left (fun (zeros, m) -> function\n      | Nan -> (zeros + 1, m)\n      | q ->\n          zeros,\n          QuotientMap.update q (fun o -> Some (1 + Option.value ~default:0 o)) @@\n          QuotientMap.update (inv q) (fun o -> Some (Option.value ~default:0 o)) m) (0, QuotientMap.empty) abs in\n  Printf.printf \"%d\\n\" @@\n  ( +^ ) (zeros -^ 1) @@\n  QuotientMap.fold (fun q n acc ->\n    match q with\n    | Zero -> acc\n    | Quotient (a, _) when a < 0 -> acc\n    | _ ->\n        let n' = QuotientMap.find (inv q) m in\n        acc *^ (power ( *^ ) 1 2 n +^ power ( *^ ) 1 2 n' -^ 1)) m 1\n", "language": "OCaml", "metadata": {"date": 1589776238, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02679.html", "problem_id": "p02679", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02679/input.txt", "sample_output_relpath": "derived/input_output/data/p02679/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02679/OCaml/s491039990.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s491039990", "user_id": "u504158101"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let rec gcd n m =\n  if m = 0 then n else gcd m (n mod m)\n\nlet m = 1000000007\nlet ( +^ ) x y = (x + y) mod m\nlet ( -^ ) x y = x +^ (m - y)\nlet ( *^ ) x y = (x * y) mod m\n\nlet rec power ( * ) e m n =\n  if n <= 0 then e\n  else power ( * ) (if n land 1 = 0 then e else m * e) (m * m) (n lsr 1)\n\ntype quotient = Nan | Zero | Inf | Quotient of int * int\n\nlet quotient_of_intpair = function\n  | (0, 0) -> Nan\n  | (0, _) -> Zero\n  | (_, 0) -> Inf\n  | (a, b) ->\n      let d = gcd (abs a) (abs b) in\n      if b < 0\n      then Quotient (~- a / d, ~-b / d)\n      else Quotient (a / d, b / d)\n\nlet inv = function\n  | Zero -> Inf\n  | Inf -> Zero\n  | Quotient (a, b) -> Quotient (b * compare 0 a, abs a)\n\nmodule QuotientMap = Map.Make (struct\n  type t = quotient\n  let compare = compare\nend)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let abs = List.init n @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun a b -> quotient_of_intpair (a, b) in\n  let zeros, m =\n    List.fold_left (fun (zeros, m) -> function\n      | Nan -> (zeros + 1, m)\n      | q ->\n          zeros,\n          QuotientMap.update q (fun o -> Some (1 + Option.value ~default:0 o)) @@\n          QuotientMap.update (inv q) (fun o -> Some (Option.value ~default:0 o)) m) (0, QuotientMap.empty) abs in\n  Printf.printf \"%d\\n\" @@\n  ( +^ ) (zeros -^ 1) @@\n  QuotientMap.fold (fun q n acc ->\n    match q with\n    | Zero -> acc\n    | Quotient (a, _) when a < 0 -> acc\n    | _ ->\n        let n' = QuotientMap.find (inv q) m in\n        acc *^ (power ( *^ ) 1 2 n +^ power ( *^ ) 1 2 n' -^ 1)) m 1\n", "problem_context": "Score: 500 points\n\nProblem Statement\n\nWe have caught N sardines. The deliciousness and fragrantness of the i-th sardine is A_i and B_i, respectively.\n\nWe will choose one or more of these sardines and put them into a cooler. However, two sardines on bad terms cannot be chosen at the same time.\n\nThe i-th and j-th sardines (i \\neq j) are on bad terms if and only if A_i \\cdot A_j + B_i \\cdot B_j = 0.\n\nIn how many ways can we choose the set of sardines to put into the cooler? Since the count can be enormous, print it modulo 1000000007.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n-10^{18} \\leq A_i, B_i \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the count modulo 1000000007.\n\nSample Input 1\n\n3\n1 2\n-1 1\n2 -1\n\nSample Output 1\n\n5\n\nThere are five ways to choose the set of sardines, as follows:\n\nThe 1-st\n\nThe 1-st and 2-nd\n\nThe 2-nd\n\nThe 2-nd and 3-rd\n\nThe 3-rd\n\nSample Input 2\n\n10\n3 2\n3 2\n-1 1\n2 -1\n-3 -9\n-8 12\n7 7\n8 1\n8 2\n8 4\n\nSample Output 2\n\n479", "sample_input": "3\n1 2\n-1 1\n2 -1\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02679", "source_text": "Score: 500 points\n\nProblem Statement\n\nWe have caught N sardines. The deliciousness and fragrantness of the i-th sardine is A_i and B_i, respectively.\n\nWe will choose one or more of these sardines and put them into a cooler. However, two sardines on bad terms cannot be chosen at the same time.\n\nThe i-th and j-th sardines (i \\neq j) are on bad terms if and only if A_i \\cdot A_j + B_i \\cdot B_j = 0.\n\nIn how many ways can we choose the set of sardines to put into the cooler? Since the count can be enormous, print it modulo 1000000007.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n-10^{18} \\leq A_i, B_i \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the count modulo 1000000007.\n\nSample Input 1\n\n3\n1 2\n-1 1\n2 -1\n\nSample Output 1\n\n5\n\nThere are five ways to choose the set of sardines, as follows:\n\nThe 1-st\n\nThe 1-st and 2-nd\n\nThe 2-nd\n\nThe 2-nd and 3-rd\n\nThe 3-rd\n\nSample Input 2\n\n10\n3 2\n3 2\n-1 1\n2 -1\n-3 -9\n-8 12\n7 7\n8 1\n8 2\n8 4\n\nSample Output 2\n\n479", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1528, "cpu_time_ms": 1657, "memory_kb": 63100}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s019494521", "group_id": "codeNet:p02679", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let rec gcd a b = if b = 0 then a else gcd b (a mod b) in\n    let agcd a b = gcd (abs a) (abs b) in\n\n    let module M = Map.Make (struct type t = int * int let compare = compare end) in\n\n    let rec loop i map a0 b0 c0 d0 e0 =\n        if i = n then map, a0, b0, c0, d0, e0 else\n            let a, b = Scanf.scanf \" %d %d\" (fun a b -> a, b) in\n            if a = 0 && b = 0 then loop (i + 1) map a0 b0 (c0 + 1) d0 e0 else\n            if a = 0 then loop (i + 1) map (a0 + 1) b0 c0 d0 e0 else\n            if b = 0 then loop (i + 1) map a0 (b0 + 1) c0 d0 e0 else\n            if a = b then loop (i + 1) map a0 b0 c0 (d0 + 1) e0 else\n            if a = -b then loop (i + 1) map a0 b0 c0 d0 (e0 + 1) else\n            let g = agcd a b in\n            let a = a / g in\n            let b = b / g in\n            let flag = if a < 0 && b < 0 || a > 0 && b > 0 then 2 else 0 in\n            let flag = if abs a < abs b then flag + 1 else flag in\n            let key = if abs a < abs b then abs a, abs b else abs b, abs a in\n            let (ca, cb, cc, cd) = try M.find key map with _ -> 0, 0, 0, 0 in\n            let abcd = if flag = 0 then ca + 1, cb, cc, cd else\n                       if flag = 1 then ca, cb + 1, cc, cd else\n                       if flag = 2 then ca, cb, cc + 1, cd else\n                                        ca, cb, cc, cd + 1\n            in\n            let map = M.add key abcd map in\n            loop (i + 1) map a0 b0 c0 d0 e0\n    in\n    let map, a0, b0, c0, d0, e0 = loop 0 M.empty 0 0 0 0 0 in\n    let m = 1_000_000_007 in\n    let ( +@) a b = (a + b) mod m in\n    let ( -@) a b = (((a - b) mod m) + m) mod m in\n    let ( *@) a b = (a * b) mod m in\n\n    let powmod a b =\n        let rec loop r i acc =\n            if i = 0 then acc else\n                loop (r *@ r) (i lsr 1) (if i land 1 = 1 then r *@ acc else acc)\n        in\n        loop a b 1\n    in\n\n    let ans1 =\n        M.fold (fun (k1, k2) (ca, cb, cc, cd) acc ->\n            (powmod 2 ca +@ powmod 2 cd -@ 1) *@ (powmod 2 cb +@ powmod 2 cc -@ 1) *@ acc\n        ) map 1\n    in\n    let ans2 = ans1 *@ (powmod 2 d0 +@ powmod 2 e0 -@ 1) in\n    let ans3 = ans2 *@ (powmod 2 a0 +@ powmod 2 b0 -@ 1) in\n    let ans4 = ans3 + c0 in\n                       Printf.printf \"%d\\n\" (ans4 -@ 1)\n)\n", "language": "OCaml", "metadata": {"date": 1589769599, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02679.html", "problem_id": "p02679", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02679/input.txt", "sample_output_relpath": "derived/input_output/data/p02679/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02679/OCaml/s019494521.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s019494521", "user_id": "u342443598"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let rec gcd a b = if b = 0 then a else gcd b (a mod b) in\n    let agcd a b = gcd (abs a) (abs b) in\n\n    let module M = Map.Make (struct type t = int * int let compare = compare end) in\n\n    let rec loop i map a0 b0 c0 d0 e0 =\n        if i = n then map, a0, b0, c0, d0, e0 else\n            let a, b = Scanf.scanf \" %d %d\" (fun a b -> a, b) in\n            if a = 0 && b = 0 then loop (i + 1) map a0 b0 (c0 + 1) d0 e0 else\n            if a = 0 then loop (i + 1) map (a0 + 1) b0 c0 d0 e0 else\n            if b = 0 then loop (i + 1) map a0 (b0 + 1) c0 d0 e0 else\n            if a = b then loop (i + 1) map a0 b0 c0 (d0 + 1) e0 else\n            if a = -b then loop (i + 1) map a0 b0 c0 d0 (e0 + 1) else\n            let g = agcd a b in\n            let a = a / g in\n            let b = b / g in\n            let flag = if a < 0 && b < 0 || a > 0 && b > 0 then 2 else 0 in\n            let flag = if abs a < abs b then flag + 1 else flag in\n            let key = if abs a < abs b then abs a, abs b else abs b, abs a in\n            let (ca, cb, cc, cd) = try M.find key map with _ -> 0, 0, 0, 0 in\n            let abcd = if flag = 0 then ca + 1, cb, cc, cd else\n                       if flag = 1 then ca, cb + 1, cc, cd else\n                       if flag = 2 then ca, cb, cc + 1, cd else\n                                        ca, cb, cc, cd + 1\n            in\n            let map = M.add key abcd map in\n            loop (i + 1) map a0 b0 c0 d0 e0\n    in\n    let map, a0, b0, c0, d0, e0 = loop 0 M.empty 0 0 0 0 0 in\n    let m = 1_000_000_007 in\n    let ( +@) a b = (a + b) mod m in\n    let ( -@) a b = (((a - b) mod m) + m) mod m in\n    let ( *@) a b = (a * b) mod m in\n\n    let powmod a b =\n        let rec loop r i acc =\n            if i = 0 then acc else\n                loop (r *@ r) (i lsr 1) (if i land 1 = 1 then r *@ acc else acc)\n        in\n        loop a b 1\n    in\n\n    let ans1 =\n        M.fold (fun (k1, k2) (ca, cb, cc, cd) acc ->\n            (powmod 2 ca +@ powmod 2 cd -@ 1) *@ (powmod 2 cb +@ powmod 2 cc -@ 1) *@ acc\n        ) map 1\n    in\n    let ans2 = ans1 *@ (powmod 2 d0 +@ powmod 2 e0 -@ 1) in\n    let ans3 = ans2 *@ (powmod 2 a0 +@ powmod 2 b0 -@ 1) in\n    let ans4 = ans3 + c0 in\n                       Printf.printf \"%d\\n\" (ans4 -@ 1)\n)\n", "problem_context": "Score: 500 points\n\nProblem Statement\n\nWe have caught N sardines. The deliciousness and fragrantness of the i-th sardine is A_i and B_i, respectively.\n\nWe will choose one or more of these sardines and put them into a cooler. However, two sardines on bad terms cannot be chosen at the same time.\n\nThe i-th and j-th sardines (i \\neq j) are on bad terms if and only if A_i \\cdot A_j + B_i \\cdot B_j = 0.\n\nIn how many ways can we choose the set of sardines to put into the cooler? Since the count can be enormous, print it modulo 1000000007.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n-10^{18} \\leq A_i, B_i \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the count modulo 1000000007.\n\nSample Input 1\n\n3\n1 2\n-1 1\n2 -1\n\nSample Output 1\n\n5\n\nThere are five ways to choose the set of sardines, as follows:\n\nThe 1-st\n\nThe 1-st and 2-nd\n\nThe 2-nd\n\nThe 2-nd and 3-rd\n\nThe 3-rd\n\nSample Input 2\n\n10\n3 2\n3 2\n-1 1\n2 -1\n-3 -9\n-8 12\n7 7\n8 1\n8 2\n8 4\n\nSample Output 2\n\n479", "sample_input": "3\n1 2\n-1 1\n2 -1\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02679", "source_text": "Score: 500 points\n\nProblem Statement\n\nWe have caught N sardines. The deliciousness and fragrantness of the i-th sardine is A_i and B_i, respectively.\n\nWe will choose one or more of these sardines and put them into a cooler. However, two sardines on bad terms cannot be chosen at the same time.\n\nThe i-th and j-th sardines (i \\neq j) are on bad terms if and only if A_i \\cdot A_j + B_i \\cdot B_j = 0.\n\nIn how many ways can we choose the set of sardines to put into the cooler? Since the count can be enormous, print it modulo 1000000007.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n-10^{18} \\leq A_i, B_i \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the count modulo 1000000007.\n\nSample Input 1\n\n3\n1 2\n-1 1\n2 -1\n\nSample Output 1\n\n5\n\nThere are five ways to choose the set of sardines, as follows:\n\nThe 1-st\n\nThe 1-st and 2-nd\n\nThe 2-nd\n\nThe 2-nd and 3-rd\n\nThe 3-rd\n\nSample Input 2\n\n10\n3 2\n3 2\n-1 1\n2 -1\n-3 -9\n-8 12\n7 7\n8 1\n8 2\n8 4\n\nSample Output 2\n\n479", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2289, "cpu_time_ms": 832, "memory_kb": 42764}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s357368322", "group_id": "codeNet:p02681", "input_text": "open Scanf\nopen Printf\n\n\nlet () = scanf \"%s %s\" (fun s t -> if t = s ^ Char.escaped t.[(String.length s) ] then \"Yes\" else \"No\")\n|>printf \"%s\"\n", "language": "OCaml", "metadata": {"date": 1589519973, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02681.html", "problem_id": "p02681", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02681/input.txt", "sample_output_relpath": "derived/input_output/data/p02681/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02681/OCaml/s357368322.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s357368322", "user_id": "u305052967"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Scanf\nopen Printf\n\n\nlet () = scanf \"%s %s\" (fun s t -> if t = s ^ Char.escaped t.[(String.length s) ] then \"Yes\" else \"No\")\n|>printf \"%s\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi wants to be a member of some web service.\n\nHe tried to register himself with the ID S, which turned out to be already used by another user.\n\nThus, he decides to register using a string obtained by appending one character at the end of S as his ID.\n\nHe is now trying to register with the ID T. Determine whether this string satisfies the property above.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\n1 \\leq |S| \\leq 10\n\n|T| = |S| + 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf T satisfies the property in Problem Statement, print Yes; otherwise, print No.\n\nSample Input 1\n\nchokudai\nchokudaiz\n\nSample Output 1\n\nYes\n\nchokudaiz can be obtained by appending z at the end of chokudai.\n\nSample Input 2\n\nsnuke\nsnekee\n\nSample Output 2\n\nNo\n\nsnekee cannot be obtained by appending one character at the end of snuke.\n\nSample Input 3\n\na\naa\n\nSample Output 3\n\nYes", "sample_input": "chokudai\nchokudaiz\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02681", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi wants to be a member of some web service.\n\nHe tried to register himself with the ID S, which turned out to be already used by another user.\n\nThus, he decides to register using a string obtained by appending one character at the end of S as his ID.\n\nHe is now trying to register with the ID T. Determine whether this string satisfies the property above.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\n1 \\leq |S| \\leq 10\n\n|T| = |S| + 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf T satisfies the property in Problem Statement, print Yes; otherwise, print No.\n\nSample Input 1\n\nchokudai\nchokudaiz\n\nSample Output 1\n\nYes\n\nchokudaiz can be obtained by appending z at the end of chokudai.\n\nSample Input 2\n\nsnuke\nsnekee\n\nSample Output 2\n\nNo\n\nsnekee cannot be obtained by appending one character at the end of snuke.\n\nSample Input 3\n\na\naa\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 143, "cpu_time_ms": 3, "memory_kb": 3720}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s973440197", "group_id": "codeNet:p02682", "input_text": "open Batteries\nopen Printf\nopen Scanf\n\nlet ($) g f x = g (f x)\nlet nil = ()\n\nmodule MyList = struct\n  include List\n  let foldl = fold_left\n  let foldr = fold_right\n  \n  let flatmap f ls = concat @@ map f ls\n\n  let zipf = map2\n  let zipfi = map2i\nend\n\nmodule L = MyList\n\nlet atoi = int_of_string\nlet itoa = string_of_int\nlet atof = float_of_string\nlet ftoa = string_of_float\nlet ctoi = int_of_char\nlet itoc = char_of_int\n\nlet stocl = String.to_list\nlet cltos = String.of_list\nlet spsp s = String.split_on_char ' ' s\n\nmodule MyString = struct\n  include String\n\n  let map' f s = L.map f (stocl s)\n  let mapi' f s = L.map f (stocl s)\n\n  let zipf f a b = L.zipf f (stocl a) (stocl b)\n  let zipfi f a b = L.zipfi f (stocl a) (stocl b)\n\n  let mkstr f sep ls =\n    L.foldl (fun acc x -> acc ^ sep ^ (f x)) (f @@ L.hd ls) (List.tl ls)\nend\n\nmodule S = MyString\n\nlet tup2 a b = (a, b)\nlet tup3 a b c = (a, b, c)\nlet tup4 a b c d = (a, b, c, d)\n\nlet rds () = read_line ()\nlet rds2 () = scanf \"%s %s\\n\" tup2\n\nlet rdi () = atoi @@ rds ()\nlet rdi2 () = scanf \"%d %d\\n\" tup2\nlet rdi3 () = scanf \"%d %d %d\\n\" tup3\nlet rdi4 () = scanf \"%d %d %d %d\\n\" tup4\n\nlet rdhs () = spsp @@ rds ()\nlet rdhi () = rdhs () |> L.map atoi\n\nlet rdvs n rdf = L.init n (fun _ -> rdf ())\n\nlet rdvi n = rdvs n rdi\nlet rdvi2 n = rdvs n rdi2\nlet rdvi3 n = rdvs n rdi3\nlet rdvi4 n = rdvs n rdi4\n\nlet puts s = print_endline s\nlet putyn b = puts (if b then \"Yes\" else \"No\")\nlet puti i = puts @@ itoa i\n\nlet _ =\n  let (a,b,c,k) = rdi4 () in\n  let r =\n    if k <= a then a\n    else if k <= a + b then a\n    else a + (a + b) - k\n  in puti r;;\n\n\n", "language": "OCaml", "metadata": {"date": 1589747834, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s973440197.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s973440197", "user_id": "u970139668"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Batteries\nopen Printf\nopen Scanf\n\nlet ($) g f x = g (f x)\nlet nil = ()\n\nmodule MyList = struct\n  include List\n  let foldl = fold_left\n  let foldr = fold_right\n  \n  let flatmap f ls = concat @@ map f ls\n\n  let zipf = map2\n  let zipfi = map2i\nend\n\nmodule L = MyList\n\nlet atoi = int_of_string\nlet itoa = string_of_int\nlet atof = float_of_string\nlet ftoa = string_of_float\nlet ctoi = int_of_char\nlet itoc = char_of_int\n\nlet stocl = String.to_list\nlet cltos = String.of_list\nlet spsp s = String.split_on_char ' ' s\n\nmodule MyString = struct\n  include String\n\n  let map' f s = L.map f (stocl s)\n  let mapi' f s = L.map f (stocl s)\n\n  let zipf f a b = L.zipf f (stocl a) (stocl b)\n  let zipfi f a b = L.zipfi f (stocl a) (stocl b)\n\n  let mkstr f sep ls =\n    L.foldl (fun acc x -> acc ^ sep ^ (f x)) (f @@ L.hd ls) (List.tl ls)\nend\n\nmodule S = MyString\n\nlet tup2 a b = (a, b)\nlet tup3 a b c = (a, b, c)\nlet tup4 a b c d = (a, b, c, d)\n\nlet rds () = read_line ()\nlet rds2 () = scanf \"%s %s\\n\" tup2\n\nlet rdi () = atoi @@ rds ()\nlet rdi2 () = scanf \"%d %d\\n\" tup2\nlet rdi3 () = scanf \"%d %d %d\\n\" tup3\nlet rdi4 () = scanf \"%d %d %d %d\\n\" tup4\n\nlet rdhs () = spsp @@ rds ()\nlet rdhi () = rdhs () |> L.map atoi\n\nlet rdvs n rdf = L.init n (fun _ -> rdf ())\n\nlet rdvi n = rdvs n rdi\nlet rdvi2 n = rdvs n rdi2\nlet rdvi3 n = rdvs n rdi3\nlet rdvi4 n = rdvs n rdi4\n\nlet puts s = print_endline s\nlet putyn b = puts (if b then \"Yes\" else \"No\")\nlet puti i = puts @@ itoa i\n\nlet _ =\n  let (a,b,c,k) = rdi4 () in\n  let r =\n    if k <= a then a\n    else if k <= a + b then a\n    else a + (a + b) - k\n  in puti r;;\n\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.\n\nWe will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, B, C\n\n1 \\leq K \\leq A + B + C \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C K\n\nOutput\n\nPrint the maximum possible sum of the numbers written on the cards chosen.\n\nSample Input 1\n\n2 1 1 3\n\nSample Output 1\n\n2\n\nConsider picking up two cards with 1s and one card with a 0.\nIn this case, the sum of the numbers written on the cards is 2, which is the maximum possible value.\n\nSample Input 2\n\n1 2 3 4\n\nSample Output 2\n\n0\n\nSample Input 3\n\n2000000000 0 0 2000000000\n\nSample Output 3\n\n2000000000", "sample_input": "2 1 1 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02682", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.\n\nWe will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, B, C\n\n1 \\leq K \\leq A + B + C \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C K\n\nOutput\n\nPrint the maximum possible sum of the numbers written on the cards chosen.\n\nSample Input 1\n\n2 1 1 3\n\nSample Output 1\n\n2\n\nConsider picking up two cards with 1s and one card with a 0.\nIn this case, the sum of the numbers written on the cards is 2, which is the maximum possible value.\n\nSample Input 2\n\n1 2 3 4\n\nSample Output 2\n\n0\n\nSample Input 3\n\n2000000000 0 0 2000000000\n\nSample Output 3\n\n2000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1597, "cpu_time_ms": 14, "memory_kb": 5424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s327200174", "group_id": "codeNet:p02682", "input_text": "let rec kn a k = \n        if a <= 0 || k <= 0 then \n                0\n        else if a < k then\n                a\n        else\n                k\n\n\nlet () = Scanf.scanf \"%d %d %d %d\" (\nfun a b c k -> \n        let an = kn a k in\n        let bn = kn b (k - an) in\n        let cn = kn c (k - an - bn) in\n        an - cn\n) |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1589162089, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s327200174.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s327200174", "user_id": "u280335093"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let rec kn a k = \n        if a <= 0 || k <= 0 then \n                0\n        else if a < k then\n                a\n        else\n                k\n\n\nlet () = Scanf.scanf \"%d %d %d %d\" (\nfun a b c k -> \n        let an = kn a k in\n        let bn = kn b (k - an) in\n        let cn = kn c (k - an - bn) in\n        an - cn\n) |> Printf.printf \"%d\\n\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.\n\nWe will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, B, C\n\n1 \\leq K \\leq A + B + C \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C K\n\nOutput\n\nPrint the maximum possible sum of the numbers written on the cards chosen.\n\nSample Input 1\n\n2 1 1 3\n\nSample Output 1\n\n2\n\nConsider picking up two cards with 1s and one card with a 0.\nIn this case, the sum of the numbers written on the cards is 2, which is the maximum possible value.\n\nSample Input 2\n\n1 2 3 4\n\nSample Output 2\n\n0\n\nSample Input 3\n\n2000000000 0 0 2000000000\n\nSample Output 3\n\n2000000000", "sample_input": "2 1 1 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02682", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.\n\nWe will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, B, C\n\n1 \\leq K \\leq A + B + C \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C K\n\nOutput\n\nPrint the maximum possible sum of the numbers written on the cards chosen.\n\nSample Input 1\n\n2 1 1 3\n\nSample Output 1\n\n2\n\nConsider picking up two cards with 1s and one card with a 0.\nIn this case, the sum of the numbers written on the cards is 2, which is the maximum possible value.\n\nSample Input 2\n\n1 2 3 4\n\nSample Output 2\n\n0\n\nSample Input 3\n\n2000000000 0 0 2000000000\n\nSample Output 3\n\n2000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 342, "cpu_time_ms": 7, "memory_kb": 3844}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s177212191", "group_id": "codeNet:p02682", "input_text": "let () = Scanf.scanf \"%d %d %d %d\" @@ fun a b c k ->\n  let l = min a k in\n  let m = min b (k - l) in\n  let n = min c (k - l - m) in\n  Printf.printf \"%d\\n\" @@ l - n\n\n", "language": "OCaml", "metadata": {"date": 1589160051, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s177212191.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s177212191", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d %d\" @@ fun a b c k ->\n  let l = min a k in\n  let m = min b (k - l) in\n  let n = min c (k - l - m) in\n  Printf.printf \"%d\\n\" @@ l - n\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.\n\nWe will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, B, C\n\n1 \\leq K \\leq A + B + C \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C K\n\nOutput\n\nPrint the maximum possible sum of the numbers written on the cards chosen.\n\nSample Input 1\n\n2 1 1 3\n\nSample Output 1\n\n2\n\nConsider picking up two cards with 1s and one card with a 0.\nIn this case, the sum of the numbers written on the cards is 2, which is the maximum possible value.\n\nSample Input 2\n\n1 2 3 4\n\nSample Output 2\n\n0\n\nSample Input 3\n\n2000000000 0 0 2000000000\n\nSample Output 3\n\n2000000000", "sample_input": "2 1 1 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02682", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.\n\nWe will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, B, C\n\n1 \\leq K \\leq A + B + C \\leq 2 \\times 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C K\n\nOutput\n\nPrint the maximum possible sum of the numbers written on the cards chosen.\n\nSample Input 1\n\n2 1 1 3\n\nSample Output 1\n\n2\n\nConsider picking up two cards with 1s and one card with a 0.\nIn this case, the sum of the numbers written on the cards is 2, which is the maximum possible value.\n\nSample Input 2\n\n1 2 3 4\n\nSample Output 2\n\n0\n\nSample Input 3\n\n2000000000 0 0 2000000000\n\nSample Output 3\n\n2000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 165, "cpu_time_ms": 8, "memory_kb": 3812}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s807950301", "group_id": "codeNet:p02683", "input_text": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nmodule ModOp = struct\n  let prime = 1_000_000_007\n  let (-) a b = (a + prime - b) mod prime\n  let (+) a b = (a + b) mod prime\n  let ( * ) a b = (a * b) mod prime\n\n  let rec pow x n =\n    if n = 0 then 1\n    else if n mod 2 = 0 then pow (x*x) (n/2)\n    else x * pow (x*x) (n/2)\nend\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list ?sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list ?sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list ?sep conv);\n  arr\n\nlet atoi c = Char.code c - Char.code '0'\n\nlet rec powerset = function\n  | [] -> [[]]\n  | hd::tl ->\n    let pws =  powerset tl in\n    pws @ ListL.map pws ~f:(fun pw -> hd::pw)\n\nlet permutations l =\n  let rec interleave x = function\n    | [] -> [[x]]\n    | (hd::tl) as l ->\n      (x::l) :: (interleave x tl |> ListL.map ~f:(fun l -> hd::l)) in\n  let rec aux = function\n    | [] -> [[]]\n    | a::rest ->\n      aux rest |> ListL.map ~f:(interleave a) |> List.concat in\n  aux l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet (n,m,x) = scan \"%d %d %d\" Tuple3.make\nlet mat = scan_matrix n m ~sep:' ' 0 Int.of_string\n\nlet () =\n  ListL.map (powerset (0++^n)) ~f:(fun ls ->\n      let arr = Array.make m 0 in\n      let v = ref 0 in\n      ListL.iter ls ~f:(fun i ->\n          v := !v + mat.(i).(0);\n          ArrayL.iteri (Array.sub mat.(i) 1 (m-1)) ~f:(fun i v ->\n              arr.(i) <- arr.(i) + v\n            )\n        );\n      if ArrayL.for_all arr ~f:(fun v -> v >= x) then !v\n      else Int.max_num\n    )\n  |> List.min\n  |> (fun v -> if v = Int.max_num then -1 else v)\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1592080391, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02683.html", "problem_id": "p02683", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02683/input.txt", "sample_output_relpath": "derived/input_output/data/p02683/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02683/OCaml/s807950301.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s807950301", "user_id": "u802614675"}, "prompt_components": {"gold_output": "120\n", "input_to_evaluate": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nmodule ModOp = struct\n  let prime = 1_000_000_007\n  let (-) a b = (a + prime - b) mod prime\n  let (+) a b = (a + b) mod prime\n  let ( * ) a b = (a * b) mod prime\n\n  let rec pow x n =\n    if n = 0 then 1\n    else if n mod 2 = 0 then pow (x*x) (n/2)\n    else x * pow (x*x) (n/2)\nend\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list ?sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list ?sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list ?sep conv);\n  arr\n\nlet atoi c = Char.code c - Char.code '0'\n\nlet rec powerset = function\n  | [] -> [[]]\n  | hd::tl ->\n    let pws =  powerset tl in\n    pws @ ListL.map pws ~f:(fun pw -> hd::pw)\n\nlet permutations l =\n  let rec interleave x = function\n    | [] -> [[x]]\n    | (hd::tl) as l ->\n      (x::l) :: (interleave x tl |> ListL.map ~f:(fun l -> hd::l)) in\n  let rec aux = function\n    | [] -> [[]]\n    | a::rest ->\n      aux rest |> ListL.map ~f:(interleave a) |> List.concat in\n  aux l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet (n,m,x) = scan \"%d %d %d\" Tuple3.make\nlet mat = scan_matrix n m ~sep:' ' 0 Int.of_string\n\nlet () =\n  ListL.map (powerset (0++^n)) ~f:(fun ls ->\n      let arr = Array.make m 0 in\n      let v = ref 0 in\n      ListL.iter ls ~f:(fun i ->\n          v := !v + mat.(i).(0);\n          ArrayL.iteri (Array.sub mat.(i) 1 (m-1)) ~f:(fun i v ->\n              arr.(i) <- arr.(i) + v\n            )\n        );\n      if ArrayL.for_all arr ~f:(fun v -> v >= x) then !v\n      else Int.max_num\n    )\n  |> List.min\n  |> (fun v -> if v = Int.max_num then -1 else v)\n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 300 points\n\nProblem\n\nTakahashi, who is a novice in competitive programming, wants to learn M algorithms.\nInitially, his understanding level of each of the M algorithms is 0.\n\nTakahashi is visiting a bookstore, where he finds N books on algorithms.\nThe i-th book (1\\leq i\\leq N) is sold for C_i yen (the currency of Japan). If he buys and reads it, his understanding level of the j-th algorithm will increase by A_{i,j} for each j (1\\leq j\\leq M).\nThere is no other way to increase the understanding levels of the algorithms.\n\nTakahashi's objective is to make his understanding levels of all the M algorithms X or higher. Determine whether this objective is achievable. If it is achievable, find the minimum amount of money needed to achieve it.\n\nConstraints\n\nAll values in input are integers.\n\n1\\leq N, M\\leq 12\n\n1\\leq X\\leq 10^5\n\n1\\leq C_i \\leq 10^5\n\n0\\leq A_{i, j} \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X\nC_1 A_{1,1} A_{1,2} \\cdots A_{1,M}\nC_2 A_{2,1} A_{2,2} \\cdots A_{2,M}\n\\vdots\nC_N A_{N,1} A_{N,2} \\cdots A_{N,M}\n\nOutput\n\nIf the objective is not achievable, print -1; otherwise, print the minimum amount of money needed to achieve it.\n\nSample Input 1\n\n3 3 10\n60 2 2 4\n70 8 7 9\n50 2 3 9\n\nSample Output 1\n\n120\n\nBuying the second and third books makes his understanding levels of all the algorithms 10 or higher, at the minimum cost possible.\n\nSample Input 2\n\n3 3 10\n100 3 1 4\n100 1 5 9\n100 2 6 5\n\nSample Output 2\n\n-1\n\nBuying all the books is still not enough to make his understanding levels of all the algorithms 10 or higher.\n\nSample Input 3\n\n8 5 22\n100 3 7 5 3 1\n164 4 5 2 7 8\n334 7 2 7 2 9\n234 4 7 2 8 2\n541 5 4 3 3 6\n235 4 8 6 9 7\n394 3 6 1 6 2\n872 8 4 3 7 2\n\nSample Output 3\n\n1067", "sample_input": "3 3 10\n60 2 2 4\n70 8 7 9\n50 2 3 9\n"}, "reference_outputs": ["120\n"], "source_document_id": "p02683", "source_text": "Score : 300 points\n\nProblem\n\nTakahashi, who is a novice in competitive programming, wants to learn M algorithms.\nInitially, his understanding level of each of the M algorithms is 0.\n\nTakahashi is visiting a bookstore, where he finds N books on algorithms.\nThe i-th book (1\\leq i\\leq N) is sold for C_i yen (the currency of Japan). If he buys and reads it, his understanding level of the j-th algorithm will increase by A_{i,j} for each j (1\\leq j\\leq M).\nThere is no other way to increase the understanding levels of the algorithms.\n\nTakahashi's objective is to make his understanding levels of all the M algorithms X or higher. Determine whether this objective is achievable. If it is achievable, find the minimum amount of money needed to achieve it.\n\nConstraints\n\nAll values in input are integers.\n\n1\\leq N, M\\leq 12\n\n1\\leq X\\leq 10^5\n\n1\\leq C_i \\leq 10^5\n\n0\\leq A_{i, j} \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X\nC_1 A_{1,1} A_{1,2} \\cdots A_{1,M}\nC_2 A_{2,1} A_{2,2} \\cdots A_{2,M}\n\\vdots\nC_N A_{N,1} A_{N,2} \\cdots A_{N,M}\n\nOutput\n\nIf the objective is not achievable, print -1; otherwise, print the minimum amount of money needed to achieve it.\n\nSample Input 1\n\n3 3 10\n60 2 2 4\n70 8 7 9\n50 2 3 9\n\nSample Output 1\n\n120\n\nBuying the second and third books makes his understanding levels of all the algorithms 10 or higher, at the minimum cost possible.\n\nSample Input 2\n\n3 3 10\n100 3 1 4\n100 1 5 9\n100 2 6 5\n\nSample Output 2\n\n-1\n\nBuying all the books is still not enough to make his understanding levels of all the algorithms 10 or higher.\n\nSample Input 3\n\n8 5 22\n100 3 7 5 3 1\n164 4 5 2 7 8\n334 7 2 7 2 9\n234 4 7 2 8 2\n541 5 4 3 3 6\n235 4 8 6 9 7\n394 3 6 1 6 2\n872 8 4 3 7 2\n\nSample Output 3\n\n1067", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2661, "cpu_time_ms": 17, "memory_kb": 7740}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s857916461", "group_id": "codeNet:p02683", "input_text": "open Batteries\nopen Printf\nopen Scanf\n\nlet ($) g f x = g (f x)\n\nmodule MyList = struct\n  include List\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr = fold_right\n  let foldri = fold_righti\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\nend\n\nmodule L = MyList\n\nlet atoi = int_of_string\nlet itoa = string_of_int\nlet atof = float_of_string\nlet ftoa = string_of_float\nlet ctoi = int_of_char\nlet itoc = char_of_int\n\nlet stocl = String.to_list\nlet cltos = String.of_list\nlet spsp s = String.split_on_char ' ' s\n\nmodule MyString = struct\n  include String\n\n  let map' f s = L.map f (stocl s)\n  let mapi' f s = L.map f (stocl s)\n\n  let zipf f a b = L.zipf f (stocl a) (stocl b)\n  let zipfi f a b = L.zipfi f (stocl a) (stocl b)\n\n  let mkstr f sep ls =\n    L.foldl (fun acc x -> acc ^ sep ^ (f x)) (f @@ L.hd ls) (List.tl ls)\nend\n\nmodule S = MyString\n\nlet tup2 a b = (a, b)\nlet tup3 a b c = (a, b, c)\nlet tup4 a b c d = (a, b, c, d)\n\nlet rds () = read_line ()\nlet rds2 () = scanf \"%s %s\\n\" tup2\n\nlet rdi () = atoi @@ rds ()\nlet rdi2 () = scanf \"%d %d\\n\" tup2\nlet rdi3 () = scanf \"%d %d %d\\n\" tup3\nlet rdi4 () = scanf \"%d %d %d %d\\n\" tup4\n\nlet rdhs () = spsp @@ rds ()\nlet rdhi () = rdhs () |> L.map atoi\n\nlet rdvs n rdf = L.init n (fun _ -> rdf ())\n\nlet rdvi n = rdvs n rdi\nlet rdvi2 n = rdvs n rdi2\nlet rdvi3 n = rdvs n rdi3\nlet rdvi4 n = rdvs n rdi4\n\nlet puts s = print_endline s\nlet putyn b = puts (if b then \"Yes\" else \"No\")\nlet puti i = puts @@ itoa i\n\nlet set_power ls =\n  let rec set_power' ls pls =\n    match ls with\n    | [] -> pls\n    | hd::tl -> set_power' tl (L.flatmap (fun p -> [p; hd::p]) pls)\n  in set_power' ls [[]]\n\nlet _ =\n  let (n,m,x) = rdi3 () in\n  let cas = rdvs n rdhi in\n  print_endline \"0\";;\n", "language": "OCaml", "metadata": {"date": 1589758538, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02683.html", "problem_id": "p02683", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02683/input.txt", "sample_output_relpath": "derived/input_output/data/p02683/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02683/OCaml/s857916461.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s857916461", "user_id": "u970139668"}, "prompt_components": {"gold_output": "120\n", "input_to_evaluate": "open Batteries\nopen Printf\nopen Scanf\n\nlet ($) g f x = g (f x)\n\nmodule MyList = struct\n  include List\n  let foldl = fold_left\n  let foldli = fold_lefti\n  let foldr = fold_right\n  let foldri = fold_righti\n  \n  let flatmap = concat_map\n\n  let zipf = map2\n  let zipfi = map2i\nend\n\nmodule L = MyList\n\nlet atoi = int_of_string\nlet itoa = string_of_int\nlet atof = float_of_string\nlet ftoa = string_of_float\nlet ctoi = int_of_char\nlet itoc = char_of_int\n\nlet stocl = String.to_list\nlet cltos = String.of_list\nlet spsp s = String.split_on_char ' ' s\n\nmodule MyString = struct\n  include String\n\n  let map' f s = L.map f (stocl s)\n  let mapi' f s = L.map f (stocl s)\n\n  let zipf f a b = L.zipf f (stocl a) (stocl b)\n  let zipfi f a b = L.zipfi f (stocl a) (stocl b)\n\n  let mkstr f sep ls =\n    L.foldl (fun acc x -> acc ^ sep ^ (f x)) (f @@ L.hd ls) (List.tl ls)\nend\n\nmodule S = MyString\n\nlet tup2 a b = (a, b)\nlet tup3 a b c = (a, b, c)\nlet tup4 a b c d = (a, b, c, d)\n\nlet rds () = read_line ()\nlet rds2 () = scanf \"%s %s\\n\" tup2\n\nlet rdi () = atoi @@ rds ()\nlet rdi2 () = scanf \"%d %d\\n\" tup2\nlet rdi3 () = scanf \"%d %d %d\\n\" tup3\nlet rdi4 () = scanf \"%d %d %d %d\\n\" tup4\n\nlet rdhs () = spsp @@ rds ()\nlet rdhi () = rdhs () |> L.map atoi\n\nlet rdvs n rdf = L.init n (fun _ -> rdf ())\n\nlet rdvi n = rdvs n rdi\nlet rdvi2 n = rdvs n rdi2\nlet rdvi3 n = rdvs n rdi3\nlet rdvi4 n = rdvs n rdi4\n\nlet puts s = print_endline s\nlet putyn b = puts (if b then \"Yes\" else \"No\")\nlet puti i = puts @@ itoa i\n\nlet set_power ls =\n  let rec set_power' ls pls =\n    match ls with\n    | [] -> pls\n    | hd::tl -> set_power' tl (L.flatmap (fun p -> [p; hd::p]) pls)\n  in set_power' ls [[]]\n\nlet _ =\n  let (n,m,x) = rdi3 () in\n  let cas = rdvs n rdhi in\n  print_endline \"0\";;\n", "problem_context": "Score : 300 points\n\nProblem\n\nTakahashi, who is a novice in competitive programming, wants to learn M algorithms.\nInitially, his understanding level of each of the M algorithms is 0.\n\nTakahashi is visiting a bookstore, where he finds N books on algorithms.\nThe i-th book (1\\leq i\\leq N) is sold for C_i yen (the currency of Japan). If he buys and reads it, his understanding level of the j-th algorithm will increase by A_{i,j} for each j (1\\leq j\\leq M).\nThere is no other way to increase the understanding levels of the algorithms.\n\nTakahashi's objective is to make his understanding levels of all the M algorithms X or higher. Determine whether this objective is achievable. If it is achievable, find the minimum amount of money needed to achieve it.\n\nConstraints\n\nAll values in input are integers.\n\n1\\leq N, M\\leq 12\n\n1\\leq X\\leq 10^5\n\n1\\leq C_i \\leq 10^5\n\n0\\leq A_{i, j} \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X\nC_1 A_{1,1} A_{1,2} \\cdots A_{1,M}\nC_2 A_{2,1} A_{2,2} \\cdots A_{2,M}\n\\vdots\nC_N A_{N,1} A_{N,2} \\cdots A_{N,M}\n\nOutput\n\nIf the objective is not achievable, print -1; otherwise, print the minimum amount of money needed to achieve it.\n\nSample Input 1\n\n3 3 10\n60 2 2 4\n70 8 7 9\n50 2 3 9\n\nSample Output 1\n\n120\n\nBuying the second and third books makes his understanding levels of all the algorithms 10 or higher, at the minimum cost possible.\n\nSample Input 2\n\n3 3 10\n100 3 1 4\n100 1 5 9\n100 2 6 5\n\nSample Output 2\n\n-1\n\nBuying all the books is still not enough to make his understanding levels of all the algorithms 10 or higher.\n\nSample Input 3\n\n8 5 22\n100 3 7 5 3 1\n164 4 5 2 7 8\n334 7 2 7 2 9\n234 4 7 2 8 2\n541 5 4 3 3 6\n235 4 8 6 9 7\n394 3 6 1 6 2\n872 8 4 3 7 2\n\nSample Output 3\n\n1067", "sample_input": "3 3 10\n60 2 2 4\n70 8 7 9\n50 2 3 9\n"}, "reference_outputs": ["120\n"], "source_document_id": "p02683", "source_text": "Score : 300 points\n\nProblem\n\nTakahashi, who is a novice in competitive programming, wants to learn M algorithms.\nInitially, his understanding level of each of the M algorithms is 0.\n\nTakahashi is visiting a bookstore, where he finds N books on algorithms.\nThe i-th book (1\\leq i\\leq N) is sold for C_i yen (the currency of Japan). If he buys and reads it, his understanding level of the j-th algorithm will increase by A_{i,j} for each j (1\\leq j\\leq M).\nThere is no other way to increase the understanding levels of the algorithms.\n\nTakahashi's objective is to make his understanding levels of all the M algorithms X or higher. Determine whether this objective is achievable. If it is achievable, find the minimum amount of money needed to achieve it.\n\nConstraints\n\nAll values in input are integers.\n\n1\\leq N, M\\leq 12\n\n1\\leq X\\leq 10^5\n\n1\\leq C_i \\leq 10^5\n\n0\\leq A_{i, j} \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X\nC_1 A_{1,1} A_{1,2} \\cdots A_{1,M}\nC_2 A_{2,1} A_{2,2} \\cdots A_{2,M}\n\\vdots\nC_N A_{N,1} A_{N,2} \\cdots A_{N,M}\n\nOutput\n\nIf the objective is not achievable, print -1; otherwise, print the minimum amount of money needed to achieve it.\n\nSample Input 1\n\n3 3 10\n60 2 2 4\n70 8 7 9\n50 2 3 9\n\nSample Output 1\n\n120\n\nBuying the second and third books makes his understanding levels of all the algorithms 10 or higher, at the minimum cost possible.\n\nSample Input 2\n\n3 3 10\n100 3 1 4\n100 1 5 9\n100 2 6 5\n\nSample Output 2\n\n-1\n\nBuying all the books is still not enough to make his understanding levels of all the algorithms 10 or higher.\n\nSample Input 3\n\n8 5 22\n100 3 7 5 3 1\n164 4 5 2 7 8\n334 7 2 7 2 9\n234 4 7 2 8 2\n541 5 4 3 3 6\n235 4 8 6 9 7\n394 3 6 1 6 2\n872 8 4 3 7 2\n\nSample Output 3\n\n1067", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1745, "cpu_time_ms": 11, "memory_kb": 5352}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s946446237", "group_id": "codeNet:p02683", "input_text": "open Batteries\n(* bitの数字の2真数の時の右からn番目の数字が0か1か *)\nlet is_bit_one bit n = if bit land (1 lsl n) = 0 then false else true\nlet bit_list bit n =\n  let rec get i =\n    match i with \n    | i when i = n -> []\n    | _ -> if is_bit_one bit i then i :: get (i+1) else get (i+1)\n  in get 0\n(* 文字列をcharのlistにする *)\nlet explode s = List.init (String.length s) (String.get s)\n\nlet n, m, x = Scanf.sscanf (read_line()) \"%d %d %d\" (fun n m x -> n,m,x)\n\nlet sankousyo =\n  Array.init n @@ fun a -> let k = read_line () |> String.split_on_char ' ' |> List.map int_of_string in (List.hd k, List.tl k |> Array.of_list)\n\nlet rec up_rikaido rikaido i up_rikaido_array =\n  if i >= Array.length up_rikaido_array then rikaido else (rikaido.(i) <- rikaido.(i) + up_rikaido_array.(i); up_rikaido rikaido (i+1) up_rikaido_array)\n\nlet check target_sankousyo_array =\n  let rec check_loop i rikaido =\n    if i >= Array.length target_sankousyo_array then rikaido else\n    (\n      let _, up_rikaido_array = target_sankousyo_array.(i) in\n      check_loop (i+1) (up_rikaido rikaido 0 up_rikaido_array)\n    ) \n    in if Array.fold_left (fun a b -> if b >= x && a = true then true else false) true (check_loop 0 (Array.init m @@ fun _ -> 0)) then \n    Array.fold_left (fun a b -> let c, _ = b in a + c) 0 target_sankousyo_array else max_int\n\nlet rec get_sankousyo lst =\n  Array.init (List.length lst) @@ fun a -> sankousyo.(List.nth lst a)\n\nlet rec bit_loop bit =\n  if bit >= n * n then max_int else (\n    (* 処理 *)\n    let j = check @@ get_sankousyo @@ bit_list bit n in\n    min (j) (bit_loop (bit+1))\n  )\n\nlet p = bit_loop 0\nlet _ = Printf.printf \"%d\\n\" @@ (if p = max_int then -1 else p)", "language": "OCaml", "metadata": {"date": 1589161118, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02683.html", "problem_id": "p02683", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02683/input.txt", "sample_output_relpath": "derived/input_output/data/p02683/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02683/OCaml/s946446237.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s946446237", "user_id": "u511870776"}, "prompt_components": {"gold_output": "120\n", "input_to_evaluate": "open Batteries\n(* bitの数字の2真数の時の右からn番目の数字が0か1か *)\nlet is_bit_one bit n = if bit land (1 lsl n) = 0 then false else true\nlet bit_list bit n =\n  let rec get i =\n    match i with \n    | i when i = n -> []\n    | _ -> if is_bit_one bit i then i :: get (i+1) else get (i+1)\n  in get 0\n(* 文字列をcharのlistにする *)\nlet explode s = List.init (String.length s) (String.get s)\n\nlet n, m, x = Scanf.sscanf (read_line()) \"%d %d %d\" (fun n m x -> n,m,x)\n\nlet sankousyo =\n  Array.init n @@ fun a -> let k = read_line () |> String.split_on_char ' ' |> List.map int_of_string in (List.hd k, List.tl k |> Array.of_list)\n\nlet rec up_rikaido rikaido i up_rikaido_array =\n  if i >= Array.length up_rikaido_array then rikaido else (rikaido.(i) <- rikaido.(i) + up_rikaido_array.(i); up_rikaido rikaido (i+1) up_rikaido_array)\n\nlet check target_sankousyo_array =\n  let rec check_loop i rikaido =\n    if i >= Array.length target_sankousyo_array then rikaido else\n    (\n      let _, up_rikaido_array = target_sankousyo_array.(i) in\n      check_loop (i+1) (up_rikaido rikaido 0 up_rikaido_array)\n    ) \n    in if Array.fold_left (fun a b -> if b >= x && a = true then true else false) true (check_loop 0 (Array.init m @@ fun _ -> 0)) then \n    Array.fold_left (fun a b -> let c, _ = b in a + c) 0 target_sankousyo_array else max_int\n\nlet rec get_sankousyo lst =\n  Array.init (List.length lst) @@ fun a -> sankousyo.(List.nth lst a)\n\nlet rec bit_loop bit =\n  if bit >= n * n then max_int else (\n    (* 処理 *)\n    let j = check @@ get_sankousyo @@ bit_list bit n in\n    min (j) (bit_loop (bit+1))\n  )\n\nlet p = bit_loop 0\nlet _ = Printf.printf \"%d\\n\" @@ (if p = max_int then -1 else p)", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1709, "cpu_time_ms": 11, "memory_kb": 5540}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s460173520", "group_id": "codeNet:p02683", "input_text": "let () = Scanf.scanf \"%d %d %d\\n\" @@ fun n m x ->\n  let icass = List.init n @@ fun i ->\n    Scanf.scanf \"%d \" @@ fun c ->\n      (i, c, List.init m @@ fun _ -> Scanf.scanf \"%d \" Fun.id) in\n  let ans =\n    List.fold_left min max_int @@\n    List.init (1 lsl n) @@ fun bits ->\n      let skill = Array.make m 0 in\n      let cost =\n        List.fold_left (fun cost (i, c, as_) ->\n          if bits land (1 lsl i) = 0\n          then cost\n          else begin\n            List.iteri (fun j a ->\n              skill.(j) <- a + skill.(j)) as_;\n            c + cost\n          end) 0 icass in\n      if\n        List.for_all (( <= ) x) @@\n        Array.to_list skill\n      then cost\n      else max_int in\n  Printf.printf \"%d\\n\" @@\n  if ans = max_int then -1 else ans\n\n", "language": "OCaml", "metadata": {"date": 1589160034, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02683.html", "problem_id": "p02683", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02683/input.txt", "sample_output_relpath": "derived/input_output/data/p02683/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02683/OCaml/s460173520.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s460173520", "user_id": "u504158101"}, "prompt_components": {"gold_output": "120\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\\n\" @@ fun n m x ->\n  let icass = List.init n @@ fun i ->\n    Scanf.scanf \"%d \" @@ fun c ->\n      (i, c, List.init m @@ fun _ -> Scanf.scanf \"%d \" Fun.id) in\n  let ans =\n    List.fold_left min max_int @@\n    List.init (1 lsl n) @@ fun bits ->\n      let skill = Array.make m 0 in\n      let cost =\n        List.fold_left (fun cost (i, c, as_) ->\n          if bits land (1 lsl i) = 0\n          then cost\n          else begin\n            List.iteri (fun j a ->\n              skill.(j) <- a + skill.(j)) as_;\n            c + cost\n          end) 0 icass in\n      if\n        List.for_all (( <= ) x) @@\n        Array.to_list skill\n      then cost\n      else max_int in\n  Printf.printf \"%d\\n\" @@\n  if ans = max_int then -1 else ans\n\n", "problem_context": "Score : 300 points\n\nProblem\n\nTakahashi, who is a novice in competitive programming, wants to learn M algorithms.\nInitially, his understanding level of each of the M algorithms is 0.\n\nTakahashi is visiting a bookstore, where he finds N books on algorithms.\nThe i-th book (1\\leq i\\leq N) is sold for C_i yen (the currency of Japan). If he buys and reads it, his understanding level of the j-th algorithm will increase by A_{i,j} for each j (1\\leq j\\leq M).\nThere is no other way to increase the understanding levels of the algorithms.\n\nTakahashi's objective is to make his understanding levels of all the M algorithms X or higher. Determine whether this objective is achievable. If it is achievable, find the minimum amount of money needed to achieve it.\n\nConstraints\n\nAll values in input are integers.\n\n1\\leq N, M\\leq 12\n\n1\\leq X\\leq 10^5\n\n1\\leq C_i \\leq 10^5\n\n0\\leq A_{i, j} \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X\nC_1 A_{1,1} A_{1,2} \\cdots A_{1,M}\nC_2 A_{2,1} A_{2,2} \\cdots A_{2,M}\n\\vdots\nC_N A_{N,1} A_{N,2} \\cdots A_{N,M}\n\nOutput\n\nIf the objective is not achievable, print -1; otherwise, print the minimum amount of money needed to achieve it.\n\nSample Input 1\n\n3 3 10\n60 2 2 4\n70 8 7 9\n50 2 3 9\n\nSample Output 1\n\n120\n\nBuying the second and third books makes his understanding levels of all the algorithms 10 or higher, at the minimum cost possible.\n\nSample Input 2\n\n3 3 10\n100 3 1 4\n100 1 5 9\n100 2 6 5\n\nSample Output 2\n\n-1\n\nBuying all the books is still not enough to make his understanding levels of all the algorithms 10 or higher.\n\nSample Input 3\n\n8 5 22\n100 3 7 5 3 1\n164 4 5 2 7 8\n334 7 2 7 2 9\n234 4 7 2 8 2\n541 5 4 3 3 6\n235 4 8 6 9 7\n394 3 6 1 6 2\n872 8 4 3 7 2\n\nSample Output 3\n\n1067", "sample_input": "3 3 10\n60 2 2 4\n70 8 7 9\n50 2 3 9\n"}, "reference_outputs": ["120\n"], "source_document_id": "p02683", "source_text": "Score : 300 points\n\nProblem\n\nTakahashi, who is a novice in competitive programming, wants to learn M algorithms.\nInitially, his understanding level of each of the M algorithms is 0.\n\nTakahashi is visiting a bookstore, where he finds N books on algorithms.\nThe i-th book (1\\leq i\\leq N) is sold for C_i yen (the currency of Japan). If he buys and reads it, his understanding level of the j-th algorithm will increase by A_{i,j} for each j (1\\leq j\\leq M).\nThere is no other way to increase the understanding levels of the algorithms.\n\nTakahashi's objective is to make his understanding levels of all the M algorithms X or higher. Determine whether this objective is achievable. If it is achievable, find the minimum amount of money needed to achieve it.\n\nConstraints\n\nAll values in input are integers.\n\n1\\leq N, M\\leq 12\n\n1\\leq X\\leq 10^5\n\n1\\leq C_i \\leq 10^5\n\n0\\leq A_{i, j} \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X\nC_1 A_{1,1} A_{1,2} \\cdots A_{1,M}\nC_2 A_{2,1} A_{2,2} \\cdots A_{2,M}\n\\vdots\nC_N A_{N,1} A_{N,2} \\cdots A_{N,M}\n\nOutput\n\nIf the objective is not achievable, print -1; otherwise, print the minimum amount of money needed to achieve it.\n\nSample Input 1\n\n3 3 10\n60 2 2 4\n70 8 7 9\n50 2 3 9\n\nSample Output 1\n\n120\n\nBuying the second and third books makes his understanding levels of all the algorithms 10 or higher, at the minimum cost possible.\n\nSample Input 2\n\n3 3 10\n100 3 1 4\n100 1 5 9\n100 2 6 5\n\nSample Output 2\n\n-1\n\nBuying all the books is still not enough to make his understanding levels of all the algorithms 10 or higher.\n\nSample Input 3\n\n8 5 22\n100 3 7 5 3 1\n164 4 5 2 7 8\n334 7 2 7 2 9\n234 4 7 2 8 2\n541 5 4 3 3 6\n235 4 8 6 9 7\n394 3 6 1 6 2\n872 8 4 3 7 2\n\nSample Output 3\n\n1067", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 13, "memory_kb": 6056}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s073462406", "group_id": "codeNet:p02686", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ss =\n    Array.init n @@ fun _ ->\n      Scanf.scanf \"%s\\n\" @@ fun s ->\n        Array.fold_left (fun (m, c) -> function\n          | '(' -> (m, c + 1)\n          | ')' -> (min m (c - 1), c - 1)) (0, 0) @@\n        Array.init (String.length s) (String.get s) in\n  print_endline @@\n  if\n    ( <> ) 0 @@\n    Array.fold_right (fun (_, c) -> ( + ) c) ss 0\n  then \"No\"\n  else begin\n    Array.sort (fun (m, c) (m', c') -> compare (m' + c') (m + c)) ss;\n    try\n      ignore\n      (Array.fold_left (fun x (m, c) ->\n        if x + m < 0 || x + c < 0 then raise Not_found; x + c) 0 ss);\n      \"Yes\"\n    with Not_found -> \"No\"\n  end\n\n", "language": "OCaml", "metadata": {"date": 1589163801, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02686.html", "problem_id": "p02686", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02686/input.txt", "sample_output_relpath": "derived/input_output/data/p02686/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02686/OCaml/s073462406.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s073462406", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ss =\n    Array.init n @@ fun _ ->\n      Scanf.scanf \"%s\\n\" @@ fun s ->\n        Array.fold_left (fun (m, c) -> function\n          | '(' -> (m, c + 1)\n          | ')' -> (min m (c - 1), c - 1)) (0, 0) @@\n        Array.init (String.length s) (String.get s) in\n  print_endline @@\n  if\n    ( <> ) 0 @@\n    Array.fold_right (fun (_, c) -> ( + ) c) ss 0\n  then \"No\"\n  else begin\n    Array.sort (fun (m, c) (m', c') -> compare (m' + c') (m + c)) ss;\n    try\n      ignore\n      (Array.fold_left (fun x (m, c) ->\n        if x + m < 0 || x + c < 0 then raise Not_found; x + c) 0 ss);\n      \"Yes\"\n    with Not_found -> \"No\"\n  end\n\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nA bracket sequence is a string that is one of the following:\n\nAn empty string;\n\nThe concatenation of (, A, and ) in this order, for some bracket sequence A ;\n\nThe concatenation of A and B in this order, for some non-empty bracket sequences A and B /\n\nGiven are N strings S_i. Can a bracket sequence be formed by concatenating all the N strings in some order?\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nThe total length of the strings S_i is at most 10^6.\n\nS_i is a non-empty string consisting of ( and ).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nIf a bracket sequence can be formed by concatenating all the N strings in some order, print Yes; otherwise, print No.\n\nSample Input 1\n\n2\n)\n(()\n\nSample Output 1\n\nYes\n\nConcatenating (() and ) in this order forms a bracket sequence.\n\nSample Input 2\n\n2\n)(\n()\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n4\n((()))\n((((((\n))))))\n()()()\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n3\n(((\n)\n)\n\nSample Output 4\n\nNo", "sample_input": "2\n)\n(()\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02686", "source_text": "Score : 600 points\n\nProblem Statement\n\nA bracket sequence is a string that is one of the following:\n\nAn empty string;\n\nThe concatenation of (, A, and ) in this order, for some bracket sequence A ;\n\nThe concatenation of A and B in this order, for some non-empty bracket sequences A and B /\n\nGiven are N strings S_i. Can a bracket sequence be formed by concatenating all the N strings in some order?\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nThe total length of the strings S_i is at most 10^6.\n\nS_i is a non-empty string consisting of ( and ).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nIf a bracket sequence can be formed by concatenating all the N strings in some order, print Yes; otherwise, print No.\n\nSample Input 1\n\n2\n)\n(()\n\nSample Output 1\n\nYes\n\nConcatenating (() and ) in this order forms a bracket sequence.\n\nSample Input 2\n\n2\n)(\n()\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n4\n((()))\n((((((\n))))))\n()()()\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n3\n(((\n)\n)\n\nSample Output 4\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 665, "cpu_time_ms": 584, "memory_kb": 38540}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s595016470", "group_id": "codeNet:p02687", "input_text": "let () = \n  let s = read_line () in\n  print_endline @@\n    if s = \"ABC\"\n    then \"ARC\"\n    else \"ABC\"\n\n", "language": "OCaml", "metadata": {"date": 1591654388, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02687.html", "problem_id": "p02687", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02687/input.txt", "sample_output_relpath": "derived/input_output/data/p02687/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02687/OCaml/s595016470.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s595016470", "user_id": "u052332717"}, "prompt_components": {"gold_output": "ARC\n", "input_to_evaluate": "let () = \n  let s = read_line () in\n  print_endline @@\n    if s = \"ABC\"\n    then \"ARC\"\n    else \"ABC\"\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoder Inc. holds a contest every Saturday.\n\nThere are two types of contests called ABC and ARC, and just one of them is held at a time.\n\nThe company holds these two types of contests alternately: an ARC follows an ABC and vice versa.\n\nGiven a string S representing the type of the contest held last week, print the string representing the type of the contest held this week.\n\nConstraints\n\nS is ABC or ARC.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the string representing the type of the contest held this week.\n\nSample Input 1\n\nABC\n\nSample Output 1\n\nARC\n\nThey held an ABC last week, so they will hold an ARC this week.", "sample_input": "ABC\n"}, "reference_outputs": ["ARC\n"], "source_document_id": "p02687", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoder Inc. holds a contest every Saturday.\n\nThere are two types of contests called ABC and ARC, and just one of them is held at a time.\n\nThe company holds these two types of contests alternately: an ARC follows an ABC and vice versa.\n\nGiven a string S representing the type of the contest held last week, print the string representing the type of the contest held this week.\n\nConstraints\n\nS is ABC or ARC.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the string representing the type of the contest held this week.\n\nSample Input 1\n\nABC\n\nSample Output 1\n\nARC\n\nThey held an ABC last week, so they will hold an ARC this week.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 103, "cpu_time_ms": 9, "memory_kb": 3568}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s751275825", "group_id": "codeNet:p02688", "input_text": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list sep conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet (n, k) = scan \"%d %d\" Tuple.Tuple2.make\nlet arr = Array.make n false\n\nlet () =\n  ListL.iter (0++^k) ~f:(fun _ ->\n      let _ = scan \"%d\" id in\n      scan_list (Some ' ') Int.of_string\n      |> ListL.iter ~f:(fun i -> arr.(pred i) <- true));\n  Array.filter ((=) false) arr\n  |> Array.length\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1588728111, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02688.html", "problem_id": "p02688", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02688/input.txt", "sample_output_relpath": "derived/input_output/data/p02688/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02688/OCaml/s751275825.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s751275825", "user_id": "u802614675"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list sep conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet (n, k) = scan \"%d %d\" Tuple.Tuple2.make\nlet arr = Array.make n false\n\nlet () =\n  ListL.iter (0++^k) ~f:(fun _ ->\n      let _ = scan \"%d\" id in\n      scan_list (Some ' ') Int.of_string\n      |> ListL.iter ~f:(fun i -> arr.(pred i) <- true));\n  Array.filter ((=) false) arr\n  |> Array.length\n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nN Snukes called Snuke 1, Snuke 2, ..., Snuke N live in a town.\n\nThere are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \\cdots, A_{i, {d_i}}.\n\nTakahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 100\n\n1 \\leq d_i \\leq N\n\n1 \\leq A_{i, 1} < \\cdots < A_{i, d_i} \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nd_1\nA_{1, 1} \\cdots A_{1, d_1}\n\\vdots\nd_K\nA_{K, 1} \\cdots A_{K, d_K}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2\n2\n1 3\n1\n3\n\nSample Output 1\n\n1\n\nSnuke 1 has Snack 1.\n\nSnuke 2 has no snacks.\n\nSnuke 3 has Snack 1 and 2.\n\nThus, there will be one victim: Snuke 2.\n\nSample Input 2\n\n3 3\n1\n3\n1\n3\n1\n3\n\nSample Output 2\n\n2", "sample_input": "3 2\n2\n1 3\n1\n3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02688", "source_text": "Score : 200 points\n\nProblem Statement\n\nN Snukes called Snuke 1, Snuke 2, ..., Snuke N live in a town.\n\nThere are K kinds of snacks sold in this town, called Snack 1, Snack 2, ..., Snack K. The following d_i Snukes have Snack i: Snuke A_{i, 1}, A_{i, 2}, \\cdots, A_{i, {d_i}}.\n\nTakahashi will walk around this town and make mischief on the Snukes who have no snacks. How many Snukes will fall victim to Takahashi's mischief?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 100\n\n1 \\leq d_i \\leq N\n\n1 \\leq A_{i, 1} < \\cdots < A_{i, d_i} \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nd_1\nA_{1, 1} \\cdots A_{1, d_1}\n\\vdots\nd_K\nA_{K, 1} \\cdots A_{K, d_K}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2\n2\n1 3\n1\n3\n\nSample Output 1\n\n1\n\nSnuke 1 has Snack 1.\n\nSnuke 2 has no snacks.\n\nSnuke 3 has Snack 1 and 2.\n\nThus, there will be one victim: Snuke 2.\n\nSample Input 2\n\n3 3\n1\n3\n1\n3\n1\n3\n\nSample Output 2\n\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2148, "cpu_time_ms": 6, "memory_kb": 6308}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s444540535", "group_id": "codeNet:p02689", "input_text": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list sep conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet (n, m) = scan \"%d %d\" Tuple.Tuple2.make\nlet heights = scan_array ~sep:' ' Int.of_string\nlet routes = scan_lines m \"%d %d\" Tuple.Tuple2.make\n\nlet () =\n  let max_heights = Array.make n (-1) in\n  ListL.iter routes\n    ~f:(fun (a, b) ->\n        let a, b = pred a, pred b in\n        max_heights.(a) <- max max_heights.(a) heights.(b);\n        max_heights.(b) <- max max_heights.(b) heights.(a));\n  ArrayL.mapi heights ~f:(fun i h ->\n      if h > max_heights.(i) then 1 else 0)\n  |> Array.sum\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1588728642, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02689.html", "problem_id": "p02689", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02689/input.txt", "sample_output_relpath": "derived/input_output/data/p02689/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02689/OCaml/s444540535.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s444540535", "user_id": "u802614675"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list sep conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet (n, m) = scan \"%d %d\" Tuple.Tuple2.make\nlet heights = scan_array ~sep:' ' Int.of_string\nlet routes = scan_lines m \"%d %d\" Tuple.Tuple2.make\n\nlet () =\n  let max_heights = Array.make n (-1) in\n  ListL.iter routes\n    ~f:(fun (a, b) ->\n        let a, b = pred a, pred b in\n        max_heights.(a) <- max max_heights.(a) heights.(b);\n        max_heights.(b) <- max max_heights.(b) heights.(a));\n  ArrayL.mapi heights ~f:(fun i h ->\n      if h > max_heights.(i) then 1 else 0)\n  |> Array.sum\n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N observatories in AtCoder Hill, called Obs. 1, Obs. 2, ..., Obs. N. The elevation of Obs. i is H_i.\nThere are also M roads, each connecting two different observatories. Road j connects Obs. A_j and Obs. B_j.\n\nObs. i is said to be good when its elevation is higher than those of all observatories that can be reached from Obs. i using just one road.\nNote that Obs. i is also good when no observatory can be reached from Obs. i using just one road.\n\nHow many good observatories are there?\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\n1 \\leq A_i,B_i \\leq N\n\nA_i \\neq B_i\n\nMultiple roads may connect the same pair of observatories.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nH_1 H_2 ... H_N\nA_1 B_1\nA_2 B_2\n:\nA_M B_M\n\nOutput\n\nPrint the number of good observatories.\n\nSample Input 1\n\n4 3\n1 2 3 4\n1 3\n2 3\n2 4\n\nSample Output 1\n\n2\n\nFrom Obs. 1, you can reach Obs. 3 using just one road. The elevation of Obs. 1 is not higher than that of Obs. 3, so Obs. 1 is not good.\n\nFrom Obs. 2, you can reach Obs. 3 and 4 using just one road. The elevation of Obs. 2 is not higher than that of Obs. 3, so Obs. 2 is not good.\n\nFrom Obs. 3, you can reach Obs. 1 and 2 using just one road. The elevation of Obs. 3 is higher than those of Obs. 1 and 2, so Obs. 3 is good.\n\nFrom Obs. 4, you can reach Obs. 2 using just one road. The elevation of Obs. 4 is higher than that of Obs. 2, so Obs. 4 is good.\n\nThus, the good observatories are Obs. 3 and 4, so there are two good observatories.\n\nSample Input 2\n\n6 5\n8 6 9 1 2 1\n1 3\n4 2\n4 3\n4 6\n4 6\n\nSample Output 2\n\n3", "sample_input": "4 3\n1 2 3 4\n1 3\n2 3\n2 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02689", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N observatories in AtCoder Hill, called Obs. 1, Obs. 2, ..., Obs. N. The elevation of Obs. i is H_i.\nThere are also M roads, each connecting two different observatories. Road j connects Obs. A_j and Obs. B_j.\n\nObs. i is said to be good when its elevation is higher than those of all observatories that can be reached from Obs. i using just one road.\nNote that Obs. i is also good when no observatory can be reached from Obs. i using just one road.\n\nHow many good observatories are there?\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\n1 \\leq A_i,B_i \\leq N\n\nA_i \\neq B_i\n\nMultiple roads may connect the same pair of observatories.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nH_1 H_2 ... H_N\nA_1 B_1\nA_2 B_2\n:\nA_M B_M\n\nOutput\n\nPrint the number of good observatories.\n\nSample Input 1\n\n4 3\n1 2 3 4\n1 3\n2 3\n2 4\n\nSample Output 1\n\n2\n\nFrom Obs. 1, you can reach Obs. 3 using just one road. The elevation of Obs. 1 is not higher than that of Obs. 3, so Obs. 1 is not good.\n\nFrom Obs. 2, you can reach Obs. 3 and 4 using just one road. The elevation of Obs. 2 is not higher than that of Obs. 3, so Obs. 2 is not good.\n\nFrom Obs. 3, you can reach Obs. 1 and 2 using just one road. The elevation of Obs. 3 is higher than those of Obs. 1 and 2, so Obs. 3 is good.\n\nFrom Obs. 4, you can reach Obs. 2 using just one road. The elevation of Obs. 4 is higher than that of Obs. 2, so Obs. 4 is good.\n\nThus, the good observatories are Obs. 3 and 4, so there are two good observatories.\n\nSample Input 2\n\n6 5\n8 6 9 1 2 1\n1 3\n4 2\n4 3\n4 6\n4 6\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2345, "cpu_time_ms": 96, "memory_kb": 20612}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s398959125", "group_id": "codeNet:p02689", "input_text": "open Batteries\nclass union_find n = object (self)\n  val mutable par = ( [| |] : int array)\n  method init = \n    par <- Array.init n (fun a -> a)\n  method get_par = par\n\n  method root s = \n    let rec loop x =\n      if par.(x) = x then x else (par.(x) <- loop par.(x); par.(x))\n    in loop s\n\n  method rank s =\n    let rec loop x n =\n      if par.(x) = x then n else loop par.(x) (n+1)\n    in loop s 1\n\n  method unite x y =\n    let xrank = self#rank x in\n    let yrank = self#rank x in\n    let rx = self#root x in\n    let ry = self#root y in\n    if rx != ry then (if xrank < yrank then par.(rx) <- ry else par.(ry) <- rx)\n\n  method same x y = self#root x = self#root y\n\n  method members x = (* 要素xが属する木の全ての要素を返す *) \n    let r = self#root x in Array.fold_left (fun a y -> if self#root y = r then y :: a else a) [] par\n\n  method roots = (* 全ての根 *) Array.fold_left (fun x y -> if List.mem y x then x else y :: x) [] par\n\n  method tree_count = (* 木の数 *) List.length @@ self#roots\nend\n\nlet n, m = Scanf.sscanf (read_line()) \"%d %d\" (fun n m -> n,m)\nlet h = read_line () |> String.split_on_char ' ' |> List.map int_of_string |> Array.of_list\n\nlet tree = new union_find n\nlet _ = tree#init\n\nlet rec loop i =\n  if i >= m then () else\n  (\n    Scanf.sscanf (read_line()) \"%d %d\" (fun a b -> tree#unite (a-1) (b-1)); loop (i+1)\n  )\n\nlet _ = loop 0\n\nlet rec check_loop i ans =\n  if i >= n then ans else (\n    let i_height = h.(i) in\n    let members = tree#members i in\n    let rec check lst =\n      match lst with\n      | [] -> true\n      | first :: rest ->\n        if first = i then check rest else (\n          if i_height <= h.(first) then false else check rest\n        )\n    in if check members then check_loop (i+1) (ans+1) else check_loop (i+1) ans\n  )\n\nlet _ = Printf.printf \"%d\\n\" ((check_loop 0 0) - 1)\n\n", "language": "OCaml", "metadata": {"date": 1588555602, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02689.html", "problem_id": "p02689", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02689/input.txt", "sample_output_relpath": "derived/input_output/data/p02689/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02689/OCaml/s398959125.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s398959125", "user_id": "u511870776"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Batteries\nclass union_find n = object (self)\n  val mutable par = ( [| |] : int array)\n  method init = \n    par <- Array.init n (fun a -> a)\n  method get_par = par\n\n  method root s = \n    let rec loop x =\n      if par.(x) = x then x else (par.(x) <- loop par.(x); par.(x))\n    in loop s\n\n  method rank s =\n    let rec loop x n =\n      if par.(x) = x then n else loop par.(x) (n+1)\n    in loop s 1\n\n  method unite x y =\n    let xrank = self#rank x in\n    let yrank = self#rank x in\n    let rx = self#root x in\n    let ry = self#root y in\n    if rx != ry then (if xrank < yrank then par.(rx) <- ry else par.(ry) <- rx)\n\n  method same x y = self#root x = self#root y\n\n  method members x = (* 要素xが属する木の全ての要素を返す *) \n    let r = self#root x in Array.fold_left (fun a y -> if self#root y = r then y :: a else a) [] par\n\n  method roots = (* 全ての根 *) Array.fold_left (fun x y -> if List.mem y x then x else y :: x) [] par\n\n  method tree_count = (* 木の数 *) List.length @@ self#roots\nend\n\nlet n, m = Scanf.sscanf (read_line()) \"%d %d\" (fun n m -> n,m)\nlet h = read_line () |> String.split_on_char ' ' |> List.map int_of_string |> Array.of_list\n\nlet tree = new union_find n\nlet _ = tree#init\n\nlet rec loop i =\n  if i >= m then () else\n  (\n    Scanf.sscanf (read_line()) \"%d %d\" (fun a b -> tree#unite (a-1) (b-1)); loop (i+1)\n  )\n\nlet _ = loop 0\n\nlet rec check_loop i ans =\n  if i >= n then ans else (\n    let i_height = h.(i) in\n    let members = tree#members i in\n    let rec check lst =\n      match lst with\n      | [] -> true\n      | first :: rest ->\n        if first = i then check rest else (\n          if i_height <= h.(first) then false else check rest\n        )\n    in if check members then check_loop (i+1) (ans+1) else check_loop (i+1) ans\n  )\n\nlet _ = Printf.printf \"%d\\n\" ((check_loop 0 0) - 1)\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N observatories in AtCoder Hill, called Obs. 1, Obs. 2, ..., Obs. N. The elevation of Obs. i is H_i.\nThere are also M roads, each connecting two different observatories. Road j connects Obs. A_j and Obs. B_j.\n\nObs. i is said to be good when its elevation is higher than those of all observatories that can be reached from Obs. i using just one road.\nNote that Obs. i is also good when no observatory can be reached from Obs. i using just one road.\n\nHow many good observatories are there?\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\n1 \\leq A_i,B_i \\leq N\n\nA_i \\neq B_i\n\nMultiple roads may connect the same pair of observatories.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nH_1 H_2 ... H_N\nA_1 B_1\nA_2 B_2\n:\nA_M B_M\n\nOutput\n\nPrint the number of good observatories.\n\nSample Input 1\n\n4 3\n1 2 3 4\n1 3\n2 3\n2 4\n\nSample Output 1\n\n2\n\nFrom Obs. 1, you can reach Obs. 3 using just one road. The elevation of Obs. 1 is not higher than that of Obs. 3, so Obs. 1 is not good.\n\nFrom Obs. 2, you can reach Obs. 3 and 4 using just one road. The elevation of Obs. 2 is not higher than that of Obs. 3, so Obs. 2 is not good.\n\nFrom Obs. 3, you can reach Obs. 1 and 2 using just one road. The elevation of Obs. 3 is higher than those of Obs. 1 and 2, so Obs. 3 is good.\n\nFrom Obs. 4, you can reach Obs. 2 using just one road. The elevation of Obs. 4 is higher than that of Obs. 2, so Obs. 4 is good.\n\nThus, the good observatories are Obs. 3 and 4, so there are two good observatories.\n\nSample Input 2\n\n6 5\n8 6 9 1 2 1\n1 3\n4 2\n4 3\n4 6\n4 6\n\nSample Output 2\n\n3", "sample_input": "4 3\n1 2 3 4\n1 3\n2 3\n2 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02689", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N observatories in AtCoder Hill, called Obs. 1, Obs. 2, ..., Obs. N. The elevation of Obs. i is H_i.\nThere are also M roads, each connecting two different observatories. Road j connects Obs. A_j and Obs. B_j.\n\nObs. i is said to be good when its elevation is higher than those of all observatories that can be reached from Obs. i using just one road.\nNote that Obs. i is also good when no observatory can be reached from Obs. i using just one road.\n\nHow many good observatories are there?\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\n1 \\leq A_i,B_i \\leq N\n\nA_i \\neq B_i\n\nMultiple roads may connect the same pair of observatories.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nH_1 H_2 ... H_N\nA_1 B_1\nA_2 B_2\n:\nA_M B_M\n\nOutput\n\nPrint the number of good observatories.\n\nSample Input 1\n\n4 3\n1 2 3 4\n1 3\n2 3\n2 4\n\nSample Output 1\n\n2\n\nFrom Obs. 1, you can reach Obs. 3 using just one road. The elevation of Obs. 1 is not higher than that of Obs. 3, so Obs. 1 is not good.\n\nFrom Obs. 2, you can reach Obs. 3 and 4 using just one road. The elevation of Obs. 2 is not higher than that of Obs. 3, so Obs. 2 is not good.\n\nFrom Obs. 3, you can reach Obs. 1 and 2 using just one road. The elevation of Obs. 3 is higher than those of Obs. 1 and 2, so Obs. 3 is good.\n\nFrom Obs. 4, you can reach Obs. 2 using just one road. The elevation of Obs. 4 is higher than that of Obs. 2, so Obs. 4 is good.\n\nThus, the good observatories are Obs. 3 and 4, so there are two good observatories.\n\nSample Input 2\n\n6 5\n8 6 9 1 2 1\n1 3\n4 2\n4 3\n4 6\n4 6\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1845, "cpu_time_ms": 2206, "memory_kb": 18872}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s168076762", "group_id": "codeNet:p02690", "input_text": "module IntMap = Map.Make (struct\n  type t = int\n  let compare = compare\nend)\n\n\nlet () = Scanf.scanf \"%d\" @@ fun n ->\n  let rec pow5s acc i =\n    if n < i * i * i * i\n    then acc\n    else pow5s (IntMap.add (i * i * i * i * i) i acc) (i + 1) in\n  let pow5s = pow5s IntMap.empty 0 in\n  let Some (a, b) =\n    IntMap.fold (fun pow5a a ans ->\n      match IntMap.find_opt (abs (pow5a - n)) pow5s with\n      | None -> ans\n      | Some b -> Some (a, if pow5a - n <= 0 then ~- b else b)) pow5s None in\n  Printf.printf \"%d %d\\n\" a b\n\n\n", "language": "OCaml", "metadata": {"date": 1588562034, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02690.html", "problem_id": "p02690", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02690/input.txt", "sample_output_relpath": "derived/input_output/data/p02690/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02690/OCaml/s168076762.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s168076762", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2 -1\n", "input_to_evaluate": "module IntMap = Map.Make (struct\n  type t = int\n  let compare = compare\nend)\n\n\nlet () = Scanf.scanf \"%d\" @@ fun n ->\n  let rec pow5s acc i =\n    if n < i * i * i * i\n    then acc\n    else pow5s (IntMap.add (i * i * i * i * i) i acc) (i + 1) in\n  let pow5s = pow5s IntMap.empty 0 in\n  let Some (a, b) =\n    IntMap.fold (fun pow5a a ans ->\n      match IntMap.find_opt (abs (pow5a - n)) pow5s with\n      | None -> ans\n      | Some b -> Some (a, if pow5a - n <= 0 then ~- b else b)) pow5s None in\n  Printf.printf \"%d %d\\n\" a b\n\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGive a pair of integers (A, B) such that A^5-B^5 = X.\nIt is guaranteed that there exists such a pair for the given integer X.\n\nConstraints\n\n1 \\leq X \\leq 10^9\n\nX is an integer.\n\nThere exists a pair of integers (A, B) satisfying the condition in Problem Statement.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint A and B, with space in between.\nIf there are multiple pairs of integers (A, B) satisfying the condition, you may print any of them.\n\nA B\n\nSample Input 1\n\n33\n\nSample Output 1\n\n2 -1\n\nFor A=2 and B=-1, A^5-B^5 = 33.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0 -1", "sample_input": "33\n"}, "reference_outputs": ["2 -1\n"], "source_document_id": "p02690", "source_text": "Score : 400 points\n\nProblem Statement\n\nGive a pair of integers (A, B) such that A^5-B^5 = X.\nIt is guaranteed that there exists such a pair for the given integer X.\n\nConstraints\n\n1 \\leq X \\leq 10^9\n\nX is an integer.\n\nThere exists a pair of integers (A, B) satisfying the condition in Problem Statement.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint A and B, with space in between.\nIf there are multiple pairs of integers (A, B) satisfying the condition, you may print any of them.\n\nA B\n\nSample Input 1\n\n33\n\nSample Output 1\n\n2 -1\n\nFor A=2 and B=-1, A^5-B^5 = 33.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n0 -1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 525, "cpu_time_ms": 9, "memory_kb": 3848}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s896180004", "group_id": "codeNet:p02692", "input_text": "let rec solve a b c acc ss =\n  if a < 0 || b < 0 || c < 0 then raise Not_found;\n  match ss with\n  | [] -> acc\n  | \"AB\" :: rest ->\n      begin try solve (a + 1) (b - 1) c ('A' :: acc) rest with\n      | Not_found -> solve (a - 1) (b + 1) c ('B' :: acc) rest\n      end\n  | \"AC\" :: rest ->\n      begin try solve (a + 1) b (c - 1) ('A' :: acc) rest with\n      | Not_found -> solve (a - 1) b (c + 1) ('C' :: acc) rest\n      end\n  | \"BC\" :: rest ->\n      begin try solve a (b + 1) (c - 1) ('B' :: acc) rest with\n      | Not_found -> solve a (b - 1) (c + 1) ('C' :: acc) rest\n      end\n\nlet () = Scanf.scanf \"%d %d %d %d\\n\" @@ fun n a b c ->\n  let ss = List.init n @@ fun _ -> Scanf.scanf \"%s\\n\" Fun.id in\n  try\n    let ans = solve a b c [] ss in\n    print_endline \"Yes\";\n    List.iter (Printf.printf \"%c\\n\") (List.rev ans)\n  with Not_found -> print_endline \"No\"\n\n", "language": "OCaml", "metadata": {"date": 1588627107, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s896180004.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s896180004", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Yes\nA\nC\n", "input_to_evaluate": "let rec solve a b c acc ss =\n  if a < 0 || b < 0 || c < 0 then raise Not_found;\n  match ss with\n  | [] -> acc\n  | \"AB\" :: rest ->\n      begin try solve (a + 1) (b - 1) c ('A' :: acc) rest with\n      | Not_found -> solve (a - 1) (b + 1) c ('B' :: acc) rest\n      end\n  | \"AC\" :: rest ->\n      begin try solve (a + 1) b (c - 1) ('A' :: acc) rest with\n      | Not_found -> solve (a - 1) b (c + 1) ('C' :: acc) rest\n      end\n  | \"BC\" :: rest ->\n      begin try solve a (b + 1) (c - 1) ('B' :: acc) rest with\n      | Not_found -> solve a (b - 1) (c + 1) ('C' :: acc) rest\n      end\n\nlet () = Scanf.scanf \"%d %d %d %d\\n\" @@ fun n a b c ->\n  let ss = List.init n @@ fun _ -> Scanf.scanf \"%s\\n\" Fun.id in\n  try\n    let ans = solve a b c [] ss in\n    print_endline \"Yes\";\n    List.iter (Printf.printf \"%c\\n\") (List.rev ans)\n  with Not_found -> print_endline \"No\"\n\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 61, "memory_kb": 22564}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s377940195", "group_id": "codeNet:p02693", "input_text": "let k = Scanf.sscanf (read_line ()) \"%d\" @@ fun k -> k\nlet (a, b) = Scanf.sscanf (read_line ()) \"%d %d\" @@ fun a b -> (a, b)\n\nlet () = print_endline @@ if k - 1 <= b - a then \"OK\" else \"NG\"", "language": "OCaml", "metadata": {"date": 1592690420, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02693.html", "problem_id": "p02693", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02693/input.txt", "sample_output_relpath": "derived/input_output/data/p02693/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02693/OCaml/s377940195.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s377940195", "user_id": "u811309788"}, "prompt_components": {"gold_output": "OK\n", "input_to_evaluate": "let k = Scanf.sscanf (read_line ()) \"%d\" @@ fun k -> k\nlet (a, b) = Scanf.sscanf (read_line ()) \"%d %d\" @@ fun a b -> (a, b)\n\nlet () = print_endline @@ if k - 1 <= b - a then \"OK\" else \"NG\"", "problem_context": "Score: 100 points\n\nProblem Statement\n\nTakahashi the Jumbo will practice golf.\n\nHis objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 1000\n\n1 \\leq K \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nA B\n\nOutput\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nSample Input 1\n\n7\n500 600\n\nSample Output 1\n\nOK\n\nAmong the multiples of 7, for example, 567 lies between 500 and 600.\n\nSample Input 2\n\n4\n5 7\n\nSample Output 2\n\nNG\n\nNo multiple of 4 lies between 5 and 7.\n\nSample Input 3\n\n1\n11 11\n\nSample Output 3\n\nOK", "sample_input": "7\n500 600\n"}, "reference_outputs": ["OK\n"], "source_document_id": "p02693", "source_text": "Score: 100 points\n\nProblem Statement\n\nTakahashi the Jumbo will practice golf.\n\nHis objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 1000\n\n1 \\leq K \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nA B\n\nOutput\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nSample Input 1\n\n7\n500 600\n\nSample Output 1\n\nOK\n\nAmong the multiples of 7, for example, 567 lies between 500 and 600.\n\nSample Input 2\n\n4\n5 7\n\nSample Output 2\n\nNG\n\nNo multiple of 4 lies between 5 and 7.\n\nSample Input 3\n\n1\n11 11\n\nSample Output 3\n\nOK", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 189, "cpu_time_ms": 7, "memory_kb": 3712}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s714762298", "group_id": "codeNet:p02693", "input_text": "let () =\n  let k = int_of_string @@ read_line () in\n  Scanf.scanf \"%d %d\" @@ \n    fun a b -> let n = (a+k-1) / k in\n    if k*n <= b \n    then print_endline \"OK\"\n    else print_endline \"NG\"\n\n", "language": "OCaml", "metadata": {"date": 1591655145, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02693.html", "problem_id": "p02693", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02693/input.txt", "sample_output_relpath": "derived/input_output/data/p02693/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02693/OCaml/s714762298.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s714762298", "user_id": "u052332717"}, "prompt_components": {"gold_output": "OK\n", "input_to_evaluate": "let () =\n  let k = int_of_string @@ read_line () in\n  Scanf.scanf \"%d %d\" @@ \n    fun a b -> let n = (a+k-1) / k in\n    if k*n <= b \n    then print_endline \"OK\"\n    else print_endline \"NG\"\n\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nTakahashi the Jumbo will practice golf.\n\nHis objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 1000\n\n1 \\leq K \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nA B\n\nOutput\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nSample Input 1\n\n7\n500 600\n\nSample Output 1\n\nOK\n\nAmong the multiples of 7, for example, 567 lies between 500 and 600.\n\nSample Input 2\n\n4\n5 7\n\nSample Output 2\n\nNG\n\nNo multiple of 4 lies between 5 and 7.\n\nSample Input 3\n\n1\n11 11\n\nSample Output 3\n\nOK", "sample_input": "7\n500 600\n"}, "reference_outputs": ["OK\n"], "source_document_id": "p02693", "source_text": "Score: 100 points\n\nProblem Statement\n\nTakahashi the Jumbo will practice golf.\n\nHis objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 1000\n\n1 \\leq K \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nA B\n\nOutput\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nSample Input 1\n\n7\n500 600\n\nSample Output 1\n\nOK\n\nAmong the multiples of 7, for example, 567 lies between 500 and 600.\n\nSample Input 2\n\n4\n5 7\n\nSample Output 2\n\nNG\n\nNo multiple of 4 lies between 5 and 7.\n\nSample Input 3\n\n1\n11 11\n\nSample Output 3\n\nOK", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 190, "cpu_time_ms": 2, "memory_kb": 3688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s224439901", "group_id": "codeNet:p02693", "input_text": "let k = read_int ()\nlet a, b = Scanf.scanf \"%d %d\\n\" @@ fun a b -> a, b\nlet ans = if a mod k = 0 || a/k*a+k <= b || b mod k = 0 then \"OK\" else \"NG\"\nlet () = print_endline ans", "language": "OCaml", "metadata": {"date": 1588468772, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02693.html", "problem_id": "p02693", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02693/input.txt", "sample_output_relpath": "derived/input_output/data/p02693/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02693/OCaml/s224439901.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s224439901", "user_id": "u307426615"}, "prompt_components": {"gold_output": "OK\n", "input_to_evaluate": "let k = read_int ()\nlet a, b = Scanf.scanf \"%d %d\\n\" @@ fun a b -> a, b\nlet ans = if a mod k = 0 || a/k*a+k <= b || b mod k = 0 then \"OK\" else \"NG\"\nlet () = print_endline ans", "problem_context": "Score: 100 points\n\nProblem Statement\n\nTakahashi the Jumbo will practice golf.\n\nHis objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 1000\n\n1 \\leq K \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nA B\n\nOutput\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nSample Input 1\n\n7\n500 600\n\nSample Output 1\n\nOK\n\nAmong the multiples of 7, for example, 567 lies between 500 and 600.\n\nSample Input 2\n\n4\n5 7\n\nSample Output 2\n\nNG\n\nNo multiple of 4 lies between 5 and 7.\n\nSample Input 3\n\n1\n11 11\n\nSample Output 3\n\nOK", "sample_input": "7\n500 600\n"}, "reference_outputs": ["OK\n"], "source_document_id": "p02693", "source_text": "Score: 100 points\n\nProblem Statement\n\nTakahashi the Jumbo will practice golf.\n\nHis objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 1000\n\n1 \\leq K \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nA B\n\nOutput\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nSample Input 1\n\n7\n500 600\n\nSample Output 1\n\nOK\n\nAmong the multiples of 7, for example, 567 lies between 500 and 600.\n\nSample Input 2\n\n4\n5 7\n\nSample Output 2\n\nNG\n\nNo multiple of 4 lies between 5 and 7.\n\nSample Input 3\n\n1\n11 11\n\nSample Output 3\n\nOK", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 174, "cpu_time_ms": 7, "memory_kb": 3700}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s499500194", "group_id": "codeNet:p02694", "input_text": "Scanf.scanf \"%d\" (fun x ->\n    let rec loop i acc =\n        if acc >= x then i else\n            loop (i + 1) (acc + acc / 100)\n    in\n    loop 0 100 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1588475428, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s499500194.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s499500194", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun x ->\n    let rec loop i acc =\n        if acc >= x then i else\n            loop (i + 1) (acc + acc / 100)\n    in\n    loop 0 100 |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has a deposit of 100 yen (the currency of Japan) in AtCoder Bank.\n\nThe bank pays an annual interest rate of 1 % compounded annually. (A fraction of less than one yen is discarded.)\n\nAssuming that nothing other than the interest affects Takahashi's balance, in how many years does the balance reach X yen or above for the first time?\n\nConstraints\n\n101 \\le X \\le 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the number of years it takes for Takahashi's balance to reach X yen or above for the first time.\n\nSample Input 1\n\n103\n\nSample Output 1\n\n3\n\nThe balance after one year is 101 yen.\n\nThe balance after two years is 102 yen.\n\nThe balance after three years is 103 yen.\n\nThus, it takes three years for the balance to reach 103 yen or above.\n\nSample Input 2\n\n1000000000000000000\n\nSample Output 2\n\n3760\n\nSample Input 3\n\n1333333333\n\nSample Output 3\n\n1706", "sample_input": "103\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02694", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has a deposit of 100 yen (the currency of Japan) in AtCoder Bank.\n\nThe bank pays an annual interest rate of 1 % compounded annually. (A fraction of less than one yen is discarded.)\n\nAssuming that nothing other than the interest affects Takahashi's balance, in how many years does the balance reach X yen or above for the first time?\n\nConstraints\n\n101 \\le X \\le 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the number of years it takes for Takahashi's balance to reach X yen or above for the first time.\n\nSample Input 1\n\n103\n\nSample Output 1\n\n3\n\nThe balance after one year is 101 yen.\n\nThe balance after two years is 102 yen.\n\nThe balance after three years is 103 yen.\n\nThus, it takes three years for the balance to reach 103 yen or above.\n\nSample Input 2\n\n1000000000000000000\n\nSample Output 2\n\n3760\n\nSample Input 3\n\n1333333333\n\nSample Output 3\n\n1706", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 174, "cpu_time_ms": 8, "memory_kb": 3832}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s889791362", "group_id": "codeNet:p02694", "input_text": "let () = Scanf.scanf \"%d\" @@ fun x ->\n  let cache = Array.make 5000 0 in\n  cache.(0) <- 100;\n  for i = 0 to 4998 do\n    cache.(i + 1) <- cache.(i) + cache.(i) / 100\n  done;\n  Printf.printf \"%d\\n\" @@\n  List.find (fun i -> x <= cache.(i)) @@\n  List.init 5000 Fun.id\n\n", "language": "OCaml", "metadata": {"date": 1588470561, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s889791362.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s889791362", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\" @@ fun x ->\n  let cache = Array.make 5000 0 in\n  cache.(0) <- 100;\n  for i = 0 to 4998 do\n    cache.(i + 1) <- cache.(i) + cache.(i) / 100\n  done;\n  Printf.printf \"%d\\n\" @@\n  List.find (fun i -> x <= cache.(i)) @@\n  List.init 5000 Fun.id\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has a deposit of 100 yen (the currency of Japan) in AtCoder Bank.\n\nThe bank pays an annual interest rate of 1 % compounded annually. (A fraction of less than one yen is discarded.)\n\nAssuming that nothing other than the interest affects Takahashi's balance, in how many years does the balance reach X yen or above for the first time?\n\nConstraints\n\n101 \\le X \\le 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the number of years it takes for Takahashi's balance to reach X yen or above for the first time.\n\nSample Input 1\n\n103\n\nSample Output 1\n\n3\n\nThe balance after one year is 101 yen.\n\nThe balance after two years is 102 yen.\n\nThe balance after three years is 103 yen.\n\nThus, it takes three years for the balance to reach 103 yen or above.\n\nSample Input 2\n\n1000000000000000000\n\nSample Output 2\n\n3760\n\nSample Input 3\n\n1333333333\n\nSample Output 3\n\n1706", "sample_input": "103\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02694", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has a deposit of 100 yen (the currency of Japan) in AtCoder Bank.\n\nThe bank pays an annual interest rate of 1 % compounded annually. (A fraction of less than one yen is discarded.)\n\nAssuming that nothing other than the interest affects Takahashi's balance, in how many years does the balance reach X yen or above for the first time?\n\nConstraints\n\n101 \\le X \\le 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the number of years it takes for Takahashi's balance to reach X yen or above for the first time.\n\nSample Input 1\n\n103\n\nSample Output 1\n\n3\n\nThe balance after one year is 101 yen.\n\nThe balance after two years is 102 yen.\n\nThe balance after three years is 103 yen.\n\nThus, it takes three years for the balance to reach 103 yen or above.\n\nSample Input 2\n\n1000000000000000000\n\nSample Output 2\n\n3760\n\nSample Input 3\n\n1333333333\n\nSample Output 3\n\n1706", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 265, "cpu_time_ms": 14, "memory_kb": 4236}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s898386808", "group_id": "codeNet:p02696", "input_text": "let a, b, n = Scanf.scanf \"%f %f %f\\n\" @@ fun a b c -> a, b, c\nlet rec f x m =\n  let nm = (floor (a*.x/.b)) -. a*.(floor(x/.b)) in\n  if x < 0. then m\n  else if nm >= m then f (x-.1.) nm\n  else f (x-.1.) m\nlet () = print_int (int_of_float (f n 0.))", "language": "OCaml", "metadata": {"date": 1588469861, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02696.html", "problem_id": "p02696", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02696/input.txt", "sample_output_relpath": "derived/input_output/data/p02696/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02696/OCaml/s898386808.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s898386808", "user_id": "u307426615"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let a, b, n = Scanf.scanf \"%f %f %f\\n\" @@ fun a b c -> a, b, c\nlet rec f x m =\n  let nm = (floor (a*.x/.b)) -. a*.(floor(x/.b)) in\n  if x < 0. then m\n  else if nm >= m then f (x-.1.) nm\n  else f (x-.1.) m\nlet () = print_int (int_of_float (f n 0.))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are integers A, B, and N.\n\nFind the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N.\n\nHere floor(t) denotes the greatest integer not greater than the real number t.\n\nConstraints\n\n1 ≤ A ≤ 10^{6}\n\n1 ≤ B ≤ 10^{12}\n\n1 ≤ N ≤ 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B N\n\nOutput\n\nPrint the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N, as an integer.\n\nSample Input 1\n\n5 7 4\n\nSample Output 1\n\n2\n\nWhen x=3, floor(Ax/B)-A×floor(x/B) = floor(15/7) - 5×floor(3/7) = 2. This is the maximum value possible.\n\nSample Input 2\n\n11 10 9\n\nSample Output 2\n\n9", "sample_input": "5 7 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02696", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are integers A, B, and N.\n\nFind the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N.\n\nHere floor(t) denotes the greatest integer not greater than the real number t.\n\nConstraints\n\n1 ≤ A ≤ 10^{6}\n\n1 ≤ B ≤ 10^{12}\n\n1 ≤ N ≤ 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B N\n\nOutput\n\nPrint the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N, as an integer.\n\nSample Input 1\n\n5 7 4\n\nSample Output 1\n\n2\n\nWhen x=3, floor(Ax/B)-A×floor(x/B) = floor(15/7) - 5×floor(3/7) = 2. This is the maximum value possible.\n\nSample Input 2\n\n11 10 9\n\nSample Output 2\n\n9", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 247, "cpu_time_ms": 2205, "memory_kb": 5896}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s005045154", "group_id": "codeNet:p02697", "input_text": "Scanf.scanf \"%d %d\" (fun n m ->\n    let k = if n mod 2 = 0 then n else n + 1 in\n    for i = 1 to m do\n        Printf.printf \"%d %d\\n\" i (k - i)\n    done\n)", "language": "OCaml", "metadata": {"date": 1588478779, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02697.html", "problem_id": "p02697", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02697/input.txt", "sample_output_relpath": "derived/input_output/data/p02697/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02697/OCaml/s005045154.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s005045154", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2 3\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n m ->\n    let k = if n mod 2 = 0 then n else n + 1 in\n    for i = 1 to m do\n        Printf.printf \"%d %d\\n\" i (k - i)\n    done\n)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are going to hold a competition of one-to-one game called AtCoder Janken. (Janken is the Japanese name for Rock-paper-scissors.)\nN players will participate in this competition, and they are given distinct integers from 1 through N.\nThe arena has M playing fields for two players. You need to assign each playing field two distinct integers between 1 and N (inclusive).\nYou cannot assign the same integer to multiple playing fields.\nThe competition consists of N rounds, each of which proceeds as follows:\n\nFor each player, if there is a playing field that is assigned the player's integer, the player goes to that field and fight the other player who comes there.\n\nThen, each player adds 1 to its integer. If it becomes N+1, change it to 1.\n\nYou want to ensure that no player fights the same opponent more than once during the N rounds.\nPrint an assignment of integers to the playing fields satisfying this condition.\nIt can be proved that such an assignment always exists under the constraints given.\n\nConstraints\n\n1 \\leq M\n\nM \\times 2 +1 \\leq N \\leq 200000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint M lines in the format below.\nThe i-th line should contain the two integers a_i and b_i assigned to the i-th playing field.\n\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nSample Input 1\n\n4 1\n\nSample Output 1\n\n2 3\n\nLet us call the four players A, B, C, and D, and assume that they are initially given the integers 1, 2, 3, and 4, respectively.\n\nThe 1-st round is fought by B and C, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 2, 3, 4, and 1, respectively.\n\nThe 2-nd round is fought by A and B, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 3, 4, 1, and 2, respectively.\n\nThe 3-rd round is fought by D and A, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 4, 1, 2, and 3, respectively.\n\nThe 4-th round is fought by C and D, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 1, 2, 3, and 4, respectively.\n\nNo player fights the same opponent more than once during the four rounds, so this solution will be accepted.\n\nSample Input 2\n\n7 3\n\nSample Output 2\n\n1 6\n2 5\n3 4", "sample_input": "4 1\n"}, "reference_outputs": ["2 3\n"], "source_document_id": "p02697", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are going to hold a competition of one-to-one game called AtCoder Janken. (Janken is the Japanese name for Rock-paper-scissors.)\nN players will participate in this competition, and they are given distinct integers from 1 through N.\nThe arena has M playing fields for two players. You need to assign each playing field two distinct integers between 1 and N (inclusive).\nYou cannot assign the same integer to multiple playing fields.\nThe competition consists of N rounds, each of which proceeds as follows:\n\nFor each player, if there is a playing field that is assigned the player's integer, the player goes to that field and fight the other player who comes there.\n\nThen, each player adds 1 to its integer. If it becomes N+1, change it to 1.\n\nYou want to ensure that no player fights the same opponent more than once during the N rounds.\nPrint an assignment of integers to the playing fields satisfying this condition.\nIt can be proved that such an assignment always exists under the constraints given.\n\nConstraints\n\n1 \\leq M\n\nM \\times 2 +1 \\leq N \\leq 200000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint M lines in the format below.\nThe i-th line should contain the two integers a_i and b_i assigned to the i-th playing field.\n\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nSample Input 1\n\n4 1\n\nSample Output 1\n\n2 3\n\nLet us call the four players A, B, C, and D, and assume that they are initially given the integers 1, 2, 3, and 4, respectively.\n\nThe 1-st round is fought by B and C, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 2, 3, 4, and 1, respectively.\n\nThe 2-nd round is fought by A and B, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 3, 4, 1, and 2, respectively.\n\nThe 3-rd round is fought by D and A, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 4, 1, 2, and 3, respectively.\n\nThe 4-th round is fought by C and D, who has the integers 2 and 3, respectively. After this round, A, B, C, and D have the integers 1, 2, 3, and 4, respectively.\n\nNo player fights the same opponent more than once during the four rounds, so this solution will be accepted.\n\nSample Input 2\n\n7 3\n\nSample Output 2\n\n1 6\n2 5\n3 4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 154, "cpu_time_ms": 42, "memory_kb": 5920}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s988767387", "group_id": "codeNet:p02699", "input_text": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nmodule ModOp = struct\n  let prime = 1_000_000_007\n  let (-) a b = (a + prime - b) mod prime\n  let (+) a b = (a + b) mod prime\n  let ( * ) a b = (a * b) mod prime\n\n  let rec pow x n =\n    if n = 0 then 1\n    else if n mod 2 = 0 then pow (x*x) (n/2)\n    else x * pow (x*x) (n/2)\nend\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list ?sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list ?sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list ?sep conv);\n  arr\n\nlet atoi c = Char.code c - Char.code '0'\n\nlet rec powerset = function\n  | [] -> [[]]\n  | hd::tl ->\n    let pws =  powerset tl in\n    pws @ ListL.map pws ~f:(fun pw -> hd::pw)\n\nlet permutations l =\n  let rec interleave x = function\n    | [] -> [[x]]\n    | (hd::tl) as l ->\n      (x::l) :: (interleave x tl |> ListL.map ~f:(fun l -> hd::l)) in\n  let rec aux = function\n    | [] -> [[]]\n    | a::rest ->\n      aux rest |> ListL.map ~f:(interleave a) |> List.concat in\n  aux l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet (s, w) = scan \"%d %d\" Tuple2.make\n\nlet () =\n  if w >= s then Printf.printf \"unsafe\\n\"\n  else Printf.printf \"safe\\n\"\n", "language": "OCaml", "metadata": {"date": 1592089689, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02699.html", "problem_id": "p02699", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02699/input.txt", "sample_output_relpath": "derived/input_output/data/p02699/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02699/OCaml/s988767387.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s988767387", "user_id": "u802614675"}, "prompt_components": {"gold_output": "unsafe\n", "input_to_evaluate": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nmodule ModOp = struct\n  let prime = 1_000_000_007\n  let (-) a b = (a + prime - b) mod prime\n  let (+) a b = (a + b) mod prime\n  let ( * ) a b = (a * b) mod prime\n\n  let rec pow x n =\n    if n = 0 then 1\n    else if n mod 2 = 0 then pow (x*x) (n/2)\n    else x * pow (x*x) (n/2)\nend\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list ?sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list ?sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list ?sep conv);\n  arr\n\nlet atoi c = Char.code c - Char.code '0'\n\nlet rec powerset = function\n  | [] -> [[]]\n  | hd::tl ->\n    let pws =  powerset tl in\n    pws @ ListL.map pws ~f:(fun pw -> hd::pw)\n\nlet permutations l =\n  let rec interleave x = function\n    | [] -> [[x]]\n    | (hd::tl) as l ->\n      (x::l) :: (interleave x tl |> ListL.map ~f:(fun l -> hd::l)) in\n  let rec aux = function\n    | [] -> [[]]\n    | a::rest ->\n      aux rest |> ListL.map ~f:(interleave a) |> List.concat in\n  aux l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet (s, w) = scan \"%d %d\" Tuple2.make\n\nlet () =\n  if w >= s then Printf.printf \"unsafe\\n\"\n  else Printf.printf \"safe\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are S sheep and W wolves.\n\nIf the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nConstraints\n\n1 \\leq S \\leq 100\n\n1 \\leq W \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS W\n\nOutput\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\nunsafe\n\nThere are four sheep and five wolves. The number of wolves is not less than that of sheep, so they will attack them.\n\nSample Input 2\n\n100 2\n\nSample Output 2\n\nsafe\n\nMany a sheep drive away two wolves.\n\nSample Input 3\n\n10 10\n\nSample Output 3\n\nunsafe", "sample_input": "4 5\n"}, "reference_outputs": ["unsafe\n"], "source_document_id": "p02699", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are S sheep and W wolves.\n\nIf the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nConstraints\n\n1 \\leq S \\leq 100\n\n1 \\leq W \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS W\n\nOutput\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\nunsafe\n\nThere are four sheep and five wolves. The number of wolves is not less than that of sheep, so they will attack them.\n\nSample Input 2\n\n100 2\n\nSample Output 2\n\nsafe\n\nMany a sheep drive away two wolves.\n\nSample Input 3\n\n10 10\n\nSample Output 3\n\nunsafe", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2206, "cpu_time_ms": 8, "memory_kb": 5368}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s244762229", "group_id": "codeNet:p02699", "input_text": "let () = Scanf.scanf \"%d %d\" @@ fun s w ->\n  print_endline @@\n    if s <= w\n    then \"unsafe\"\n    else \"safe\"", "language": "OCaml", "metadata": {"date": 1591764196, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02699.html", "problem_id": "p02699", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02699/input.txt", "sample_output_relpath": "derived/input_output/data/p02699/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02699/OCaml/s244762229.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s244762229", "user_id": "u052332717"}, "prompt_components": {"gold_output": "unsafe\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\" @@ fun s w ->\n  print_endline @@\n    if s <= w\n    then \"unsafe\"\n    else \"safe\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are S sheep and W wolves.\n\nIf the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nConstraints\n\n1 \\leq S \\leq 100\n\n1 \\leq W \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS W\n\nOutput\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\nunsafe\n\nThere are four sheep and five wolves. The number of wolves is not less than that of sheep, so they will attack them.\n\nSample Input 2\n\n100 2\n\nSample Output 2\n\nsafe\n\nMany a sheep drive away two wolves.\n\nSample Input 3\n\n10 10\n\nSample Output 3\n\nunsafe", "sample_input": "4 5\n"}, "reference_outputs": ["unsafe\n"], "source_document_id": "p02699", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are S sheep and W wolves.\n\nIf the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nConstraints\n\n1 \\leq S \\leq 100\n\n1 \\leq W \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS W\n\nOutput\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\nunsafe\n\nThere are four sheep and five wolves. The number of wolves is not less than that of sheep, so they will attack them.\n\nSample Input 2\n\n100 2\n\nSample Output 2\n\nsafe\n\nMany a sheep drive away two wolves.\n\nSample Input 3\n\n10 10\n\nSample Output 3\n\nunsafe", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 109, "cpu_time_ms": 7, "memory_kb": 3712}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s360349609", "group_id": "codeNet:p02699", "input_text": "let s, w = Scanf.scanf \"%d %d\\n\" @@ fun a b -> a, b\nlet ans = if w >= s then \"unsafe\" else \"safe\"\nlet () = print_endline ans", "language": "OCaml", "metadata": {"date": 1588517637, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02699.html", "problem_id": "p02699", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02699/input.txt", "sample_output_relpath": "derived/input_output/data/p02699/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02699/OCaml/s360349609.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s360349609", "user_id": "u307426615"}, "prompt_components": {"gold_output": "unsafe\n", "input_to_evaluate": "let s, w = Scanf.scanf \"%d %d\\n\" @@ fun a b -> a, b\nlet ans = if w >= s then \"unsafe\" else \"safe\"\nlet () = print_endline ans", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are S sheep and W wolves.\n\nIf the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nConstraints\n\n1 \\leq S \\leq 100\n\n1 \\leq W \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS W\n\nOutput\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\nunsafe\n\nThere are four sheep and five wolves. The number of wolves is not less than that of sheep, so they will attack them.\n\nSample Input 2\n\n100 2\n\nSample Output 2\n\nsafe\n\nMany a sheep drive away two wolves.\n\nSample Input 3\n\n10 10\n\nSample Output 3\n\nunsafe", "sample_input": "4 5\n"}, "reference_outputs": ["unsafe\n"], "source_document_id": "p02699", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are S sheep and W wolves.\n\nIf the number of wolves is greater than or equal to that of sheep, the wolves will attack the sheep.\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nConstraints\n\n1 \\leq S \\leq 100\n\n1 \\leq W \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS W\n\nOutput\n\nIf the wolves will attack the sheep, print unsafe; otherwise, print safe.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\nunsafe\n\nThere are four sheep and five wolves. The number of wolves is not less than that of sheep, so they will attack them.\n\nSample Input 2\n\n100 2\n\nSample Output 2\n\nsafe\n\nMany a sheep drive away two wolves.\n\nSample Input 3\n\n10 10\n\nSample Output 3\n\nunsafe", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 124, "cpu_time_ms": 7, "memory_kb": 3700}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s475239548", "group_id": "codeNet:p02701", "input_text": "let n = read_int()\n\nmodule SS = Set.Make(String)\n\nlet rec f i ans set =\n  if i = n then ans\n  else\n    let s = read_line () in\n    if SS.mem s set then f (i + 1) ans set\n    else f (i + 1) (ans + 1) (SS.add s set)\n\nlet () = print_int (f 0 0 SS.empty)\n", "language": "OCaml", "metadata": {"date": 1596680833, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02701.html", "problem_id": "p02701", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02701/input.txt", "sample_output_relpath": "derived/input_output/data/p02701/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02701/OCaml/s475239548.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s475239548", "user_id": "u752907799"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let n = read_int()\n\nmodule SS = Set.Make(String)\n\nlet rec f i ans set =\n  if i = n then ans\n  else\n    let s = read_line () in\n    if SS.mem s set then f (i + 1) ans set\n    else f (i + 1) (ans + 1) (SS.add s set)\n\nlet () = print_int (f 0 0 SS.empty)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.\n\nHow many kinds of items did you get?\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS_i consists of lowercase English letters and has a length between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint the number of kinds of items you got.\n\nSample Input 1\n\n3\napple\norange\napple\n\nSample Output 1\n\n2\n\nYou got two kinds of items: apple and orange.\n\nSample Input 2\n\n5\ngrape\ngrape\ngrape\ngrape\ngrape\n\nSample Output 2\n\n1\n\nSample Input 3\n\n4\naaaa\na\naaa\naa\n\nSample Output 3\n\n4", "sample_input": "3\napple\norange\napple\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02701", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.\n\nHow many kinds of items did you get?\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS_i consists of lowercase English letters and has a length between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint the number of kinds of items you got.\n\nSample Input 1\n\n3\napple\norange\napple\n\nSample Output 1\n\n2\n\nYou got two kinds of items: apple and orange.\n\nSample Input 2\n\n5\ngrape\ngrape\ngrape\ngrape\ngrape\n\nSample Output 2\n\n1\n\nSample Input 3\n\n4\naaaa\na\naaa\naa\n\nSample Output 3\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 251, "cpu_time_ms": 375, "memory_kb": 29348}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s762670222", "group_id": "codeNet:p02701", "input_text": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list sep conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet n = scan \"%d\" id\nlet ls = scan_lines n \"%s\" id\n\nlet () =\n  let h = Hashtbl.create n in\n  ListL.iter ls ~f:(fun s ->\n      Hashtbl.add h s true);\n  Printf.printf \"%d\\n\" @@ Hashtbl.length h\n", "language": "OCaml", "metadata": {"date": 1589060480, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02701.html", "problem_id": "p02701", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02701/input.txt", "sample_output_relpath": "derived/input_output/data/p02701/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02701/OCaml/s762670222.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s762670222", "user_id": "u802614675"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list sep conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet n = scan \"%d\" id\nlet ls = scan_lines n \"%s\" id\n\nlet () =\n  let h = Hashtbl.create n in\n  ListL.iter ls ~f:(fun s ->\n      Hashtbl.add h s true);\n  Printf.printf \"%d\\n\" @@ Hashtbl.length h\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.\n\nHow many kinds of items did you get?\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS_i consists of lowercase English letters and has a length between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint the number of kinds of items you got.\n\nSample Input 1\n\n3\napple\norange\napple\n\nSample Output 1\n\n2\n\nYou got two kinds of items: apple and orange.\n\nSample Input 2\n\n5\ngrape\ngrape\ngrape\ngrape\ngrape\n\nSample Output 2\n\n1\n\nSample Input 3\n\n4\naaaa\na\naaa\naa\n\nSample Output 3\n\n4", "sample_input": "3\napple\norange\napple\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02701", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou drew lottery N times. In the i-th draw, you got an item of the kind represented by a string S_i.\n\nHow many kinds of items did you get?\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS_i consists of lowercase English letters and has a length between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint the number of kinds of items you got.\n\nSample Input 1\n\n3\napple\norange\napple\n\nSample Output 1\n\n2\n\nYou got two kinds of items: apple and orange.\n\nSample Input 2\n\n5\ngrape\ngrape\ngrape\ngrape\ngrape\n\nSample Output 2\n\n1\n\nSample Input 3\n\n4\naaaa\na\naaa\naa\n\nSample Output 3\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2193, "cpu_time_ms": 147, "memory_kb": 28432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s023688838", "group_id": "codeNet:p02706", "input_text": "let split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\nlet n, m = Scanf.sscanf (read_line ()) \"%d %d\" @@ fun n m -> (n, m)\nlet a = read_line () |> split_string ~pattern:\" \" |> List.map int_of_string\n\nlet sum = List.fold_left (+) 0 a\n\nlet () = Printf.printf \"%d\\n\" @@ if sum <= n then n - sum else -1", "language": "OCaml", "metadata": {"date": 1595035830, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02706.html", "problem_id": "p02706", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02706/input.txt", "sample_output_relpath": "derived/input_output/data/p02706/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02706/OCaml/s023688838.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s023688838", "user_id": "u811309788"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "let split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\nlet n, m = Scanf.sscanf (read_line ()) \"%d %d\" @@ fun n m -> (n, m)\nlet a = read_line () |> split_string ~pattern:\" \" |> List.map int_of_string\n\nlet sum = List.fold_left (+) 0 a\n\nlet () = Printf.printf \"%d\\n\" @@ if sum <= n then n - sum else -1", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has N days of summer vacation.\n\nHis teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.\n\nHe cannot do multiple assignments on the same day, or hang out on a day he does an assignment.\n\nWhat is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?\n\nIf Takahashi cannot finish all the assignments during the vacation, print -1 instead.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\n1 \\leq M \\leq 10^4\n\n1 \\leq A_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_M\n\nOutput\n\nPrint the maximum number of days Takahashi can hang out during the vacation, or -1.\n\nSample Input 1\n\n41 2\n5 6\n\nSample Output 1\n\n30\n\nFor example, he can do the first assignment on the first 5 days, hang out on the next 30 days, and do the second assignment on the last 6 days of the vacation. In this way, he can safely spend 30 days hanging out.\n\nSample Input 2\n\n10 2\n5 6\n\nSample Output 2\n\n-1\n\nHe cannot finish his assignments.\n\nSample Input 3\n\n11 2\n5 6\n\nSample Output 3\n\n0\n\nHe can finish his assignments, but he will have no time to hang out.\n\nSample Input 4\n\n314 15\n9 26 5 35 8 9 79 3 23 8 46 2 6 43 3\n\nSample Output 4\n\n9", "sample_input": "41 2\n5 6\n"}, "reference_outputs": ["30\n"], "source_document_id": "p02706", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has N days of summer vacation.\n\nHis teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.\n\nHe cannot do multiple assignments on the same day, or hang out on a day he does an assignment.\n\nWhat is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?\n\nIf Takahashi cannot finish all the assignments during the vacation, print -1 instead.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\n1 \\leq M \\leq 10^4\n\n1 \\leq A_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_M\n\nOutput\n\nPrint the maximum number of days Takahashi can hang out during the vacation, or -1.\n\nSample Input 1\n\n41 2\n5 6\n\nSample Output 1\n\n30\n\nFor example, he can do the first assignment on the first 5 days, hang out on the next 30 days, and do the second assignment on the last 6 days of the vacation. In this way, he can safely spend 30 days hanging out.\n\nSample Input 2\n\n10 2\n5 6\n\nSample Output 2\n\n-1\n\nHe cannot finish his assignments.\n\nSample Input 3\n\n11 2\n5 6\n\nSample Output 3\n\n0\n\nHe can finish his assignments, but he will have no time to hang out.\n\nSample Input 4\n\n314 15\n9 26 5 35 8 9 79 3 23 8 46 2 6 43 3\n\nSample Output 4\n\n9", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 309, "cpu_time_ms": 10, "memory_kb": 5660}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s890173421", "group_id": "codeNet:p02706", "input_text": "open Printf\nopen Scanf\n\nlet id x = x\n\nlet solve n m =\n  let la = List.init m @@ fun _ -> scanf \"%d \" id in\n  let pd = n - List.fold_left (+) 0 la in\n  if pd >= 0 then pd else -1\n\nlet () =\n  scanf \"%d %d \" solve |> printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1587496909, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02706.html", "problem_id": "p02706", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02706/input.txt", "sample_output_relpath": "derived/input_output/data/p02706/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02706/OCaml/s890173421.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s890173421", "user_id": "u388783188"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet id x = x\n\nlet solve n m =\n  let la = List.init m @@ fun _ -> scanf \"%d \" id in\n  let pd = n - List.fold_left (+) 0 la in\n  if pd >= 0 then pd else -1\n\nlet () =\n  scanf \"%d %d \" solve |> printf \"%d\\n\"\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has N days of summer vacation.\n\nHis teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.\n\nHe cannot do multiple assignments on the same day, or hang out on a day he does an assignment.\n\nWhat is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?\n\nIf Takahashi cannot finish all the assignments during the vacation, print -1 instead.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\n1 \\leq M \\leq 10^4\n\n1 \\leq A_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_M\n\nOutput\n\nPrint the maximum number of days Takahashi can hang out during the vacation, or -1.\n\nSample Input 1\n\n41 2\n5 6\n\nSample Output 1\n\n30\n\nFor example, he can do the first assignment on the first 5 days, hang out on the next 30 days, and do the second assignment on the last 6 days of the vacation. In this way, he can safely spend 30 days hanging out.\n\nSample Input 2\n\n10 2\n5 6\n\nSample Output 2\n\n-1\n\nHe cannot finish his assignments.\n\nSample Input 3\n\n11 2\n5 6\n\nSample Output 3\n\n0\n\nHe can finish his assignments, but he will have no time to hang out.\n\nSample Input 4\n\n314 15\n9 26 5 35 8 9 79 3 23 8 46 2 6 43 3\n\nSample Output 4\n\n9", "sample_input": "41 2\n5 6\n"}, "reference_outputs": ["30\n"], "source_document_id": "p02706", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has N days of summer vacation.\n\nHis teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.\n\nHe cannot do multiple assignments on the same day, or hang out on a day he does an assignment.\n\nWhat is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?\n\nIf Takahashi cannot finish all the assignments during the vacation, print -1 instead.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\n1 \\leq M \\leq 10^4\n\n1 \\leq A_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_M\n\nOutput\n\nPrint the maximum number of days Takahashi can hang out during the vacation, or -1.\n\nSample Input 1\n\n41 2\n5 6\n\nSample Output 1\n\n30\n\nFor example, he can do the first assignment on the first 5 days, hang out on the next 30 days, and do the second assignment on the last 6 days of the vacation. In this way, he can safely spend 30 days hanging out.\n\nSample Input 2\n\n10 2\n5 6\n\nSample Output 2\n\n-1\n\nHe cannot finish his assignments.\n\nSample Input 3\n\n11 2\n5 6\n\nSample Output 3\n\n0\n\nHe can finish his assignments, but he will have no time to hang out.\n\nSample Input 4\n\n314 15\n9 26 5 35 8 9 79 3 23 8 46 2 6 43 3\n\nSample Output 4\n\n9", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 6332}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s534415519", "group_id": "codeNet:p02710", "input_text": "open Base\nopen Stdio\n\n(* Core.read_line is deprecated *)\nlet read_line () =\n    (* Out_channel.(flush stdout); *)\n    In_channel.(input_line_exn stdin)\n\nlet mapt2 ~f (a, b) = (f a, f b)\n\nlet n = Int.of_string @@ read_line ()\n\nlet sums = Array.create ~len:(n+1) 0\nlet neg_res = Array.create ~len:(n+1) 0L\nlet g_hd = Array.create ~len:(n+1) 0\nlet g_nx = Array.create ~len:(2*n) 0\nlet g_to = Array.create ~len:(2*n) 0\nlet g_len = ref 0\nlet g_add u v =\n    g_len := !g_len + 1;\n    g_nx.(!g_len) <- g_hd.(u);\n    g_to.(!g_len) <- v;\n    g_hd.(u) <- !g_len\n\nlet colors = read_line () |> String.split ~on:' ' |> List.map ~f:Int.of_string\n    |> List.cons 0 |> Array.of_list\n\nlet rec dfs ?(cur=1) ?(par=0) () =\n    let memo = sums.(colors.(par)) in\n    let rec loop e acc = if e = 0 then acc else\n        let ch = g_to.(e) in\n        let ret = if ch = par then 0 else dfs ~cur:ch ~par:cur () in\n        loop g_nx.(e) (ret + acc)\n    in\n    let tree_size = loop (g_hd.(cur)) 1 in\n\n    sums.(colors.(cur)) <- sums.(colors.(cur)) + 1;\n    let component_size = Int64.of_int @@ tree_size - (sums.(colors.(par)) - memo) in\n    neg_res.(colors.(par)) <- Int64.(neg_res.(colors.(par)) + component_size * (component_size + 1L) / 2L);\n    sums.(colors.(par)) <- tree_size + memo;\n    tree_size\n\nlet _ =\n    for i = 0 to n - 2 do\n        let a, b = read_line () |> String.lsplit2_exn ~on:' ' |> mapt2 ~f:Int.of_string in\n        g_add a b;\n        g_add b a\n    done\n\nlet _ =\n    ignore (dfs ());\n    for i = 1 to n do\n        let component_size = Int64.of_int @@ n - sums.(i) in\n        let n64 = Int64.of_int n in\n        let res = Int64.(n64 * (n64 + 1L) / 2L - component_size * (component_size + 1L) / 2L - neg_res.(i)) in\n        printf \"%Ld\\n\" res\n    done\n", "language": "OCaml", "metadata": {"date": 1596008398, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02710.html", "problem_id": "p02710", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02710/input.txt", "sample_output_relpath": "derived/input_output/data/p02710/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02710/OCaml/s534415519.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s534415519", "user_id": "u869306730"}, "prompt_components": {"gold_output": "5\n4\n0\n", "input_to_evaluate": "open Base\nopen Stdio\n\n(* Core.read_line is deprecated *)\nlet read_line () =\n    (* Out_channel.(flush stdout); *)\n    In_channel.(input_line_exn stdin)\n\nlet mapt2 ~f (a, b) = (f a, f b)\n\nlet n = Int.of_string @@ read_line ()\n\nlet sums = Array.create ~len:(n+1) 0\nlet neg_res = Array.create ~len:(n+1) 0L\nlet g_hd = Array.create ~len:(n+1) 0\nlet g_nx = Array.create ~len:(2*n) 0\nlet g_to = Array.create ~len:(2*n) 0\nlet g_len = ref 0\nlet g_add u v =\n    g_len := !g_len + 1;\n    g_nx.(!g_len) <- g_hd.(u);\n    g_to.(!g_len) <- v;\n    g_hd.(u) <- !g_len\n\nlet colors = read_line () |> String.split ~on:' ' |> List.map ~f:Int.of_string\n    |> List.cons 0 |> Array.of_list\n\nlet rec dfs ?(cur=1) ?(par=0) () =\n    let memo = sums.(colors.(par)) in\n    let rec loop e acc = if e = 0 then acc else\n        let ch = g_to.(e) in\n        let ret = if ch = par then 0 else dfs ~cur:ch ~par:cur () in\n        loop g_nx.(e) (ret + acc)\n    in\n    let tree_size = loop (g_hd.(cur)) 1 in\n\n    sums.(colors.(cur)) <- sums.(colors.(cur)) + 1;\n    let component_size = Int64.of_int @@ tree_size - (sums.(colors.(par)) - memo) in\n    neg_res.(colors.(par)) <- Int64.(neg_res.(colors.(par)) + component_size * (component_size + 1L) / 2L);\n    sums.(colors.(par)) <- tree_size + memo;\n    tree_size\n\nlet _ =\n    for i = 0 to n - 2 do\n        let a, b = read_line () |> String.lsplit2_exn ~on:' ' |> mapt2 ~f:Int.of_string in\n        g_add a b;\n        g_add b a\n    done\n\nlet _ =\n    ignore (dfs ());\n    for i = 1 to n do\n        let component_size = Int64.of_int @@ n - sums.(i) in\n        let n64 = Int64.of_int n in\n        let res = Int64.(n64 * (n64 + 1L) / 2L - component_size * (component_size + 1L) / 2L - neg_res.(i)) in\n        printf \"%Ld\\n\" res\n    done\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices numbered 1 to N. The i-th edge in this tree connects Vertex a_i and b_i.\nAdditionally, each vertex is painted in a color, and the color of Vertex i is c_i. Here, the color of each vertex is represented by an integer between 1 and N (inclusive). The same integer corresponds to the same color; different integers correspond to different colors.\n\nFor each k=1, 2, ..., N, solve the following problem:\n\nFind the number of simple paths that visit a vertex painted in the color k one or more times.\n\nNote: The simple paths from Vertex u to v and from v to u are not distinguished.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq c_i \\leq N\n\n1 \\leq a_i,b_i \\leq N\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nc_1 c_2 ... c_N\na_1 b_1\n:\na_{N-1} b_{N-1}\n\nOutput\n\nPrint the answers for k = 1, 2, ..., N in order, each in its own line.\n\nSample Input 1\n\n3\n1 2 1\n1 2\n2 3\n\nSample Output 1\n\n5\n4\n0\n\nLet P_{i,j} denote the simple path connecting Vertex i and j.\n\nThere are 5 simple paths that visit a vertex painted in the color 1 one or more times:\n\nP_{1,1}\\,,\\,\nP_{1,2}\\,,\\,\nP_{1,3}\\,,\\,\nP_{2,3}\\,,\\,\nP_{3,3}\n\nThere are 4 simple paths that visit a vertex painted in the color 2 one or more times:\n\nP_{1,2}\\,,\\,\nP_{1,3}\\,,\\,\nP_{2,2}\\,,\\,\nP_{2,3}\n\nThere are no simple paths that visit a vertex painted in the color 3 one or more times.\n\nSample Input 2\n\n1\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n2\n1 2\n1 2\n\nSample Output 3\n\n2\n2\n\nSample Input 4\n\n5\n1 2 3 4 5\n1 2\n2 3\n3 4\n3 5\n\nSample Output 4\n\n5\n8\n10\n5\n5\n\nSample Input 5\n\n8\n2 7 2 5 4 1 7 5\n3 1\n1 2\n2 7\n4 5\n5 6\n6 8\n7 8\n\nSample Output 5\n\n18\n15\n0\n14\n23\n0\n23\n0", "sample_input": "3\n1 2 1\n1 2\n2 3\n"}, "reference_outputs": ["5\n4\n0\n"], "source_document_id": "p02710", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices numbered 1 to N. The i-th edge in this tree connects Vertex a_i and b_i.\nAdditionally, each vertex is painted in a color, and the color of Vertex i is c_i. Here, the color of each vertex is represented by an integer between 1 and N (inclusive). The same integer corresponds to the same color; different integers correspond to different colors.\n\nFor each k=1, 2, ..., N, solve the following problem:\n\nFind the number of simple paths that visit a vertex painted in the color k one or more times.\n\nNote: The simple paths from Vertex u to v and from v to u are not distinguished.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq c_i \\leq N\n\n1 \\leq a_i,b_i \\leq N\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nc_1 c_2 ... c_N\na_1 b_1\n:\na_{N-1} b_{N-1}\n\nOutput\n\nPrint the answers for k = 1, 2, ..., N in order, each in its own line.\n\nSample Input 1\n\n3\n1 2 1\n1 2\n2 3\n\nSample Output 1\n\n5\n4\n0\n\nLet P_{i,j} denote the simple path connecting Vertex i and j.\n\nThere are 5 simple paths that visit a vertex painted in the color 1 one or more times:\n\nP_{1,1}\\,,\\,\nP_{1,2}\\,,\\,\nP_{1,3}\\,,\\,\nP_{2,3}\\,,\\,\nP_{3,3}\n\nThere are 4 simple paths that visit a vertex painted in the color 2 one or more times:\n\nP_{1,2}\\,,\\,\nP_{1,3}\\,,\\,\nP_{2,2}\\,,\\,\nP_{2,3}\n\nThere are no simple paths that visit a vertex painted in the color 3 one or more times.\n\nSample Input 2\n\n1\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n2\n1 2\n1 2\n\nSample Output 3\n\n2\n2\n\nSample Input 4\n\n5\n1 2 3 4 5\n1 2\n2 3\n3 4\n3 5\n\nSample Output 4\n\n5\n8\n10\n5\n5\n\nSample Input 5\n\n8\n2 7 2 5 4 1 7 5\n3 1\n1 2\n2 7\n4 5\n5 6\n6 8\n7 8\n\nSample Output 5\n\n18\n15\n0\n14\n23\n0\n23\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1745, "cpu_time_ms": 224, "memory_kb": 53396}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s194884221", "group_id": "codeNet:p02722", "input_text": "let n = read_int ()\n\nlet rec factors m a acc =\n  if a * a > m then acc\n  else if a * a = m then a :: acc\n  else if m mod a = 0 then factors m (a + 1) (a :: (m / a) :: acc)\n  else factors m (a + 1) acc\n\nlet fs = factors (n - 1) 1 [] |> List.length\n\nlet rec test m k =\n  if m = 0 then false else if m mod k = 0 then test (m / k) k else m mod k = 1\n\nlet fn =\n  factors n 1 []\n  |> List.filter (fun x -> x <> 1)\n  |> List.map (test n)\n  |> List.fold_left (fun acc x -> if x then acc + 1 else acc) 0\n\n;;\nprint_int (fs - 1 + fn);\nprint_newline ()\n", "language": "OCaml", "metadata": {"date": 1587179757, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s194884221.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s194884221", "user_id": "u395620499"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let n = read_int ()\n\nlet rec factors m a acc =\n  if a * a > m then acc\n  else if a * a = m then a :: acc\n  else if m mod a = 0 then factors m (a + 1) (a :: (m / a) :: acc)\n  else factors m (a + 1) acc\n\nlet fs = factors (n - 1) 1 [] |> List.length\n\nlet rec test m k =\n  if m = 0 then false else if m mod k = 0 then test (m / k) k else m mod k = 1\n\nlet fn =\n  factors n 1 []\n  |> List.filter (fun x -> x <> 1)\n  |> List.map (test n)\n  |> List.fold_left (fun acc x -> if x then acc + 1 else acc) 0\n\n;;\nprint_int (fs - 1 + fn);\nprint_newline ()\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 541, "cpu_time_ms": 25, "memory_kb": 1152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s328225253", "group_id": "codeNet:p02722", "input_text": "let rec aux n k =\n  if n mod k = 0\n  then aux (n / k) k\n  else n\n\nlet rec solve n k ans =\n  if n < k * k\n  then ans\n  else\n    solve n (k + 1) @@\n    ans +\n    if n mod k = 0\n    then (if aux n k mod k = 1 then 1 else 0) + (if aux n (n / k) mod (n / k) = 1 then 1 else 0)\n    else if (n - 1) mod k = 0\n    then 1 + (if n - 1 = k * k then 0 else 1)\n    else 0\nlet solve n = solve n 2 2\n\nlet () = Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d\" solve", "language": "OCaml", "metadata": {"date": 1586056298, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s328225253.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s328225253", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let rec aux n k =\n  if n mod k = 0\n  then aux (n / k) k\n  else n\n\nlet rec solve n k ans =\n  if n < k * k\n  then ans\n  else\n    solve n (k + 1) @@\n    ans +\n    if n mod k = 0\n    then (if aux n k mod k = 1 then 1 else 0) + (if aux n (n / k) mod (n / k) = 1 then 1 else 0)\n    else if (n - 1) mod k = 0\n    then 1 + (if n - 1 = k * k then 0 else 1)\n    else 0\nlet solve n = solve n 2 2\n\nlet () = Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d\" solve", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 441, "cpu_time_ms": 26, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s888723533", "group_id": "codeNet:p02722", "input_text": "module S = Set.Make (struct type t = int let compare = compare end) ;;\n\nScanf.scanf \"%d\" (fun nn ->\n    let divisors a =\n        let rec loop i acc =\n            if i * i > a then acc else\n                let acc = if a mod i = 0 then S.add (a / i) (S.add i acc) else acc in\n                loop (i + 1) acc\n        in\n        loop 2 (S.singleton a)\n    in\n    let rec loop n k =\n        if n = 1 then true else\n            if n < k then false else\n            if n mod k = 0 then loop (n / k) k\n                           else loop (n mod k) k\n    in\n    let rec loop2 acc = function\n        | [] -> acc\n        | hd :: tl ->\n                let acc = if loop nn hd then acc + 1 else acc in\n                loop2 acc tl\n    in\n    let set = divisors (nn - 1) in\n    let set = S.union (divisors nn) set in\n    loop2 0 (S.elements set) |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1586053997, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s888723533.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s888723533", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "module S = Set.Make (struct type t = int let compare = compare end) ;;\n\nScanf.scanf \"%d\" (fun nn ->\n    let divisors a =\n        let rec loop i acc =\n            if i * i > a then acc else\n                let acc = if a mod i = 0 then S.add (a / i) (S.add i acc) else acc in\n                loop (i + 1) acc\n        in\n        loop 2 (S.singleton a)\n    in\n    let rec loop n k =\n        if n = 1 then true else\n            if n < k then false else\n            if n mod k = 0 then loop (n / k) k\n                           else loop (n mod k) k\n    in\n    let rec loop2 acc = function\n        | [] -> acc\n        | hd :: tl ->\n                let acc = if loop nn hd then acc + 1 else acc in\n                loop2 acc tl\n    in\n    let set = divisors (nn - 1) in\n    let set = S.union (divisors nn) set in\n    loop2 0 (S.elements set) |> Printf.printf \"%d\\n\"\n)", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 860, "cpu_time_ms": 2103, "memory_kb": 2816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s946192434", "group_id": "codeNet:p02724", "input_text": "let x = read_int ()\nlet ans = x / 500 * 1000 + x mod 500 / 5 * 5\nlet () = print_int ans", "language": "OCaml", "metadata": {"date": 1588525530, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s946192434.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s946192434", "user_id": "u307426615"}, "prompt_components": {"gold_output": "2020\n", "input_to_evaluate": "let x = read_int ()\nlet ans = x / 500 * 1000 + x mod 500 / 5 * 5\nlet () = print_int ans", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves gold coins. He gains 1000 happiness points for each 500-yen coin he has and gains 5 happiness points for each 5-yen coin he has. (Yen is the currency of Japan.)\n\nTakahashi has X yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?\n\n(We assume that there are six kinds of coins available: 500-yen, 100-yen, 50-yen, 10-yen, 5-yen, and 1-yen coins.)\n\nConstraints\n\n0 \\leq X \\leq 10^9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the maximum number of happiness points that can be earned.\n\nSample Input 1\n\n1024\n\nSample Output 1\n\n2020\n\nBy exchanging his money so that he gets two 500-yen coins and four 5-yen coins, he gains 2020 happiness points, which is the maximum number of happiness points that can be earned.\n\nSample Input 2\n\n0\n\nSample Output 2\n\n0\n\nHe is penniless - or yenless.\n\nSample Input 3\n\n1000000000\n\nSample Output 3\n\n2000000000\n\nHe is a billionaire - in yen.", "sample_input": "1024\n"}, "reference_outputs": ["2020\n"], "source_document_id": "p02724", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves gold coins. He gains 1000 happiness points for each 500-yen coin he has and gains 5 happiness points for each 5-yen coin he has. (Yen is the currency of Japan.)\n\nTakahashi has X yen. If he exchanges his money so that he will gain the most happiness points, how many happiness points will he earn?\n\n(We assume that there are six kinds of coins available: 500-yen, 100-yen, 50-yen, 10-yen, 5-yen, and 1-yen coins.)\n\nConstraints\n\n0 \\leq X \\leq 10^9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the maximum number of happiness points that can be earned.\n\nSample Input 1\n\n1024\n\nSample Output 1\n\n2020\n\nBy exchanging his money so that he gets two 500-yen coins and four 5-yen coins, he gains 2020 happiness points, which is the maximum number of happiness points that can be earned.\n\nSample Input 2\n\n0\n\nSample Output 2\n\n0\n\nHe is penniless - or yenless.\n\nSample Input 3\n\n1000000000\n\nSample Output 3\n\n2000000000\n\nHe is a billionaire - in yen.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 87, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s245505761", "group_id": "codeNet:p02725", "input_text": "let () =\n  let k, n = Scanf.scanf \"%d %d\\n\" @@ fun a b -> a, b in\n  let arr = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun d -> d in\n  let brr = Array.make n 0 in\n  for i = 0 to n-1 do\n    print_int i; print_newline ();\n    if i = 0 then brr.(n-1) <- abs (arr.(n-1) - arr.(i))\n    else brr.(i-1) <- abs (arr.(i) - arr.(i-1))\n  done;\n  let ans = Array.fold_left\n      (fun (m, s) x -> if m < x then (x, s+m) else (m, x+s)) (0, 0) brr in\n  print_int (snd ans)", "language": "OCaml", "metadata": {"date": 1589311033, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s245505761.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s245505761", "user_id": "u307426615"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let () =\n  let k, n = Scanf.scanf \"%d %d\\n\" @@ fun a b -> a, b in\n  let arr = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun d -> d in\n  let brr = Array.make n 0 in\n  for i = 0 to n-1 do\n    print_int i; print_newline ();\n    if i = 0 then brr.(n-1) <- abs (arr.(n-1) - arr.(i))\n    else brr.(i-1) <- abs (arr.(i) - arr.(i-1))\n  done;\n  let ans = Array.fold_left\n      (fun (m, s) x -> if m < x then (x, s+m) else (m, x+s)) (0, 0) brr in\n  print_int (snd ans)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a circular pond with a perimeter of K meters, and N houses around them.\n\nThe i-th house is built at a distance of A_i meters from the northmost point of the pond, measured clockwise around the pond.\n\nWhen traveling between these houses, you can only go around the pond.\n\nFind the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nConstraints\n\n2 \\leq K \\leq 10^6\n\n2 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq A_1 < ... < A_N < K\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK N\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nSample Input 1\n\n20 3\n5 10 15\n\nSample Output 1\n\n10\n\nIf you start at the 1-st house and go to the 2-nd and 3-rd houses in this order, the total distance traveled will be 10.\n\nSample Input 2\n\n20 3\n0 5 15\n\nSample Output 2\n\n10\n\nIf you start at the 2-nd house and go to the 1-st and 3-rd houses in this order, the total distance traveled will be 10.", "sample_input": "20 3\n5 10 15\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02725", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a circular pond with a perimeter of K meters, and N houses around them.\n\nThe i-th house is built at a distance of A_i meters from the northmost point of the pond, measured clockwise around the pond.\n\nWhen traveling between these houses, you can only go around the pond.\n\nFind the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nConstraints\n\n2 \\leq K \\leq 10^6\n\n2 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq A_1 < ... < A_N < K\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK N\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nSample Input 1\n\n20 3\n5 10 15\n\nSample Output 1\n\n10\n\nIf you start at the 1-st house and go to the 2-nd and 3-rd houses in this order, the total distance traveled will be 10.\n\nSample Input 2\n\n20 3\n0 5 15\n\nSample Output 2\n\n10\n\nIf you start at the 2-nd house and go to the 1-st and 3-rd houses in this order, the total distance traveled will be 10.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 462, "cpu_time_ms": 406, "memory_kb": 8192}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s112923698", "group_id": "codeNet:p02725", "input_text": "open Batteries\nlet rec sum lst =\n  match lst with\n  | [] -> 0\n  | first :: rest -> first + sum rest\nlet kn = Scanf.sscanf (read_line()) \"%d %d\" (fun k n ->\n  [|k; n|]\n)\nlet k = kn.(0)\nlet n = kn.(1)\nlet a = read_line () |> String.split_on_char ' ' |> List.map int_of_string |> Array.of_list\nlet rec get_lengths i =\n  if i = (Array.length a) - 1 then [(k-a.(i))+a.(0)] else\n  a.(i+1) - a.(i) :: get_lengths (i+1)\n\nlet lengths = List.sort compare @@ get_lengths 0\nlet _ = Printf.printf \"%d\\n\" (sum @@ List.tl @@ List.rev lengths)\n", "language": "OCaml", "metadata": {"date": 1585492153, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s112923698.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s112923698", "user_id": "u511870776"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "open Batteries\nlet rec sum lst =\n  match lst with\n  | [] -> 0\n  | first :: rest -> first + sum rest\nlet kn = Scanf.sscanf (read_line()) \"%d %d\" (fun k n ->\n  [|k; n|]\n)\nlet k = kn.(0)\nlet n = kn.(1)\nlet a = read_line () |> String.split_on_char ' ' |> List.map int_of_string |> Array.of_list\nlet rec get_lengths i =\n  if i = (Array.length a) - 1 then [(k-a.(i))+a.(0)] else\n  a.(i+1) - a.(i) :: get_lengths (i+1)\n\nlet lengths = List.sort compare @@ get_lengths 0\nlet _ = Printf.printf \"%d\\n\" (sum @@ List.tl @@ List.rev lengths)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a circular pond with a perimeter of K meters, and N houses around them.\n\nThe i-th house is built at a distance of A_i meters from the northmost point of the pond, measured clockwise around the pond.\n\nWhen traveling between these houses, you can only go around the pond.\n\nFind the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nConstraints\n\n2 \\leq K \\leq 10^6\n\n2 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq A_1 < ... < A_N < K\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK N\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nSample Input 1\n\n20 3\n5 10 15\n\nSample Output 1\n\n10\n\nIf you start at the 1-st house and go to the 2-nd and 3-rd houses in this order, the total distance traveled will be 10.\n\nSample Input 2\n\n20 3\n0 5 15\n\nSample Output 2\n\n10\n\nIf you start at the 2-nd house and go to the 1-st and 3-rd houses in this order, the total distance traveled will be 10.", "sample_input": "20 3\n5 10 15\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02725", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a circular pond with a perimeter of K meters, and N houses around them.\n\nThe i-th house is built at a distance of A_i meters from the northmost point of the pond, measured clockwise around the pond.\n\nWhen traveling between these houses, you can only go around the pond.\n\nFind the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nConstraints\n\n2 \\leq K \\leq 10^6\n\n2 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq A_1 < ... < A_N < K\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK N\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nSample Input 1\n\n20 3\n5 10 15\n\nSample Output 1\n\n10\n\nIf you start at the 1-st house and go to the 2-nd and 3-rd houses in this order, the total distance traveled will be 10.\n\nSample Input 2\n\n20 3\n0 5 15\n\nSample Output 2\n\n10\n\nIf you start at the 2-nd house and go to the 1-st and 3-rd houses in this order, the total distance traveled will be 10.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 528, "cpu_time_ms": 209, "memory_kb": 23600}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s329951172", "group_id": "codeNet:p02726", "input_text": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = if n <= m then List.range n `To m  else []\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nmodule ModOp = struct\n  let prime = 1_000_000_007\n  let (-) a b = (a + prime - b) mod prime\n  let (+) a b = (a + b) mod prime\n  let ( * ) a b = (a * b) mod prime\n\n  let rec pow x n =\n    if n = 0 then 1\n    else if n mod 2 = 0 then pow (x*x) (n/2)\n    else x * pow (x*x) (n/2)\nend\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list ?sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list ?sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list ?sep conv);\n  arr\n\nlet atoi c = Char.code c - Char.code '0'\n\nlet rec powerset = function\n  | [] -> [[]]\n  | hd::tl ->\n    let pws =  powerset tl in\n    pws @ ListL.map pws ~f:(fun pw -> hd::pw)\n\nlet permutations l =\n  let rec interleave x = function\n    | [] -> [[x]]\n    | (hd::tl) as l ->\n      (x::l) :: (interleave x tl |> ListL.map ~f:(fun l -> hd::l)) in\n  let rec aux = function\n    | [] -> [[]]\n    | a::rest ->\n      aux rest |> ListL.map ~f:(interleave a) |> List.concat in\n  aux l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet (n,x,y) = scan \"%d %d %d\" Tuple3.make\n\nlet () =\n  let arr = Array.make_matrix (succ n) (succ n) 0 in\n  ListL.iter (1++n) ~f:(fun i ->\n      ListL.iter (i++n) ~f:(fun j -> arr.(i).(j) <- j - i));\n  ListL.iter (1++x) ~f:(fun i ->\n      ListL.iter (x+1++n) ~f:(fun j ->\n          arr.(i).(j) <- min (arr.(i).(x) + abs (j-y) + 1) arr.(i).(j)));\n  ListL.iter (x+1++^y) ~f:(fun i ->\n      ListL.iter (i+1++n) ~f:(fun j ->\n          arr.(i).(j) <- min ((i-x) + abs (j-y) + 1) arr.(i).(j)));\n  let h = Hashtbl.create n in\n  ListL.iter (1++n) ~f:(fun i ->\n      ListL.iter (i+1++n) ~f:(fun j ->\n          Hashtbl.modify_def 0 arr.(i).(j) succ h));\n  (* Array.print ~sep:\"\\n\" (Array.print Int.print) stderr arr ; *)\n  ListL.iter (1++^n) ~f:(fun i ->\n      Printf.printf \"%d\\n\" @@ Hashtbl.find_default h i 0)\n", "language": "OCaml", "metadata": {"date": 1592708669, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s329951172.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s329951172", "user_id": "u802614675"}, "prompt_components": {"gold_output": "5\n4\n1\n0\n", "input_to_evaluate": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = if n <= m then List.range n `To m  else []\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nmodule ModOp = struct\n  let prime = 1_000_000_007\n  let (-) a b = (a + prime - b) mod prime\n  let (+) a b = (a + b) mod prime\n  let ( * ) a b = (a * b) mod prime\n\n  let rec pow x n =\n    if n = 0 then 1\n    else if n mod 2 = 0 then pow (x*x) (n/2)\n    else x * pow (x*x) (n/2)\nend\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list ?sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list ?sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list ?sep conv);\n  arr\n\nlet atoi c = Char.code c - Char.code '0'\n\nlet rec powerset = function\n  | [] -> [[]]\n  | hd::tl ->\n    let pws =  powerset tl in\n    pws @ ListL.map pws ~f:(fun pw -> hd::pw)\n\nlet permutations l =\n  let rec interleave x = function\n    | [] -> [[x]]\n    | (hd::tl) as l ->\n      (x::l) :: (interleave x tl |> ListL.map ~f:(fun l -> hd::l)) in\n  let rec aux = function\n    | [] -> [[]]\n    | a::rest ->\n      aux rest |> ListL.map ~f:(interleave a) |> List.concat in\n  aux l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet (n,x,y) = scan \"%d %d %d\" Tuple3.make\n\nlet () =\n  let arr = Array.make_matrix (succ n) (succ n) 0 in\n  ListL.iter (1++n) ~f:(fun i ->\n      ListL.iter (i++n) ~f:(fun j -> arr.(i).(j) <- j - i));\n  ListL.iter (1++x) ~f:(fun i ->\n      ListL.iter (x+1++n) ~f:(fun j ->\n          arr.(i).(j) <- min (arr.(i).(x) + abs (j-y) + 1) arr.(i).(j)));\n  ListL.iter (x+1++^y) ~f:(fun i ->\n      ListL.iter (i+1++n) ~f:(fun j ->\n          arr.(i).(j) <- min ((i-x) + abs (j-y) + 1) arr.(i).(j)));\n  let h = Hashtbl.create n in\n  ListL.iter (1++n) ~f:(fun i ->\n      ListL.iter (i+1++n) ~f:(fun j ->\n          Hashtbl.modify_def 0 arr.(i).(j) succ h));\n  (* Array.print ~sep:\"\\n\" (Array.print Int.print) stderr arr ; *)\n  ListL.iter (1++^n) ~f:(fun i ->\n      Printf.printf \"%d\\n\" @@ Hashtbl.find_default h i 0)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have an undirected graph G with N vertices numbered 1 to N and N edges as follows:\n\nFor each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.\n\nThere is an edge between Vertex X and Vertex Y.\n\nFor each k=1,2,...,N-1, solve the problem below:\n\nFind the number of pairs of integers (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j in G is k.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^3\n\n1 \\leq X,Y \\leq N\n\nX+1 < Y\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X Y\n\nOutput\n\nFor each k=1, 2, ..., N-1 in this order, print a line containing the answer to the problem.\n\nSample Input 1\n\n5 2 4\n\nSample Output 1\n\n5\n4\n1\n0\n\nThe graph in this input is as follows:\n\nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 1: (1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5).\n\nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5).\n\nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 3: (1,5).\n\nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 4.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n3\n0\n\nThe graph in this input is as follows:\n\nSample Input 3\n\n7 3 7\n\nSample Output 3\n\n7\n8\n4\n2\n0\n0\n\nSample Input 4\n\n10 4 8\n\nSample Output 4\n\n10\n12\n10\n8\n4\n1\n0\n0\n0", "sample_input": "5 2 4\n"}, "reference_outputs": ["5\n4\n1\n0\n"], "source_document_id": "p02726", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have an undirected graph G with N vertices numbered 1 to N and N edges as follows:\n\nFor each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.\n\nThere is an edge between Vertex X and Vertex Y.\n\nFor each k=1,2,...,N-1, solve the problem below:\n\nFind the number of pairs of integers (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j in G is k.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^3\n\n1 \\leq X,Y \\leq N\n\nX+1 < Y\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X Y\n\nOutput\n\nFor each k=1, 2, ..., N-1 in this order, print a line containing the answer to the problem.\n\nSample Input 1\n\n5 2 4\n\nSample Output 1\n\n5\n4\n1\n0\n\nThe graph in this input is as follows:\n\nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 1: (1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5).\n\nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5).\n\nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 3: (1,5).\n\nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 4.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n3\n0\n\nThe graph in this input is as follows:\n\nSample Input 3\n\n7 3 7\n\nSample Output 3\n\n7\n8\n4\n2\n0\n0\n\nSample Input 4\n\n10 4 8\n\nSample Output 4\n\n10\n12\n10\n8\n4\n1\n0\n0\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2912, "cpu_time_ms": 200, "memory_kb": 51972}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s867855264", "group_id": "codeNet:p02729", "input_text": "Scanf.scanf \"%d %d\" (fun n m -> print_int (n * (n - 1) / 2 + m * (m - 1) / 2))\n", "language": "OCaml", "metadata": {"date": 1585029972, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s867855264.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s867855264", "user_id": "u752907799"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n m -> print_int (n * (n - 1) / 2 + m * (m - 1) / 2))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have N+M balls, each of which has an integer written on it.\n\nIt is known that:\n\nThe numbers written on N of the balls are even.\n\nThe numbers written on M of the balls are odd.\n\nFind the number of ways to choose two of the N+M balls (disregarding order) so that the sum of the numbers written on them is even.\n\nIt can be shown that this count does not depend on the actual values written on the balls.\n\nConstraints\n\n0 \\leq N,M \\leq 100\n\n2 \\leq N+M\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 1\n\nSample Output 1\n\n1\n\nFor example, let us assume that the numbers written on the three balls are 1,2,4.\n\nIf we choose the two balls with 1 and 2, the sum is odd;\n\nIf we choose the two balls with 1 and 4, the sum is odd;\n\nIf we choose the two balls with 2 and 4, the sum is even.\n\nThus, the answer is 1.\n\nSample Input 2\n\n4 3\n\nSample Output 2\n\n9\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n13 3\n\nSample Output 4\n\n81\n\nSample Input 5\n\n0 3\n\nSample Output 5\n\n3", "sample_input": "2 1\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02729", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have N+M balls, each of which has an integer written on it.\n\nIt is known that:\n\nThe numbers written on N of the balls are even.\n\nThe numbers written on M of the balls are odd.\n\nFind the number of ways to choose two of the N+M balls (disregarding order) so that the sum of the numbers written on them is even.\n\nIt can be shown that this count does not depend on the actual values written on the balls.\n\nConstraints\n\n0 \\leq N,M \\leq 100\n\n2 \\leq N+M\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 1\n\nSample Output 1\n\n1\n\nFor example, let us assume that the numbers written on the three balls are 1,2,4.\n\nIf we choose the two balls with 1 and 2, the sum is odd;\n\nIf we choose the two balls with 1 and 4, the sum is odd;\n\nIf we choose the two balls with 2 and 4, the sum is even.\n\nThus, the answer is 1.\n\nSample Input 2\n\n4 3\n\nSample Output 2\n\n9\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n13 3\n\nSample Output 4\n\n81\n\nSample Input 5\n\n0 3\n\nSample Output 5\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 79, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s533742851", "group_id": "codeNet:p02730", "input_text": "let is_palindrome str = \n  let n = String.length str in\n  List.fold_left (&&) true @@\n  List.init (n/2) @@ fun i -> str.[i] = str.[n-1-i]\n\nlet () =\n  let s = read_line () in\n  let n = String.length s in\n  Printf.printf \"%s\\n\" @@\n  if\n    is_palindrome s &&\n    is_palindrome (String.sub s 0 ((n-1)/2)) &&\n    is_palindrome (String.sub s ((n+1)/2) ((n-1)/2))\n  then \"Yes\"\n  else \"No\"", "language": "OCaml", "metadata": {"date": 1592703096, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s533742851.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s533742851", "user_id": "u052332717"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let is_palindrome str = \n  let n = String.length str in\n  List.fold_left (&&) true @@\n  List.init (n/2) @@ fun i -> str.[i] = str.[n-1-i]\n\nlet () =\n  let s = read_line () in\n  let n = String.length s in\n  Printf.printf \"%s\\n\" @@\n  if\n    is_palindrome s &&\n    is_palindrome (String.sub s 0 ((n-1)/2)) &&\n    is_palindrome (String.sub s ((n+1)/2) ((n-1)/2))\n  then \"Yes\"\n  else \"No\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:\n\nS is a palindrome.\n\nLet N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome.\n\nThe string consisting of the (N+3)/2-st through N-th characters of S is a palindrome.\n\nDetermine whether S is a strong palindrome.\n\nConstraints\n\nS consists of lowercase English letters.\n\nThe length of S is an odd number between 3 and 99 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a strong palindrome, print Yes;\notherwise, print No.\n\nSample Input 1\n\nakasaka\n\nSample Output 1\n\nYes\n\nS is akasaka.\n\nThe string formed by the 1-st through the 3-rd characters is aka.\n\nThe string formed by the 5-th through the 7-th characters is aka.\nAll of these are palindromes, so S is a strong palindrome.\n\nSample Input 2\n\nlevel\n\nSample Output 2\n\nNo\n\nSample Input 3\n\natcoder\n\nSample Output 3\n\nNo", "sample_input": "akasaka\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02730", "source_text": "Score : 200 points\n\nProblem Statement\n\nA string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:\n\nS is a palindrome.\n\nLet N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome.\n\nThe string consisting of the (N+3)/2-st through N-th characters of S is a palindrome.\n\nDetermine whether S is a strong palindrome.\n\nConstraints\n\nS consists of lowercase English letters.\n\nThe length of S is an odd number between 3 and 99 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a strong palindrome, print Yes;\notherwise, print No.\n\nSample Input 1\n\nakasaka\n\nSample Output 1\n\nYes\n\nS is akasaka.\n\nThe string formed by the 1-st through the 3-rd characters is aka.\n\nThe string formed by the 5-th through the 7-th characters is aka.\nAll of these are palindromes, so S is a strong palindrome.\n\nSample Input 2\n\nlevel\n\nSample Output 2\n\nNo\n\nSample Input 3\n\natcoder\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 382, "cpu_time_ms": 10, "memory_kb": 3620}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s086840201", "group_id": "codeNet:p02730", "input_text": "let s = read_line ()\nlet rec f s n i =\n  if i >= n/2 then true else if s.[i] <> s.[n-i-1] then false\n  else f s n (i+1)\nlet n = String.length s\nlet ans = if f s n 0 && f s ((n-1) / 2) 0 then \"Yes\" else \"No\"\nlet () = print_endline ans", "language": "OCaml", "metadata": {"date": 1588542509, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s086840201.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s086840201", "user_id": "u307426615"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let s = read_line ()\nlet rec f s n i =\n  if i >= n/2 then true else if s.[i] <> s.[n-i-1] then false\n  else f s n (i+1)\nlet n = String.length s\nlet ans = if f s n 0 && f s ((n-1) / 2) 0 then \"Yes\" else \"No\"\nlet () = print_endline ans", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:\n\nS is a palindrome.\n\nLet N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome.\n\nThe string consisting of the (N+3)/2-st through N-th characters of S is a palindrome.\n\nDetermine whether S is a strong palindrome.\n\nConstraints\n\nS consists of lowercase English letters.\n\nThe length of S is an odd number between 3 and 99 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a strong palindrome, print Yes;\notherwise, print No.\n\nSample Input 1\n\nakasaka\n\nSample Output 1\n\nYes\n\nS is akasaka.\n\nThe string formed by the 1-st through the 3-rd characters is aka.\n\nThe string formed by the 5-th through the 7-th characters is aka.\nAll of these are palindromes, so S is a strong palindrome.\n\nSample Input 2\n\nlevel\n\nSample Output 2\n\nNo\n\nSample Input 3\n\natcoder\n\nSample Output 3\n\nNo", "sample_input": "akasaka\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02730", "source_text": "Score : 200 points\n\nProblem Statement\n\nA string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:\n\nS is a palindrome.\n\nLet N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome.\n\nThe string consisting of the (N+3)/2-st through N-th characters of S is a palindrome.\n\nDetermine whether S is a strong palindrome.\n\nConstraints\n\nS consists of lowercase English letters.\n\nThe length of S is an odd number between 3 and 99 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a strong palindrome, print Yes;\notherwise, print No.\n\nSample Input 1\n\nakasaka\n\nSample Output 1\n\nYes\n\nS is akasaka.\n\nThe string formed by the 1-st through the 3-rd characters is aka.\n\nThe string formed by the 5-th through the 7-th characters is aka.\nAll of these are palindromes, so S is a strong palindrome.\n\nSample Input 2\n\nlevel\n\nSample Output 2\n\nNo\n\nSample Input 3\n\natcoder\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 233, "cpu_time_ms": 2, "memory_kb": 4480}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s646910731", "group_id": "codeNet:p02731", "input_text": "Scanf.scanf \"%f\" (fun l -> print_float ((l /. 3.) ** 3.))", "language": "OCaml", "metadata": {"date": 1585031649, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s646910731.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s646910731", "user_id": "u752907799"}, "prompt_components": {"gold_output": "1.000000000000\n", "input_to_evaluate": "Scanf.scanf \"%f\" (fun l -> print_float ((l /. 3.) ** 3.))", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s574318809", "group_id": "codeNet:p02731", "input_text": "let () = Scanf.scanf \"%d\" @@ fun l ->\n  let w = float_of_int l /. 3. in\n  Printf.printf \"%.10f\" @@ w *. w *. w", "language": "OCaml", "metadata": {"date": 1584926998, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s574318809.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s574318809", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1.000000000000\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\" @@ fun l ->\n  let w = float_of_int l /. 3. in\n  Printf.printf \"%.10f\" @@ w *. w *. w", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 110, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s934440998", "group_id": "codeNet:p02734", "input_text": "Scanf.scanf \"%d %d\" (fun n s ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n    let dp = Array.make_matrix (n + 1) (s + 1) 0 in\n    let m = 998244353 in\n    let (+@) a b = (a + b) mod m in\n\n    for i = 0 to n - 1 do\n        let x = a.(i) in\n        if x <= s then\n            dp.(i + 1).(x) <- dp.(i + 1).(x) +@ (i + 1);\n        for j = 0 to s do\n            dp.(i + 1).(j) <- dp.(i + 1).(j) +@ dp.(i).(j);\n            if j + x <= s then \n                dp.(i + 1).(j + x) <- dp.(i + 1).(j + x) +@ dp.(i).(j)\n        done\n    done;\n    let rec loop i acc =\n        if i > n then acc else loop (i + 1) (acc +@ dp.(i).(s))\n    in\n    loop 0 0 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1584944296, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02734.html", "problem_id": "p02734", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02734/input.txt", "sample_output_relpath": "derived/input_output/data/p02734/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02734/OCaml/s934440998.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s934440998", "user_id": "u342443598"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n s ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n    let dp = Array.make_matrix (n + 1) (s + 1) 0 in\n    let m = 998244353 in\n    let (+@) a b = (a + b) mod m in\n\n    for i = 0 to n - 1 do\n        let x = a.(i) in\n        if x <= s then\n            dp.(i + 1).(x) <- dp.(i + 1).(x) +@ (i + 1);\n        for j = 0 to s do\n            dp.(i + 1).(j) <- dp.(i + 1).(j) +@ dp.(i).(j);\n            if j + x <= s then \n                dp.(i + 1).(j + x) <- dp.(i + 1).(j + x) +@ dp.(i).(j)\n        done\n    done;\n    let rec loop i acc =\n        if i > n then acc else loop (i + 1) (acc +@ dp.(i).(s))\n    in\n    loop 0 0 |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven are a sequence of N integers A_1, A_2, \\ldots, A_N and a positive integer S.\n\nFor a pair of integers (L, R) such that 1\\leq L \\leq R \\leq N, let us define f(L, R) as follows:\n\nf(L, R) is the number of sequences of integers (x_1, x_2, \\ldots , x_k) such that L \\leq x_1 < x_2 < \\cdots < x_k \\leq R and A_{x_1}+A_{x_2}+\\cdots +A_{x_k} = S.\n\nFind the sum of f(L, R) over all pairs of integers (L, R) such that 1\\leq L \\leq R\\leq N. Since this sum can be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3000\n\n1 \\leq S \\leq 3000\n\n1 \\leq A_i \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN S\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the sum of f(L, R), modulo 998244353.\n\nSample Input 1\n\n3 4\n2 2 4\n\nSample Output 1\n\n5\n\nThe value of f(L, R) for each pair is as follows, for a total of 5.\n\nf(1,1) = 0\n\nf(1,2) = 1 (for the sequence (1, 2))\n\nf(1,3) = 2 (for (1, 2) and (3))\n\nf(2,2) = 0\n\nf(2,3) = 1 (for (3))\n\nf(3,3) = 1 (for (3))\n\nSample Input 2\n\n5 8\n9 9 9 9 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n10 10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 3\n\n152", "sample_input": "3 4\n2 2 4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02734", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven are a sequence of N integers A_1, A_2, \\ldots, A_N and a positive integer S.\n\nFor a pair of integers (L, R) such that 1\\leq L \\leq R \\leq N, let us define f(L, R) as follows:\n\nf(L, R) is the number of sequences of integers (x_1, x_2, \\ldots , x_k) such that L \\leq x_1 < x_2 < \\cdots < x_k \\leq R and A_{x_1}+A_{x_2}+\\cdots +A_{x_k} = S.\n\nFind the sum of f(L, R) over all pairs of integers (L, R) such that 1\\leq L \\leq R\\leq N. Since this sum can be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3000\n\n1 \\leq S \\leq 3000\n\n1 \\leq A_i \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN S\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the sum of f(L, R), modulo 998244353.\n\nSample Input 1\n\n3 4\n2 2 4\n\nSample Output 1\n\n5\n\nThe value of f(L, R) for each pair is as follows, for a total of 5.\n\nf(1,1) = 0\n\nf(1,2) = 1 (for the sequence (1, 2))\n\nf(1,3) = 2 (for (1, 2) and (3))\n\nf(2,2) = 0\n\nf(2,3) = 1 (for (3))\n\nf(3,3) = 1 (for (3))\n\nSample Input 2\n\n5 8\n9 9 9 9 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n10 10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 3\n\n152", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 123, "memory_kb": 73848}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s169123085", "group_id": "codeNet:p02735", "input_text": "let split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\n\nlet (h, w) = Scanf.sscanf (read_line ()) \"%d %d\" @@ fun h w -> (h, w)\nlet s = Array.init h @@ fun _ -> Array.of_list @@ split_string @@ read_line ()\n\nlet rec loop dp i j =\n  if i = h then Printf.printf \"%d\\n\" dp.(h - 1).(w - 1)\n  else begin\n    dp.(i).(j) <- min\n      (if i > 0 then (dp.(i - 1).(j) + if s.(i - 1).(j) = \".\" && s.(i).(j) = \"#\" then 1 else 0) else max_int)\n      (if j > 0 then (dp.(i).(j - 1) + if s.(i).(j - 1) = \".\" && s.(i).(j) = \"#\" then 1 else 0) else max_int);\n    if j = w - 1 then loop dp (i + 1) 0 else loop dp i (j + 1)\n  end\n\nlet () =\n  let dp = Array.init h @@ fun _ -> Array.make w 0 in\n  if s.(0).(0) = \"#\" then dp.(0).(0) <- 1;\n  loop dp 0 1", "language": "OCaml", "metadata": {"date": 1589739074, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s169123085.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s169123085", "user_id": "u811309788"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\n\nlet (h, w) = Scanf.sscanf (read_line ()) \"%d %d\" @@ fun h w -> (h, w)\nlet s = Array.init h @@ fun _ -> Array.of_list @@ split_string @@ read_line ()\n\nlet rec loop dp i j =\n  if i = h then Printf.printf \"%d\\n\" dp.(h - 1).(w - 1)\n  else begin\n    dp.(i).(j) <- min\n      (if i > 0 then (dp.(i - 1).(j) + if s.(i - 1).(j) = \".\" && s.(i).(j) = \"#\" then 1 else 0) else max_int)\n      (if j > 0 then (dp.(i).(j - 1) + if s.(i).(j - 1) = \".\" && s.(i).(j) = \"#\" then 1 else 0) else max_int);\n    if j = w - 1 then loop dp (i + 1) 0 else loop dp i (j + 1)\n  end\n\nlet () =\n  let dp = Array.init h @@ fun _ -> Array.make w 0 in\n  if s.(0).(0) = \"#\" then dp.(0).(0) <- 1;\n  loop dp 0 1", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 739, "cpu_time_ms": 3, "memory_kb": 2176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s848181068", "group_id": "codeNet:p02741", "input_text": "let ts = [| 1; 1; 1; 2; 1; 2; 1; 5; 2; 2; 1; 5; 1; 2; 1; 14; 1; 5; 1; 5; 2; 2; 1; 15; 2; 2; 5; 4; 1; 4; 1; 51 |]\n\nlet () = Printf.printf \"%d\\n\" @@ Array.get ts @@ Scanf.scanf \"%d\\n\" @@ pred", "language": "OCaml", "metadata": {"date": 1584234328, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02741.html", "problem_id": "p02741", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02741/input.txt", "sample_output_relpath": "derived/input_output/data/p02741/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02741/OCaml/s848181068.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s848181068", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let ts = [| 1; 1; 1; 2; 1; 2; 1; 5; 2; 2; 1; 5; 1; 2; 1; 14; 1; 5; 1; 5; 2; 2; 1; 15; 2; 2; 5; 4; 1; 4; 1; 51 |]\n\nlet () = Printf.printf \"%d\\n\" @@ Array.get ts @@ Scanf.scanf \"%d\\n\" @@ pred", "problem_context": "Score : 100 points\n\nProblem Statement\n\nPrint the K-th element of the following sequence of length 32:\n\n1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51\n\nConstraints\n\n1 \\leq K \\leq 32\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the K-th element.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n2\n\nThe 6-th element is 2.\n\nSample Input 2\n\n27\n\nSample Output 2\n\n5\n\nThe 27-th element is 5.", "sample_input": "6\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02741", "source_text": "Score : 100 points\n\nProblem Statement\n\nPrint the K-th element of the following sequence of length 32:\n\n1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51\n\nConstraints\n\n1 \\leq K \\leq 32\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the K-th element.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n2\n\nThe 6-th element is 2.\n\nSample Input 2\n\n27\n\nSample Output 2\n\n5\n\nThe 27-th element is 5.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 189, "cpu_time_ms": 2, "memory_kb": 4480}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s766183403", "group_id": "codeNet:p02742", "input_text": "open Printf\nopen Scanf\n\nlet prod h w =\n    if w = 1 then 1\n    else if h = 1 then 1\n    else if w mod 2 = 0 then (w/2)*h\n    else if h mod 2 = 0 then (w/2)*(h/2)+(w+1)/2*(h/2)\n    else (w/2)*(h/2)+(w+1)/2*(h+1)/2\n\nlet() = \n    scanf \"%d %d\" prod |> printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1586817614, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s766183403.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s766183403", "user_id": "u932465688"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet prod h w =\n    if w = 1 then 1\n    else if h = 1 then 1\n    else if w mod 2 = 0 then (w/2)*h\n    else if h mod 2 = 0 then (w/2)*(h/2)+(w+1)/2*(h/2)\n    else (w/2)*(h/2)+(w+1)/2*(h+1)/2\n\nlet() = \n    scanf \"%d %d\" prod |> printf \"%d\\n\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a board with H horizontal rows and W vertical columns of squares.\nThere is a bishop at the top-left square on this board.\nHow many squares can this bishop reach by zero or more movements?\n\nHere the bishop can only move diagonally.\nMore formally, the bishop can move from the square at the r_1-th row (from the top) and the c_1-th column (from the left) to the square at the r_2-th row and the c_2-th column if and only if exactly one of the following holds:\n\nr_1 + c_1 = r_2 + c_2\n\nr_1 - c_1 = r_2 - c_2\n\nFor example, in the following figure, the bishop can move to any of the red squares in one move:\n\nConstraints\n\n1 \\leq H, W \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH \\ W\n\nOutput\n\nPrint the number of squares the bishop can reach.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\n10\n\nThe bishop can reach the cyan squares in the following figure:\n\nSample Input 2\n\n7 3\n\nSample Output 2\n\n11\n\nThe bishop can reach the cyan squares in the following figure:\n\nSample Input 3\n\n1000000000 1000000000\n\nSample Output 3\n\n500000000000000000", "sample_input": "4 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02742", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a board with H horizontal rows and W vertical columns of squares.\nThere is a bishop at the top-left square on this board.\nHow many squares can this bishop reach by zero or more movements?\n\nHere the bishop can only move diagonally.\nMore formally, the bishop can move from the square at the r_1-th row (from the top) and the c_1-th column (from the left) to the square at the r_2-th row and the c_2-th column if and only if exactly one of the following holds:\n\nr_1 + c_1 = r_2 + c_2\n\nr_1 - c_1 = r_2 - c_2\n\nFor example, in the following figure, the bishop can move to any of the red squares in one move:\n\nConstraints\n\n1 \\leq H, W \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH \\ W\n\nOutput\n\nPrint the number of squares the bishop can reach.\n\nSample Input 1\n\n4 5\n\nSample Output 1\n\n10\n\nThe bishop can reach the cyan squares in the following figure:\n\nSample Input 2\n\n7 3\n\nSample Output 2\n\n11\n\nThe bishop can reach the cyan squares in the following figure:\n\nSample Input 3\n\n1000000000 1000000000\n\nSample Output 3\n\n500000000000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 262, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s660601090", "group_id": "codeNet:p02745", "input_text": "let eqs a b o =\n  let a, b, o = if o < 0 then b, a, -o else a, b, o in\n  let rec f i =\n    if i+o >= String.length a || i >= String.length b then true\n    else (a.[i+o] = '?' || b.[i] = '?' || a.[i+o] = b.[i]) && f (i+1)\n  in f 0\n\nlet max3 a b = max (max a b)\nlet min3 a b = min (min a b)\n\nlet () =\n  Scanf.scanf \"%s %s %s\" @@ fun a b c ->\n  let la, lb, lc = String.(length a, length b, length c) in\n  let ab = Array.init 4001 (fun i -> eqs a b (i-2000)) in\n  let bc = Array.init 4001 (fun i -> eqs b c (i-2000)) in\n  let ac = Array.init 4001 (fun i -> eqs a c (i-2000)) in\n\n  let ans = ref 6000 in\n  for i = -4000 to 4000 do\n    if abs i > 2000 || ab.(i+2000) then\n      for j = -4000 to 4000 do\n          if (abs j > 2000 || ac.(j+2000)) &&\n             (abs (j-i) > 2000 || bc.(j-i+2000))\n          then\n            ans := min !ans (max3 la (i+lb) (j+lc) - min3 0 i j)\n      done;\n  done;\n  Printf.printf \"%d\\n\" !ans\n", "language": "OCaml", "metadata": {"date": 1584250553, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02745.html", "problem_id": "p02745", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02745/input.txt", "sample_output_relpath": "derived/input_output/data/p02745/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02745/OCaml/s660601090.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s660601090", "user_id": "u798181098"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "let eqs a b o =\n  let a, b, o = if o < 0 then b, a, -o else a, b, o in\n  let rec f i =\n    if i+o >= String.length a || i >= String.length b then true\n    else (a.[i+o] = '?' || b.[i] = '?' || a.[i+o] = b.[i]) && f (i+1)\n  in f 0\n\nlet max3 a b = max (max a b)\nlet min3 a b = min (min a b)\n\nlet () =\n  Scanf.scanf \"%s %s %s\" @@ fun a b c ->\n  let la, lb, lc = String.(length a, length b, length c) in\n  let ab = Array.init 4001 (fun i -> eqs a b (i-2000)) in\n  let bc = Array.init 4001 (fun i -> eqs b c (i-2000)) in\n  let ac = Array.init 4001 (fun i -> eqs a c (i-2000)) in\n\n  let ans = ref 6000 in\n  for i = -4000 to 4000 do\n    if abs i > 2000 || ab.(i+2000) then\n      for j = -4000 to 4000 do\n          if (abs j > 2000 || ac.(j+2000)) &&\n             (abs (j-i) > 2000 || bc.(j-i+2000))\n          then\n            ans := min !ans (max3 la (i+lb) (j+lc) - min3 0 i j)\n      done;\n  done;\n  Printf.printf \"%d\\n\" !ans\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nSnuke has a string s.\nFrom this string, Anuke, Bnuke, and Cnuke obtained strings a, b, and c, respectively, as follows:\n\nChoose a non-empty (contiguous) substring of s (possibly s itself). Then, replace some characters (possibly all or none) in it with ?s.\n\nFor example, if s is mississippi, we can choose the substring ssissip and replace its 1-st and 3-rd characters with ? to obtain ?s?ssip.\n\nYou are given the strings a, b, and c.\nFind the minimum possible length of s.\n\nConstraints\n\n1 \\leq |a|, |b|, |c| \\leq 2000\n\na, b, and c consists of lowercase English letters and ?s.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\nb\nc\n\nOutput\n\nPrint the minimum possible length of s.\n\nSample Input 1\n\na?c\nder\ncod\n\nSample Output 1\n\n7\n\nFor example, s could be atcoder.\n\nSample Input 2\n\natcoder\natcoder\n???????\n\nSample Output 2\n\n7\n\na, b, and c may not be distinct.", "sample_input": "a?c\nder\ncod\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02745", "source_text": "Score : 500 points\n\nProblem Statement\n\nSnuke has a string s.\nFrom this string, Anuke, Bnuke, and Cnuke obtained strings a, b, and c, respectively, as follows:\n\nChoose a non-empty (contiguous) substring of s (possibly s itself). Then, replace some characters (possibly all or none) in it with ?s.\n\nFor example, if s is mississippi, we can choose the substring ssissip and replace its 1-st and 3-rd characters with ? to obtain ?s?ssip.\n\nYou are given the strings a, b, and c.\nFind the minimum possible length of s.\n\nConstraints\n\n1 \\leq |a|, |b|, |c| \\leq 2000\n\na, b, and c consists of lowercase English letters and ?s.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\nb\nc\n\nOutput\n\nPrint the minimum possible length of s.\n\nSample Input 1\n\na?c\nder\ncod\n\nSample Output 1\n\n7\n\nFor example, s could be atcoder.\n\nSample Input 2\n\natcoder\natcoder\n???????\n\nSample Output 2\n\n7\n\na, b, and c may not be distinct.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 920, "cpu_time_ms": 2103, "memory_kb": 4736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s656527043", "group_id": "codeNet:p02747", "input_text": "let s = read_line()\n\nlet rec f i b =\n  try\n    let c = s.[i] in\n    if b then\n      begin\n        if c <> 'h' then \"No\"\n        else f (i+1) false\n      end\n    else\n      if c = 'i' then f (i+1) true\n      else \"No\"\n  with Invalid_argument _ -> if b then \"Yes\" else \"No\"\n\nlet () = print_endline (f 0 true)\n", "language": "OCaml", "metadata": {"date": 1583797151, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s656527043.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s656527043", "user_id": "u752907799"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let s = read_line()\n\nlet rec f i b =\n  try\n    let c = s.[i] in\n    if b then\n      begin\n        if c <> 'h' then \"No\"\n        else f (i+1) false\n      end\n    else\n      if c = 'i' then f (i+1) true\n      else \"No\"\n  with Invalid_argument _ -> if b then \"Yes\" else \"No\"\n\nlet () = print_endline (f 0 true)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA Hitachi string is a concatenation of one or more copies of the string hi.\n\nFor example, hi and hihi are Hitachi strings, while ha and hii are not.\n\nGiven a string S, determine whether S is a Hitachi string.\n\nConstraints\n\nThe length of S is between 1 and 10 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a Hitachi string, print Yes; otherwise, print No.\n\nSample Input 1\n\nhihi\n\nSample Output 1\n\nYes\n\nhihi is the concatenation of two copies of hi, so it is a Hitachi string.\n\nSample Input 2\n\nhi\n\nSample Output 2\n\nYes\n\nSample Input 3\n\nha\n\nSample Output 3\n\nNo", "sample_input": "hihi\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02747", "source_text": "Score : 100 points\n\nProblem Statement\n\nA Hitachi string is a concatenation of one or more copies of the string hi.\n\nFor example, hi and hihi are Hitachi strings, while ha and hii are not.\n\nGiven a string S, determine whether S is a Hitachi string.\n\nConstraints\n\nThe length of S is between 1 and 10 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a Hitachi string, print Yes; otherwise, print No.\n\nSample Input 1\n\nhihi\n\nSample Output 1\n\nYes\n\nhihi is the concatenation of two copies of hi, so it is a Hitachi string.\n\nSample Input 2\n\nhi\n\nSample Output 2\n\nYes\n\nSample Input 3\n\nha\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 307, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s353008286", "group_id": "codeNet:p02747", "input_text": "let s = read_line()\n\nlet rec f i b =\n  try\n    let c = s.[i] in\n    if b then\n      begin\n        if c <> 'h' then \"No\"\n        else f (i+1) false\n      end\n    else\n      if c = 'i' then f (i+1) true\n      else \"No\"\n  with Invalid_argument _ -> \"Yes\"\n\nlet () = print_endline (f 0 true)\n", "language": "OCaml", "metadata": {"date": 1583796863, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s353008286.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s353008286", "user_id": "u752907799"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let s = read_line()\n\nlet rec f i b =\n  try\n    let c = s.[i] in\n    if b then\n      begin\n        if c <> 'h' then \"No\"\n        else f (i+1) false\n      end\n    else\n      if c = 'i' then f (i+1) true\n      else \"No\"\n  with Invalid_argument _ -> \"Yes\"\n\nlet () = print_endline (f 0 true)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA Hitachi string is a concatenation of one or more copies of the string hi.\n\nFor example, hi and hihi are Hitachi strings, while ha and hii are not.\n\nGiven a string S, determine whether S is a Hitachi string.\n\nConstraints\n\nThe length of S is between 1 and 10 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a Hitachi string, print Yes; otherwise, print No.\n\nSample Input 1\n\nhihi\n\nSample Output 1\n\nYes\n\nhihi is the concatenation of two copies of hi, so it is a Hitachi string.\n\nSample Input 2\n\nhi\n\nSample Output 2\n\nYes\n\nSample Input 3\n\nha\n\nSample Output 3\n\nNo", "sample_input": "hihi\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02747", "source_text": "Score : 100 points\n\nProblem Statement\n\nA Hitachi string is a concatenation of one or more copies of the string hi.\n\nFor example, hi and hihi are Hitachi strings, while ha and hii are not.\n\nGiven a string S, determine whether S is a Hitachi string.\n\nConstraints\n\nThe length of S is between 1 and 10 (inclusive).\n\nS is a string consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a Hitachi string, print Yes; otherwise, print No.\n\nSample Input 1\n\nhihi\n\nSample Output 1\n\nYes\n\nhihi is the concatenation of two copies of hi, so it is a Hitachi string.\n\nSample Input 2\n\nhi\n\nSample Output 2\n\nYes\n\nSample Input 3\n\nha\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s031645285", "group_id": "codeNet:p02753", "input_text": "let () = Scanf.scanf \"%s\" @@ fun s ->\n  if s = \"AAA\" || s = \"BBB\"\n  then print_endline \"Yes\"\n  else print_endline \"No\"", "language": "OCaml", "metadata": {"date": 1592094322, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s031645285.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s031645285", "user_id": "u052332717"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () = Scanf.scanf \"%s\" @@ fun s ->\n  if s = \"AAA\" || s = \"BBB\"\n  then print_endline \"Yes\"\n  else print_endline \"No\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn AtCoder City, there are three stations numbered 1, 2, and 3.\n\nEach of these stations is operated by one of the two railway companies, A and B. A string S of length 3 represents which company operates each station. If S_i is A, Company A operates Station i; if S_i is B, Company B operates Station i.\n\nTo improve the transportation condition, for each pair of a station operated by Company A and one operated by Company B, there will be a bus service connecting them.\n\nDetermine if there is a pair of stations that will be connected by a bus service.\n\nConstraints\n\nEach character of S is A or B.\n\n|S| = 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf there is a pair of stations that will be connected by a bus service, print Yes; otherwise, print No.\n\nSample Input 1\n\nABA\n\nSample Output 1\n\nYes\n\nCompany A operates Station 1 and 3, while Company B operates Station 2.\n\nThere will be a bus service between Station 1 and 2, and between Station 2 and 3, so print Yes.\n\nSample Input 2\n\nBBA\n\nSample Output 2\n\nYes\n\nCompany B operates Station 1 and 2, while Company A operates Station 3.\n\nThere will be a bus service between Station 1 and 3, and between Station 2 and 3, so print Yes.\n\nSample Input 3\n\nBBB\n\nSample Output 3\n\nNo\n\nCompany B operates all the stations. Thus, there will be no bus service, so print No.", "sample_input": "ABA\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02753", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn AtCoder City, there are three stations numbered 1, 2, and 3.\n\nEach of these stations is operated by one of the two railway companies, A and B. A string S of length 3 represents which company operates each station. If S_i is A, Company A operates Station i; if S_i is B, Company B operates Station i.\n\nTo improve the transportation condition, for each pair of a station operated by Company A and one operated by Company B, there will be a bus service connecting them.\n\nDetermine if there is a pair of stations that will be connected by a bus service.\n\nConstraints\n\nEach character of S is A or B.\n\n|S| = 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf there is a pair of stations that will be connected by a bus service, print Yes; otherwise, print No.\n\nSample Input 1\n\nABA\n\nSample Output 1\n\nYes\n\nCompany A operates Station 1 and 3, while Company B operates Station 2.\n\nThere will be a bus service between Station 1 and 2, and between Station 2 and 3, so print Yes.\n\nSample Input 2\n\nBBA\n\nSample Output 2\n\nYes\n\nCompany B operates Station 1 and 2, while Company A operates Station 3.\n\nThere will be a bus service between Station 1 and 3, and between Station 2 and 3, so print Yes.\n\nSample Input 3\n\nBBB\n\nSample Output 3\n\nNo\n\nCompany B operates all the stations. Thus, there will be no bus service, so print No.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 118, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s864238099", "group_id": "codeNet:p02754", "input_text": "let () = Scanf.scanf \"%d %d %d\" @@ fun n a b ->\n  Printf.printf \"%d\\n\" @@\n  n / (a + b) * a + min a (n mod (a + b))", "language": "OCaml", "metadata": {"date": 1583633917, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s864238099.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s864238099", "user_id": "u504158101"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" @@ fun n a b ->\n  Printf.printf \"%d\\n\" @@\n  n / (a + b) * a + min a (n mod (a + b))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has many red balls and blue balls. Now, he will place them in a row.\n\nInitially, there is no ball placed.\n\nTakahashi, who is very patient, will do the following operation 10^{100} times:\n\nPlace A blue balls at the end of the row of balls already placed. Then, place B red balls at the end of the row.\n\nHow many blue balls will be there among the first N balls in the row of balls made this way?\n\nConstraints\n\n1 \\leq N \\leq 10^{18}\n\nA, B \\geq 0\n\n0 < A + B \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of blue balls that will be there among the first N balls in the row of balls.\n\nSample Input 1\n\n8 3 4\n\nSample Output 1\n\n4\n\nLet b denote a blue ball, and r denote a red ball. The first eight balls in the row will be bbbrrrrb, among which there are four blue balls.\n\nSample Input 2\n\n8 0 4\n\nSample Output 2\n\n0\n\nHe placed only red balls from the beginning.\n\nSample Input 3\n\n6 2 4\n\nSample Output 3\n\n2\n\nAmong bbrrrr, there are two blue balls.", "sample_input": "8 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02754", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has many red balls and blue balls. Now, he will place them in a row.\n\nInitially, there is no ball placed.\n\nTakahashi, who is very patient, will do the following operation 10^{100} times:\n\nPlace A blue balls at the end of the row of balls already placed. Then, place B red balls at the end of the row.\n\nHow many blue balls will be there among the first N balls in the row of balls made this way?\n\nConstraints\n\n1 \\leq N \\leq 10^{18}\n\nA, B \\geq 0\n\n0 < A + B \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the number of blue balls that will be there among the first N balls in the row of balls.\n\nSample Input 1\n\n8 3 4\n\nSample Output 1\n\n4\n\nLet b denote a blue ball, and r denote a red ball. The first eight balls in the row will be bbbrrrrb, among which there are four blue balls.\n\nSample Input 2\n\n8 0 4\n\nSample Output 2\n\n0\n\nHe placed only red balls from the beginning.\n\nSample Input 3\n\n6 2 4\n\nSample Output 3\n\n2\n\nAmong bbrrrr, there are two blue balls.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s054239639", "group_id": "codeNet:p02756", "input_text": "let s, q = Scanf.scanf \" %s %d\" @@ fun a b -> a, b\nlet r, fs, bs = ref 0, ref [], ref []\nlet g s = String.(init (length s) @@ fun i -> s.[length s - i - 1])\nlet _ = Scanf.(for _ = 1 to q do scanf \" %d\" @@ fun t -> if t = 1 then r := !r lxor 1 else scanf \" %d %s\" @@ fun f c -> if !r = f - 1 then fs := c :: !fs else bs := c :: !bs done); List.(if !r = 0 then bs := rev !bs else fs := rev !fs); let f, b = String.(concat \"\" !fs, concat \"\" !bs) in print_endline @@ if !r = 0 then f ^ s ^ b else b ^ g s ^ f", "language": "OCaml", "metadata": {"date": 1583663098, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02756.html", "problem_id": "p02756", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02756/input.txt", "sample_output_relpath": "derived/input_output/data/p02756/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02756/OCaml/s054239639.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s054239639", "user_id": "u732304692"}, "prompt_components": {"gold_output": "cpa\n", "input_to_evaluate": "let s, q = Scanf.scanf \" %s %d\" @@ fun a b -> a, b\nlet r, fs, bs = ref 0, ref [], ref []\nlet g s = String.(init (length s) @@ fun i -> s.[length s - i - 1])\nlet _ = Scanf.(for _ = 1 to q do scanf \" %d\" @@ fun t -> if t = 1 then r := !r lxor 1 else scanf \" %d %s\" @@ fun f c -> if !r = f - 1 then fs := c :: !fs else bs := c :: !bs done); List.(if !r = 0 then bs := rev !bs else fs := rev !fs); let f, b = String.(concat \"\" !fs, concat \"\" !bs) in print_endline @@ if !r = 0 then f ^ s ^ b else b ^ g s ^ f", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a string S consisting of lowercase English letters.\n\nStarting with this string, he will produce a new one in the procedure given as follows.\n\nThe procedure consists of Q operations. In Operation i (1 \\leq i \\leq Q), an integer T_i is provided, which means the following:\n\nIf T_i = 1: reverse the string S.\n\nIf T_i = 2: An integer F_i and a lowercase English letter C_i are additionally provided.\n\nIf F_i = 1 : Add C_i to the beginning of the string S.\n\nIf F_i = 2 : Add C_i to the end of the string S.\n\nHelp Takahashi by finding the final string that results from the procedure.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS consists of lowercase English letters.\n\n1 \\leq Q \\leq 2 \\times 10^5\n\nT_i = 1 or 2.\n\nF_i = 1 or 2, if provided.\n\nC_i is a lowercase English letter, if provided.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nQ\nQuery_1\n:\nQuery_Q\n\nIn the 3-rd through the (Q+2)-th lines, Query_i is one of the following:\n\n1\n\nwhich means T_i = 1, and:\n\n2 F_i C_i\n\nwhich means T_i = 2.\n\nOutput\n\nPrint the resulting string.\n\nSample Input 1\n\na\n4\n2 1 p\n1\n2 2 c\n1\n\nSample Output 1\n\ncpa\n\nThere will be Q = 4 operations. Initially, S is a.\n\nOperation 1: Add p at the beginning of S. S becomes pa.\n\nOperation 2: Reverse S. S becomes ap.\n\nOperation 3: Add c at the end of S. S becomes apc.\n\nOperation 4: Reverse S. S becomes cpa.\n\nThus, the resulting string is cpa.\n\nSample Input 2\n\na\n6\n2 2 a\n2 1 b\n1\n2 2 c\n1\n1\n\nSample Output 2\n\naabc\n\nThere will be Q = 6 operations. Initially, S is a.\n\nOperation 1: S becomes aa.\n\nOperation 2: S becomes baa.\n\nOperation 3: S becomes aab.\n\nOperation 4: S becomes aabc.\n\nOperation 5: S becomes cbaa.\n\nOperation 6: S becomes aabc.\n\nThus, the resulting string is aabc.\n\nSample Input 3\n\ny\n1\n2 1 x\n\nSample Output 3\n\nxy", "sample_input": "a\n4\n2 1 p\n1\n2 2 c\n1\n"}, "reference_outputs": ["cpa\n"], "source_document_id": "p02756", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a string S consisting of lowercase English letters.\n\nStarting with this string, he will produce a new one in the procedure given as follows.\n\nThe procedure consists of Q operations. In Operation i (1 \\leq i \\leq Q), an integer T_i is provided, which means the following:\n\nIf T_i = 1: reverse the string S.\n\nIf T_i = 2: An integer F_i and a lowercase English letter C_i are additionally provided.\n\nIf F_i = 1 : Add C_i to the beginning of the string S.\n\nIf F_i = 2 : Add C_i to the end of the string S.\n\nHelp Takahashi by finding the final string that results from the procedure.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS consists of lowercase English letters.\n\n1 \\leq Q \\leq 2 \\times 10^5\n\nT_i = 1 or 2.\n\nF_i = 1 or 2, if provided.\n\nC_i is a lowercase English letter, if provided.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nQ\nQuery_1\n:\nQuery_Q\n\nIn the 3-rd through the (Q+2)-th lines, Query_i is one of the following:\n\n1\n\nwhich means T_i = 1, and:\n\n2 F_i C_i\n\nwhich means T_i = 2.\n\nOutput\n\nPrint the resulting string.\n\nSample Input 1\n\na\n4\n2 1 p\n1\n2 2 c\n1\n\nSample Output 1\n\ncpa\n\nThere will be Q = 4 operations. Initially, S is a.\n\nOperation 1: Add p at the beginning of S. S becomes pa.\n\nOperation 2: Reverse S. S becomes ap.\n\nOperation 3: Add c at the end of S. S becomes apc.\n\nOperation 4: Reverse S. S becomes cpa.\n\nThus, the resulting string is cpa.\n\nSample Input 2\n\na\n6\n2 2 a\n2 1 b\n1\n2 2 c\n1\n1\n\nSample Output 2\n\naabc\n\nThere will be Q = 6 operations. Initially, S is a.\n\nOperation 1: S becomes aa.\n\nOperation 2: S becomes baa.\n\nOperation 3: S becomes aab.\n\nOperation 4: S becomes aabc.\n\nOperation 5: S becomes cbaa.\n\nOperation 6: S becomes aabc.\n\nThus, the resulting string is aabc.\n\nSample Input 3\n\ny\n1\n2 1 x\n\nSample Output 3\n\nxy", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 504, "cpu_time_ms": 132, "memory_kb": 13568}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s111616293", "group_id": "codeNet:p02756", "input_text": "open Batteries\n\nlet s = read_line ()\nlet q = read_int ()\n\nlet string_rev s =\n  let len = String.length s in\n  String.init len (fun i -> s.[len - 1 - i])\n\nlet add_p result line_list =\n    match List.nth line_list 1 with\n    | \"1\" -> (List.nth line_list 2) ^ result\n    | _ -> result ^ (List.nth line_list 2)\n\n\nlet change result line =\n    match line.[0] with\n    | '1' -> string_rev result\n    | _ -> add_p result (String.split_on_char ' ' line)\n\nlet rec ans r s = \n    match s with\n    | 0 -> r\n    | _ -> ans (change r (read_line())) (s-1)\n\nlet _ = print_endline (ans s q)\n\n", "language": "OCaml", "metadata": {"date": 1583636964, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02756.html", "problem_id": "p02756", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02756/input.txt", "sample_output_relpath": "derived/input_output/data/p02756/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02756/OCaml/s111616293.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s111616293", "user_id": "u511870776"}, "prompt_components": {"gold_output": "cpa\n", "input_to_evaluate": "open Batteries\n\nlet s = read_line ()\nlet q = read_int ()\n\nlet string_rev s =\n  let len = String.length s in\n  String.init len (fun i -> s.[len - 1 - i])\n\nlet add_p result line_list =\n    match List.nth line_list 1 with\n    | \"1\" -> (List.nth line_list 2) ^ result\n    | _ -> result ^ (List.nth line_list 2)\n\n\nlet change result line =\n    match line.[0] with\n    | '1' -> string_rev result\n    | _ -> add_p result (String.split_on_char ' ' line)\n\nlet rec ans r s = \n    match s with\n    | 0 -> r\n    | _ -> ans (change r (read_line())) (s-1)\n\nlet _ = print_endline (ans s q)\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a string S consisting of lowercase English letters.\n\nStarting with this string, he will produce a new one in the procedure given as follows.\n\nThe procedure consists of Q operations. In Operation i (1 \\leq i \\leq Q), an integer T_i is provided, which means the following:\n\nIf T_i = 1: reverse the string S.\n\nIf T_i = 2: An integer F_i and a lowercase English letter C_i are additionally provided.\n\nIf F_i = 1 : Add C_i to the beginning of the string S.\n\nIf F_i = 2 : Add C_i to the end of the string S.\n\nHelp Takahashi by finding the final string that results from the procedure.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS consists of lowercase English letters.\n\n1 \\leq Q \\leq 2 \\times 10^5\n\nT_i = 1 or 2.\n\nF_i = 1 or 2, if provided.\n\nC_i is a lowercase English letter, if provided.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nQ\nQuery_1\n:\nQuery_Q\n\nIn the 3-rd through the (Q+2)-th lines, Query_i is one of the following:\n\n1\n\nwhich means T_i = 1, and:\n\n2 F_i C_i\n\nwhich means T_i = 2.\n\nOutput\n\nPrint the resulting string.\n\nSample Input 1\n\na\n4\n2 1 p\n1\n2 2 c\n1\n\nSample Output 1\n\ncpa\n\nThere will be Q = 4 operations. Initially, S is a.\n\nOperation 1: Add p at the beginning of S. S becomes pa.\n\nOperation 2: Reverse S. S becomes ap.\n\nOperation 3: Add c at the end of S. S becomes apc.\n\nOperation 4: Reverse S. S becomes cpa.\n\nThus, the resulting string is cpa.\n\nSample Input 2\n\na\n6\n2 2 a\n2 1 b\n1\n2 2 c\n1\n1\n\nSample Output 2\n\naabc\n\nThere will be Q = 6 operations. Initially, S is a.\n\nOperation 1: S becomes aa.\n\nOperation 2: S becomes baa.\n\nOperation 3: S becomes aab.\n\nOperation 4: S becomes aabc.\n\nOperation 5: S becomes cbaa.\n\nOperation 6: S becomes aabc.\n\nThus, the resulting string is aabc.\n\nSample Input 3\n\ny\n1\n2 1 x\n\nSample Output 3\n\nxy", "sample_input": "a\n4\n2 1 p\n1\n2 2 c\n1\n"}, "reference_outputs": ["cpa\n"], "source_document_id": "p02756", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a string S consisting of lowercase English letters.\n\nStarting with this string, he will produce a new one in the procedure given as follows.\n\nThe procedure consists of Q operations. In Operation i (1 \\leq i \\leq Q), an integer T_i is provided, which means the following:\n\nIf T_i = 1: reverse the string S.\n\nIf T_i = 2: An integer F_i and a lowercase English letter C_i are additionally provided.\n\nIf F_i = 1 : Add C_i to the beginning of the string S.\n\nIf F_i = 2 : Add C_i to the end of the string S.\n\nHelp Takahashi by finding the final string that results from the procedure.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS consists of lowercase English letters.\n\n1 \\leq Q \\leq 2 \\times 10^5\n\nT_i = 1 or 2.\n\nF_i = 1 or 2, if provided.\n\nC_i is a lowercase English letter, if provided.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nQ\nQuery_1\n:\nQuery_Q\n\nIn the 3-rd through the (Q+2)-th lines, Query_i is one of the following:\n\n1\n\nwhich means T_i = 1, and:\n\n2 F_i C_i\n\nwhich means T_i = 2.\n\nOutput\n\nPrint the resulting string.\n\nSample Input 1\n\na\n4\n2 1 p\n1\n2 2 c\n1\n\nSample Output 1\n\ncpa\n\nThere will be Q = 4 operations. Initially, S is a.\n\nOperation 1: Add p at the beginning of S. S becomes pa.\n\nOperation 2: Reverse S. S becomes ap.\n\nOperation 3: Add c at the end of S. S becomes apc.\n\nOperation 4: Reverse S. S becomes cpa.\n\nThus, the resulting string is cpa.\n\nSample Input 2\n\na\n6\n2 2 a\n2 1 b\n1\n2 2 c\n1\n1\n\nSample Output 2\n\naabc\n\nThere will be Q = 6 operations. Initially, S is a.\n\nOperation 1: S becomes aa.\n\nOperation 2: S becomes baa.\n\nOperation 3: S becomes aab.\n\nOperation 4: S becomes aabc.\n\nOperation 5: S becomes cbaa.\n\nOperation 6: S becomes aabc.\n\nThus, the resulting string is aabc.\n\nSample Input 3\n\ny\n1\n2 1 x\n\nSample Output 3\n\nxy", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 575, "cpu_time_ms": 2104, "memory_kb": 10368}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s265887671", "group_id": "codeNet:p02757", "input_text": "let rec power ( * ) e m n =\n  if n <= 0 then e\n  else power ( * ) (if n land 1 = 0 then e else m * e) (m * m) (n lsr 1)\n\nlet () = Scanf.scanf \"%d %d\\n%s\" @@ fun n p s ->\n  if p = 2 || p = 5 then begin\n    Printf.printf \"%d\\n\" @@\n    Array.fold_left ( + ) 0 @@\n    Array.init n @@ fun i ->\n      if 0 < (Char.code s.[i] - Char.code '0') mod p\n      then 0\n      else i + 1\n  end else begin\n    let ( +^ ) x y = (x + y) mod p in\n    let ( *^ ) x y = (x * y) mod p in\n    let acc = Array.make (n + 1) 0 in\n    for i = 0 to n - 1 do\n      acc.(i + 1) <- acc.(i) +^ power ( *^ ) (Char.code s.[i] - Char.code '0') 10 ((p - 2) * (i + 1))\n    done;\n    let ms = Array.make p 0 in\n    Array.iter (fun m -> ms.(m) <- 1 + ms.(m)) acc;\n    Printf.printf \"%d\\n\" @@\n    Array.fold_right (fun m -> ( + ) @@ m * (m - 1) / 2) ms 0\n  end", "language": "OCaml", "metadata": {"date": 1584074073, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s265887671.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s265887671", "user_id": "u504158101"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let rec power ( * ) e m n =\n  if n <= 0 then e\n  else power ( * ) (if n land 1 = 0 then e else m * e) (m * m) (n lsr 1)\n\nlet () = Scanf.scanf \"%d %d\\n%s\" @@ fun n p s ->\n  if p = 2 || p = 5 then begin\n    Printf.printf \"%d\\n\" @@\n    Array.fold_left ( + ) 0 @@\n    Array.init n @@ fun i ->\n      if 0 < (Char.code s.[i] - Char.code '0') mod p\n      then 0\n      else i + 1\n  end else begin\n    let ( +^ ) x y = (x + y) mod p in\n    let ( *^ ) x y = (x * y) mod p in\n    let acc = Array.make (n + 1) 0 in\n    for i = 0 to n - 1 do\n      acc.(i + 1) <- acc.(i) +^ power ( *^ ) (Char.code s.[i] - Char.code '0') 10 ((p - 2) * (i + 1))\n    done;\n    let ms = Array.make p 0 in\n    Array.iter (fun m -> ms.(m) <- 1 + ms.(m)) acc;\n    Printf.printf \"%d\\n\" @@\n    Array.fold_right (fun m -> ( + ) @@ m * (m - 1) / 2) ms 0\n  end", "problem_context": "Score : 500 points\n\nProblem Statement\n\nTakahashi has a string S of length N consisting of digits from 0 through 9.\n\nHe loves the prime number P. He wants to know how many non-empty (contiguous) substrings of S - there are N \\times (N + 1) / 2 of them - are divisible by P when regarded as integers written in base ten.\n\nHere substrings starting with a 0 also count, and substrings originated from different positions in S are distinguished, even if they are equal as strings or integers.\n\nCompute this count to help Takahashi.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS consists of digits.\n\n|S| = N\n\n2 \\leq P \\leq 10000\n\nP is a prime number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\nS\n\nOutput\n\nPrint the number of non-empty (contiguous) substrings of S that are divisible by P when regarded as an integer written in base ten.\n\nSample Input 1\n\n4 3\n3543\n\nSample Output 1\n\n6\n\nHere S = 3543. There are ten non-empty (contiguous) substrings of S:\n\n3: divisible by 3.\n\n35: not divisible by 3.\n\n354: divisible by 3.\n\n3543: divisible by 3.\n\n5: not divisible by 3.\n\n54: divisible by 3.\n\n543: divisible by 3.\n\n4: not divisible by 3.\n\n43: not divisible by 3.\n\n3: divisible by 3.\n\nSix of these are divisible by 3, so print 6.\n\nSample Input 2\n\n4 2\n2020\n\nSample Output 2\n\n10\n\nHere S = 2020. There are ten non-empty (contiguous) substrings of S, all of which are divisible by 2, so print 10.\n\nNote that substrings beginning with a 0 also count.\n\nSample Input 3\n\n20 11\n33883322005544116655\n\nSample Output 3\n\n68", "sample_input": "4 3\n3543\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02757", "source_text": "Score : 500 points\n\nProblem Statement\n\nTakahashi has a string S of length N consisting of digits from 0 through 9.\n\nHe loves the prime number P. He wants to know how many non-empty (contiguous) substrings of S - there are N \\times (N + 1) / 2 of them - are divisible by P when regarded as integers written in base ten.\n\nHere substrings starting with a 0 also count, and substrings originated from different positions in S are distinguished, even if they are equal as strings or integers.\n\nCompute this count to help Takahashi.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS consists of digits.\n\n|S| = N\n\n2 \\leq P \\leq 10000\n\nP is a prime number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\nS\n\nOutput\n\nPrint the number of non-empty (contiguous) substrings of S that are divisible by P when regarded as an integer written in base ten.\n\nSample Input 1\n\n4 3\n3543\n\nSample Output 1\n\n6\n\nHere S = 3543. There are ten non-empty (contiguous) substrings of S:\n\n3: divisible by 3.\n\n35: not divisible by 3.\n\n354: divisible by 3.\n\n3543: divisible by 3.\n\n5: not divisible by 3.\n\n54: divisible by 3.\n\n543: divisible by 3.\n\n4: not divisible by 3.\n\n43: not divisible by 3.\n\n3: divisible by 3.\n\nSix of these are divisible by 3, so print 6.\n\nSample Input 2\n\n4 2\n2020\n\nSample Output 2\n\n10\n\nHere S = 2020. There are ten non-empty (contiguous) substrings of S, all of which are divisible by 2, so print 10.\n\nNote that substrings beginning with a 0 also count.\n\nSample Input 3\n\n20 11\n33883322005544116655\n\nSample Output 3\n\n68", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 819, "cpu_time_ms": 165, "memory_kb": 4992}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s925049163", "group_id": "codeNet:p02757", "input_text": "Scanf.sscanf (read_line ()) \"%d %d\" (fun n p ->\n    let s = read_line () in\n    if p = 2 || p = 5 then (\n        let rec loop i d acc =\n            if i = n then acc else (\n                let c = int_of_char s.[i] - int_of_char '0' in\n                let d = if c mod p = 0 then d + 1 else d in\n                let acc = acc + d in\n                loop (i + 1) d acc\n            )\n        in\n        loop 0 0 0 |> Printf.printf \"%d\\n\"\n    ) else (\n        let dp = Array.make p 0 in\n        dp.(0) <- 1;\n        let rec loop i mul prev acc =\n            if i < 0 then acc else\n                let c = int_of_char s.[i] - int_of_char '0' in\n                let d = (c * mul + prev) mod p in\n                let () = dp.(d) <- dp.(d) + 1 in\n                loop (i - 1) ((mul * 10) mod p) d (acc + dp.(d) - 1)\n        in\n        loop (n - 1) 1 0 0 |> Printf.printf \"%d\\n\" \n    )\n)", "language": "OCaml", "metadata": {"date": 1583645332, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s925049163.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s925049163", "user_id": "u342443598"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "Scanf.sscanf (read_line ()) \"%d %d\" (fun n p ->\n    let s = read_line () in\n    if p = 2 || p = 5 then (\n        let rec loop i d acc =\n            if i = n then acc else (\n                let c = int_of_char s.[i] - int_of_char '0' in\n                let d = if c mod p = 0 then d + 1 else d in\n                let acc = acc + d in\n                loop (i + 1) d acc\n            )\n        in\n        loop 0 0 0 |> Printf.printf \"%d\\n\"\n    ) else (\n        let dp = Array.make p 0 in\n        dp.(0) <- 1;\n        let rec loop i mul prev acc =\n            if i < 0 then acc else\n                let c = int_of_char s.[i] - int_of_char '0' in\n                let d = (c * mul + prev) mod p in\n                let () = dp.(d) <- dp.(d) + 1 in\n                loop (i - 1) ((mul * 10) mod p) d (acc + dp.(d) - 1)\n        in\n        loop (n - 1) 1 0 0 |> Printf.printf \"%d\\n\" \n    )\n)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nTakahashi has a string S of length N consisting of digits from 0 through 9.\n\nHe loves the prime number P. He wants to know how many non-empty (contiguous) substrings of S - there are N \\times (N + 1) / 2 of them - are divisible by P when regarded as integers written in base ten.\n\nHere substrings starting with a 0 also count, and substrings originated from different positions in S are distinguished, even if they are equal as strings or integers.\n\nCompute this count to help Takahashi.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS consists of digits.\n\n|S| = N\n\n2 \\leq P \\leq 10000\n\nP is a prime number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\nS\n\nOutput\n\nPrint the number of non-empty (contiguous) substrings of S that are divisible by P when regarded as an integer written in base ten.\n\nSample Input 1\n\n4 3\n3543\n\nSample Output 1\n\n6\n\nHere S = 3543. There are ten non-empty (contiguous) substrings of S:\n\n3: divisible by 3.\n\n35: not divisible by 3.\n\n354: divisible by 3.\n\n3543: divisible by 3.\n\n5: not divisible by 3.\n\n54: divisible by 3.\n\n543: divisible by 3.\n\n4: not divisible by 3.\n\n43: not divisible by 3.\n\n3: divisible by 3.\n\nSix of these are divisible by 3, so print 6.\n\nSample Input 2\n\n4 2\n2020\n\nSample Output 2\n\n10\n\nHere S = 2020. There are ten non-empty (contiguous) substrings of S, all of which are divisible by 2, so print 10.\n\nNote that substrings beginning with a 0 also count.\n\nSample Input 3\n\n20 11\n33883322005544116655\n\nSample Output 3\n\n68", "sample_input": "4 3\n3543\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02757", "source_text": "Score : 500 points\n\nProblem Statement\n\nTakahashi has a string S of length N consisting of digits from 0 through 9.\n\nHe loves the prime number P. He wants to know how many non-empty (contiguous) substrings of S - there are N \\times (N + 1) / 2 of them - are divisible by P when regarded as integers written in base ten.\n\nHere substrings starting with a 0 also count, and substrings originated from different positions in S are distinguished, even if they are equal as strings or integers.\n\nCompute this count to help Takahashi.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS consists of digits.\n\n|S| = N\n\n2 \\leq P \\leq 10000\n\nP is a prime number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\nS\n\nOutput\n\nPrint the number of non-empty (contiguous) substrings of S that are divisible by P when regarded as an integer written in base ten.\n\nSample Input 1\n\n4 3\n3543\n\nSample Output 1\n\n6\n\nHere S = 3543. There are ten non-empty (contiguous) substrings of S:\n\n3: divisible by 3.\n\n35: not divisible by 3.\n\n354: divisible by 3.\n\n3543: divisible by 3.\n\n5: not divisible by 3.\n\n54: divisible by 3.\n\n543: divisible by 3.\n\n4: not divisible by 3.\n\n43: not divisible by 3.\n\n3: divisible by 3.\n\nSix of these are divisible by 3, so print 6.\n\nSample Input 2\n\n4 2\n2020\n\nSample Output 2\n\n10\n\nHere S = 2020. There are ten non-empty (contiguous) substrings of S, all of which are divisible by 2, so print 10.\n\nNote that substrings beginning with a 0 also count.\n\nSample Input 3\n\n20 11\n33883322005544116655\n\nSample Output 3\n\n68", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 879, "cpu_time_ms": 7, "memory_kb": 2816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s946996790", "group_id": "codeNet:p02757", "input_text": "Scanf.sscanf (read_line ()) \"%d %d\" (fun n p ->\n    let s = read_line () in\n    if p mod 2 = 0 || p mod 5 = 0 then (\n        let dp = Array.make_matrix 2 p 0 in\n        let rec loop i acc =\n            if i = n then acc else (\n                let cur = i mod 2 in\n                let next = 1 - cur in\n                let c = int_of_char s.[i] - int_of_char '0' in\n                for j = 0 to p - 1 do dp.(next).(j) <- 0 done;\n                for j = 0 to p - 1 do\n                    let v = (j * 10 + c) mod p in\n                    dp.(next).(v) <- dp.(next).(v) + dp.(cur).(j)\n                done;\n                dp.(next).(c mod p) <- dp.(next).(c mod p) + 1;\n                loop (i + 1) (acc + dp.(next).(0))\n            )\n        in\n        loop 0 0 |> Printf.printf \"%d\\n\"\n    ) else (\n        let dp = Array.make p 0 in\n        let rec loop i mul shift acc =\n            if i = n then acc else\n                let c = int_of_char s.[i] - int_of_char '0' in\n                let d = (c * mul + shift) mod p in\n                let () = dp.(d) <- dp.(d) + 1 in\n                let mul = (mul * 10) mod p in\n                let nextshift = (shift * 10 + c) mod p in\n                loop (i + 1) mul nextshift (acc + dp.(shift mod p))\n        in\n        loop 0 1 0 0 |> Printf.printf \"%d\\n\" \n    )\n)", "language": "OCaml", "metadata": {"date": 1583637304, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s946996790.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s946996790", "user_id": "u342443598"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "Scanf.sscanf (read_line ()) \"%d %d\" (fun n p ->\n    let s = read_line () in\n    if p mod 2 = 0 || p mod 5 = 0 then (\n        let dp = Array.make_matrix 2 p 0 in\n        let rec loop i acc =\n            if i = n then acc else (\n                let cur = i mod 2 in\n                let next = 1 - cur in\n                let c = int_of_char s.[i] - int_of_char '0' in\n                for j = 0 to p - 1 do dp.(next).(j) <- 0 done;\n                for j = 0 to p - 1 do\n                    let v = (j * 10 + c) mod p in\n                    dp.(next).(v) <- dp.(next).(v) + dp.(cur).(j)\n                done;\n                dp.(next).(c mod p) <- dp.(next).(c mod p) + 1;\n                loop (i + 1) (acc + dp.(next).(0))\n            )\n        in\n        loop 0 0 |> Printf.printf \"%d\\n\"\n    ) else (\n        let dp = Array.make p 0 in\n        let rec loop i mul shift acc =\n            if i = n then acc else\n                let c = int_of_char s.[i] - int_of_char '0' in\n                let d = (c * mul + shift) mod p in\n                let () = dp.(d) <- dp.(d) + 1 in\n                let mul = (mul * 10) mod p in\n                let nextshift = (shift * 10 + c) mod p in\n                loop (i + 1) mul nextshift (acc + dp.(shift mod p))\n        in\n        loop 0 1 0 0 |> Printf.printf \"%d\\n\" \n    )\n)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nTakahashi has a string S of length N consisting of digits from 0 through 9.\n\nHe loves the prime number P. He wants to know how many non-empty (contiguous) substrings of S - there are N \\times (N + 1) / 2 of them - are divisible by P when regarded as integers written in base ten.\n\nHere substrings starting with a 0 also count, and substrings originated from different positions in S are distinguished, even if they are equal as strings or integers.\n\nCompute this count to help Takahashi.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS consists of digits.\n\n|S| = N\n\n2 \\leq P \\leq 10000\n\nP is a prime number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\nS\n\nOutput\n\nPrint the number of non-empty (contiguous) substrings of S that are divisible by P when regarded as an integer written in base ten.\n\nSample Input 1\n\n4 3\n3543\n\nSample Output 1\n\n6\n\nHere S = 3543. There are ten non-empty (contiguous) substrings of S:\n\n3: divisible by 3.\n\n35: not divisible by 3.\n\n354: divisible by 3.\n\n3543: divisible by 3.\n\n5: not divisible by 3.\n\n54: divisible by 3.\n\n543: divisible by 3.\n\n4: not divisible by 3.\n\n43: not divisible by 3.\n\n3: divisible by 3.\n\nSix of these are divisible by 3, so print 6.\n\nSample Input 2\n\n4 2\n2020\n\nSample Output 2\n\n10\n\nHere S = 2020. There are ten non-empty (contiguous) substrings of S, all of which are divisible by 2, so print 10.\n\nNote that substrings beginning with a 0 also count.\n\nSample Input 3\n\n20 11\n33883322005544116655\n\nSample Output 3\n\n68", "sample_input": "4 3\n3543\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02757", "source_text": "Score : 500 points\n\nProblem Statement\n\nTakahashi has a string S of length N consisting of digits from 0 through 9.\n\nHe loves the prime number P. He wants to know how many non-empty (contiguous) substrings of S - there are N \\times (N + 1) / 2 of them - are divisible by P when regarded as integers written in base ten.\n\nHere substrings starting with a 0 also count, and substrings originated from different positions in S are distinguished, even if they are equal as strings or integers.\n\nCompute this count to help Takahashi.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS consists of digits.\n\n|S| = N\n\n2 \\leq P \\leq 10000\n\nP is a prime number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\nS\n\nOutput\n\nPrint the number of non-empty (contiguous) substrings of S that are divisible by P when regarded as an integer written in base ten.\n\nSample Input 1\n\n4 3\n3543\n\nSample Output 1\n\n6\n\nHere S = 3543. There are ten non-empty (contiguous) substrings of S:\n\n3: divisible by 3.\n\n35: not divisible by 3.\n\n354: divisible by 3.\n\n3543: divisible by 3.\n\n5: not divisible by 3.\n\n54: divisible by 3.\n\n543: divisible by 3.\n\n4: not divisible by 3.\n\n43: not divisible by 3.\n\n3: divisible by 3.\n\nSix of these are divisible by 3, so print 6.\n\nSample Input 2\n\n4 2\n2020\n\nSample Output 2\n\n10\n\nHere S = 2020. There are ten non-empty (contiguous) substrings of S, all of which are divisible by 2, so print 10.\n\nNote that substrings beginning with a 0 also count.\n\nSample Input 3\n\n20 11\n33883322005544116655\n\nSample Output 3\n\n68", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1306, "cpu_time_ms": 24, "memory_kb": 2944}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s028955377", "group_id": "codeNet:p02760", "input_text": "open Array\nlet () =\n  let arr = List.concat (to_list (init 3 @@ fun _ -> Scanf.scanf \"%d %d %d\\n\" @@ fun a b c -> [a; b; c])) in\n  let n = read_int () in\n  let brr = Array.init n @@ fun _ -> Scanf.scanf \"%d\\n\" @@ fun d -> d in\n  let check = Array.make_matrix 3 3 false in\n  for i = 0 to n-1 do\n    let x = brr.(i) in\n    if List.mem x arr then List.iteri (fun i a -> if a = x then check.(i / 3).(i mod 3) <- true) arr\n  done;\n  let ans = ref false in\n  for i = 0 to 2 do\n    if check.(i).(0) && check.(i).(1) && check.(i).(2) then ans := true (* 横 *)\n    else if check.(0).(i) && check.(1).(i) && check.(2).(i) then ans := true (* たて *)\n  done;\n  if check.(0).(0) && check.(1).(1) && check.(2).(2) then ans := true;\n  if check.(0).(2) && check.(1).(1) && check.(2).(0) then ans := true;\n  print_endline (if !ans then \"Yes\" else \"No\")", "language": "OCaml", "metadata": {"date": 1591466409, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s028955377.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s028955377", "user_id": "u307426615"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Array\nlet () =\n  let arr = List.concat (to_list (init 3 @@ fun _ -> Scanf.scanf \"%d %d %d\\n\" @@ fun a b c -> [a; b; c])) in\n  let n = read_int () in\n  let brr = Array.init n @@ fun _ -> Scanf.scanf \"%d\\n\" @@ fun d -> d in\n  let check = Array.make_matrix 3 3 false in\n  for i = 0 to n-1 do\n    let x = brr.(i) in\n    if List.mem x arr then List.iteri (fun i a -> if a = x then check.(i / 3).(i mod 3) <- true) arr\n  done;\n  let ans = ref false in\n  for i = 0 to 2 do\n    if check.(i).(0) && check.(i).(1) && check.(i).(2) then ans := true (* 横 *)\n    else if check.(0).(i) && check.(1).(i) && check.(2).(i) then ans := true (* たて *)\n  done;\n  if check.(0).(0) && check.(1).(1) && check.(2).(2) then ans := true;\n  if check.(0).(2) && check.(1).(1) && check.(2).(0) then ans := true;\n  print_endline (if !ans then \"Yes\" else \"No\")", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "sample_input": "84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02760", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 839, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s016916776", "group_id": "codeNet:p02760", "input_text": "open Array\nlet () =\n  let arr = List.concat (to_list (init 3 @@ fun _ -> Scanf.scanf \"%d %d %d\\n\" @@ fun a b c -> [a; b; c])) in\n  let n = read_int () in\n  let check = Array.make_matrix 3 3 false in\n  for i = 1 to n do\n    Scanf.scanf \"%d\\n\" @@ fun x ->\n    if List.mem x arr then List.iteri (fun i a -> if a = x then check.(i / 3).(i mod 3) <- true) arr\n  done;\n  let ans = ref false in\n  for i = 0 to 2 do\n    if check.(i).(0) && check.(i).(1) && check.(i).(2) then ans := true (* 横 *)\n    else if check.(0).(i) && check.(1).(i) && check.(2).(i) then ans := true (* たて *)\n  done;\n  if check.(0).(0) && check.(1).(1) && check.(2).(2) then ans := true;\n  if check.(0).(2) && check.(1).(1) && check.(2).(0) then ans := true;\n  print_endline (if !ans then \"Yes\" else \"No\")", "language": "OCaml", "metadata": {"date": 1591458919, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s016916776.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s016916776", "user_id": "u307426615"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Array\nlet () =\n  let arr = List.concat (to_list (init 3 @@ fun _ -> Scanf.scanf \"%d %d %d\\n\" @@ fun a b c -> [a; b; c])) in\n  let n = read_int () in\n  let check = Array.make_matrix 3 3 false in\n  for i = 1 to n do\n    Scanf.scanf \"%d\\n\" @@ fun x ->\n    if List.mem x arr then List.iteri (fun i a -> if a = x then check.(i / 3).(i mod 3) <- true) arr\n  done;\n  let ans = ref false in\n  for i = 0 to 2 do\n    if check.(i).(0) && check.(i).(1) && check.(i).(2) then ans := true (* 横 *)\n    else if check.(0).(i) && check.(1).(i) && check.(2).(i) then ans := true (* たて *)\n  done;\n  if check.(0).(0) && check.(1).(1) && check.(2).(2) then ans := true;\n  if check.(0).(2) && check.(1).(1) && check.(2).(0) then ans := true;\n  print_endline (if !ans then \"Yes\" else \"No\")", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "sample_input": "84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02760", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 776, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s690562568", "group_id": "codeNet:p02760", "input_text": "open Batteries\nopen BatPrintf\n\nlet dbg n = Printf.eprintf \"%s\\n\" @@ dump n; n\n\nlet scan fmt f =\n  Scanf.sscanf (read_line ()) fmt f\n\nlet scan_list cnv =\n  read_line ()\n  |> String.split_on_char ' '\n  |> List.map cnv\n\nlet scan_listn n cnv =\n  List.range 1 `To n |> List.map (fun _ -> cnv @@ read_line ())\n\nlet bsearch_ge arr a =\n  let l = Array.length arr in\n  match Array.bsearch Int.ord arr a with\n  | `All_lower -> l\n  | `All_bigger -> 0\n  | `Just_after n -> l - n -1\n  | `At n -> l - n\n  | `Empty -> 0\n\nlet rec zip xs ys =\n  match xs, ys with\n  | [], _ -> []\n  | _, [] -> []\n  | x::xs, y::ys ->\n    (x, y) :: zip xs ys\n\nlet square x = x * x\n\nlet as_ = scan_listn 3\n    (fun s -> String.split_on_char ' ' s |> List.Labels.map ~f:Int.of_string)\nlet n = scan \"%d\" identity\nlet bs = scan_listn n Int.of_string\nlet bingo = [[(0,0);(0,1);(0,2)]; [(1,0); (1,1); (1,2)]; [(2,0);(2,1);(2,2)];\n             [(0,0);(1,0);(2,0)]; [(0,1); (1,1); (2,1)]; [(0,2);(1,2);(2,2)];\n             [(0,0);(1,1);(2,2)];\n             [(2,0);(1,1);(0,2)]]\nlet () =\n  List.mapi\n    (fun i a -> List.mapi (fun j b -> if List.exists ((=) b) bs then Some (i,j) else None) a) as_\n  |> List.flatten\n  |> List.filter Option.is_some\n  |> List.map Option.get\n  |> (fun l -> List.exists ((=) true) @@ List.map (fun b -> (List.fold_left (fun r c -> List.exists ((=) c) l && r) true b)) bingo)\n  |> (fun ans -> printf \"%s\\n\" (if ans then \"Yes\" else \"No\"))\n", "language": "OCaml", "metadata": {"date": 1583889889, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s690562568.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s690562568", "user_id": "u802614675"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Batteries\nopen BatPrintf\n\nlet dbg n = Printf.eprintf \"%s\\n\" @@ dump n; n\n\nlet scan fmt f =\n  Scanf.sscanf (read_line ()) fmt f\n\nlet scan_list cnv =\n  read_line ()\n  |> String.split_on_char ' '\n  |> List.map cnv\n\nlet scan_listn n cnv =\n  List.range 1 `To n |> List.map (fun _ -> cnv @@ read_line ())\n\nlet bsearch_ge arr a =\n  let l = Array.length arr in\n  match Array.bsearch Int.ord arr a with\n  | `All_lower -> l\n  | `All_bigger -> 0\n  | `Just_after n -> l - n -1\n  | `At n -> l - n\n  | `Empty -> 0\n\nlet rec zip xs ys =\n  match xs, ys with\n  | [], _ -> []\n  | _, [] -> []\n  | x::xs, y::ys ->\n    (x, y) :: zip xs ys\n\nlet square x = x * x\n\nlet as_ = scan_listn 3\n    (fun s -> String.split_on_char ' ' s |> List.Labels.map ~f:Int.of_string)\nlet n = scan \"%d\" identity\nlet bs = scan_listn n Int.of_string\nlet bingo = [[(0,0);(0,1);(0,2)]; [(1,0); (1,1); (1,2)]; [(2,0);(2,1);(2,2)];\n             [(0,0);(1,0);(2,0)]; [(0,1); (1,1); (2,1)]; [(0,2);(1,2);(2,2)];\n             [(0,0);(1,1);(2,2)];\n             [(2,0);(1,1);(0,2)]]\nlet () =\n  List.mapi\n    (fun i a -> List.mapi (fun j b -> if List.exists ((=) b) bs then Some (i,j) else None) a) as_\n  |> List.flatten\n  |> List.filter Option.is_some\n  |> List.map Option.get\n  |> (fun l -> List.exists ((=) true) @@ List.map (fun b -> (List.fold_left (fun r c -> List.exists ((=) c) l && r) true b)) bingo)\n  |> (fun ans -> printf \"%s\\n\" (if ans then \"Yes\" else \"No\"))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "sample_input": "84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02760", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1421, "cpu_time_ms": 2, "memory_kb": 1024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s200883143", "group_id": "codeNet:p02760", "input_text": "let inp_matrix : 'a array -> int -> int -> unit = fun a m n ->\n  for i = 0 to m - 1 do\n    for j = 0 to n - 1 do\n      a.(i).(j) <- Scanf.scanf \" %d\" (fun x -> x)\n    done\n  done\n\nlet rec inp_loop : (unit -> 'a) -> int -> 'a list = fun inp_fun n ->\n  if n = 0 then []\n  else\n    let x = inp_fun () in\n    x :: inp_loop inp_fun (n - 1)\n\nlet hole a m n k =\n  for i = 0 to m - 1 do\n    for j = 0 to n - 1 do\n      if a.(i).(j) == k then\n        a.(i).(j) <- (-1)\n    done\n  done\n\nlet calc_ans a =\n  let ans = ref \"No\" in\n  for i = 0 to 2 do\n    if (a.(i).(0) == a.(i).(1) && a.(i).(0) == a.(i).(2)) then ans := \"Yes\"\n  done;\n  for j = 0 to 2 do\n    if (a.(0).(j) == a.(1).(j) && a.(0).(j) == a.(2).(j)) then ans := \"Yes\"\n  done;\n  if (a.(0).(0) == a.(1).(1) && a.(2).(2) == a.(1).(1) || a.(0).(2) == a.(1).(1) && a.(0).(2) == a.(2).(0)) then ans := \"Yes\";\n  !ans\n  \n  \nlet () =\n  let a = Array.make_matrix 3 3 0 in\n  let () = inp_matrix a 3 3 in\n  let n = Scanf.sscanf (input_line stdin) \"%d\" (fun a -> a) in\n  let l = inp_loop (fun () -> Scanf.sscanf (input_line stdin) \"%d\" (fun a -> a)) n in\n  List.iter  (hole a 3 3) l;\n  let ans = calc_ans a\n  in\n  print_endline ans;\n", "language": "OCaml", "metadata": {"date": 1583597342, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s200883143.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s200883143", "user_id": "u977566741"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let inp_matrix : 'a array -> int -> int -> unit = fun a m n ->\n  for i = 0 to m - 1 do\n    for j = 0 to n - 1 do\n      a.(i).(j) <- Scanf.scanf \" %d\" (fun x -> x)\n    done\n  done\n\nlet rec inp_loop : (unit -> 'a) -> int -> 'a list = fun inp_fun n ->\n  if n = 0 then []\n  else\n    let x = inp_fun () in\n    x :: inp_loop inp_fun (n - 1)\n\nlet hole a m n k =\n  for i = 0 to m - 1 do\n    for j = 0 to n - 1 do\n      if a.(i).(j) == k then\n        a.(i).(j) <- (-1)\n    done\n  done\n\nlet calc_ans a =\n  let ans = ref \"No\" in\n  for i = 0 to 2 do\n    if (a.(i).(0) == a.(i).(1) && a.(i).(0) == a.(i).(2)) then ans := \"Yes\"\n  done;\n  for j = 0 to 2 do\n    if (a.(0).(j) == a.(1).(j) && a.(0).(j) == a.(2).(j)) then ans := \"Yes\"\n  done;\n  if (a.(0).(0) == a.(1).(1) && a.(2).(2) == a.(1).(1) || a.(0).(2) == a.(1).(1) && a.(0).(2) == a.(2).(0)) then ans := \"Yes\";\n  !ans\n  \n  \nlet () =\n  let a = Array.make_matrix 3 3 0 in\n  let () = inp_matrix a 3 3 in\n  let n = Scanf.sscanf (input_line stdin) \"%d\" (fun a -> a) in\n  let l = inp_loop (fun () -> Scanf.sscanf (input_line stdin) \"%d\" (fun a -> a)) n in\n  List.iter  (hole a 3 3) l;\n  let ans = calc_ans a\n  in\n  print_endline ans;\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "sample_input": "84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02760", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1170, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s976094204", "group_id": "codeNet:p02760", "input_text": "let () =\n    let main () =\n        let ar = Array.make 101 1024 in\n        for i = 0 to 8 do\n            Scanf.scanf \" %d\" (fun a -> ar.(a) <- i)\n        done;\n        let n = read_int () in\n        let rec loop i map =\n            if i = 0 then map else\n                let b = read_int () in\n                loop (i - 1) (map lor ar.(b))\n        in\n        let m = loop n 0 in\n        let l = [\n            (1 lsl 0) lor (1 lsl 1) lor (1 lsl 2) ;\n            (1 lsl 3) lor (1 lsl 4) lor (1 lsl 5) ;\n            (1 lsl 6) lor (1 lsl 7) lor (1 lsl 8) ;\n            (1 lsl 0) lor (1 lsl 3) lor (1 lsl 6) ;\n            (1 lsl 1) lor (1 lsl 4) lor (1 lsl 7) ;\n            (1 lsl 2) lor (1 lsl 5) lor (1 lsl 8) ;\n            (1 lsl 0) lor (1 lsl 4) lor (1 lsl 8) ;\n            (1 lsl 2) lor (1 lsl 4) lor (1 lsl 6)\n        ] \n        in\n        print_endline (if List.exists (fun a -> a land m = a) l then \"Yes\" else \"No\")\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1583115043, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s976094204.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s976094204", "user_id": "u342443598"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n    let main () =\n        let ar = Array.make 101 1024 in\n        for i = 0 to 8 do\n            Scanf.scanf \" %d\" (fun a -> ar.(a) <- i)\n        done;\n        let n = read_int () in\n        let rec loop i map =\n            if i = 0 then map else\n                let b = read_int () in\n                loop (i - 1) (map lor ar.(b))\n        in\n        let m = loop n 0 in\n        let l = [\n            (1 lsl 0) lor (1 lsl 1) lor (1 lsl 2) ;\n            (1 lsl 3) lor (1 lsl 4) lor (1 lsl 5) ;\n            (1 lsl 6) lor (1 lsl 7) lor (1 lsl 8) ;\n            (1 lsl 0) lor (1 lsl 3) lor (1 lsl 6) ;\n            (1 lsl 1) lor (1 lsl 4) lor (1 lsl 7) ;\n            (1 lsl 2) lor (1 lsl 5) lor (1 lsl 8) ;\n            (1 lsl 0) lor (1 lsl 4) lor (1 lsl 8) ;\n            (1 lsl 2) lor (1 lsl 4) lor (1 lsl 6)\n        ] \n        in\n        print_endline (if List.exists (fun a -> a land m = a) l then \"Yes\" else \"No\")\n    in\n    main ()", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "sample_input": "84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02760", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 937, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s932649309", "group_id": "codeNet:p02762", "input_text": "Scanf.scanf \"%d %d %d\" (fun n m k ->\n    let par = Array.init n (fun i -> i) in\n    let size = Array.make n 1 in\n    let near = Array.make n 0 in\n    let rec root x =\n        if par.(x) = x then x else\n            let r = root par.(x) in\n            let () = par.(x) <- r in\n            r\n    in\n    for i = 1 to m do\n        Scanf.scanf \" %d %d\" (fun a b ->\n            let a = a - 1 in let b = b - 1 in\n            near.(a) <- near.(a) + 1;\n            near.(b) <- near.(b) + 1;\n            if root a <> root b then (\n                size.(par.(a)) <- size.(par.(a)) + size.(par.(b));\n                par.(par.(b)) <- par.(a)\n            )\n        )\n    done;\n    for i = 1 to k do\n        Scanf.scanf \" %d %d\" (fun c d ->\n            let c = c - 1 in let d = d - 1 in\n            if root c = root d then (\n                near.(c) <- near.(c) + 1;\n                near.(d) <- near.(d) + 1;\n            )\n        )\n    done;\n    for i = 0 to n - 1 do\n        Printf.printf \"%d \" (size.(root i) - near.(i) - 1)\n    done\n)", "language": "OCaml", "metadata": {"date": 1583123363, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02762.html", "problem_id": "p02762", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02762/input.txt", "sample_output_relpath": "derived/input_output/data/p02762/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02762/OCaml/s932649309.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s932649309", "user_id": "u342443598"}, "prompt_components": {"gold_output": "0 1 0 1\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" (fun n m k ->\n    let par = Array.init n (fun i -> i) in\n    let size = Array.make n 1 in\n    let near = Array.make n 0 in\n    let rec root x =\n        if par.(x) = x then x else\n            let r = root par.(x) in\n            let () = par.(x) <- r in\n            r\n    in\n    for i = 1 to m do\n        Scanf.scanf \" %d %d\" (fun a b ->\n            let a = a - 1 in let b = b - 1 in\n            near.(a) <- near.(a) + 1;\n            near.(b) <- near.(b) + 1;\n            if root a <> root b then (\n                size.(par.(a)) <- size.(par.(a)) + size.(par.(b));\n                par.(par.(b)) <- par.(a)\n            )\n        )\n    done;\n    for i = 1 to k do\n        Scanf.scanf \" %d %d\" (fun c d ->\n            let c = c - 1 in let d = d - 1 in\n            if root c = root d then (\n                near.(c) <- near.(c) + 1;\n                near.(d) <- near.(d) + 1;\n            )\n        )\n    done;\n    for i = 0 to n - 1 do\n        Printf.printf \"%d \" (size.(root i) - near.(i) - 1)\n    done\n)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nAn SNS has N users - User 1, User 2, \\cdots, User N.\n\nBetween these N users, there are some relationships - M friendships and K blockships.\n\nFor each i = 1, 2, \\cdots, M, there is a bidirectional friendship between User A_i and User B_i.\n\nFor each i = 1, 2, \\cdots, K, there is a bidirectional blockship between User C_i and User D_i.\n\nWe define User a to be a friend candidate for User b when all of the following four conditions are satisfied:\n\na \\neq b.\n\nThere is not a friendship between User a and User b.\n\nThere is not a blockship between User a and User b.\n\nThere exists a sequence c_0, c_1, c_2, \\cdots, c_L consisting of integers between 1 and N (inclusive) such that c_0 = a, c_L = b, and there is a friendship between User c_i and c_{i+1} for each i = 0, 1, \\cdots, L - 1.\n\nFor each user i = 1, 2, ... N, how many friend candidates does it have?\n\nConstraints\n\nAll values in input are integers.\n\n2 ≤ N ≤ 10^5\n\n0 \\leq M \\leq 10^5\n\n0 \\leq K \\leq 10^5\n\n1 \\leq A_i, B_i \\leq N\n\nA_i \\neq B_i\n\n1 \\leq C_i, D_i \\leq N\n\nC_i \\neq D_i\n\n(A_i, B_i) \\neq (A_j, B_j) (i \\neq j)\n\n(A_i, B_i) \\neq (B_j, A_j)\n\n(C_i, D_i) \\neq (C_j, D_j) (i \\neq j)\n\n(C_i, D_i) \\neq (D_j, C_j)\n\n(A_i, B_i) \\neq (C_j, D_j)\n\n(A_i, B_i) \\neq (D_j, C_j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 B_1\n\\vdots\nA_M B_M\nC_1 D_1\n\\vdots\nC_K D_K\n\nOutput\n\nPrint the answers in order, with space in between.\n\nSample Input 1\n\n4 4 1\n2 1\n1 3\n3 2\n3 4\n4 1\n\nSample Output 1\n\n0 1 0 1\n\nThere is a friendship between User 2 and 3, and between 3 and 4. Also, there is no friendship or blockship between User 2 and 4. Thus, User 4 is a friend candidate for User 2.\n\nHowever, neither User 1 or 3 is a friend candidate for User 2, so User 2 has one friend candidate.\n\nSample Input 2\n\n5 10 0\n1 2\n1 3\n1 4\n1 5\n3 2\n2 4\n2 5\n4 3\n5 3\n4 5\n\nSample Output 2\n\n0 0 0 0 0\n\nEveryone is a friend of everyone else and has no friend candidate.\n\nSample Input 3\n\n10 9 3\n10 1\n6 7\n8 2\n2 5\n8 4\n7 3\n10 9\n6 4\n5 8\n2 6\n7 5\n3 1\n\nSample Output 3\n\n1 3 5 4 3 3 3 3 1 0", "sample_input": "4 4 1\n2 1\n1 3\n3 2\n3 4\n4 1\n"}, "reference_outputs": ["0 1 0 1\n"], "source_document_id": "p02762", "source_text": "Score : 400 points\n\nProblem Statement\n\nAn SNS has N users - User 1, User 2, \\cdots, User N.\n\nBetween these N users, there are some relationships - M friendships and K blockships.\n\nFor each i = 1, 2, \\cdots, M, there is a bidirectional friendship between User A_i and User B_i.\n\nFor each i = 1, 2, \\cdots, K, there is a bidirectional blockship between User C_i and User D_i.\n\nWe define User a to be a friend candidate for User b when all of the following four conditions are satisfied:\n\na \\neq b.\n\nThere is not a friendship between User a and User b.\n\nThere is not a blockship between User a and User b.\n\nThere exists a sequence c_0, c_1, c_2, \\cdots, c_L consisting of integers between 1 and N (inclusive) such that c_0 = a, c_L = b, and there is a friendship between User c_i and c_{i+1} for each i = 0, 1, \\cdots, L - 1.\n\nFor each user i = 1, 2, ... N, how many friend candidates does it have?\n\nConstraints\n\nAll values in input are integers.\n\n2 ≤ N ≤ 10^5\n\n0 \\leq M \\leq 10^5\n\n0 \\leq K \\leq 10^5\n\n1 \\leq A_i, B_i \\leq N\n\nA_i \\neq B_i\n\n1 \\leq C_i, D_i \\leq N\n\nC_i \\neq D_i\n\n(A_i, B_i) \\neq (A_j, B_j) (i \\neq j)\n\n(A_i, B_i) \\neq (B_j, A_j)\n\n(C_i, D_i) \\neq (C_j, D_j) (i \\neq j)\n\n(C_i, D_i) \\neq (D_j, C_j)\n\n(A_i, B_i) \\neq (C_j, D_j)\n\n(A_i, B_i) \\neq (D_j, C_j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 B_1\n\\vdots\nA_M B_M\nC_1 D_1\n\\vdots\nC_K D_K\n\nOutput\n\nPrint the answers in order, with space in between.\n\nSample Input 1\n\n4 4 1\n2 1\n1 3\n3 2\n3 4\n4 1\n\nSample Output 1\n\n0 1 0 1\n\nThere is a friendship between User 2 and 3, and between 3 and 4. Also, there is no friendship or blockship between User 2 and 4. Thus, User 4 is a friend candidate for User 2.\n\nHowever, neither User 1 or 3 is a friend candidate for User 2, so User 2 has one friend candidate.\n\nSample Input 2\n\n5 10 0\n1 2\n1 3\n1 4\n1 5\n3 2\n2 4\n2 5\n4 3\n5 3\n4 5\n\nSample Output 2\n\n0 0 0 0 0\n\nEveryone is a friend of everyone else and has no friend candidate.\n\nSample Input 3\n\n10 9 3\n10 1\n6 7\n8 2\n2 5\n8 4\n7 3\n10 9\n6 4\n5 8\n2 6\n7 5\n3 1\n\nSample Output 3\n\n1 3 5 4 3 3 3 3 1 0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1022, "cpu_time_ms": 121, "memory_kb": 7168}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s203334743", "group_id": "codeNet:p02766", "input_text": "let n, k = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet rec f n = if n < k then 1 else 1 + f (n / k)\nlet _ = Printf.printf \"%d\\n\" @@ f n", "language": "OCaml", "metadata": {"date": 1583126362, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s203334743.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s203334743", "user_id": "u732304692"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let n, k = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet rec f n = if n < k then 1 else 1 + f (n / k)\nlet _ = Printf.printf \"%d\\n\" @@ f n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s052737099", "group_id": "codeNet:p02767", "input_text": "open Batteries\n\n(* purpose\n        ある地点の住所Pと全住人の住所リストから全住人の住所からpにかけての距離の総和を求める\n   - detail of data\n        P:\n                detail: 全住人からの距離が最小と成る点\n                condition: 1 <= P <= 100\n        住所:\n                detail: Pが存在する範囲の始点と終点\n                condition: 1 <= N <= 100\n                           1 <= M <= 100\n\n   - edge case\n        P, 住所:\n                - 1\n                - 100\n        住所リスト:\n                - 全要素が同じ値\n\n   amount_of_calculation\n        upper_limit: \n                O(N)\n        actual     : \n                O(N)\n*)\n(* - function type\n        solver: int -> int list -> int\n*)\nlet rec solver p lst =\n        match lst with\n                  [] -> 0\n                | first :: rest -> \n                        (Int.pow (first - p) 2) + (solver p rest)\n\n(* - purpose\n       任意の住所のリストと全住人の住所のリストから住人の住所からリストに含まれる任意の住所までの距離の全住人についての総和の最小値を求める\n\n   - detail of data\n        住所:\n                detail: 全住人からの距離が最小と成る点\n                condition: 1 <= 住所 <= 100\n\n   - edge case\n        住所:\n                - 1\n                - 100\n        住所リスト:\n                - 全要素が同じ値\n\n   - amount_of_calculation \n        upper_limit: \n                O(N^2)\n        actual     : \n                O(N^2)\n*)\n(* - function type\n        solver2: int list -> int list -> int(acm) -> int\n\n   - accumulator(option)\n   \tminsum: (調べ終わった総和のうち最小の値を格納) \n*)\nlet rec solver2 rlst lst minsum = \n        match rlst with\n                  [] -> minsum\n                | first :: rest -> \n                        let sum = solver first lst in (* O(N) *)\n                                if sum < minsum then\n                                        solver2 rest lst sum\n                                else\n                                        solver2 rest lst minsum\n\nlet test1 = (\n        solver2 [] [] max_int\n        =\n        max_int\n)\nlet test2 = (\n        solver2 [1] [1] max_int\n        =\n        0\n)\nlet test3 = (\n        solver2 [1; 2] [1; 2] max_int\n        =\n        1\n        ||\n        solver2 [1; 2] [1; 2] max_int\n        =\n        2\n)\n\nlet lst =\n        Scanf.sscanf (read_line ()) \"%d\" (\n                fun _ -> \n                        Str.split (Str.regexp \" \") (read_line ())\n                        |> List.map int_of_string \n        )\n\n\nlet () =\n        let maxval = List.max lst in\n        let minval = List.min lst in\n                solver2 (List.range minval `To maxval) lst max_int\n                |> Printf.printf \"%d\\n\"\n(*\nlet rec solver3 n m lst = \n        if m = (n + 1) || n = m then\n                solver n lst\n        else\n                let p = (n + m) / 2 in\n                let lp = (n + p) / 2 in\n                let rp = (p + 1 + m) / 2 in\n                let lsum = solver lp lst in\n                let rsum = solver rp lst in\n                        if lsum < rsum then\n                                solver3 n p lst \n                        else\n                                solver3 (p + 1) m lst \n\nlet lst = Scanf.sscanf (read_line ()) \"%d\" (\n        fun _ -> \n                Str.split (Str.regexp \" \") (read_line ())\n                |> List.map int_of_string\n)\n\nlet () = \n        let minlst = List.min lst in\n        let maxlst = List.max lst in\n                solver3 minlst maxlst lst \n                |> Printf.printf \"%d\\n\"\n*)\n", "language": "OCaml", "metadata": {"date": 1589853025, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02767.html", "problem_id": "p02767", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02767/input.txt", "sample_output_relpath": "derived/input_output/data/p02767/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02767/OCaml/s052737099.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s052737099", "user_id": "u280335093"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "open Batteries\n\n(* purpose\n        ある地点の住所Pと全住人の住所リストから全住人の住所からpにかけての距離の総和を求める\n   - detail of data\n        P:\n                detail: 全住人からの距離が最小と成る点\n                condition: 1 <= P <= 100\n        住所:\n                detail: Pが存在する範囲の始点と終点\n                condition: 1 <= N <= 100\n                           1 <= M <= 100\n\n   - edge case\n        P, 住所:\n                - 1\n                - 100\n        住所リスト:\n                - 全要素が同じ値\n\n   amount_of_calculation\n        upper_limit: \n                O(N)\n        actual     : \n                O(N)\n*)\n(* - function type\n        solver: int -> int list -> int\n*)\nlet rec solver p lst =\n        match lst with\n                  [] -> 0\n                | first :: rest -> \n                        (Int.pow (first - p) 2) + (solver p rest)\n\n(* - purpose\n       任意の住所のリストと全住人の住所のリストから住人の住所からリストに含まれる任意の住所までの距離の全住人についての総和の最小値を求める\n\n   - detail of data\n        住所:\n                detail: 全住人からの距離が最小と成る点\n                condition: 1 <= 住所 <= 100\n\n   - edge case\n        住所:\n                - 1\n                - 100\n        住所リスト:\n                - 全要素が同じ値\n\n   - amount_of_calculation \n        upper_limit: \n                O(N^2)\n        actual     : \n                O(N^2)\n*)\n(* - function type\n        solver2: int list -> int list -> int(acm) -> int\n\n   - accumulator(option)\n   \tminsum: (調べ終わった総和のうち最小の値を格納) \n*)\nlet rec solver2 rlst lst minsum = \n        match rlst with\n                  [] -> minsum\n                | first :: rest -> \n                        let sum = solver first lst in (* O(N) *)\n                                if sum < minsum then\n                                        solver2 rest lst sum\n                                else\n                                        solver2 rest lst minsum\n\nlet test1 = (\n        solver2 [] [] max_int\n        =\n        max_int\n)\nlet test2 = (\n        solver2 [1] [1] max_int\n        =\n        0\n)\nlet test3 = (\n        solver2 [1; 2] [1; 2] max_int\n        =\n        1\n        ||\n        solver2 [1; 2] [1; 2] max_int\n        =\n        2\n)\n\nlet lst =\n        Scanf.sscanf (read_line ()) \"%d\" (\n                fun _ -> \n                        Str.split (Str.regexp \" \") (read_line ())\n                        |> List.map int_of_string \n        )\n\n\nlet () =\n        let maxval = List.max lst in\n        let minval = List.min lst in\n                solver2 (List.range minval `To maxval) lst max_int\n                |> Printf.printf \"%d\\n\"\n(*\nlet rec solver3 n m lst = \n        if m = (n + 1) || n = m then\n                solver n lst\n        else\n                let p = (n + m) / 2 in\n                let lp = (n + p) / 2 in\n                let rp = (p + 1 + m) / 2 in\n                let lsum = solver lp lst in\n                let rsum = solver rp lst in\n                        if lsum < rsum then\n                                solver3 n p lst \n                        else\n                                solver3 (p + 1) m lst \n\nlet lst = Scanf.sscanf (read_line ()) \"%d\" (\n        fun _ -> \n                Str.split (Str.regexp \" \") (read_line ())\n                |> List.map int_of_string\n)\n\nlet () = \n        let minlst = List.min lst in\n        let maxlst = List.max lst in\n                solver3 minlst maxlst lst \n                |> Printf.printf \"%d\\n\"\n*)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N people living on a number line.\n\nThe i-th person lives at coordinate X_i.\n\nYou are going to hold a meeting that all N people have to attend.\n\nThe meeting can be held at any integer coordinate. If you choose to hold the meeting at coordinate P, the i-th person will spend (X_i - P)^2 points of stamina to attend the meeting.\n\nFind the minimum total points of stamina the N people have to spend.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq X_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 X_2 ... X_N\n\nOutput\n\nPrint the minimum total stamina the N people have to spend.\n\nSample Input 1\n\n2\n1 4\n\nSample Output 1\n\n5\n\nAssume the meeting is held at coordinate 2. In this case, the first person will spend (1 - 2)^2 points of stamina, and the second person will spend (4 - 2)^2 = 4 points of stamina, for a total of 5 points of stamina. This is the minimum total stamina that the 2 people have to spend.\n\nNote that you can hold the meeting only at an integer coordinate.\n\nSample Input 2\n\n7\n14 14 2 13 56 2 37\n\nSample Output 2\n\n2354", "sample_input": "2\n1 4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02767", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N people living on a number line.\n\nThe i-th person lives at coordinate X_i.\n\nYou are going to hold a meeting that all N people have to attend.\n\nThe meeting can be held at any integer coordinate. If you choose to hold the meeting at coordinate P, the i-th person will spend (X_i - P)^2 points of stamina to attend the meeting.\n\nFind the minimum total points of stamina the N people have to spend.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq X_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 X_2 ... X_N\n\nOutput\n\nPrint the minimum total stamina the N people have to spend.\n\nSample Input 1\n\n2\n1 4\n\nSample Output 1\n\n5\n\nAssume the meeting is held at coordinate 2. In this case, the first person will spend (1 - 2)^2 points of stamina, and the second person will spend (4 - 2)^2 = 4 points of stamina, for a total of 5 points of stamina. This is the minimum total stamina that the 2 people have to spend.\n\nNote that you can hold the meeting only at an integer coordinate.\n\nSample Input 2\n\n7\n14 14 2 13 56 2 37\n\nSample Output 2\n\n2354", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3690, "cpu_time_ms": 3, "memory_kb": 3328}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s972363212", "group_id": "codeNet:p02767", "input_text": "open Batteries\n\nlet rec solver p lst =\n        match lst with\n                  [] -> 0\n                | first :: rest -> \n                        ((first - p) * (first - p)) + (solver p rest)\n\nlet rec solver2 n m lst = \n        if m = (n + 1) then\n                solver n lst\n        else\n                let p = (n + m) / 2 in\n                let lp = (n + p) / 2 in\n                let rp = (p + 1 + m) / 2 in\n                let lsum = solver lp lst in\n                let rsum = solver rp lst in\n                        if lsum < rsum then\n                                solver2 n p lst \n                        else\n                                solver2 (p + 1) m lst \n\nlet lst = Scanf.scanf \"%d\\n\" (\n        fun n -> \n                Str.split (Str.regexp \" \") (read_line ()) \n                |> List.map int_of_string\n)\n\nlet () = \n        let minlst = List.min lst in\n        let maxlst = List.max lst in\n                solver2 minlst maxlst lst \n                |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1589677906, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02767.html", "problem_id": "p02767", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02767/input.txt", "sample_output_relpath": "derived/input_output/data/p02767/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02767/OCaml/s972363212.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s972363212", "user_id": "u280335093"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "open Batteries\n\nlet rec solver p lst =\n        match lst with\n                  [] -> 0\n                | first :: rest -> \n                        ((first - p) * (first - p)) + (solver p rest)\n\nlet rec solver2 n m lst = \n        if m = (n + 1) then\n                solver n lst\n        else\n                let p = (n + m) / 2 in\n                let lp = (n + p) / 2 in\n                let rp = (p + 1 + m) / 2 in\n                let lsum = solver lp lst in\n                let rsum = solver rp lst in\n                        if lsum < rsum then\n                                solver2 n p lst \n                        else\n                                solver2 (p + 1) m lst \n\nlet lst = Scanf.scanf \"%d\\n\" (\n        fun n -> \n                Str.split (Str.regexp \" \") (read_line ()) \n                |> List.map int_of_string\n)\n\nlet () = \n        let minlst = List.min lst in\n        let maxlst = List.max lst in\n                solver2 minlst maxlst lst \n                |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N people living on a number line.\n\nThe i-th person lives at coordinate X_i.\n\nYou are going to hold a meeting that all N people have to attend.\n\nThe meeting can be held at any integer coordinate. If you choose to hold the meeting at coordinate P, the i-th person will spend (X_i - P)^2 points of stamina to attend the meeting.\n\nFind the minimum total points of stamina the N people have to spend.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq X_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 X_2 ... X_N\n\nOutput\n\nPrint the minimum total stamina the N people have to spend.\n\nSample Input 1\n\n2\n1 4\n\nSample Output 1\n\n5\n\nAssume the meeting is held at coordinate 2. In this case, the first person will spend (1 - 2)^2 points of stamina, and the second person will spend (4 - 2)^2 = 4 points of stamina, for a total of 5 points of stamina. This is the minimum total stamina that the 2 people have to spend.\n\nNote that you can hold the meeting only at an integer coordinate.\n\nSample Input 2\n\n7\n14 14 2 13 56 2 37\n\nSample Output 2\n\n2354", "sample_input": "2\n1 4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02767", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N people living on a number line.\n\nThe i-th person lives at coordinate X_i.\n\nYou are going to hold a meeting that all N people have to attend.\n\nThe meeting can be held at any integer coordinate. If you choose to hold the meeting at coordinate P, the i-th person will spend (X_i - P)^2 points of stamina to attend the meeting.\n\nFind the minimum total points of stamina the N people have to spend.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq X_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 X_2 ... X_N\n\nOutput\n\nPrint the minimum total stamina the N people have to spend.\n\nSample Input 1\n\n2\n1 4\n\nSample Output 1\n\n5\n\nAssume the meeting is held at coordinate 2. In this case, the first person will spend (1 - 2)^2 points of stamina, and the second person will spend (4 - 2)^2 = 4 points of stamina, for a total of 5 points of stamina. This is the minimum total stamina that the 2 people have to spend.\n\nNote that you can hold the meeting only at an integer coordinate.\n\nSample Input 2\n\n7\n14 14 2 13 56 2 37\n\nSample Output 2\n\n2354", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1001, "cpu_time_ms": 2, "memory_kb": 1024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s970893729", "group_id": "codeNet:p02767", "input_text": "open Batteries\nopen BatPrintf\n\nlet scan fmt f =\n  Scanf.sscanf (read_line ()) fmt f\n\nlet scan_list cnv =\n  read_line ()\n  |> String.split_on_char ' '\n  |> List.map cnv\n\nlet scan_listn n cnv =\n  (0 --^ n) |> Enum.map (fun _ -> (cnv % read_line) ())\n\nlet bsearch_ge arr a =\n  let l = Array.length arr in\n  match Array.bsearch Int.ord arr a with\n  | `All_lower -> l\n  | `All_bigger -> 0\n  | `Just_after n -> l - n -1\n  | `At n -> l - n\n  | `Empty -> 0\n\nlet rec zip xs ys =\n  match xs, ys with\n  | [], _ -> []\n  | _, [] -> []\n  | x::xs, y::ys ->\n    (x, y) :: zip xs ys\n\nlet n = scan \"%d\" identity\nlet xs = scan_list Int.of_string\n\nlet () =\n  let half = (List.sum xs) / n in\n  let half2 = (List.sum xs) / n + 1 in\n  let n = List.sum @@ List.map (fun n -> let k = n - half in k*k) xs in\n  let m = List.sum @@ List.map (fun n -> let k = n - half2 in k*k) xs in\n  printf \"%d\" @@ min n m\n", "language": "OCaml", "metadata": {"date": 1583647564, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02767.html", "problem_id": "p02767", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02767/input.txt", "sample_output_relpath": "derived/input_output/data/p02767/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02767/OCaml/s970893729.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s970893729", "user_id": "u802614675"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "open Batteries\nopen BatPrintf\n\nlet scan fmt f =\n  Scanf.sscanf (read_line ()) fmt f\n\nlet scan_list cnv =\n  read_line ()\n  |> String.split_on_char ' '\n  |> List.map cnv\n\nlet scan_listn n cnv =\n  (0 --^ n) |> Enum.map (fun _ -> (cnv % read_line) ())\n\nlet bsearch_ge arr a =\n  let l = Array.length arr in\n  match Array.bsearch Int.ord arr a with\n  | `All_lower -> l\n  | `All_bigger -> 0\n  | `Just_after n -> l - n -1\n  | `At n -> l - n\n  | `Empty -> 0\n\nlet rec zip xs ys =\n  match xs, ys with\n  | [], _ -> []\n  | _, [] -> []\n  | x::xs, y::ys ->\n    (x, y) :: zip xs ys\n\nlet n = scan \"%d\" identity\nlet xs = scan_list Int.of_string\n\nlet () =\n  let half = (List.sum xs) / n in\n  let half2 = (List.sum xs) / n + 1 in\n  let n = List.sum @@ List.map (fun n -> let k = n - half in k*k) xs in\n  let m = List.sum @@ List.map (fun n -> let k = n - half2 in k*k) xs in\n  printf \"%d\" @@ min n m\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N people living on a number line.\n\nThe i-th person lives at coordinate X_i.\n\nYou are going to hold a meeting that all N people have to attend.\n\nThe meeting can be held at any integer coordinate. If you choose to hold the meeting at coordinate P, the i-th person will spend (X_i - P)^2 points of stamina to attend the meeting.\n\nFind the minimum total points of stamina the N people have to spend.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq X_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 X_2 ... X_N\n\nOutput\n\nPrint the minimum total stamina the N people have to spend.\n\nSample Input 1\n\n2\n1 4\n\nSample Output 1\n\n5\n\nAssume the meeting is held at coordinate 2. In this case, the first person will spend (1 - 2)^2 points of stamina, and the second person will spend (4 - 2)^2 = 4 points of stamina, for a total of 5 points of stamina. This is the minimum total stamina that the 2 people have to spend.\n\nNote that you can hold the meeting only at an integer coordinate.\n\nSample Input 2\n\n7\n14 14 2 13 56 2 37\n\nSample Output 2\n\n2354", "sample_input": "2\n1 4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02767", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N people living on a number line.\n\nThe i-th person lives at coordinate X_i.\n\nYou are going to hold a meeting that all N people have to attend.\n\nThe meeting can be held at any integer coordinate. If you choose to hold the meeting at coordinate P, the i-th person will spend (X_i - P)^2 points of stamina to attend the meeting.\n\nFind the minimum total points of stamina the N people have to spend.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq X_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 X_2 ... X_N\n\nOutput\n\nPrint the minimum total stamina the N people have to spend.\n\nSample Input 1\n\n2\n1 4\n\nSample Output 1\n\n5\n\nAssume the meeting is held at coordinate 2. In this case, the first person will spend (1 - 2)^2 points of stamina, and the second person will spend (4 - 2)^2 = 4 points of stamina, for a total of 5 points of stamina. This is the minimum total stamina that the 2 people have to spend.\n\nNote that you can hold the meeting only at an integer coordinate.\n\nSample Input 2\n\n7\n14 14 2 13 56 2 37\n\nSample Output 2\n\n2354", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 880, "cpu_time_ms": 4, "memory_kb": 1408}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s682087659", "group_id": "codeNet:p02768", "input_text": "let m = 1000000007\nlet n, a, b, dp = Scanf.scanf \"%d %d %d\" @@ fun n a b -> n, a, b, Array.make (max a b + 1) 0\nlet ( * ) a b = a * b mod m\nlet (-) a b = a - b + if a < b then m else 0\nlet rec f b n = if n <= 0 then 1 else let p = f b (n / 2) in p * p * if n mod 2 = 0 then 1 else b\nlet _ = dp.(0) <- 1; for i = 1 to max a b do dp.(i) <- dp.(i - 1) * (n - i + 1) * f i (m - 2) done; f 2 n - 1 - dp.(a) - dp.(b) |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1582562388, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s682087659.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s682087659", "user_id": "u732304692"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "let m = 1000000007\nlet n, a, b, dp = Scanf.scanf \"%d %d %d\" @@ fun n a b -> n, a, b, Array.make (max a b + 1) 0\nlet ( * ) a b = a * b mod m\nlet (-) a b = a - b + if a < b then m else 0\nlet rec f b n = if n <= 0 then 1 else let p = f b (n / 2) in p * p * if n mod 2 = 0 then 1 else b\nlet _ = dp.(0) <- 1; for i = 1 to max a b do dp.(i) <- dp.(i - 1) * (n - i + 1) * f i (m - 2) done; f 2 n - 1 - dp.(a) - dp.(b) |> Printf.printf \"%d\\n\"", "problem_context": "Score : 400 points\n\nProblem Statement\n\nAkari has n kinds of flowers, one of each kind.\n\nShe is going to choose one or more of these flowers to make a bouquet.\n\nHowever, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b.\n\nHow many different bouquets are there that Akari can make?\n\nFind the count modulo (10^9 + 7).\n\nHere, two bouquets are considered different when there is a flower that is used in one of the bouquets but not in the other bouquet.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq n \\leq 10^9\n\n1 \\leq a < b \\leq \\textrm{min}(n, 2 \\times 10^5)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn a b\n\nOutput\n\nPrint the number of bouquets that Akari can make, modulo (10^9 + 7). (If there are no such bouquets, print 0.)\n\nSample Input 1\n\n4 1 3\n\nSample Output 1\n\n7\n\nIn this case, Akari can choose 2 or 4 flowers to make the bouquet.\n\nThere are 6 ways to choose 2 out of the 4 flowers, and 1 way to choose 4, so there are a total of 7 different bouquets that Akari can make.\n\nSample Input 2\n\n1000000000 141421 173205\n\nSample Output 2\n\n34076506\n\nPrint the count modulo (10^9 + 7).", "sample_input": "4 1 3\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02768", "source_text": "Score : 400 points\n\nProblem Statement\n\nAkari has n kinds of flowers, one of each kind.\n\nShe is going to choose one or more of these flowers to make a bouquet.\n\nHowever, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b.\n\nHow many different bouquets are there that Akari can make?\n\nFind the count modulo (10^9 + 7).\n\nHere, two bouquets are considered different when there is a flower that is used in one of the bouquets but not in the other bouquet.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq n \\leq 10^9\n\n1 \\leq a < b \\leq \\textrm{min}(n, 2 \\times 10^5)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn a b\n\nOutput\n\nPrint the number of bouquets that Akari can make, modulo (10^9 + 7). (If there are no such bouquets, print 0.)\n\nSample Input 1\n\n4 1 3\n\nSample Output 1\n\n7\n\nIn this case, Akari can choose 2 or 4 flowers to make the bouquet.\n\nThere are 6 ways to choose 2 out of the 4 flowers, and 1 way to choose 4, so there are a total of 7 different bouquets that Akari can make.\n\nSample Input 2\n\n1000000000 141421 173205\n\nSample Output 2\n\n34076506\n\nPrint the count modulo (10^9 + 7).", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 91, "memory_kb": 3712}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s657994912", "group_id": "codeNet:p02769", "input_text": "let m = 1000000007\nlet ( +^ ) x y = (x + y) mod m\nlet ( -^ ) x y = x +^ (m - y)\nlet ( *^ ) x y = (x * y) mod m\n\nlet rec power ( * ) e m n =\n  if n <= 0 then e\n  else power ( * ) (if n land 1 = 0 then e else m * e) (m * m) (n lsr 1)\n\nlet perm n k =\n  Array.fold_left ( *^ ) 1 @@\n  Array.init k @@ fun i -> (i + n - k + 1) mod m\nlet comb n k = power ( *^ ) (perm n k) (perm k k) (m - 2)\n\nlet () = Scanf.scanf \"%d %d\" @@ fun n k ->\n  let perm_n = Array.make (min n k + 1) 1 in\n  let perm_n1 = Array.make (min n k + 1) 1 in\n  let perm_kk = Array.make (min n k + 1) 1 in\n  for i = 0 to min n k - 1 do\n    perm_n.(i + 1) <- (n - i) mod m *^ perm_n.(i);\n    perm_n1.(i + 1) <- (n - i - 1) mod m *^ perm_n1.(i);\n    perm_kk.(i + 1) <- (i + 1) *^ perm_kk.(i)\n  done;\n  let combn k = power ( *^ ) perm_n.(k) perm_kk.(k) (m - 2) in\n  let combn1 k = power ( *^ ) perm_n1.(k) perm_kk.(k) (m - 2) in\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left ( +^ ) 0 @@\n  Array.init (min n k + 1) @@ fun i -> combn i *^ combn1 i", "language": "OCaml", "metadata": {"date": 1582405742, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02769.html", "problem_id": "p02769", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02769/input.txt", "sample_output_relpath": "derived/input_output/data/p02769/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02769/OCaml/s657994912.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s657994912", "user_id": "u504158101"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let m = 1000000007\nlet ( +^ ) x y = (x + y) mod m\nlet ( -^ ) x y = x +^ (m - y)\nlet ( *^ ) x y = (x * y) mod m\n\nlet rec power ( * ) e m n =\n  if n <= 0 then e\n  else power ( * ) (if n land 1 = 0 then e else m * e) (m * m) (n lsr 1)\n\nlet perm n k =\n  Array.fold_left ( *^ ) 1 @@\n  Array.init k @@ fun i -> (i + n - k + 1) mod m\nlet comb n k = power ( *^ ) (perm n k) (perm k k) (m - 2)\n\nlet () = Scanf.scanf \"%d %d\" @@ fun n k ->\n  let perm_n = Array.make (min n k + 1) 1 in\n  let perm_n1 = Array.make (min n k + 1) 1 in\n  let perm_kk = Array.make (min n k + 1) 1 in\n  for i = 0 to min n k - 1 do\n    perm_n.(i + 1) <- (n - i) mod m *^ perm_n.(i);\n    perm_n1.(i + 1) <- (n - i - 1) mod m *^ perm_n1.(i);\n    perm_kk.(i + 1) <- (i + 1) *^ perm_kk.(i)\n  done;\n  let combn k = power ( *^ ) perm_n.(k) perm_kk.(k) (m - 2) in\n  let combn1 k = power ( *^ ) perm_n1.(k) perm_kk.(k) (m - 2) in\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left ( +^ ) 0 @@\n  Array.init (min n k + 1) @@ fun i -> combn i *^ combn1 i", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a building with n rooms, numbered 1 to n.\n\nWe can move from any room to any other room in the building.\n\nLet us call the following event a move: a person in some room i goes to another room j~ (i \\neq j).\n\nInitially, there was one person in each room in the building.\n\nAfter that, we know that there were exactly k moves happened up to now.\n\nWe are interested in the number of people in each of the n rooms now. How many combinations of numbers of people in the n rooms are possible?\n\nFind the count modulo (10^9 + 7).\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq n \\leq 2 \\times 10^5\n\n2 \\leq k \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn k\n\nOutput\n\nPrint the number of possible combinations of numbers of people in the n rooms now, modulo (10^9 + 7).\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n10\n\nLet c_1, c_2, and c_3 be the number of people in Room 1, 2, and 3 now, respectively. There are 10 possible combination of (c_1, c_2, c_3):\n\n(0, 0, 3)\n\n(0, 1, 2)\n\n(0, 2, 1)\n\n(0, 3, 0)\n\n(1, 0, 2)\n\n(1, 1, 1)\n\n(1, 2, 0)\n\n(2, 0, 1)\n\n(2, 1, 0)\n\n(3, 0, 0)\n\nFor example, (c_1, c_2, c_3) will be (0, 1, 2) if the person in Room 1 goes to Room 2 and then one of the persons in Room 2 goes to Room 3.\n\nSample Input 2\n\n200000 1000000000\n\nSample Output 2\n\n607923868\n\nPrint the count modulo (10^9 + 7).\n\nSample Input 3\n\n15 6\n\nSample Output 3\n\n22583772", "sample_input": "3 2\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02769", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a building with n rooms, numbered 1 to n.\n\nWe can move from any room to any other room in the building.\n\nLet us call the following event a move: a person in some room i goes to another room j~ (i \\neq j).\n\nInitially, there was one person in each room in the building.\n\nAfter that, we know that there were exactly k moves happened up to now.\n\nWe are interested in the number of people in each of the n rooms now. How many combinations of numbers of people in the n rooms are possible?\n\nFind the count modulo (10^9 + 7).\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq n \\leq 2 \\times 10^5\n\n2 \\leq k \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn k\n\nOutput\n\nPrint the number of possible combinations of numbers of people in the n rooms now, modulo (10^9 + 7).\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n10\n\nLet c_1, c_2, and c_3 be the number of people in Room 1, 2, and 3 now, respectively. There are 10 possible combination of (c_1, c_2, c_3):\n\n(0, 0, 3)\n\n(0, 1, 2)\n\n(0, 2, 1)\n\n(0, 3, 0)\n\n(1, 0, 2)\n\n(1, 1, 1)\n\n(1, 2, 0)\n\n(2, 0, 1)\n\n(2, 1, 0)\n\n(3, 0, 0)\n\nFor example, (c_1, c_2, c_3) will be (0, 1, 2) if the person in Room 1 goes to Room 2 and then one of the persons in Room 2 goes to Room 3.\n\nSample Input 2\n\n200000 1000000000\n\nSample Output 2\n\n607923868\n\nPrint the count modulo (10^9 + 7).\n\nSample Input 3\n\n15 6\n\nSample Output 3\n\n22583772", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1000, "cpu_time_ms": 115, "memory_kb": 8192}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s558105738", "group_id": "codeNet:p02772", "input_text": "open Batteries\nopen BatPrintf\n\nlet scan fmt f =\n  BatScanf.sscanf (read_line ()) fmt f\n\nlet scan_list cnv =\n  read_line ()\n  |> BatString.split_on_char ' '\n  |> List.map cnv\n\nlet rec zip xs ys =\n  match xs, ys with\n  | [], _ -> []\n  | _, [] -> []\n  | x::xs, y::ys ->\n    (x, y) :: zip xs ys\n\nlet n = scan \"%d\" identity\nlet a = scan_list Int.of_string\n\nlet () =\n  BatList.filter (fun x -> x mod 2 = 0) a\n  |> BatList.for_all (fun x -> x mod 3 = 0 || x mod 5 = 0)\n  |> (fun b -> if b then \"APPROVED\" else \"DENIED\")\n  |> printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1582380745, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02772.html", "problem_id": "p02772", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02772/input.txt", "sample_output_relpath": "derived/input_output/data/p02772/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02772/OCaml/s558105738.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s558105738", "user_id": "u802614675"}, "prompt_components": {"gold_output": "APPROVED\n", "input_to_evaluate": "open Batteries\nopen BatPrintf\n\nlet scan fmt f =\n  BatScanf.sscanf (read_line ()) fmt f\n\nlet scan_list cnv =\n  read_line ()\n  |> BatString.split_on_char ' '\n  |> List.map cnv\n\nlet rec zip xs ys =\n  match xs, ys with\n  | [], _ -> []\n  | _, [] -> []\n  | x::xs, y::ys ->\n    (x, y) :: zip xs ys\n\nlet n = scan \"%d\" identity\nlet a = scan_list Int.of_string\n\nlet () =\n  BatList.filter (fun x -> x mod 2 = 0) a\n  |> BatList.for_all (fun x -> x mod 3 = 0 || x mod 5 = 0)\n  |> (fun b -> if b then \"APPROVED\" else \"DENIED\")\n  |> printf \"%s\\n\"\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nYou are an immigration officer in the Kingdom of AtCoder. The document carried by an immigrant has some number of integers written on it, and you need to check whether they meet certain criteria.\n\nAccording to the regulation, the immigrant should be allowed entry to the kingdom if and only if the following condition is satisfied:\n\nAll even numbers written on the document are divisible by 3 or 5.\n\nIf the immigrant should be allowed entry according to the regulation, output APPROVED; otherwise, print DENIED.\n\nNotes\n\nThe condition in the statement can be rephrased as \"If x is an even number written on the document, x is divisible by 3 or 5\".\nHere \"if\" and \"or\" are logical terms.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nIf the immigrant should be allowed entry according to the regulation, print APPROVED; otherwise, print DENIED.\n\nSample Input 1\n\n5\n6 7 9 10 31\n\nSample Output 1\n\nAPPROVED\n\nThe even numbers written on the document are 6 and 10.\n\nAll of them are divisible by 3 or 5, so the immigrant should be allowed entry.\n\nSample Input 2\n\n3\n28 27 24\n\nSample Output 2\n\nDENIED\n\n28 violates the condition, so the immigrant should not be allowed entry.", "sample_input": "5\n6 7 9 10 31\n"}, "reference_outputs": ["APPROVED\n"], "source_document_id": "p02772", "source_text": "Score: 200 points\n\nProblem Statement\n\nYou are an immigration officer in the Kingdom of AtCoder. The document carried by an immigrant has some number of integers written on it, and you need to check whether they meet certain criteria.\n\nAccording to the regulation, the immigrant should be allowed entry to the kingdom if and only if the following condition is satisfied:\n\nAll even numbers written on the document are divisible by 3 or 5.\n\nIf the immigrant should be allowed entry according to the regulation, output APPROVED; otherwise, print DENIED.\n\nNotes\n\nThe condition in the statement can be rephrased as \"If x is an even number written on the document, x is divisible by 3 or 5\".\nHere \"if\" and \"or\" are logical terms.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nIf the immigrant should be allowed entry according to the regulation, print APPROVED; otherwise, print DENIED.\n\nSample Input 1\n\n5\n6 7 9 10 31\n\nSample Output 1\n\nAPPROVED\n\nThe even numbers written on the document are 6 and 10.\n\nAll of them are divisible by 3 or 5, so the immigrant should be allowed entry.\n\nSample Input 2\n\n3\n28 27 24\n\nSample Output 2\n\nDENIED\n\n28 violates the condition, so the immigrant should not be allowed entry.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 532, "cpu_time_ms": 3, "memory_kb": 4992}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s496712700", "group_id": "codeNet:p02772", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  print_endline @@\n  if List.for_all (fun a -> a mod 2 = 1 || a mod 3 = 0 || a mod 5 = 0) @@ Array.to_list as_\n  then \"APPROVED\" else \"DENIED\"", "language": "OCaml", "metadata": {"date": 1581885655, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02772.html", "problem_id": "p02772", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02772/input.txt", "sample_output_relpath": "derived/input_output/data/p02772/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02772/OCaml/s496712700.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s496712700", "user_id": "u504158101"}, "prompt_components": {"gold_output": "APPROVED\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  print_endline @@\n  if List.for_all (fun a -> a mod 2 = 1 || a mod 3 = 0 || a mod 5 = 0) @@ Array.to_list as_\n  then \"APPROVED\" else \"DENIED\"", "problem_context": "Score: 200 points\n\nProblem Statement\n\nYou are an immigration officer in the Kingdom of AtCoder. The document carried by an immigrant has some number of integers written on it, and you need to check whether they meet certain criteria.\n\nAccording to the regulation, the immigrant should be allowed entry to the kingdom if and only if the following condition is satisfied:\n\nAll even numbers written on the document are divisible by 3 or 5.\n\nIf the immigrant should be allowed entry according to the regulation, output APPROVED; otherwise, print DENIED.\n\nNotes\n\nThe condition in the statement can be rephrased as \"If x is an even number written on the document, x is divisible by 3 or 5\".\nHere \"if\" and \"or\" are logical terms.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nIf the immigrant should be allowed entry according to the regulation, print APPROVED; otherwise, print DENIED.\n\nSample Input 1\n\n5\n6 7 9 10 31\n\nSample Output 1\n\nAPPROVED\n\nThe even numbers written on the document are 6 and 10.\n\nAll of them are divisible by 3 or 5, so the immigrant should be allowed entry.\n\nSample Input 2\n\n3\n28 27 24\n\nSample Output 2\n\nDENIED\n\n28 violates the condition, so the immigrant should not be allowed entry.", "sample_input": "5\n6 7 9 10 31\n"}, "reference_outputs": ["APPROVED\n"], "source_document_id": "p02772", "source_text": "Score: 200 points\n\nProblem Statement\n\nYou are an immigration officer in the Kingdom of AtCoder. The document carried by an immigrant has some number of integers written on it, and you need to check whether they meet certain criteria.\n\nAccording to the regulation, the immigrant should be allowed entry to the kingdom if and only if the following condition is satisfied:\n\nAll even numbers written on the document are divisible by 3 or 5.\n\nIf the immigrant should be allowed entry according to the regulation, output APPROVED; otherwise, print DENIED.\n\nNotes\n\nThe condition in the statement can be rephrased as \"If x is an even number written on the document, x is divisible by 3 or 5\".\nHere \"if\" and \"or\" are logical terms.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\dots A_N\n\nOutput\n\nIf the immigrant should be allowed entry according to the regulation, print APPROVED; otherwise, print DENIED.\n\nSample Input 1\n\n5\n6 7 9 10 31\n\nSample Output 1\n\nAPPROVED\n\nThe even numbers written on the document are 6 and 10.\n\nAll of them are divisible by 3 or 5, so the immigrant should be allowed entry.\n\nSample Input 2\n\n3\n28 27 24\n\nSample Output 2\n\nDENIED\n\n28 violates the condition, so the immigrant should not be allowed entry.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 254, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s394407455", "group_id": "codeNet:p02773", "input_text": "open Hashtbl\nlet h, m = create 100100, ref 1\nlet _ = for _ = 1 to read_int () do let s = read_line () in replace h s @@ try let c = find h s + 1 in m := max !m c; c with _ -> 1 done; List.(fold (fun s c a -> if c = !m then s :: a else a) h [] |> sort compare |> iter print_endline)", "language": "OCaml", "metadata": {"date": 1582491324, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s394407455.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s394407455", "user_id": "u732304692"}, "prompt_components": {"gold_output": "beet\nvet\n", "input_to_evaluate": "open Hashtbl\nlet h, m = create 100100, ref 1\nlet _ = for _ = 1 to read_int () do let s = read_line () in replace h s @@ try let c = find h s + 1 in m := max !m c; c with _ -> 1 done; List.(fold (fun s c a -> if c = !m then s :: a else a) h [] |> sort compare |> iter print_endline)", "problem_context": "Score: 300 points\n\nProblem Statement\n\nWe have N voting papers. The i-th vote (1 \\leq i \\leq N) has the string S_i written on it.\n\nPrint all strings that are written on the most number of votes, in lexicographical order.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS_i (1 \\leq i \\leq N) are strings consisting of lowercase English letters.\n\nThe length of S_i (1 \\leq i \\leq N) is between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint all strings in question in lexicographical order.\n\nSample Input 1\n\n7\nbeat\nvet\nbeet\nbed\nvet\nbet\nbeet\n\nSample Output 1\n\nbeet\nvet\n\nbeet and vet are written on two sheets each, while beat, bed, and bet are written on one vote each. Thus, we should print the strings beet and vet.\n\nSample Input 2\n\n8\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\n\nSample Output 2\n\nbuffalo\n\nSample Input 3\n\n7\nbass\nbass\nkick\nkick\nbass\nkick\nkick\n\nSample Output 3\n\nkick\n\nSample Input 4\n\n4\nushi\ntapu\nnichia\nkun\n\nSample Output 4\n\nkun\nnichia\ntapu\nushi", "sample_input": "7\nbeat\nvet\nbeet\nbed\nvet\nbet\nbeet\n"}, "reference_outputs": ["beet\nvet\n"], "source_document_id": "p02773", "source_text": "Score: 300 points\n\nProblem Statement\n\nWe have N voting papers. The i-th vote (1 \\leq i \\leq N) has the string S_i written on it.\n\nPrint all strings that are written on the most number of votes, in lexicographical order.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS_i (1 \\leq i \\leq N) are strings consisting of lowercase English letters.\n\nThe length of S_i (1 \\leq i \\leq N) is between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint all strings in question in lexicographical order.\n\nSample Input 1\n\n7\nbeat\nvet\nbeet\nbed\nvet\nbet\nbeet\n\nSample Output 1\n\nbeet\nvet\n\nbeet and vet are written on two sheets each, while beat, bed, and bet are written on one vote each. Thus, we should print the strings beet and vet.\n\nSample Input 2\n\n8\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\n\nSample Output 2\n\nbuffalo\n\nSample Input 3\n\n7\nbass\nbass\nkick\nkick\nbass\nkick\nkick\n\nSample Output 3\n\nkick\n\nSample Input 4\n\n4\nushi\ntapu\nnichia\nkun\n\nSample Output 4\n\nkun\nnichia\ntapu\nushi", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 281, "cpu_time_ms": 748, "memory_kb": 33024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s093565811", "group_id": "codeNet:p02773", "input_text": "open Batteries\nopen BatPrintf\n\nlet scan fmt f =\n  Scanf.sscanf (read_line ()) fmt f\n\nlet scan_list cnv =\n  read_line ()\n  |> String.split_on_char ' '\n  |> List.map cnv\n\nlet scan_listn n cnv =\n  (0 --^ n) /@ (fun _ -> (cnv % read_line) ())\n\nlet rec zip xs ys =\n  match xs, ys with\n  | [], _ -> []\n  | _, [] -> []\n  | x::xs, y::ys ->\n    (x, y) :: zip xs ys\n\nlet n = scan \"%d\" identity\nlet s = scan_listn n identity\n\nmodule SMap = Map.Make (struct\n    type t = string\n    let compare = String.IString.compare\n  end)\n\nlet () =\n  let map = fold (fun m k -> SMap.modify_def 0 k succ m) SMap.empty s in\n  let m = SMap.fold (fun _ v m -> if v > m then v else m) map 0 in\n  SMap.filter (fun _ n -> n = m) map\n  |> List.of_enum % SMap.keys\n  |> String.concat \"\\n\" % List.sort String.compare\n  |> printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1582384716, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s093565811.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s093565811", "user_id": "u802614675"}, "prompt_components": {"gold_output": "beet\nvet\n", "input_to_evaluate": "open Batteries\nopen BatPrintf\n\nlet scan fmt f =\n  Scanf.sscanf (read_line ()) fmt f\n\nlet scan_list cnv =\n  read_line ()\n  |> String.split_on_char ' '\n  |> List.map cnv\n\nlet scan_listn n cnv =\n  (0 --^ n) /@ (fun _ -> (cnv % read_line) ())\n\nlet rec zip xs ys =\n  match xs, ys with\n  | [], _ -> []\n  | _, [] -> []\n  | x::xs, y::ys ->\n    (x, y) :: zip xs ys\n\nlet n = scan \"%d\" identity\nlet s = scan_listn n identity\n\nmodule SMap = Map.Make (struct\n    type t = string\n    let compare = String.IString.compare\n  end)\n\nlet () =\n  let map = fold (fun m k -> SMap.modify_def 0 k succ m) SMap.empty s in\n  let m = SMap.fold (fun _ v m -> if v > m then v else m) map 0 in\n  SMap.filter (fun _ n -> n = m) map\n  |> List.of_enum % SMap.keys\n  |> String.concat \"\\n\" % List.sort String.compare\n  |> printf \"%s\\n\"\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nWe have N voting papers. The i-th vote (1 \\leq i \\leq N) has the string S_i written on it.\n\nPrint all strings that are written on the most number of votes, in lexicographical order.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS_i (1 \\leq i \\leq N) are strings consisting of lowercase English letters.\n\nThe length of S_i (1 \\leq i \\leq N) is between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint all strings in question in lexicographical order.\n\nSample Input 1\n\n7\nbeat\nvet\nbeet\nbed\nvet\nbet\nbeet\n\nSample Output 1\n\nbeet\nvet\n\nbeet and vet are written on two sheets each, while beat, bed, and bet are written on one vote each. Thus, we should print the strings beet and vet.\n\nSample Input 2\n\n8\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\n\nSample Output 2\n\nbuffalo\n\nSample Input 3\n\n7\nbass\nbass\nkick\nkick\nbass\nkick\nkick\n\nSample Output 3\n\nkick\n\nSample Input 4\n\n4\nushi\ntapu\nnichia\nkun\n\nSample Output 4\n\nkun\nnichia\ntapu\nushi", "sample_input": "7\nbeat\nvet\nbeet\nbed\nvet\nbet\nbeet\n"}, "reference_outputs": ["beet\nvet\n"], "source_document_id": "p02773", "source_text": "Score: 300 points\n\nProblem Statement\n\nWe have N voting papers. The i-th vote (1 \\leq i \\leq N) has the string S_i written on it.\n\nPrint all strings that are written on the most number of votes, in lexicographical order.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS_i (1 \\leq i \\leq N) are strings consisting of lowercase English letters.\n\nThe length of S_i (1 \\leq i \\leq N) is between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint all strings in question in lexicographical order.\n\nSample Input 1\n\n7\nbeat\nvet\nbeet\nbed\nvet\nbet\nbeet\n\nSample Output 1\n\nbeet\nvet\n\nbeet and vet are written on two sheets each, while beat, bed, and bet are written on one vote each. Thus, we should print the strings beet and vet.\n\nSample Input 2\n\n8\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\n\nSample Output 2\n\nbuffalo\n\nSample Input 3\n\n7\nbass\nbass\nkick\nkick\nbass\nkick\nkick\n\nSample Output 3\n\nkick\n\nSample Input 4\n\n4\nushi\ntapu\nnichia\nkun\n\nSample Output 4\n\nkun\nnichia\ntapu\nushi", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 801, "cpu_time_ms": 1390, "memory_kb": 35944}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s823271682", "group_id": "codeNet:p02773", "input_text": "module StringMap = Map.Make (String)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ss = Array.init n @@ fun _ -> Scanf.scanf \"%s\\n\" @@ fun s -> s in\n  List.iter print_endline @@\n  List.rev @@\n  fst @@\n  List.fold_left (fun (ss, n) (s, m) ->\n    if n < m\n    then ([s], m)\n    else if n = m then (s :: ss, n)\n    else (ss, n)) ([], 0) @@\n  StringMap.bindings @@\n  Array.fold_left (fun m s ->\n    StringMap.add s (1 + try StringMap.find s m with Not_found -> 0) m) StringMap.empty ss", "language": "OCaml", "metadata": {"date": 1581885632, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s823271682.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s823271682", "user_id": "u504158101"}, "prompt_components": {"gold_output": "beet\nvet\n", "input_to_evaluate": "module StringMap = Map.Make (String)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ss = Array.init n @@ fun _ -> Scanf.scanf \"%s\\n\" @@ fun s -> s in\n  List.iter print_endline @@\n  List.rev @@\n  fst @@\n  List.fold_left (fun (ss, n) (s, m) ->\n    if n < m\n    then ([s], m)\n    else if n = m then (s :: ss, n)\n    else (ss, n)) ([], 0) @@\n  StringMap.bindings @@\n  Array.fold_left (fun m s ->\n    StringMap.add s (1 + try StringMap.find s m with Not_found -> 0) m) StringMap.empty ss", "problem_context": "Score: 300 points\n\nProblem Statement\n\nWe have N voting papers. The i-th vote (1 \\leq i \\leq N) has the string S_i written on it.\n\nPrint all strings that are written on the most number of votes, in lexicographical order.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS_i (1 \\leq i \\leq N) are strings consisting of lowercase English letters.\n\nThe length of S_i (1 \\leq i \\leq N) is between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint all strings in question in lexicographical order.\n\nSample Input 1\n\n7\nbeat\nvet\nbeet\nbed\nvet\nbet\nbeet\n\nSample Output 1\n\nbeet\nvet\n\nbeet and vet are written on two sheets each, while beat, bed, and bet are written on one vote each. Thus, we should print the strings beet and vet.\n\nSample Input 2\n\n8\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\n\nSample Output 2\n\nbuffalo\n\nSample Input 3\n\n7\nbass\nbass\nkick\nkick\nbass\nkick\nkick\n\nSample Output 3\n\nkick\n\nSample Input 4\n\n4\nushi\ntapu\nnichia\nkun\n\nSample Output 4\n\nkun\nnichia\ntapu\nushi", "sample_input": "7\nbeat\nvet\nbeet\nbed\nvet\nbet\nbeet\n"}, "reference_outputs": ["beet\nvet\n"], "source_document_id": "p02773", "source_text": "Score: 300 points\n\nProblem Statement\n\nWe have N voting papers. The i-th vote (1 \\leq i \\leq N) has the string S_i written on it.\n\nPrint all strings that are written on the most number of votes, in lexicographical order.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS_i (1 \\leq i \\leq N) are strings consisting of lowercase English letters.\n\nThe length of S_i (1 \\leq i \\leq N) is between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint all strings in question in lexicographical order.\n\nSample Input 1\n\n7\nbeat\nvet\nbeet\nbed\nvet\nbet\nbeet\n\nSample Output 1\n\nbeet\nvet\n\nbeet and vet are written on two sheets each, while beat, bed, and bet are written on one vote each. Thus, we should print the strings beet and vet.\n\nSample Input 2\n\n8\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\n\nSample Output 2\n\nbuffalo\n\nSample Input 3\n\n7\nbass\nbass\nkick\nkick\nbass\nkick\nkick\n\nSample Output 3\n\nkick\n\nSample Input 4\n\n4\nushi\ntapu\nnichia\nkun\n\nSample Output 4\n\nkun\nnichia\ntapu\nushi", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 482, "cpu_time_ms": 859, "memory_kb": 37760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s670127970", "group_id": "codeNet:p02773", "input_text": "module M = Map.Make (struct type t = string let compare = compare end)\n\nlet () =\n    let n = read_int () in\n    let rec loop i map =\n        if i = n then map else\n            let s = read_line () in\n            let map = M.add s (1 + try M.find s map with _ -> 0) map in\n            loop (i + 1) map\n    in\n    let map = loop 0 M.empty in\n    let (_, l) = M.fold (fun key v (mx, mxl) ->\n        if v > mx then (v, [ key ]) else\n            if v = mx then (v, key :: mxl) else (mx, mxl)) map (0, [])\n    in\n    List.sort compare l |> List.iter print_endline", "language": "OCaml", "metadata": {"date": 1581883858, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s670127970.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s670127970", "user_id": "u342443598"}, "prompt_components": {"gold_output": "beet\nvet\n", "input_to_evaluate": "module M = Map.Make (struct type t = string let compare = compare end)\n\nlet () =\n    let n = read_int () in\n    let rec loop i map =\n        if i = n then map else\n            let s = read_line () in\n            let map = M.add s (1 + try M.find s map with _ -> 0) map in\n            loop (i + 1) map\n    in\n    let map = loop 0 M.empty in\n    let (_, l) = M.fold (fun key v (mx, mxl) ->\n        if v > mx then (v, [ key ]) else\n            if v = mx then (v, key :: mxl) else (mx, mxl)) map (0, [])\n    in\n    List.sort compare l |> List.iter print_endline", "problem_context": "Score: 300 points\n\nProblem Statement\n\nWe have N voting papers. The i-th vote (1 \\leq i \\leq N) has the string S_i written on it.\n\nPrint all strings that are written on the most number of votes, in lexicographical order.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS_i (1 \\leq i \\leq N) are strings consisting of lowercase English letters.\n\nThe length of S_i (1 \\leq i \\leq N) is between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint all strings in question in lexicographical order.\n\nSample Input 1\n\n7\nbeat\nvet\nbeet\nbed\nvet\nbet\nbeet\n\nSample Output 1\n\nbeet\nvet\n\nbeet and vet are written on two sheets each, while beat, bed, and bet are written on one vote each. Thus, we should print the strings beet and vet.\n\nSample Input 2\n\n8\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\n\nSample Output 2\n\nbuffalo\n\nSample Input 3\n\n7\nbass\nbass\nkick\nkick\nbass\nkick\nkick\n\nSample Output 3\n\nkick\n\nSample Input 4\n\n4\nushi\ntapu\nnichia\nkun\n\nSample Output 4\n\nkun\nnichia\ntapu\nushi", "sample_input": "7\nbeat\nvet\nbeet\nbed\nvet\nbet\nbeet\n"}, "reference_outputs": ["beet\nvet\n"], "source_document_id": "p02773", "source_text": "Score: 300 points\n\nProblem Statement\n\nWe have N voting papers. The i-th vote (1 \\leq i \\leq N) has the string S_i written on it.\n\nPrint all strings that are written on the most number of votes, in lexicographical order.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nS_i (1 \\leq i \\leq N) are strings consisting of lowercase English letters.\n\nThe length of S_i (1 \\leq i \\leq N) is between 1 and 10 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nPrint all strings in question in lexicographical order.\n\nSample Input 1\n\n7\nbeat\nvet\nbeet\nbed\nvet\nbet\nbeet\n\nSample Output 1\n\nbeet\nvet\n\nbeet and vet are written on two sheets each, while beat, bed, and bet are written on one vote each. Thus, we should print the strings beet and vet.\n\nSample Input 2\n\n8\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\nbuffalo\n\nSample Output 2\n\nbuffalo\n\nSample Input 3\n\n7\nbass\nbass\nkick\nkick\nbass\nkick\nkick\n\nSample Output 3\n\nkick\n\nSample Input 4\n\n4\nushi\ntapu\nnichia\nkun\n\nSample Output 4\n\nkun\nnichia\ntapu\nushi", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 557, "cpu_time_ms": 1146, "memory_kb": 30848}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s596259221", "group_id": "codeNet:p02777", "input_text": "Scanf.scanf \"%s %s\" (fun s t ->\n    Scanf.scanf \" %d %d\" (fun a b ->\n        Scanf.scanf \" %s\" (fun u ->\n            let a, b = if s = u then (a - 1, b) else (a, b - 1) in\n            Printf.printf \"%d %d\\n\" a b\n        )\n    )\n)", "language": "OCaml", "metadata": {"date": 1581278549, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s596259221.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s596259221", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2 4\n", "input_to_evaluate": "Scanf.scanf \"%s %s\" (fun s t ->\n    Scanf.scanf \" %d %d\" (fun a b ->\n        Scanf.scanf \" %s\" (fun u ->\n            let a, b = if s = u then (a - 1, b) else (a, b - 1) in\n            Printf.printf \"%d %d\\n\" a b\n        )\n    )\n)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have A balls with the string S written on each of them and B balls with the string T written on each of them.\n\nFrom these balls, Takahashi chooses one with the string U written on it and throws it away.\n\nFind the number of balls with the string S and balls with the string T that we have now.\n\nConstraints\n\nS, T, and U are strings consisting of lowercase English letters.\n\nThe lengths of S and T are each between 1 and 10 (inclusive).\n\nS \\not= T\n\nS=U or T=U.\n\n1 \\leq A,B \\leq 10\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\nA B\nU\n\nOutput\n\nPrint the answer, with space in between.\n\nSample Input 1\n\nred blue\n3 4\nred\n\nSample Output 1\n\n2 4\n\nTakahashi chose a ball with red written on it and threw it away.\nNow we have two balls with the string S and four balls with the string T.\n\nSample Input 2\n\nred blue\n5 5\nblue\n\nSample Output 2\n\n5 4\n\nTakahashi chose a ball with blue written on it and threw it away.\nNow we have five balls with the string S and four balls with the string T.", "sample_input": "red blue\n3 4\nred\n"}, "reference_outputs": ["2 4\n"], "source_document_id": "p02777", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have A balls with the string S written on each of them and B balls with the string T written on each of them.\n\nFrom these balls, Takahashi chooses one with the string U written on it and throws it away.\n\nFind the number of balls with the string S and balls with the string T that we have now.\n\nConstraints\n\nS, T, and U are strings consisting of lowercase English letters.\n\nThe lengths of S and T are each between 1 and 10 (inclusive).\n\nS \\not= T\n\nS=U or T=U.\n\n1 \\leq A,B \\leq 10\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\nA B\nU\n\nOutput\n\nPrint the answer, with space in between.\n\nSample Input 1\n\nred blue\n3 4\nred\n\nSample Output 1\n\n2 4\n\nTakahashi chose a ball with red written on it and threw it away.\nNow we have two balls with the string S and four balls with the string T.\n\nSample Input 2\n\nred blue\n5 5\nblue\n\nSample Output 2\n\n5 4\n\nTakahashi chose a ball with blue written on it and threw it away.\nNow we have five balls with the string S and four balls with the string T.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 229, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s547469988", "group_id": "codeNet:p02779", "input_text": "open Batteries\nlet n = read_int ()\nlet a = read_line () |> String.split_on_char ' ' |> List.sort compare\n\nlet _ =\n  let rec loop lst =\n    match lst with\n    | [] -> \"YES\"\n    | first :: second :: rest -> if first = second then \"NO\" else loop (second :: rest)\n    | first :: rest -> loop rest\n  in loop a |> print_endline", "language": "OCaml", "metadata": {"date": 1586677480, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s547469988.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s547469988", "user_id": "u511870776"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "open Batteries\nlet n = read_int ()\nlet a = read_line () |> String.split_on_char ' ' |> List.sort compare\n\nlet _ =\n  let rec loop lst =\n    match lst with\n    | [] -> \"YES\"\n    | first :: second :: rest -> if first = second then \"NO\" else loop (second :: rest)\n    | first :: rest -> loop rest\n  in loop a |> print_endline", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a sequence of integers A_1, A_2, ..., A_N.\nIf its elements are pairwise distinct, print YES; otherwise, print NO.\n\nConstraints\n\n2 ≤ N ≤ 200000\n\n1 ≤ A_i ≤ 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nIf the elements of the sequence are pairwise distinct, print YES; otherwise, print NO.\n\nSample Input 1\n\n5\n2 6 1 4 5\n\nSample Output 1\n\nYES\n\nThe elements are pairwise distinct.\n\nSample Input 2\n\n6\n4 1 3 1 6 2\n\nSample Output 2\n\nNO\n\nThe second and fourth elements are identical.\n\nSample Input 3\n\n2\n10000000 10000000\n\nSample Output 3\n\nNO", "sample_input": "5\n2 6 1 4 5\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p02779", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a sequence of integers A_1, A_2, ..., A_N.\nIf its elements are pairwise distinct, print YES; otherwise, print NO.\n\nConstraints\n\n2 ≤ N ≤ 200000\n\n1 ≤ A_i ≤ 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nIf the elements of the sequence are pairwise distinct, print YES; otherwise, print NO.\n\nSample Input 1\n\n5\n2 6 1 4 5\n\nSample Output 1\n\nYES\n\nThe elements are pairwise distinct.\n\nSample Input 2\n\n6\n4 1 3 1 6 2\n\nSample Output 2\n\nNO\n\nThe second and fourth elements are identical.\n\nSample Input 3\n\n2\n10000000 10000000\n\nSample Output 3\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 321, "cpu_time_ms": 261, "memory_kb": 26624}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s037060546", "group_id": "codeNet:p02779", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  print_endline @@\n  if\n    ( = ) n @@\n    List.length @@\n    List.sort_uniq compare @@\n    Array.to_list as_\n  then \"YES\"\n  else \"NO\"", "language": "OCaml", "metadata": {"date": 1583331575, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s037060546.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s037060546", "user_id": "u504158101"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  print_endline @@\n  if\n    ( = ) n @@\n    List.length @@\n    List.sort_uniq compare @@\n    Array.to_list as_\n  then \"YES\"\n  else \"NO\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a sequence of integers A_1, A_2, ..., A_N.\nIf its elements are pairwise distinct, print YES; otherwise, print NO.\n\nConstraints\n\n2 ≤ N ≤ 200000\n\n1 ≤ A_i ≤ 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nIf the elements of the sequence are pairwise distinct, print YES; otherwise, print NO.\n\nSample Input 1\n\n5\n2 6 1 4 5\n\nSample Output 1\n\nYES\n\nThe elements are pairwise distinct.\n\nSample Input 2\n\n6\n4 1 3 1 6 2\n\nSample Output 2\n\nNO\n\nThe second and fourth elements are identical.\n\nSample Input 3\n\n2\n10000000 10000000\n\nSample Output 3\n\nNO", "sample_input": "5\n2 6 1 4 5\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p02779", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a sequence of integers A_1, A_2, ..., A_N.\nIf its elements are pairwise distinct, print YES; otherwise, print NO.\n\nConstraints\n\n2 ≤ N ≤ 200000\n\n1 ≤ A_i ≤ 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nIf the elements of the sequence are pairwise distinct, print YES; otherwise, print NO.\n\nSample Input 1\n\n5\n2 6 1 4 5\n\nSample Output 1\n\nYES\n\nThe elements are pairwise distinct.\n\nSample Input 2\n\n6\n4 1 3 1 6 2\n\nSample Output 2\n\nNO\n\nThe second and fourth elements are identical.\n\nSample Input 3\n\n2\n10000000 10000000\n\nSample Output 3\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 246, "cpu_time_ms": 189, "memory_kb": 15360}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s026334984", "group_id": "codeNet:p02779", "input_text": "let () =\n    let n = read_int () in\n    let arr = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n    Array.sort compare arr;\n    let rec loop i prev =\n        if i = n then \"YES\" else\n            if arr.(i) = prev then \"NO\" else loop (i + 1) arr.(i)\n    in\n    loop 1 arr.(0) |>  print_endline", "language": "OCaml", "metadata": {"date": 1581278823, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s026334984.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s026334984", "user_id": "u342443598"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let () =\n    let n = read_int () in\n    let arr = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n    Array.sort compare arr;\n    let rec loop i prev =\n        if i = n then \"YES\" else\n            if arr.(i) = prev then \"NO\" else loop (i + 1) arr.(i)\n    in\n    loop 1 arr.(0) |>  print_endline", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a sequence of integers A_1, A_2, ..., A_N.\nIf its elements are pairwise distinct, print YES; otherwise, print NO.\n\nConstraints\n\n2 ≤ N ≤ 200000\n\n1 ≤ A_i ≤ 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nIf the elements of the sequence are pairwise distinct, print YES; otherwise, print NO.\n\nSample Input 1\n\n5\n2 6 1 4 5\n\nSample Output 1\n\nYES\n\nThe elements are pairwise distinct.\n\nSample Input 2\n\n6\n4 1 3 1 6 2\n\nSample Output 2\n\nNO\n\nThe second and fourth elements are identical.\n\nSample Input 3\n\n2\n10000000 10000000\n\nSample Output 3\n\nNO", "sample_input": "5\n2 6 1 4 5\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p02779", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a sequence of integers A_1, A_2, ..., A_N.\nIf its elements are pairwise distinct, print YES; otherwise, print NO.\n\nConstraints\n\n2 ≤ N ≤ 200000\n\n1 ≤ A_i ≤ 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\n\nOutput\n\nIf the elements of the sequence are pairwise distinct, print YES; otherwise, print NO.\n\nSample Input 1\n\n5\n2 6 1 4 5\n\nSample Output 1\n\nYES\n\nThe elements are pairwise distinct.\n\nSample Input 2\n\n6\n4 1 3 1 6 2\n\nSample Output 2\n\nNO\n\nThe second and fourth elements are identical.\n\nSample Input 3\n\n2\n10000000 10000000\n\nSample Output 3\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 304, "cpu_time_ms": 160, "memory_kb": 5888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s362886346", "group_id": "codeNet:p02783", "input_text": "Scanf.scanf \"%d %d\" (fun h a -> let r = (h + a - 1) / a in Printf.printf \"%d\\n\" r)", "language": "OCaml", "metadata": {"date": 1580068863, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s362886346.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s362886346", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun h a -> let r = (h + a - 1) / a in Printf.printf \"%d\\n\" r)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nServal is fighting with a monster.\n\nThe health of the monster is H.\n\nIn one attack, Serval can decrease the monster's health by A.\nThere is no other way to decrease the monster's health.\n\nServal wins when the monster's health becomes 0 or below.\n\nFind the number of attacks Serval needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq A \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH A\n\nOutput\n\nPrint the number of attacks Serval needs to make before winning.\n\nSample Input 1\n\n10 4\n\nSample Output 1\n\n3\n\nAfter one attack, the monster's health will be 6.\n\nAfter two attacks, the monster's health will be 2.\n\nAfter three attacks, the monster's health will be -2.\n\nThus, Serval needs to make three attacks to win.\n\nSample Input 2\n\n1 10000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10000 1\n\nSample Output 3\n\n10000", "sample_input": "10 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02783", "source_text": "Score : 100 points\n\nProblem Statement\n\nServal is fighting with a monster.\n\nThe health of the monster is H.\n\nIn one attack, Serval can decrease the monster's health by A.\nThere is no other way to decrease the monster's health.\n\nServal wins when the monster's health becomes 0 or below.\n\nFind the number of attacks Serval needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq A \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH A\n\nOutput\n\nPrint the number of attacks Serval needs to make before winning.\n\nSample Input 1\n\n10 4\n\nSample Output 1\n\n3\n\nAfter one attack, the monster's health will be 6.\n\nAfter two attacks, the monster's health will be 2.\n\nAfter three attacks, the monster's health will be -2.\n\nThus, Serval needs to make three attacks to win.\n\nSample Input 2\n\n1 10000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10000 1\n\nSample Output 3\n\n10000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 82, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s284176403", "group_id": "codeNet:p02784", "input_text": "let () =\n  Scanf.scanf \"%d %d\\n\" @@ fun h n ->\n  let arr = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun d -> d in\n  Printf.printf \"%s\\n\" (if h <= Array.fold_left (+) 0 arr then \"Yes\" else \"No\")", "language": "OCaml", "metadata": {"date": 1591618181, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02784.html", "problem_id": "p02784", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02784/input.txt", "sample_output_relpath": "derived/input_output/data/p02784/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02784/OCaml/s284176403.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s284176403", "user_id": "u307426615"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d\\n\" @@ fun h n ->\n  let arr = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun d -> d in\n  Printf.printf \"%s\\n\" (if h <= Array.fold_left (+) 0 arr then \"Yes\" else \"No\")", "problem_context": "Score : 200 points\n\nProblem Statement\n\nRaccoon is fighting with a monster.\n\nThe health of the monster is H.\n\nRaccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i.\nThere is no other way to decrease the monster's health.\n\nRaccoon wins when the monster's health becomes 0 or below.\n\nIf Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq H \\leq 10^9\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH N\nA_1 A_2 ... A_N\n\nOutput\n\nIf Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n10 3\n4 5 6\n\nSample Output 1\n\nYes\n\nThe monster's health will become 0 or below after, for example, using the second and third moves.\n\nSample Input 2\n\n20 3\n4 5 6\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n210 5\n31 41 59 26 53\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n211 5\n31 41 59 26 53\n\nSample Output 4\n\nNo", "sample_input": "10 3\n4 5 6\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02784", "source_text": "Score : 200 points\n\nProblem Statement\n\nRaccoon is fighting with a monster.\n\nThe health of the monster is H.\n\nRaccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i.\nThere is no other way to decrease the monster's health.\n\nRaccoon wins when the monster's health becomes 0 or below.\n\nIf Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq H \\leq 10^9\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH N\nA_1 A_2 ... A_N\n\nOutput\n\nIf Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n10 3\n4 5 6\n\nSample Output 1\n\nYes\n\nThe monster's health will become 0 or below after, for example, using the second and third moves.\n\nSample Input 2\n\n20 3\n4 5 6\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n210 5\n31 41 59 26 53\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n211 5\n31 41 59 26 53\n\nSample Output 4\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 198, "cpu_time_ms": 26, "memory_kb": 5120}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s539656107", "group_id": "codeNet:p02784", "input_text": "let () = Scanf.scanf \"%d %d\\n\" @@ fun h n ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  print_endline @@\n  if h <= Array.fold_left ( + ) 0 as_\n  then \"Yes\"\n  else \"No\"\n", "language": "OCaml", "metadata": {"date": 1580070002, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02784.html", "problem_id": "p02784", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02784/input.txt", "sample_output_relpath": "derived/input_output/data/p02784/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02784/OCaml/s539656107.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s539656107", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\\n\" @@ fun h n ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  print_endline @@\n  if h <= Array.fold_left ( + ) 0 as_\n  then \"Yes\"\n  else \"No\"\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nRaccoon is fighting with a monster.\n\nThe health of the monster is H.\n\nRaccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i.\nThere is no other way to decrease the monster's health.\n\nRaccoon wins when the monster's health becomes 0 or below.\n\nIf Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq H \\leq 10^9\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH N\nA_1 A_2 ... A_N\n\nOutput\n\nIf Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n10 3\n4 5 6\n\nSample Output 1\n\nYes\n\nThe monster's health will become 0 or below after, for example, using the second and third moves.\n\nSample Input 2\n\n20 3\n4 5 6\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n210 5\n31 41 59 26 53\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n211 5\n31 41 59 26 53\n\nSample Output 4\n\nNo", "sample_input": "10 3\n4 5 6\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02784", "source_text": "Score : 200 points\n\nProblem Statement\n\nRaccoon is fighting with a monster.\n\nThe health of the monster is H.\n\nRaccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i.\nThere is no other way to decrease the monster's health.\n\nRaccoon wins when the monster's health becomes 0 or below.\n\nIf Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq H \\leq 10^9\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH N\nA_1 A_2 ... A_N\n\nOutput\n\nIf Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n10 3\n4 5 6\n\nSample Output 1\n\nYes\n\nThe monster's health will become 0 or below after, for example, using the second and third moves.\n\nSample Input 2\n\n20 3\n4 5 6\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n210 5\n31 41 59 26 53\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n211 5\n31 41 59 26 53\n\nSample Output 4\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 199, "cpu_time_ms": 26, "memory_kb": 5120}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s147770368", "group_id": "codeNet:p02785", "input_text": "let () =\n  Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let hrr = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun d -> d in\n  let () = Array.fast_sort (fun x y -> y-x) hrr in\n  let all = Array.fold_left (+) 0 hrr in\n  let sum = ref 0 in\n  if n > k then\n    for i = 0 to k - 1 do\n      sum := !sum + hrr.(i)\n    done;\n  Printf.printf \"%d\\n\" (if n <= k then 0 else all - !sum)\n", "language": "OCaml", "metadata": {"date": 1593891782, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s147770368.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s147770368", "user_id": "u307426615"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let hrr = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun d -> d in\n  let () = Array.fast_sort (fun x y -> y-x) hrr in\n  let all = Array.fold_left (+) 0 hrr in\n  let sum = ref 0 in\n  if n > k then\n    for i = 0 to k - 1 do\n      sum := !sum + hrr.(i)\n    done;\n  Printf.printf \"%d\\n\" (if n <= k then 0 else all - !sum)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "sample_input": "3 1\n4 1 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02785", "source_text": "Score : 300 points\n\nProblem Statement\n\nFennec is fighting with N monsters.\n\nThe health of the i-th monster is H_i.\n\nFennec can do the following two actions:\n\nAttack: Fennec chooses one monster. That monster's health will decrease by 1.\n\nSpecial Move: Fennec chooses one monster. That monster's health will become 0.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\n\nFennec wins when all the monsters' healths become 0 or below.\n\nFind the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 2 \\times 10^5\n\n1 \\leq H_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nH_1 ... H_N\n\nOutput\n\nPrint the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.\n\nSample Input 1\n\n3 1\n4 1 5\n\nSample Output 1\n\n5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks.\n\nSample Input 2\n\n8 9\n7 9 3 2 3 8 4 6\n\nSample Output 2\n\n0\n\nShe can use Special Move on all the monsters.\n\nSample Input 3\n\n3 0\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n3000000000\n\nWatch out for overflow.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 370, "cpu_time_ms": 93, "memory_kb": 8248}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s557690462", "group_id": "codeNet:p02786", "input_text": "(*\nocamlfind ocamlopt -package batteries -linkpkg main.ml -o a.out\n*)\nopen Batteries\n\nlet h = Scanf.sscanf (read_line ()) \"%d\" (\n        fun h -> \n                h\n)\n\nlet rec f h =\n        if h = 1 then\n                1\n        else\n                2 * (f (h / 2)) + 1\n\nlet () =\n        f h\n        |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1590328713, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s557690462.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s557690462", "user_id": "u280335093"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(*\nocamlfind ocamlopt -package batteries -linkpkg main.ml -o a.out\n*)\nopen Batteries\n\nlet h = Scanf.sscanf (read_line ()) \"%d\" (\n        fun h -> \n                h\n)\n\nlet rec f h =\n        if h = 1 then\n                1\n        else\n                2 * (f (h / 2)) + 1\n\nlet () =\n        f h\n        |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nCaracal is fighting with a monster.\n\nThe health of the monster is H.\n\nCaracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:\n\nIf the monster's health is 1, it drops to 0.\n\nIf the monster's health, X, is greater than 1, that monster disappears. Then, two new monsters appear, each with the health of \\lfloor X/2 \\rfloor.\n\n(\\lfloor r \\rfloor denotes the greatest integer not exceeding r.)\n\nCaracal wins when the healths of all existing monsters become 0 or below.\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\n\nOutput\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n3\n\nWhen Caracal attacks the initial monster, it disappears, and two monsters appear, each with the health of 1.\n\nThen, Caracal can attack each of these new monsters once and win with a total of three attacks.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n1000000000000\n\nSample Output 3\n\n1099511627775", "sample_input": "2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02786", "source_text": "Score : 400 points\n\nProblem Statement\n\nCaracal is fighting with a monster.\n\nThe health of the monster is H.\n\nCaracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:\n\nIf the monster's health is 1, it drops to 0.\n\nIf the monster's health, X, is greater than 1, that monster disappears. Then, two new monsters appear, each with the health of \\lfloor X/2 \\rfloor.\n\n(\\lfloor r \\rfloor denotes the greatest integer not exceeding r.)\n\nCaracal wins when the healths of all existing monsters become 0 or below.\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\n\nOutput\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n3\n\nWhen Caracal attacks the initial monster, it disappears, and two monsters appear, each with the health of 1.\n\nThen, Caracal can attack each of these new monsters once and win with a total of three attacks.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n1000000000000\n\nSample Output 3\n\n1099511627775", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 325, "cpu_time_ms": 2, "memory_kb": 3072}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s612611517", "group_id": "codeNet:p02786", "input_text": "Scanf.scanf \"%d\" (fun h -> \n    let rec loop h k acc =\n        if h = 0 then Printf.printf \"%d\\n\" acc else\n            loop (h / 2) (k * 2) (acc + k)\n    in\n    loop h 1 0\n)", "language": "OCaml", "metadata": {"date": 1580069505, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s612611517.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s612611517", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun h -> \n    let rec loop h k acc =\n        if h = 0 then Printf.printf \"%d\\n\" acc else\n            loop (h / 2) (k * 2) (acc + k)\n    in\n    loop h 1 0\n)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nCaracal is fighting with a monster.\n\nThe health of the monster is H.\n\nCaracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:\n\nIf the monster's health is 1, it drops to 0.\n\nIf the monster's health, X, is greater than 1, that monster disappears. Then, two new monsters appear, each with the health of \\lfloor X/2 \\rfloor.\n\n(\\lfloor r \\rfloor denotes the greatest integer not exceeding r.)\n\nCaracal wins when the healths of all existing monsters become 0 or below.\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\n\nOutput\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n3\n\nWhen Caracal attacks the initial monster, it disappears, and two monsters appear, each with the health of 1.\n\nThen, Caracal can attack each of these new monsters once and win with a total of three attacks.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n1000000000000\n\nSample Output 3\n\n1099511627775", "sample_input": "2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02786", "source_text": "Score : 400 points\n\nProblem Statement\n\nCaracal is fighting with a monster.\n\nThe health of the monster is H.\n\nCaracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:\n\nIf the monster's health is 1, it drops to 0.\n\nIf the monster's health, X, is greater than 1, that monster disappears. Then, two new monsters appear, each with the health of \\lfloor X/2 \\rfloor.\n\n(\\lfloor r \\rfloor denotes the greatest integer not exceeding r.)\n\nCaracal wins when the healths of all existing monsters become 0 or below.\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\n\nOutput\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n3\n\nWhen Caracal attacks the initial monster, it disappears, and two monsters appear, each with the health of 1.\n\nThen, Caracal can attack each of these new monsters once and win with a total of three attacks.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n1000000000000\n\nSample Output 3\n\n1099511627775", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 173, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s192937866", "group_id": "codeNet:p02787", "input_text": "let h, dp, ab_s = Scanf.(scanf \"%d %d\" @@ fun h n -> Array.(h, make (h + 1) (1 lsl 40), init n @@ fun _ -> scanf \" %d %d\" @@ fun a b -> a, b))\nlet _ = for i = 1 to h do Array.iter (fun (a, b) -> dp.(i) <- min dp.(i) @@ if a >= i then b else dp.(i - a) + b) ab_s done; Printf.printf \"%d\\n\" @@ dp.(h)", "language": "OCaml", "metadata": {"date": 1581845063, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02787.html", "problem_id": "p02787", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02787/input.txt", "sample_output_relpath": "derived/input_output/data/p02787/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02787/OCaml/s192937866.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s192937866", "user_id": "u732304692"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let h, dp, ab_s = Scanf.(scanf \"%d %d\" @@ fun h n -> Array.(h, make (h + 1) (1 lsl 40), init n @@ fun _ -> scanf \" %d %d\" @@ fun a b -> a, b))\nlet _ = for i = 1 to h do Array.iter (fun (a, b) -> dp.(i) <- min dp.(i) @@ if a >= i then b else dp.(i - a) + b) ab_s done; Printf.printf \"%d\\n\" @@ dp.(h)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nIbis is fighting with a monster.\n\nThe health of the monster is H.\n\nIbis can cast N kinds of spells. Casting the i-th spell decreases the monster's health by A_i, at the cost of B_i Magic Points.\n\nThe same spell can be cast multiple times. There is no way other than spells to decrease the monster's health.\n\nIbis wins when the health of the monster becomes 0 or below.\n\nFind the minimum total Magic Points that have to be consumed before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq N \\leq 10^3\n\n1 \\leq A_i \\leq 10^4\n\n1 \\leq B_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH N\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the minimum total Magic Points that have to be consumed before winning.\n\nSample Input 1\n\n9 3\n8 3\n4 2\n2 1\n\nSample Output 1\n\n4\n\nFirst, let us cast the first spell to decrease the monster's health by 8, at the cost of 3 Magic Points. The monster's health is now 1.\n\nThen, cast the third spell to decrease the monster's health by 2, at the cost of 1 Magic Point. The monster's health is now -1.\n\nIn this way, we can win at the total cost of 4 Magic Points.\n\nSample Input 2\n\n100 6\n1 1\n2 3\n3 9\n4 27\n5 81\n6 243\n\nSample Output 2\n\n100\n\nIt is optimal to cast the first spell 100 times.\n\nSample Input 3\n\n9999 10\n540 7550\n691 9680\n700 9790\n510 7150\n415 5818\n551 7712\n587 8227\n619 8671\n588 8228\n176 2461\n\nSample Output 3\n\n139815", "sample_input": "9 3\n8 3\n4 2\n2 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02787", "source_text": "Score : 500 points\n\nProblem Statement\n\nIbis is fighting with a monster.\n\nThe health of the monster is H.\n\nIbis can cast N kinds of spells. Casting the i-th spell decreases the monster's health by A_i, at the cost of B_i Magic Points.\n\nThe same spell can be cast multiple times. There is no way other than spells to decrease the monster's health.\n\nIbis wins when the health of the monster becomes 0 or below.\n\nFind the minimum total Magic Points that have to be consumed before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq N \\leq 10^3\n\n1 \\leq A_i \\leq 10^4\n\n1 \\leq B_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH N\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the minimum total Magic Points that have to be consumed before winning.\n\nSample Input 1\n\n9 3\n8 3\n4 2\n2 1\n\nSample Output 1\n\n4\n\nFirst, let us cast the first spell to decrease the monster's health by 8, at the cost of 3 Magic Points. The monster's health is now 1.\n\nThen, cast the third spell to decrease the monster's health by 2, at the cost of 1 Magic Point. The monster's health is now -1.\n\nIn this way, we can win at the total cost of 4 Magic Points.\n\nSample Input 2\n\n100 6\n1 1\n2 3\n3 9\n4 27\n5 81\n6 243\n\nSample Output 2\n\n100\n\nIt is optimal to cast the first spell 100 times.\n\nSample Input 3\n\n9999 10\n540 7550\n691 9680\n700 9790\n510 7150\n415 5818\n551 7712\n587 8227\n619 8671\n588 8228\n176 2461\n\nSample Output 3\n\n139815", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 181, "memory_kb": 3328}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s282081869", "group_id": "codeNet:p02789", "input_text": "let () =\n  Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  Printf.printf \"%s\\n\" (if n = m then \"Yes\" else \"No\")", "language": "OCaml", "metadata": {"date": 1591629721, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s282081869.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s282081869", "user_id": "u307426615"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  Printf.printf \"%s\\n\" (if n = m then \"Yes\" else \"No\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest, AXC001. He has just submitted his code to Problem A.\n\nThe problem has N test cases, all of which must be passed to get an AC verdict.\n\nTakahashi's submission has passed M cases out of the N test cases.\n\nDetermine whether Takahashi's submission gets an AC.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq M \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nIf Takahashi's submission gets an AC, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\nYes\n\nAll three test cases have been passed, so his submission gets an AC.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\nNo\n\nOnly two out of the three test cases have been passed, so his submission does not get an AC.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nYes", "sample_input": "3 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02789", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest, AXC001. He has just submitted his code to Problem A.\n\nThe problem has N test cases, all of which must be passed to get an AC verdict.\n\nTakahashi's submission has passed M cases out of the N test cases.\n\nDetermine whether Takahashi's submission gets an AC.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq M \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nIf Takahashi's submission gets an AC, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 3\n\nSample Output 1\n\nYes\n\nAll three test cases have been passed, so his submission gets an AC.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\nNo\n\nOnly two out of the three test cases have been passed, so his submission does not get an AC.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 101, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s528861576", "group_id": "codeNet:p02790", "input_text": "let () =\n  let rec makeN n m = if m = 0 then \"\" else n ^ (makeN n (m-1)) in\n  let ios = int_of_string in\n  Scanf.scanf \"%s %s\\n\" @@ fun a b ->\n  Printf.printf \"%d\\n\" @@ (if a < b then (ios (makeN a (ios(b)))) else (ios (makeN b (ios(a)))))", "language": "OCaml", "metadata": {"date": 1591632036, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s528861576.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s528861576", "user_id": "u307426615"}, "prompt_components": {"gold_output": "3333\n", "input_to_evaluate": "let () =\n  let rec makeN n m = if m = 0 then \"\" else n ^ (makeN n (m-1)) in\n  let ios = int_of_string in\n  Scanf.scanf \"%s %s\\n\" @@ fun a b ->\n  Printf.printf \"%d\\n\" @@ (if a < b then (ios (makeN a (ios(b)))) else (ios (makeN b (ios(a)))))", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s892115922", "group_id": "codeNet:p02792", "input_text": "let rec fix f x = f (fix f) x\nlet () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let ad = Array.init 10 (fun _ -> Array.make 10 0) in\n  for i = 1 to n do\n    let d = fix (fun f x -> if x < 10 then x else f (x/10)) i in\n    ad.(i mod 10).(d) <- ad.(i mod 10).(d) + 1;\n  done;\n\n  fix (fun f ans i j ->\n    if i > 9 then ans\n    else if j > 9 then f ans (i+1) 1\n    else f (ans + ad.(i).(j) * ad.(j).(i)) i (j+1)) 0 1 1 \n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1579468242, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s892115922.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s892115922", "user_id": "u798181098"}, "prompt_components": {"gold_output": "17\n", "input_to_evaluate": "let rec fix f x = f (fix f) x\nlet () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let ad = Array.init 10 (fun _ -> Array.make 10 0) in\n  for i = 1 to n do\n    let d = fix (fun f x -> if x < 10 then x else f (x/10)) i in\n    ad.(i mod 10).(d) <- ad.(i mod 10).(d) + 1;\n  done;\n\n  fix (fun f ans i j ->\n    if i > 9 then ans\n    else if j > 9 then f ans (i+1) 1\n    else f (ans + ad.(i).(j) * ad.(j).(i)) i (j+1)) 0 1 1 \n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a positive integer N.\n\nFind the number of pairs (A, B) of positive integers not greater than N that satisfy the following condition:\n\nWhen A and B are written in base ten without leading zeros, the last digit of A is equal to the first digit of B, and the first digit of A is equal to the last digit of B.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n25\n\nSample Output 1\n\n17\n\nThe following 17 pairs satisfy the condition: (1,1), (1,11), (2,2), (2,22), (3,3), (4,4), (5,5), (6,6), (7,7), (8,8), (9,9), (11,1), (11,11), (12,21), (21,12), (22,2), and (22,22).\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100\n\nSample Output 3\n\n108\n\nSample Input 4\n\n2020\n\nSample Output 4\n\n40812\n\nSample Input 5\n\n200000\n\nSample Output 5\n\n400000008", "sample_input": "25\n"}, "reference_outputs": ["17\n"], "source_document_id": "p02792", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a positive integer N.\n\nFind the number of pairs (A, B) of positive integers not greater than N that satisfy the following condition:\n\nWhen A and B are written in base ten without leading zeros, the last digit of A is equal to the first digit of B, and the first digit of A is equal to the last digit of B.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n25\n\nSample Output 1\n\n17\n\nThe following 17 pairs satisfy the condition: (1,1), (1,11), (2,2), (2,22), (3,3), (4,4), (5,5), (6,6), (7,7), (8,8), (9,9), (11,1), (11,11), (12,21), (21,12), (22,2), and (22,22).\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100\n\nSample Output 3\n\n108\n\nSample Input 4\n\n2020\n\nSample Output 4\n\n40812\n\nSample Input 5\n\n200000\n\nSample Output 5\n\n400000008", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 435, "cpu_time_ms": 7, "memory_kb": 2560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s174946971", "group_id": "codeNet:p02797", "input_text": "let () =\n    let main () =\n        let n, k, s = Scanf.scanf \"%d %d %d\" (fun n k s -> n, k ,s) in\n        if s > n - k then (\n            for i = 1 to k do Printf.printf \"%d \" s done;\n            for i = k + 1 to n do Printf.printf \"1 \" done;\n        ) else (\n            for i = 1 to k do Printf.printf \"%d \" s done;\n            for i = k + 1 to n do Printf.printf \"100000000 \" done;\n        );\n        print_newline ()\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1579380721, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s174946971.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s174946971", "user_id": "u342443598"}, "prompt_components": {"gold_output": "1 2 3 4\n", "input_to_evaluate": "let () =\n    let main () =\n        let n, k, s = Scanf.scanf \"%d %d %d\" (fun n k s -> n, k ,s) in\n        if s > n - k then (\n            for i = 1 to k do Printf.printf \"%d \" s done;\n            for i = k + 1 to n do Printf.printf \"1 \" done;\n        ) else (\n            for i = 1 to k do Printf.printf \"%d \" s done;\n            for i = k + 1 to n do Printf.printf \"100000000 \" done;\n        );\n        print_newline ()\n    in\n    main ()", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are three integers N, K, and S.\n\nFind a sequence A_1, A_2, ..., A_N of N integers between 1 and 10^9 (inclusive) that satisfies the condition below.\nWe can prove that, under the conditions in Constraints, such a sequence always exists.\n\nThere are exactly K pairs (l, r) of integers such that 1 \\leq l \\leq r \\leq N and A_l + A_{l + 1} + \\cdots + A_r = S.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K \\leq N\n\n1 \\leq S \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K S\n\nOutput\n\nPrint a sequence satisfying the condition, in the following format:\n\nA_1 A_2 ... A_N\n\nSample Input 1\n\n4 2 3\n\nSample Output 1\n\n1 2 3 4\n\nTwo pairs (l, r) = (1, 2) and (3, 3) satisfy the condition in the statement.\n\nSample Input 2\n\n5 3 100\n\nSample Output 2\n\n50 50 50 30 70", "sample_input": "4 2 3\n"}, "reference_outputs": ["1 2 3 4\n"], "source_document_id": "p02797", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are three integers N, K, and S.\n\nFind a sequence A_1, A_2, ..., A_N of N integers between 1 and 10^9 (inclusive) that satisfies the condition below.\nWe can prove that, under the conditions in Constraints, such a sequence always exists.\n\nThere are exactly K pairs (l, r) of integers such that 1 \\leq l \\leq r \\leq N and A_l + A_{l + 1} + \\cdots + A_r = S.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K \\leq N\n\n1 \\leq S \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K S\n\nOutput\n\nPrint a sequence satisfying the condition, in the following format:\n\nA_1 A_2 ... A_N\n\nSample Input 1\n\n4 2 3\n\nSample Output 1\n\n1 2 3 4\n\nTwo pairs (l, r) = (1, 2) and (3, 3) satisfy the condition in the statement.\n\nSample Input 2\n\n5 3 100\n\nSample Output 2\n\n50 50 50 30 70", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 439, "cpu_time_ms": 24, "memory_kb": 3712}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s024658057", "group_id": "codeNet:p02797", "input_text": "let () = Scanf.scanf \"%d %d %d\" @@ fun n k s ->\n  for i = 1 to k do\n    Printf.printf \"%d \" s\n  done;\n  for i = k + 1 to n do\n    Printf.printf \"%d \" @@\n    if n < s then 1 else s + 1\n  done;\n  print_newline ()", "language": "OCaml", "metadata": {"date": 1579379952, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s024658057.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s024658057", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1 2 3 4\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" @@ fun n k s ->\n  for i = 1 to k do\n    Printf.printf \"%d \" s\n  done;\n  for i = k + 1 to n do\n    Printf.printf \"%d \" @@\n    if n < s then 1 else s + 1\n  done;\n  print_newline ()", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are three integers N, K, and S.\n\nFind a sequence A_1, A_2, ..., A_N of N integers between 1 and 10^9 (inclusive) that satisfies the condition below.\nWe can prove that, under the conditions in Constraints, such a sequence always exists.\n\nThere are exactly K pairs (l, r) of integers such that 1 \\leq l \\leq r \\leq N and A_l + A_{l + 1} + \\cdots + A_r = S.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K \\leq N\n\n1 \\leq S \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K S\n\nOutput\n\nPrint a sequence satisfying the condition, in the following format:\n\nA_1 A_2 ... A_N\n\nSample Input 1\n\n4 2 3\n\nSample Output 1\n\n1 2 3 4\n\nTwo pairs (l, r) = (1, 2) and (3, 3) satisfy the condition in the statement.\n\nSample Input 2\n\n5 3 100\n\nSample Output 2\n\n50 50 50 30 70", "sample_input": "4 2 3\n"}, "reference_outputs": ["1 2 3 4\n"], "source_document_id": "p02797", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are three integers N, K, and S.\n\nFind a sequence A_1, A_2, ..., A_N of N integers between 1 and 10^9 (inclusive) that satisfies the condition below.\nWe can prove that, under the conditions in Constraints, such a sequence always exists.\n\nThere are exactly K pairs (l, r) of integers such that 1 \\leq l \\leq r \\leq N and A_l + A_{l + 1} + \\cdots + A_r = S.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K \\leq N\n\n1 \\leq S \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K S\n\nOutput\n\nPrint a sequence satisfying the condition, in the following format:\n\nA_1 A_2 ... A_N\n\nSample Input 1\n\n4 2 3\n\nSample Output 1\n\n1 2 3 4\n\nTwo pairs (l, r) = (1, 2) and (3, 3) satisfy the condition in the statement.\n\nSample Input 2\n\n5 3 100\n\nSample Output 2\n\n50 50 50 30 70", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 210, "cpu_time_ms": 27, "memory_kb": 3712}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s575860933", "group_id": "codeNet:p02803", "input_text": "let split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\nlet (h, w) = Scanf.sscanf (read_line ()) \"%d %d\" @@ fun h w -> (h, w)\nlet s = Array.init h @@ fun _ -> read_line () |> split_string |> Array.of_list\n\nlet rec start i j = if s.(i).(j) = \".\" then (i, j) else if j = w - 1 then start (i + 1) 0 else start i (j + 1)\nlet (si, sj) = start 0 0\n\nlet walk i j arr =\n  let que = Queue.create () in\n  Queue.add (i, j) que;\n  while not (Queue.is_empty que) do\n    let (i, j) = Queue.pop que in\n    List.iter (fun (di, dj) -> \n      if 0 <= di && di < h && 0 <= dj && dj < w && s.(di).(dj) = \".\"  && arr.(di).(dj) = -1 then begin\n        arr.(di).(dj) <- arr.(i).(j) + 1;\n        Queue.add (di, dj) que\n      end\n    ) [(i - 1, j); (i + 1, j); (i, j - 1); (i, j + 1)]\n  done\n\nlet f arr =\n  let m = ref 0 in\n  for i = 0 to h - 1 do\n    for j = 0 to w - 1 do\n      m := max !m arr.(i).(j)\n    done\n  done;\n  !m\n\nlet () =\n  let ans = ref 0 in\n  for i = 0 to h - 1 do\n    for j = 0 to w - 1 do\n      if s.(i).(j) = \".\" then begin\n        let arr = Array.init h @@ fun _ -> Array.make w (-1) in\n        arr.(i).(j) <- 0;\n        walk i j arr;\n        ans := max !ans (f arr)\n      end\n    done\n  done;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1590448964, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s575860933.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s575860933", "user_id": "u811309788"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\nlet (h, w) = Scanf.sscanf (read_line ()) \"%d %d\" @@ fun h w -> (h, w)\nlet s = Array.init h @@ fun _ -> read_line () |> split_string |> Array.of_list\n\nlet rec start i j = if s.(i).(j) = \".\" then (i, j) else if j = w - 1 then start (i + 1) 0 else start i (j + 1)\nlet (si, sj) = start 0 0\n\nlet walk i j arr =\n  let que = Queue.create () in\n  Queue.add (i, j) que;\n  while not (Queue.is_empty que) do\n    let (i, j) = Queue.pop que in\n    List.iter (fun (di, dj) -> \n      if 0 <= di && di < h && 0 <= dj && dj < w && s.(di).(dj) = \".\"  && arr.(di).(dj) = -1 then begin\n        arr.(di).(dj) <- arr.(i).(j) + 1;\n        Queue.add (di, dj) que\n      end\n    ) [(i - 1, j); (i + 1, j); (i, j - 1); (i, j + 1)]\n  done\n\nlet f arr =\n  let m = ref 0 in\n  for i = 0 to h - 1 do\n    for j = 0 to w - 1 do\n      m := max !m arr.(i).(j)\n    done\n  done;\n  !m\n\nlet () =\n  let ans = ref 0 in\n  for i = 0 to h - 1 do\n    for j = 0 to w - 1 do\n      if s.(i).(j) = \".\" then begin\n        let arr = Array.init h @@ fun _ -> Array.make w (-1) in\n        arr.(i).(j) <- 0;\n        walk i j arr;\n        ans := max !ans (f arr)\n      end\n    done\n  done;\n  Printf.printf \"%d\\n\" !ans", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1225, "cpu_time_ms": 14, "memory_kb": 2816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s584353212", "group_id": "codeNet:p02803", "input_text": "open Queue\nlet ans, q, h, w, ss = Scanf.(scanf \"%d %d\" @@ fun h w -> ref 0, create (), h, w, Array.init h @@ fun _ -> scanf \" %s\" @@ fun s -> s)\nlet f sy sx = let ds, m = Array.make_matrix h w ~-1, ref 0 in push (sy, sx) q; ds.(sy).(sx) <- 0;\n  while not @@ is_empty q do let y0, x0 = pop q in List.iter (fun (dy, dx) -> let y, x = y0 + dy, x0 + dx in if 0 <= y && y < h && 0 <= x && x < w && ds.(y).(x) = -1 && ss.(y).[x] = '.' then (push (y, x) q; ds.(y).(x) <- ds.(y0).(x0) + 1; m := max !m ds.(y).(x))) [-1, 0; 0, -1; 1, 0; 0, 1] done; !m\nlet _ = for sy = 0 to h - 1 do for sx = 0 to w - 1 do if ss.(sy).[sx] = '.' then ans := max !ans (f sy sx) done done; Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1580778357, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s584353212.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s584353212", "user_id": "u732304692"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "open Queue\nlet ans, q, h, w, ss = Scanf.(scanf \"%d %d\" @@ fun h w -> ref 0, create (), h, w, Array.init h @@ fun _ -> scanf \" %s\" @@ fun s -> s)\nlet f sy sx = let ds, m = Array.make_matrix h w ~-1, ref 0 in push (sy, sx) q; ds.(sy).(sx) <- 0;\n  while not @@ is_empty q do let y0, x0 = pop q in List.iter (fun (dy, dx) -> let y, x = y0 + dy, x0 + dx in if 0 <= y && y < h && 0 <= x && x < w && ds.(y).(x) = -1 && ss.(y).[x] = '.' then (push (y, x) q; ds.(y).(x) <- ds.(y0).(x0) + 1; m := max !m ds.(y).(x))) [-1, 0; 0, -1; 1, 0; 0, 1] done; !m\nlet _ = for sy = 0 to h - 1 do for sx = 0 to w - 1 do if ss.(sy).[sx] = '.' then ans := max !ans (f sy sx) done done; Printf.printf \"%d\\n\" !ans", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 686, "cpu_time_ms": 13, "memory_kb": 4608}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s332157011", "group_id": "codeNet:p02803", "input_text": "module DirectedGraph\n  (* 道の表現 *)\n  (Path : sig\n    type t\n    (* 辺の名前 *)\n    type edge\n    (* 長さ0の道 *)\n    val nil : t\n    (* 道の後ろに辺を付け足した道 *)\n    val snoc : t -> edge -> t\n  end) :\nsig\n  (* BFSにより，重みのないグラフの最短経路を求める *)\n  val bfs :\n    (* 頂点数（Hashtblを用いるので目安程度） *)\n    int ->\n    (* 辺の名前が付いた隣接リスト *)\n    ('v -> ('v * Path.edge) list) ->\n    (* 始点 *)\n    'v ->\n    (* 最短経路を返す関数 辿り着けなければNoneを返す） *)\n    ('v -> Path.t option)\nend = struct\n  let rec bfs_aux es d frontier t =\n    try Some (Hashtbl.find d t) with\n    | Not_found ->\n        match !frontier with\n        | [] -> None\n        | _ :: _ ->\n            frontier := List.fold_right (fun u ->\n              List.fold_right (fun (v, e) frontier ->\n                if Hashtbl.mem d v\n                then frontier\n                else (Hashtbl.add d v (Path.snoc (Hashtbl.find d u) e); v :: frontier))\n              (es u)) !frontier [];\n            bfs_aux es d frontier t\n\n  (*\n   * 終点に辿り着いた時点で探索を切り上げるが，\n   * 戻り値の関数を覚えておくと，途中まで探索した結果が再利用される\n   * （#trace bfs_aux すると分かりやすい）\n   *)\n  let bfs n es s =\n    let d = Hashtbl.create n in\n    Hashtbl.add d s Path.nil;\n    let frontier = ref [s] in\n    bfs_aux es d frontier\nend\n\n(* 距離だけ欲しい場合 *)\nmodule G = DirectedGraph (struct\n  type t = int\n  type edge = unit\n  let nil = 0\n  let snoc t _ = t + 1\nend)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun h w ->\n  let ss = Array.init h @@ fun _ -> Scanf.scanf \"%s\\n\" @@ fun s -> s in\n  let d =\n    Array.init h @@ fun i ->\n      Array.init w @@ fun j ->\n        let d =\n          G.bfs (h * w) (fun (i, j) ->\n            [(i - 1, j); (i + 1, j); (i, j - 1); (i, j + 1)]\n            |> List.filter (fun (i, j) -> try ss.(i).[j] = '.' with _ -> false)\n            |> List.map (fun v -> (v, ()))) (i, j) in\n        Array.init h @@ fun i ->\n          Array.init w @@ fun j -> d (i, j) in\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left (Array.fold_left (Array.fold_left (Array.fold_left (fun ans -> function None -> ans | Some d -> max d ans)))) min_int d\n\n\n", "language": "OCaml", "metadata": {"date": 1578887053, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s332157011.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s332157011", "user_id": "u504158101"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "module DirectedGraph\n  (* 道の表現 *)\n  (Path : sig\n    type t\n    (* 辺の名前 *)\n    type edge\n    (* 長さ0の道 *)\n    val nil : t\n    (* 道の後ろに辺を付け足した道 *)\n    val snoc : t -> edge -> t\n  end) :\nsig\n  (* BFSにより，重みのないグラフの最短経路を求める *)\n  val bfs :\n    (* 頂点数（Hashtblを用いるので目安程度） *)\n    int ->\n    (* 辺の名前が付いた隣接リスト *)\n    ('v -> ('v * Path.edge) list) ->\n    (* 始点 *)\n    'v ->\n    (* 最短経路を返す関数 辿り着けなければNoneを返す） *)\n    ('v -> Path.t option)\nend = struct\n  let rec bfs_aux es d frontier t =\n    try Some (Hashtbl.find d t) with\n    | Not_found ->\n        match !frontier with\n        | [] -> None\n        | _ :: _ ->\n            frontier := List.fold_right (fun u ->\n              List.fold_right (fun (v, e) frontier ->\n                if Hashtbl.mem d v\n                then frontier\n                else (Hashtbl.add d v (Path.snoc (Hashtbl.find d u) e); v :: frontier))\n              (es u)) !frontier [];\n            bfs_aux es d frontier t\n\n  (*\n   * 終点に辿り着いた時点で探索を切り上げるが，\n   * 戻り値の関数を覚えておくと，途中まで探索した結果が再利用される\n   * （#trace bfs_aux すると分かりやすい）\n   *)\n  let bfs n es s =\n    let d = Hashtbl.create n in\n    Hashtbl.add d s Path.nil;\n    let frontier = ref [s] in\n    bfs_aux es d frontier\nend\n\n(* 距離だけ欲しい場合 *)\nmodule G = DirectedGraph (struct\n  type t = int\n  type edge = unit\n  let nil = 0\n  let snoc t _ = t + 1\nend)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun h w ->\n  let ss = Array.init h @@ fun _ -> Scanf.scanf \"%s\\n\" @@ fun s -> s in\n  let d =\n    Array.init h @@ fun i ->\n      Array.init w @@ fun j ->\n        let d =\n          G.bfs (h * w) (fun (i, j) ->\n            [(i - 1, j); (i + 1, j); (i, j - 1); (i, j + 1)]\n            |> List.filter (fun (i, j) -> try ss.(i).[j] = '.' with _ -> false)\n            |> List.map (fun v -> (v, ()))) (i, j) in\n        Array.init h @@ fun i ->\n          Array.init w @@ fun j -> d (i, j) in\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left (Array.fold_left (Array.fold_left (Array.fold_left (fun ans -> function None -> ans | Some d -> max d ans)))) min_int d\n\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a maze, which is a grid of H \\times W squares with H horizontal rows and W vertical columns.\n\nThe square at the i-th row from the top and the j-th column is a \"wall\" square if S_{ij} is #, and a \"road\" square if S_{ij} is ..\n\nFrom a road square, you can move to a horizontally or vertically adjacent road square.\n\nYou cannot move out of the maze, move to a wall square, or move diagonally.\n\nTakahashi will choose a starting square and a goal square, which can be any road squares, and give the maze to Aoki.\n\nAoki will then travel from the starting square to the goal square, in the minimum number of moves required.\n\nIn this situation, find the maximum possible number of moves Aoki has to make.\n\nConstraints\n\n1 \\leq H,W \\leq 20\n\nS_{ij} is . or #.\n\nS contains at least two occurrences of ..\n\nAny road square can be reached from any road square in zero or more moves.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_{11}...S_{1W}\n:\nS_{H1}...S_{HW}\n\nOutput\n\nPrint the maximum possible number of moves Aoki has to make.\n\nSample Input 1\n\n3 3\n...\n...\n...\n\nSample Output 1\n\n4\n\nIf Takahashi chooses the top-left square as the starting square and the bottom-right square as the goal square, Aoki has to make four moves.\n\nSample Input 2\n\n3 5\n...#.\n.#.#.\n.#...\n\nSample Output 2\n\n10\n\nIf Takahashi chooses the bottom-left square as the starting square and the top-right square as the goal square, Aoki has to make ten moves.", "sample_input": "3 3\n...\n...\n...\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02803", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a maze, which is a grid of H \\times W squares with H horizontal rows and W vertical columns.\n\nThe square at the i-th row from the top and the j-th column is a \"wall\" square if S_{ij} is #, and a \"road\" square if S_{ij} is ..\n\nFrom a road square, you can move to a horizontally or vertically adjacent road square.\n\nYou cannot move out of the maze, move to a wall square, or move diagonally.\n\nTakahashi will choose a starting square and a goal square, which can be any road squares, and give the maze to Aoki.\n\nAoki will then travel from the starting square to the goal square, in the minimum number of moves required.\n\nIn this situation, find the maximum possible number of moves Aoki has to make.\n\nConstraints\n\n1 \\leq H,W \\leq 20\n\nS_{ij} is . or #.\n\nS contains at least two occurrences of ..\n\nAny road square can be reached from any road square in zero or more moves.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_{11}...S_{1W}\n:\nS_{H1}...S_{HW}\n\nOutput\n\nPrint the maximum possible number of moves Aoki has to make.\n\nSample Input 1\n\n3 3\n...\n...\n...\n\nSample Output 1\n\n4\n\nIf Takahashi chooses the top-left square as the starting square and the bottom-right square as the goal square, Aoki has to make four moves.\n\nSample Input 2\n\n3 5\n...#.\n.#.#.\n.#...\n\nSample Output 2\n\n10\n\nIf Takahashi chooses the bottom-left square as the starting square and the top-right square as the goal square, Aoki has to make ten moves.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2324, "cpu_time_ms": 124, "memory_kb": 8448}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s310967678", "group_id": "codeNet:p02803", "input_text": "let () =\n    let main () =\n        let h, w = Scanf.sscanf (read_line ()) \"%d %d\" (fun h w -> h, w) in\n        let s = Array.init h (fun _ -> read_line ()) in\n        let dfs x y =\n            let m = Array.make_matrix h w (-1) in\n            let rec loop depth next = function\n                | [] -> if next = [] then depth else loop (depth + 1) [] next\n                | (xx, yy) :: tl ->\n                        let () = m.(yy).(xx) <- depth in\n                        let next = if xx > 0     && m.(yy).(xx - 1) < 0 && s.(yy).[xx-1] = '.' then (xx-1, yy) :: next else next in\n                        let next = if xx < w - 1 && m.(yy).(xx + 1) < 0 && s.(yy).[xx+1] = '.' then (xx+1, yy) :: next else next in\n                        let next = if yy > 0     && m.(yy - 1).(xx) < 0 && s.(yy-1).[xx] = '.' then (xx, yy-1) :: next else next in\n                        let next = if yy < h - 1 && m.(yy + 1).(xx) < 0 && s.(yy+1).[xx] = '.' then (xx, yy+1) :: next else next in\n                        loop depth next tl\n            in\n            if s.(y).[x] = '.' then loop 0 [] [ x, y ] else 0\n        in\n        let rec loop_h y acc =\n            let rec loop_w x acc =\n                if x = w then acc else loop_w (x + 1) (max acc (dfs x y))\n            in\n            if y = h then acc else loop_h (y + 1) (loop_w 0 acc)\n        in\n        loop_h 0 0 |> Printf.printf \"%d\\n\"\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1578882504, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s310967678.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s310967678", "user_id": "u342443598"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let () =\n    let main () =\n        let h, w = Scanf.sscanf (read_line ()) \"%d %d\" (fun h w -> h, w) in\n        let s = Array.init h (fun _ -> read_line ()) in\n        let dfs x y =\n            let m = Array.make_matrix h w (-1) in\n            let rec loop depth next = function\n                | [] -> if next = [] then depth else loop (depth + 1) [] next\n                | (xx, yy) :: tl ->\n                        let () = m.(yy).(xx) <- depth in\n                        let next = if xx > 0     && m.(yy).(xx - 1) < 0 && s.(yy).[xx-1] = '.' then (xx-1, yy) :: next else next in\n                        let next = if xx < w - 1 && m.(yy).(xx + 1) < 0 && s.(yy).[xx+1] = '.' then (xx+1, yy) :: next else next in\n                        let next = if yy > 0     && m.(yy - 1).(xx) < 0 && s.(yy-1).[xx] = '.' then (xx, yy-1) :: next else next in\n                        let next = if yy < h - 1 && m.(yy + 1).(xx) < 0 && s.(yy+1).[xx] = '.' then (xx, yy+1) :: next else next in\n                        loop depth next tl\n            in\n            if s.(y).[x] = '.' then loop 0 [] [ x, y ] else 0\n        in\n        let rec loop_h y acc =\n            let rec loop_w x acc =\n                if x = w then acc else loop_w (x + 1) (max acc (dfs x y))\n            in\n            if y = h then acc else loop_h (y + 1) (loop_w 0 acc)\n        in\n        loop_h 0 0 |> Printf.printf \"%d\\n\"\n    in\n    main ()", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1400, "cpu_time_ms": 2109, "memory_kb": 483696}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s414634321", "group_id": "codeNet:p02811", "input_text": "let coins k x =\n  if k * 500 >= x then \"Yes\" else \"No\"\n\nlet k, x = Scanf.sscanf (read_line ()) \"%d %d\" (fun k x -> (k, x))\nlet () = Printf.printf \"%s\\n\" (coins k x)\n", "language": "OCaml", "metadata": {"date": 1595712915, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s414634321.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s414634321", "user_id": "u272377260"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let coins k x =\n  if k * 500 >= x then \"Yes\" else \"No\"\n\nlet k, x = Scanf.sscanf (read_line ()) \"%d %d\" (fun k x -> (k, x))\nlet () = Printf.printf \"%s\\n\" (coins k x)\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 3696}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s853721369", "group_id": "codeNet:p02814", "input_text": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list ?sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list ?sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list ?sep conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet (n,m) = scan \"%d %d\" Tuple2.make\nlet ls = scan_list ~sep:' ' Int.of_string\n\nlet rec gcd a b =\n  if b = 0 then a\n  else gcd b (a mod b)\n\nlet () =\n  let ms = ListL.map ls ~f:(fun x -> x / 2) in\n  List.reduce (fun a b -> a*b / gcd a b) ms\n  |> (fun x ->\n      if m = 1 || m - x < 0 then 0\n      else (m - List.min ms)/(2*x) + 1)\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1590533751, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s853721369.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s853721369", "user_id": "u802614675"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list ?sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list ?sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list ?sep conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet (n,m) = scan \"%d %d\" Tuple2.make\nlet ls = scan_list ~sep:' ' Int.of_string\n\nlet rec gcd a b =\n  if b = 0 then a\n  else gcd b (a mod b)\n\nlet () =\n  let ms = ListL.map ls ~f:(fun x -> x / 2) in\n  List.reduce (fun a b -> a*b / gcd a b) ms\n  |> (fun x ->\n      if m = 1 || m - x < 0 then 0\n      else (m - List.min ms)/(2*x) + 1)\n  |> Printf.printf \"%d\\n\"\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2360, "cpu_time_ms": 53, "memory_kb": 12800}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s529473752", "group_id": "codeNet:p02814", "input_text": "let rec gcd n m =\n  if m = 0 then n\n  else gcd m (n mod m)\n\nlet lcm n m = n / gcd n m * m\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  Printf.printf \"%d\\n\" @@\n  try\n    let lcm = Array.fold_left (fun ans a ->\n      (if m < ans then raise Not_found);\n      lcm ans (a / 2)) 1 as_ in\n    (m / lcm + 1) / 2\n  with Not_found -> 0\n\n", "language": "OCaml", "metadata": {"date": 1578710348, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s529473752.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s529473752", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let rec gcd n m =\n  if m = 0 then n\n  else gcd m (n mod m)\n\nlet lcm n m = n / gcd n m * m\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  Printf.printf \"%d\\n\" @@\n  try\n    let lcm = Array.fold_left (fun ans a ->\n      (if m < ans then raise Not_found);\n      lcm ans (a / 2)) 1 as_ in\n    (m / lcm + 1) / 2\n  with Not_found -> 0\n\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 402, "cpu_time_ms": 36, "memory_kb": 5376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s313363951", "group_id": "codeNet:p02814", "input_text": "let () =\n    let rec gcd a b = if b = 0 then a else gcd b (a mod b) in\n    let lcm a b = a / gcd a b * b in\n    let main () =\n        let n, m = Scanf.scanf \"%d %d\" (fun n m -> n, m) in\n        let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun p -> p)) in\n        let rec loop i acc =\n            if acc > m then acc else\n            if i = n then acc else loop (i + 1) (lcm acc (a.(i) / 2))\n        in\n        let l = loop 1 (a.(0) / 2) in\n        (m / l + 1) / 2 |> Printf.printf \"%d\\n\"\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1578709826, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s313363951.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s313363951", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () =\n    let rec gcd a b = if b = 0 then a else gcd b (a mod b) in\n    let lcm a b = a / gcd a b * b in\n    let main () =\n        let n, m = Scanf.scanf \"%d %d\" (fun n m -> n, m) in\n        let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun p -> p)) in\n        let rec loop i acc =\n            if acc > m then acc else\n            if i = n then acc else loop (i + 1) (lcm acc (a.(i) / 2))\n        in\n        let l = loop 1 (a.(0) / 2) in\n        (m / l + 1) / 2 |> Printf.printf \"%d\\n\"\n    in\n    main ()", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 34, "memory_kb": 5248}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s235181324", "group_id": "codeNet:p02817", "input_text": "Scanf.scanf \"%s %s\" (fun a b ->  print_endline (b^a))", "language": "OCaml", "metadata": {"date": 1577667656, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s235181324.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s235181324", "user_id": "u342443598"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "Scanf.scanf \"%s %s\" (fun a b ->  print_endline (b^a))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\nThe lengths of S and T are between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\n\nOutput\n\nPrint the resulting string.\n\nSample Input 1\n\noder atc\n\nSample Output 1\n\natcoder\n\nWhen S = oder and T = atc, concatenating T and S in this order results in atcoder.\n\nSample Input 2\n\nhumu humu\n\nSample Output 2\n\nhumuhumu", "sample_input": "oder atc\n"}, "reference_outputs": ["atcoder\n"], "source_document_id": "p02817", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.\n\nConstraints\n\nS and T are strings consisting of lowercase English letters.\n\nThe lengths of S and T are between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\n\nOutput\n\nPrint the resulting string.\n\nSample Input 1\n\noder atc\n\nSample Output 1\n\natcoder\n\nWhen S = oder and T = atc, concatenating T and S in this order results in atcoder.\n\nSample Input 2\n\nhumu humu\n\nSample Output 2\n\nhumuhumu", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 53, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s712582524", "group_id": "codeNet:p02818", "input_text": "(* Vicfred\n * https://atcoder.jp/contests/abc149/tasks/abc149_b\n * implementation\n * *)\nScanf.scanf \"%d %d %d\\n\" (fun a b k ->\n    if k <= a then (a - k, b)\n    else if k <= a+b then (0, b - k + a)\n    else (0, 0)\n) |> fun (x, y) -> Printf.printf \"%d %d\\n\" x y\n\n", "language": "OCaml", "metadata": {"date": 1593647158, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s712582524.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s712582524", "user_id": "u737840172"}, "prompt_components": {"gold_output": "0 2\n", "input_to_evaluate": "(* Vicfred\n * https://atcoder.jp/contests/abc149/tasks/abc149_b\n * implementation\n * *)\nScanf.scanf \"%d %d %d\\n\" (fun a b k ->\n    if k <= a then (a - k, b)\n    else if k <= a+b then (0, b - k + a)\n    else (0, 0)\n) |> fun (x, y) -> Printf.printf \"%d %d\\n\" x y\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A cookies, and Aoki has B cookies.\nTakahashi will do the following action K times:\n\nIf Takahashi has one or more cookies, eat one of his cookies.\n\nOtherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.\n\nIf they both have no cookies, do nothing.\n\nIn the end, how many cookies will Takahashi and Aoki have, respectively?\n\nConstraints\n\n0 \\leq A \\leq 10^{12}\n\n0 \\leq B \\leq 10^{12}\n\n0 \\leq K \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the numbers of Takahashi's and Aoki's cookies after K actions.\n\nSample Input 1\n\n2 3 3\n\nSample Output 1\n\n0 2\n\nTakahashi will do the following:\n\nHe has two cookies, so he eats one of them.\n\nNow he has one cookie left, and he eats it.\n\nNow he has no cookies left, but Aoki has three, so Takahashi eats one of them.\n\nThus, in the end, Takahashi will have 0 cookies, and Aoki will have 2.\n\nSample Input 2\n\n500000000000 500000000000 1000000000000\n\nSample Output 2\n\n0 0\n\nWatch out for overflows.", "sample_input": "2 3 3\n"}, "reference_outputs": ["0 2\n"], "source_document_id": "p02818", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A cookies, and Aoki has B cookies.\nTakahashi will do the following action K times:\n\nIf Takahashi has one or more cookies, eat one of his cookies.\n\nOtherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.\n\nIf they both have no cookies, do nothing.\n\nIn the end, how many cookies will Takahashi and Aoki have, respectively?\n\nConstraints\n\n0 \\leq A \\leq 10^{12}\n\n0 \\leq B \\leq 10^{12}\n\n0 \\leq K \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the numbers of Takahashi's and Aoki's cookies after K actions.\n\nSample Input 1\n\n2 3 3\n\nSample Output 1\n\n0 2\n\nTakahashi will do the following:\n\nHe has two cookies, so he eats one of them.\n\nNow he has one cookie left, and he eats it.\n\nNow he has no cookies left, but Aoki has three, so Takahashi eats one of them.\n\nThus, in the end, Takahashi will have 0 cookies, and Aoki will have 2.\n\nSample Input 2\n\n500000000000 500000000000 1000000000000\n\nSample Output 2\n\n0 0\n\nWatch out for overflows.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 262, "cpu_time_ms": 9, "memory_kb": 3820}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s641665782", "group_id": "codeNet:p02818", "input_text": "let a, b, k = Scanf.sscanf (read_line()) \"%d %d %d\" (fun a b k ->\n  a, b, k\n)\n\nlet end_a = if a < k then 0 else a - k\nlet end_b = if end_a != 0 then b else if b < k - a then 0 else b - (k - a)\n\nlet _ = Printf.printf \"%d %d\\n\" end_a end_b\n", "language": "OCaml", "metadata": {"date": 1585709385, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s641665782.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s641665782", "user_id": "u511870776"}, "prompt_components": {"gold_output": "0 2\n", "input_to_evaluate": "let a, b, k = Scanf.sscanf (read_line()) \"%d %d %d\" (fun a b k ->\n  a, b, k\n)\n\nlet end_a = if a < k then 0 else a - k\nlet end_b = if end_a != 0 then b else if b < k - a then 0 else b - (k - a)\n\nlet _ = Printf.printf \"%d %d\\n\" end_a end_b\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A cookies, and Aoki has B cookies.\nTakahashi will do the following action K times:\n\nIf Takahashi has one or more cookies, eat one of his cookies.\n\nOtherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.\n\nIf they both have no cookies, do nothing.\n\nIn the end, how many cookies will Takahashi and Aoki have, respectively?\n\nConstraints\n\n0 \\leq A \\leq 10^{12}\n\n0 \\leq B \\leq 10^{12}\n\n0 \\leq K \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the numbers of Takahashi's and Aoki's cookies after K actions.\n\nSample Input 1\n\n2 3 3\n\nSample Output 1\n\n0 2\n\nTakahashi will do the following:\n\nHe has two cookies, so he eats one of them.\n\nNow he has one cookie left, and he eats it.\n\nNow he has no cookies left, but Aoki has three, so Takahashi eats one of them.\n\nThus, in the end, Takahashi will have 0 cookies, and Aoki will have 2.\n\nSample Input 2\n\n500000000000 500000000000 1000000000000\n\nSample Output 2\n\n0 0\n\nWatch out for overflows.", "sample_input": "2 3 3\n"}, "reference_outputs": ["0 2\n"], "source_document_id": "p02818", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A cookies, and Aoki has B cookies.\nTakahashi will do the following action K times:\n\nIf Takahashi has one or more cookies, eat one of his cookies.\n\nOtherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.\n\nIf they both have no cookies, do nothing.\n\nIn the end, how many cookies will Takahashi and Aoki have, respectively?\n\nConstraints\n\n0 \\leq A \\leq 10^{12}\n\n0 \\leq B \\leq 10^{12}\n\n0 \\leq K \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the numbers of Takahashi's and Aoki's cookies after K actions.\n\nSample Input 1\n\n2 3 3\n\nSample Output 1\n\n0 2\n\nTakahashi will do the following:\n\nHe has two cookies, so he eats one of them.\n\nNow he has one cookie left, and he eats it.\n\nNow he has no cookies left, but Aoki has three, so Takahashi eats one of them.\n\nThus, in the end, Takahashi will have 0 cookies, and Aoki will have 2.\n\nSample Input 2\n\n500000000000 500000000000 1000000000000\n\nSample Output 2\n\n0 0\n\nWatch out for overflows.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 238, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s681844159", "group_id": "codeNet:p02819", "input_text": "let rec fix f x = f (fix f) x\nlet isprime x =\n  fix (fun f d -> if d * d > x then true else x mod d <> 0 && f (d+1)) 2\n\nlet () =\n  Scanf.scanf \"%d\" @@ fun x ->\n  fix (fun f v -> if isprime v then v else f (v+1)) x\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1577683373, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s681844159.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s681844159", "user_id": "u798181098"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "let rec fix f x = f (fix f) x\nlet isprime x =\n  fix (fun f d -> if d * d > x then true else x mod d <> 0 && f (d+1)) 2\n\nlet () =\n  Scanf.scanf \"%d\" @@ fun x ->\n  fix (fun f v -> if isprime v then v else f (v+1)) x\n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nFind the minimum prime number greater than or equal to X.\n\nNotes\n\nA prime number is an integer greater than 1 that cannot be evenly divided by any positive integer except 1 and itself.\n\nFor example, 2, 3, and 5 are prime numbers, while 4 and 6 are not.\n\nConstraints\n\n2 \\le X \\le 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the minimum prime number greater than or equal to X.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n23\n\nThe minimum prime number greater than or equal to 20 is 23.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n2\n\nX itself can be a prime number.\n\nSample Input 3\n\n99992\n\nSample Output 3\n\n100003", "sample_input": "20\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02819", "source_text": "Score: 300 points\n\nProblem Statement\n\nFind the minimum prime number greater than or equal to X.\n\nNotes\n\nA prime number is an integer greater than 1 that cannot be evenly divided by any positive integer except 1 and itself.\n\nFor example, 2, 3, and 5 are prime numbers, while 4 and 6 are not.\n\nConstraints\n\n2 \\le X \\le 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the minimum prime number greater than or equal to X.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n23\n\nThe minimum prime number greater than or equal to 20 is 23.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n2\n\nX itself can be a prime number.\n\nSample Input 3\n\n99992\n\nSample Output 3\n\n100003", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 240, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s733243320", "group_id": "codeNet:p02820", "input_text": "let n, k, r, s, p = Scanf.scanf \" %d %d %d %d %d\" @@ fun a b c d e -> a, b, c, d, e\nlet ts = Array.init n @@ fun _ -> Scanf.scanf \" %c\" @@ fun c -> c\nlet us = Array.make n ' '\nlet ans = ref 0\nlet f = function 'r' -> 'p' | 's' -> 'r' | _ -> 's'\nlet g t u = List.(filter (fun x -> x <> t && x <> u) ['r'; 's'; 'p'] |> hd)\nlet h = function 'r' -> r | 's' -> s | _ -> p\nlet _ = Array.iteri (fun i t -> us.(i) <- if i - k >= 0 && us.(i - k) = f t then g t @@ if i + k < n then f ts.(i + k) else f t else (ans := !ans + h (f t); f t)) ts; Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1577776531, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s733243320.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s733243320", "user_id": "u732304692"}, "prompt_components": {"gold_output": "27\n", "input_to_evaluate": "let n, k, r, s, p = Scanf.scanf \" %d %d %d %d %d\" @@ fun a b c d e -> a, b, c, d, e\nlet ts = Array.init n @@ fun _ -> Scanf.scanf \" %c\" @@ fun c -> c\nlet us = Array.make n ' '\nlet ans = ref 0\nlet f = function 'r' -> 'p' | 's' -> 'r' | _ -> 's'\nlet g t u = List.(filter (fun x -> x <> t && x <> u) ['r'; 's'; 'p'] |> hd)\nlet h = function 'r' -> r | 's' -> s | _ -> p\nlet _ = Array.iteri (fun i t -> us.(i) <- if i - k >= 0 && us.(i - k) = f t then g t @@ if i + k < n then f ts.(i + k) else f t else (ans := !ans + h (f t); f t)) ts; Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 400 points\n\nProblem Statement\n\nAt an arcade, Takahashi is playing a game called RPS Battle, which is played as follows:\n\nThe player plays N rounds of Rock Paper Scissors against the machine. (See Notes for the description of Rock Paper Scissors. A draw also counts as a round.)\n\nEach time the player wins a round, depending on which hand he/she uses, he/she earns the following score (no points for a draw or a loss):\n\nR points for winning with Rock;\n\nS points for winning with Scissors;\n\nP points for winning with Paper.\n\nHowever, in the i-th round, the player cannot use the hand he/she used in the (i-K)-th round. (In the first K rounds, the player can use any hand.)\n\nBefore the start of the game, the machine decides the hand it will play in each round. With supernatural power, Takahashi managed to read all of those hands.\n\nThe information Takahashi obtained is given as a string T. If the i-th character of T (1 \\leq i \\leq N) is r, the machine will play Rock in the i-th round. Similarly, p and s stand for Paper and Scissors, respectively.\n\nWhat is the maximum total score earned in the game by adequately choosing the hand to play in each round?\n\nNotes\n\nIn this problem, Rock Paper Scissors can be thought of as a two-player game, in which each player simultaneously forms Rock, Paper, or Scissors with a hand.\n\nIf a player chooses Rock and the other chooses Scissors, the player choosing Rock wins;\n\nif a player chooses Scissors and the other chooses Paper, the player choosing Scissors wins;\n\nif a player chooses Paper and the other chooses Rock, the player choosing Paper wins;\n\nif both players play the same hand, it is a draw.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N-1\n\n1 \\leq R,S,P \\leq 10^4\n\nN,K,R,S, and P are all integers.\n\n|T| = N\n\nT consists of r, p, and s.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nR S P\nT\n\nOutput\n\nPrint the maximum total score earned in the game.\n\nSample Input 1\n\n5 2\n8 7 6\nrsrpr\n\nSample Output 1\n\n27\n\nThe machine will play {Rock, Scissors, Rock, Paper, Rock}.\n\nWe can, for example, play {Paper, Rock, Rock, Scissors, Paper} against it to earn 27 points.\nWe cannot earn more points, so the answer is 27.\n\nSample Input 2\n\n7 1\n100 10 1\nssssppr\n\nSample Output 2\n\n211\n\nSample Input 3\n\n30 5\n325 234 123\nrspsspspsrpspsppprpsprpssprpsr\n\nSample Output 3\n\n4996", "sample_input": "5 2\n8 7 6\nrsrpr\n"}, "reference_outputs": ["27\n"], "source_document_id": "p02820", "source_text": "Score : 400 points\n\nProblem Statement\n\nAt an arcade, Takahashi is playing a game called RPS Battle, which is played as follows:\n\nThe player plays N rounds of Rock Paper Scissors against the machine. (See Notes for the description of Rock Paper Scissors. A draw also counts as a round.)\n\nEach time the player wins a round, depending on which hand he/she uses, he/she earns the following score (no points for a draw or a loss):\n\nR points for winning with Rock;\n\nS points for winning with Scissors;\n\nP points for winning with Paper.\n\nHowever, in the i-th round, the player cannot use the hand he/she used in the (i-K)-th round. (In the first K rounds, the player can use any hand.)\n\nBefore the start of the game, the machine decides the hand it will play in each round. With supernatural power, Takahashi managed to read all of those hands.\n\nThe information Takahashi obtained is given as a string T. If the i-th character of T (1 \\leq i \\leq N) is r, the machine will play Rock in the i-th round. Similarly, p and s stand for Paper and Scissors, respectively.\n\nWhat is the maximum total score earned in the game by adequately choosing the hand to play in each round?\n\nNotes\n\nIn this problem, Rock Paper Scissors can be thought of as a two-player game, in which each player simultaneously forms Rock, Paper, or Scissors with a hand.\n\nIf a player chooses Rock and the other chooses Scissors, the player choosing Rock wins;\n\nif a player chooses Scissors and the other chooses Paper, the player choosing Scissors wins;\n\nif a player chooses Paper and the other chooses Rock, the player choosing Paper wins;\n\nif both players play the same hand, it is a draw.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N-1\n\n1 \\leq R,S,P \\leq 10^4\n\nN,K,R,S, and P are all integers.\n\n|T| = N\n\nT consists of r, p, and s.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nR S P\nT\n\nOutput\n\nPrint the maximum total score earned in the game.\n\nSample Input 1\n\n5 2\n8 7 6\nrsrpr\n\nSample Output 1\n\n27\n\nThe machine will play {Rock, Scissors, Rock, Paper, Rock}.\n\nWe can, for example, play {Paper, Rock, Rock, Scissors, Paper} against it to earn 27 points.\nWe cannot earn more points, so the answer is 27.\n\nSample Input 2\n\n7 1\n100 10 1\nssssppr\n\nSample Output 2\n\n211\n\nSample Input 3\n\n30 5\n325 234 123\nrspsspspsrpspsppprpsprpssprpsr\n\nSample Output 3\n\n4996", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 558, "cpu_time_ms": 16, "memory_kb": 6016}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s386363942", "group_id": "codeNet:p02820", "input_text": "let () = Scanf.scanf \"%d %d\\n%d %d %d\\n%s\" @@ fun n k r s p t ->\n  let dp =\n    Array.init (n + k) @@ fun _ ->\n      Array.make 3 0 in\n  for i = 0 to n - 1 do\n    dp.(i + k).(0) <-\n      max dp.(i).(1) dp.(i).(2)\n      + if t.[i] = 's' then r else 0;\n    dp.(i + k).(1) <-\n      max dp.(i).(0) dp.(i).(2)\n      + if t.[i] = 'p' then s else 0;\n    dp.(i + k).(2) <-\n      max dp.(i).(0) dp.(i).(1)\n      + if t.[i] = 'r' then p else 0;\n  done;\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left ( + ) 0 @@\n  Array.init k @@ fun i ->\n    Array.fold_left max min_int dp.(n + i)\n", "language": "OCaml", "metadata": {"date": 1577669497, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s386363942.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s386363942", "user_id": "u504158101"}, "prompt_components": {"gold_output": "27\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\\n%d %d %d\\n%s\" @@ fun n k r s p t ->\n  let dp =\n    Array.init (n + k) @@ fun _ ->\n      Array.make 3 0 in\n  for i = 0 to n - 1 do\n    dp.(i + k).(0) <-\n      max dp.(i).(1) dp.(i).(2)\n      + if t.[i] = 's' then r else 0;\n    dp.(i + k).(1) <-\n      max dp.(i).(0) dp.(i).(2)\n      + if t.[i] = 'p' then s else 0;\n    dp.(i + k).(2) <-\n      max dp.(i).(0) dp.(i).(1)\n      + if t.[i] = 'r' then p else 0;\n  done;\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left ( + ) 0 @@\n  Array.init k @@ fun i ->\n    Array.fold_left max min_int dp.(n + i)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nAt an arcade, Takahashi is playing a game called RPS Battle, which is played as follows:\n\nThe player plays N rounds of Rock Paper Scissors against the machine. (See Notes for the description of Rock Paper Scissors. A draw also counts as a round.)\n\nEach time the player wins a round, depending on which hand he/she uses, he/she earns the following score (no points for a draw or a loss):\n\nR points for winning with Rock;\n\nS points for winning with Scissors;\n\nP points for winning with Paper.\n\nHowever, in the i-th round, the player cannot use the hand he/she used in the (i-K)-th round. (In the first K rounds, the player can use any hand.)\n\nBefore the start of the game, the machine decides the hand it will play in each round. With supernatural power, Takahashi managed to read all of those hands.\n\nThe information Takahashi obtained is given as a string T. If the i-th character of T (1 \\leq i \\leq N) is r, the machine will play Rock in the i-th round. Similarly, p and s stand for Paper and Scissors, respectively.\n\nWhat is the maximum total score earned in the game by adequately choosing the hand to play in each round?\n\nNotes\n\nIn this problem, Rock Paper Scissors can be thought of as a two-player game, in which each player simultaneously forms Rock, Paper, or Scissors with a hand.\n\nIf a player chooses Rock and the other chooses Scissors, the player choosing Rock wins;\n\nif a player chooses Scissors and the other chooses Paper, the player choosing Scissors wins;\n\nif a player chooses Paper and the other chooses Rock, the player choosing Paper wins;\n\nif both players play the same hand, it is a draw.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N-1\n\n1 \\leq R,S,P \\leq 10^4\n\nN,K,R,S, and P are all integers.\n\n|T| = N\n\nT consists of r, p, and s.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nR S P\nT\n\nOutput\n\nPrint the maximum total score earned in the game.\n\nSample Input 1\n\n5 2\n8 7 6\nrsrpr\n\nSample Output 1\n\n27\n\nThe machine will play {Rock, Scissors, Rock, Paper, Rock}.\n\nWe can, for example, play {Paper, Rock, Rock, Scissors, Paper} against it to earn 27 points.\nWe cannot earn more points, so the answer is 27.\n\nSample Input 2\n\n7 1\n100 10 1\nssssppr\n\nSample Output 2\n\n211\n\nSample Input 3\n\n30 5\n325 234 123\nrspsspspsrpspsppprpsprpssprpsr\n\nSample Output 3\n\n4996", "sample_input": "5 2\n8 7 6\nrsrpr\n"}, "reference_outputs": ["27\n"], "source_document_id": "p02820", "source_text": "Score : 400 points\n\nProblem Statement\n\nAt an arcade, Takahashi is playing a game called RPS Battle, which is played as follows:\n\nThe player plays N rounds of Rock Paper Scissors against the machine. (See Notes for the description of Rock Paper Scissors. A draw also counts as a round.)\n\nEach time the player wins a round, depending on which hand he/she uses, he/she earns the following score (no points for a draw or a loss):\n\nR points for winning with Rock;\n\nS points for winning with Scissors;\n\nP points for winning with Paper.\n\nHowever, in the i-th round, the player cannot use the hand he/she used in the (i-K)-th round. (In the first K rounds, the player can use any hand.)\n\nBefore the start of the game, the machine decides the hand it will play in each round. With supernatural power, Takahashi managed to read all of those hands.\n\nThe information Takahashi obtained is given as a string T. If the i-th character of T (1 \\leq i \\leq N) is r, the machine will play Rock in the i-th round. Similarly, p and s stand for Paper and Scissors, respectively.\n\nWhat is the maximum total score earned in the game by adequately choosing the hand to play in each round?\n\nNotes\n\nIn this problem, Rock Paper Scissors can be thought of as a two-player game, in which each player simultaneously forms Rock, Paper, or Scissors with a hand.\n\nIf a player chooses Rock and the other chooses Scissors, the player choosing Rock wins;\n\nif a player chooses Scissors and the other chooses Paper, the player choosing Scissors wins;\n\nif a player chooses Paper and the other chooses Rock, the player choosing Paper wins;\n\nif both players play the same hand, it is a draw.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N-1\n\n1 \\leq R,S,P \\leq 10^4\n\nN,K,R,S, and P are all integers.\n\n|T| = N\n\nT consists of r, p, and s.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nR S P\nT\n\nOutput\n\nPrint the maximum total score earned in the game.\n\nSample Input 1\n\n5 2\n8 7 6\nrsrpr\n\nSample Output 1\n\n27\n\nThe machine will play {Rock, Scissors, Rock, Paper, Rock}.\n\nWe can, for example, play {Paper, Rock, Rock, Scissors, Paper} against it to earn 27 points.\nWe cannot earn more points, so the answer is 27.\n\nSample Input 2\n\n7 1\n100 10 1\nssssppr\n\nSample Output 2\n\n211\n\nSample Input 3\n\n30 5\n325 234 123\nrspsspspsrpspsppprpsprpssprpsr\n\nSample Output 3\n\n4996", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 568, "cpu_time_ms": 26, "memory_kb": 10240}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s679514870", "group_id": "codeNet:p02824", "input_text": "Scanf.scanf \"%d %d %d %d\" (fun n m v p ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n    Array.sort (fun a b -> compare b a) a;\n\n    let border = a.(p - 1) in\n\n    let bordersum =\n        let rec loop i acc =\n            if i = n then acc else\n                loop (i + 1) (acc + border - a.(i))\n        in\n        loop p 0\n    in\n\n    let rec loop i acc =\n        if i = n then acc else\n            if a.(i) + m < border then acc else\n                let nb = bordersum - (border - a.(i)) in\n                if nb + (a.(i) + m - border) * (n - p) <= (v - p) * m then acc\n                else loop (i + 1) (acc + 1)\n    in\n    loop p p |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1586728471, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02824.html", "problem_id": "p02824", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02824/input.txt", "sample_output_relpath": "derived/input_output/data/p02824/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02824/OCaml/s679514870.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s679514870", "user_id": "u342443598"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d %d\" (fun n m v p ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n    Array.sort (fun a b -> compare b a) a;\n\n    let border = a.(p - 1) in\n\n    let bordersum =\n        let rec loop i acc =\n            if i = n then acc else\n                loop (i + 1) (acc + border - a.(i))\n        in\n        loop p 0\n    in\n\n    let rec loop i acc =\n        if i = n then acc else\n            if a.(i) + m < border then acc else\n                let nb = bordersum - (border - a.(i)) in\n                if nb + (a.(i) + m - border) * (n - p) <= (v - p) * m then acc\n                else loop (i + 1) (acc + 1)\n    in\n    loop p p |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 700 points\n\nProblem Statement\n\nN problems are proposed for an upcoming contest. Problem i has an initial integer score of A_i points.\n\nM judges are about to vote for problems they like. Each judge will choose exactly V problems, independently from the other judges,\nand increase the score of each chosen problem by 1.\n\nAfter all M judges cast their vote, the problems will be sorted in non-increasing order of score, and the first P problems will be chosen for the problemset.\nProblems with the same score can be ordered arbitrarily, this order is decided by the chief judge.\n\nHow many problems out of the given N have a chance to be chosen for the problemset?\n\nConstraints\n\n2 \\le N \\le 10^5\n\n1 \\le M \\le 10^9\n\n1 \\le V \\le N - 1\n\n1 \\le P \\le N - 1\n\n0 \\le A_i \\le 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M V P\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of problems that have a chance to be chosen for the problemset.\n\nSample Input 1\n\n6 1 2 2\n2 1 1 3 0 2\n\nSample Output 1\n\n5\n\nIf the only judge votes for problems 2 and 5, the scores will be 2 2 1 3 1 2.\nThe problemset will consist of problem 4 and one of problems 1, 2, or 6.\n\nIf the only judge votes for problems 3 and 4, the scores will be 2 1 2 4 0 2.\nThe problemset will consist of problem 4 and one of problems 1, 3, or 6.\n\nThus, problems 1, 2, 3, 4, and 6 have a chance to be chosen for the problemset. On the contrary, there is no way for problem 5 to be chosen.\n\nSample Input 2\n\n6 1 5 2\n2 1 1 3 0 2\n\nSample Output 2\n\n3\n\nOnly problems 1, 4, and 6 have a chance to be chosen.\n\nSample Input 3\n\n10 4 8 5\n7 2 3 6 1 6 5 4 6 5\n\nSample Output 3\n\n8", "sample_input": "6 1 2 2\n2 1 1 3 0 2\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02824", "source_text": "Score : 700 points\n\nProblem Statement\n\nN problems are proposed for an upcoming contest. Problem i has an initial integer score of A_i points.\n\nM judges are about to vote for problems they like. Each judge will choose exactly V problems, independently from the other judges,\nand increase the score of each chosen problem by 1.\n\nAfter all M judges cast their vote, the problems will be sorted in non-increasing order of score, and the first P problems will be chosen for the problemset.\nProblems with the same score can be ordered arbitrarily, this order is decided by the chief judge.\n\nHow many problems out of the given N have a chance to be chosen for the problemset?\n\nConstraints\n\n2 \\le N \\le 10^5\n\n1 \\le M \\le 10^9\n\n1 \\le V \\le N - 1\n\n1 \\le P \\le N - 1\n\n0 \\le A_i \\le 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M V P\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of problems that have a chance to be chosen for the problemset.\n\nSample Input 1\n\n6 1 2 2\n2 1 1 3 0 2\n\nSample Output 1\n\n5\n\nIf the only judge votes for problems 2 and 5, the scores will be 2 2 1 3 1 2.\nThe problemset will consist of problem 4 and one of problems 1, 2, or 6.\n\nIf the only judge votes for problems 3 and 4, the scores will be 2 1 2 4 0 2.\nThe problemset will consist of problem 4 and one of problems 1, 3, or 6.\n\nThus, problems 1, 2, 3, 4, and 6 have a chance to be chosen for the problemset. On the contrary, there is no way for problem 5 to be chosen.\n\nSample Input 2\n\n6 1 5 2\n2 1 1 3 0 2\n\nSample Output 2\n\n3\n\nOnly problems 1, 4, and 6 have a chance to be chosen.\n\nSample Input 3\n\n10 4 8 5\n7 2 3 6 1 6 5 4 6 5\n\nSample Output 3\n\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 688, "cpu_time_ms": 70, "memory_kb": 5504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s295216662", "group_id": "codeNet:p02824", "input_text": "let () = Scanf.scanf \"%d %d %d %d\\n\" @@ fun n m v p ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  Array.sort (fun a a' -> compare a' a) as_;\n  let acc = Array.make (n + 1) 0 in\n  for i = 0 to n - 1 do\n    acc.(i + 1) <- as_.(i) + acc.(i)\n  done;\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left ( + ) 0 @@\n  Array.init n @@ fun i ->\n    if\n      as_.(p - 1) <= as_.(i) ||\n      acc.(i) - acc.(p - 1)\n        <= min (i - p + 1) (n - v) * m + as_.(i) * (i - p + 1)\n    then 1\n    else 0\n", "language": "OCaml", "metadata": {"date": 1577591382, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02824.html", "problem_id": "p02824", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02824/input.txt", "sample_output_relpath": "derived/input_output/data/p02824/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02824/OCaml/s295216662.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s295216662", "user_id": "u504158101"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d %d\\n\" @@ fun n m v p ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  Array.sort (fun a a' -> compare a' a) as_;\n  let acc = Array.make (n + 1) 0 in\n  for i = 0 to n - 1 do\n    acc.(i + 1) <- as_.(i) + acc.(i)\n  done;\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left ( + ) 0 @@\n  Array.init n @@ fun i ->\n    if\n      as_.(p - 1) <= as_.(i) ||\n      acc.(i) - acc.(p - 1)\n        <= min (i - p + 1) (n - v) * m + as_.(i) * (i - p + 1)\n    then 1\n    else 0\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nN problems are proposed for an upcoming contest. Problem i has an initial integer score of A_i points.\n\nM judges are about to vote for problems they like. Each judge will choose exactly V problems, independently from the other judges,\nand increase the score of each chosen problem by 1.\n\nAfter all M judges cast their vote, the problems will be sorted in non-increasing order of score, and the first P problems will be chosen for the problemset.\nProblems with the same score can be ordered arbitrarily, this order is decided by the chief judge.\n\nHow many problems out of the given N have a chance to be chosen for the problemset?\n\nConstraints\n\n2 \\le N \\le 10^5\n\n1 \\le M \\le 10^9\n\n1 \\le V \\le N - 1\n\n1 \\le P \\le N - 1\n\n0 \\le A_i \\le 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M V P\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of problems that have a chance to be chosen for the problemset.\n\nSample Input 1\n\n6 1 2 2\n2 1 1 3 0 2\n\nSample Output 1\n\n5\n\nIf the only judge votes for problems 2 and 5, the scores will be 2 2 1 3 1 2.\nThe problemset will consist of problem 4 and one of problems 1, 2, or 6.\n\nIf the only judge votes for problems 3 and 4, the scores will be 2 1 2 4 0 2.\nThe problemset will consist of problem 4 and one of problems 1, 3, or 6.\n\nThus, problems 1, 2, 3, 4, and 6 have a chance to be chosen for the problemset. On the contrary, there is no way for problem 5 to be chosen.\n\nSample Input 2\n\n6 1 5 2\n2 1 1 3 0 2\n\nSample Output 2\n\n3\n\nOnly problems 1, 4, and 6 have a chance to be chosen.\n\nSample Input 3\n\n10 4 8 5\n7 2 3 6 1 6 5 4 6 5\n\nSample Output 3\n\n8", "sample_input": "6 1 2 2\n2 1 1 3 0 2\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02824", "source_text": "Score : 700 points\n\nProblem Statement\n\nN problems are proposed for an upcoming contest. Problem i has an initial integer score of A_i points.\n\nM judges are about to vote for problems they like. Each judge will choose exactly V problems, independently from the other judges,\nand increase the score of each chosen problem by 1.\n\nAfter all M judges cast their vote, the problems will be sorted in non-increasing order of score, and the first P problems will be chosen for the problemset.\nProblems with the same score can be ordered arbitrarily, this order is decided by the chief judge.\n\nHow many problems out of the given N have a chance to be chosen for the problemset?\n\nConstraints\n\n2 \\le N \\le 10^5\n\n1 \\le M \\le 10^9\n\n1 \\le V \\le N - 1\n\n1 \\le P \\le N - 1\n\n0 \\le A_i \\le 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M V P\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of problems that have a chance to be chosen for the problemset.\n\nSample Input 1\n\n6 1 2 2\n2 1 1 3 0 2\n\nSample Output 1\n\n5\n\nIf the only judge votes for problems 2 and 5, the scores will be 2 2 1 3 1 2.\nThe problemset will consist of problem 4 and one of problems 1, 2, or 6.\n\nIf the only judge votes for problems 3 and 4, the scores will be 2 1 2 4 0 2.\nThe problemset will consist of problem 4 and one of problems 1, 3, or 6.\n\nThus, problems 1, 2, 3, 4, and 6 have a chance to be chosen for the problemset. On the contrary, there is no way for problem 5 to be chosen.\n\nSample Input 2\n\n6 1 5 2\n2 1 1 3 0 2\n\nSample Output 2\n\n3\n\nOnly problems 1, 4, and 6 have a chance to be chosen.\n\nSample Input 3\n\n10 4 8 5\n7 2 3 6 1 6 5 4 6 5\n\nSample Output 3\n\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 511, "cpu_time_ms": 71, "memory_kb": 6400}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s243535743", "group_id": "codeNet:p02824", "input_text": "let () = Scanf.scanf \"%d %d %d %d\\n\" @@ fun n m v p ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  Array.sort (fun a a' -> compare a' a) as_;\n  Printf.printf \"%d\\n\" @@\n  snd @@\n  Array.fold_left (fun ((oblig, c), n) a ->\n    ( (oblig + a, c + 1),\n      n + if as_.(p - 1) <= a || oblig <= (n - v) * m + a * c then 1 else 0 ))\n  ((Array.fold_left ( - ) 0 (Array.sub as_ 0 (p - 1)), 0), 0) as_\n", "language": "OCaml", "metadata": {"date": 1577588709, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02824.html", "problem_id": "p02824", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02824/input.txt", "sample_output_relpath": "derived/input_output/data/p02824/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02824/OCaml/s243535743.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s243535743", "user_id": "u504158101"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d %d\\n\" @@ fun n m v p ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  Array.sort (fun a a' -> compare a' a) as_;\n  Printf.printf \"%d\\n\" @@\n  snd @@\n  Array.fold_left (fun ((oblig, c), n) a ->\n    ( (oblig + a, c + 1),\n      n + if as_.(p - 1) <= a || oblig <= (n - v) * m + a * c then 1 else 0 ))\n  ((Array.fold_left ( - ) 0 (Array.sub as_ 0 (p - 1)), 0), 0) as_\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nN problems are proposed for an upcoming contest. Problem i has an initial integer score of A_i points.\n\nM judges are about to vote for problems they like. Each judge will choose exactly V problems, independently from the other judges,\nand increase the score of each chosen problem by 1.\n\nAfter all M judges cast their vote, the problems will be sorted in non-increasing order of score, and the first P problems will be chosen for the problemset.\nProblems with the same score can be ordered arbitrarily, this order is decided by the chief judge.\n\nHow many problems out of the given N have a chance to be chosen for the problemset?\n\nConstraints\n\n2 \\le N \\le 10^5\n\n1 \\le M \\le 10^9\n\n1 \\le V \\le N - 1\n\n1 \\le P \\le N - 1\n\n0 \\le A_i \\le 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M V P\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of problems that have a chance to be chosen for the problemset.\n\nSample Input 1\n\n6 1 2 2\n2 1 1 3 0 2\n\nSample Output 1\n\n5\n\nIf the only judge votes for problems 2 and 5, the scores will be 2 2 1 3 1 2.\nThe problemset will consist of problem 4 and one of problems 1, 2, or 6.\n\nIf the only judge votes for problems 3 and 4, the scores will be 2 1 2 4 0 2.\nThe problemset will consist of problem 4 and one of problems 1, 3, or 6.\n\nThus, problems 1, 2, 3, 4, and 6 have a chance to be chosen for the problemset. On the contrary, there is no way for problem 5 to be chosen.\n\nSample Input 2\n\n6 1 5 2\n2 1 1 3 0 2\n\nSample Output 2\n\n3\n\nOnly problems 1, 4, and 6 have a chance to be chosen.\n\nSample Input 3\n\n10 4 8 5\n7 2 3 6 1 6 5 4 6 5\n\nSample Output 3\n\n8", "sample_input": "6 1 2 2\n2 1 1 3 0 2\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02824", "source_text": "Score : 700 points\n\nProblem Statement\n\nN problems are proposed for an upcoming contest. Problem i has an initial integer score of A_i points.\n\nM judges are about to vote for problems they like. Each judge will choose exactly V problems, independently from the other judges,\nand increase the score of each chosen problem by 1.\n\nAfter all M judges cast their vote, the problems will be sorted in non-increasing order of score, and the first P problems will be chosen for the problemset.\nProblems with the same score can be ordered arbitrarily, this order is decided by the chief judge.\n\nHow many problems out of the given N have a chance to be chosen for the problemset?\n\nConstraints\n\n2 \\le N \\le 10^5\n\n1 \\le M \\le 10^9\n\n1 \\le V \\le N - 1\n\n1 \\le P \\le N - 1\n\n0 \\le A_i \\le 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M V P\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of problems that have a chance to be chosen for the problemset.\n\nSample Input 1\n\n6 1 2 2\n2 1 1 3 0 2\n\nSample Output 1\n\n5\n\nIf the only judge votes for problems 2 and 5, the scores will be 2 2 1 3 1 2.\nThe problemset will consist of problem 4 and one of problems 1, 2, or 6.\n\nIf the only judge votes for problems 3 and 4, the scores will be 2 1 2 4 0 2.\nThe problemset will consist of problem 4 and one of problems 1, 3, or 6.\n\nThus, problems 1, 2, 3, 4, and 6 have a chance to be chosen for the problemset. On the contrary, there is no way for problem 5 to be chosen.\n\nSample Input 2\n\n6 1 5 2\n2 1 1 3 0 2\n\nSample Output 2\n\n3\n\nOnly problems 1, 4, and 6 have a chance to be chosen.\n\nSample Input 3\n\n10 4 8 5\n7 2 3 6 1 6 5 4 6 5\n\nSample Output 3\n\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 422, "cpu_time_ms": 69, "memory_kb": 5760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s435151263", "group_id": "codeNet:p02829", "input_text": "Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d %d %d\" (fun a b c -> 6-a-b)", "language": "OCaml", "metadata": {"date": 1577072658, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s435151263.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s435151263", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d %d %d\" (fun a b c -> 6-a-b)", "problem_context": "Score: 100 points\n\nProblem Statement\n\nTakahashi is solving quizzes. He has easily solved all but the last one.\n\nThe last quiz has three choices: 1, 2, and 3.\n\nWith his supernatural power, Takahashi has found out that the choices A and B are both wrong.\n\nPrint the correct choice for this problem.\n\nConstraints\n\nEach of the numbers A and B is 1, 2, or 3.\n\nA and B are different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\n\nOutput\n\nPrint the correct choice.\n\nSample Input 1\n\n3\n1\n\nSample Output 1\n\n2\n\nWhen we know 3 and 1 are both wrong, the correct choice is 2.\n\nSample Input 2\n\n1\n2\n\nSample Output 2\n\n3", "sample_input": "3\n1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02829", "source_text": "Score: 100 points\n\nProblem Statement\n\nTakahashi is solving quizzes. He has easily solved all but the last one.\n\nThe last quiz has three choices: 1, 2, and 3.\n\nWith his supernatural power, Takahashi has found out that the choices A and B are both wrong.\n\nPrint the correct choice for this problem.\n\nConstraints\n\nEach of the numbers A and B is 1, 2, or 3.\n\nA and B are different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\n\nOutput\n\nPrint the correct choice.\n\nSample Input 1\n\n3\n1\n\nSample Output 1\n\n2\n\nWhen we know 3 and 1 are both wrong, the correct choice is 2.\n\nSample Input 2\n\n1\n2\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 67, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s029018178", "group_id": "codeNet:p02829", "input_text": "let () = Scanf.scanf \"%d\\n%d\" @@ fun a b ->\n  Printf.printf \"%d\\n\" @@\n  List.find (fun x -> x <> a && x <> b) [1; 2; 3]\n", "language": "OCaml", "metadata": {"date": 1577072622, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s029018178.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s029018178", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n%d\" @@ fun a b ->\n  Printf.printf \"%d\\n\" @@\n  List.find (fun x -> x <> a && x <> b) [1; 2; 3]\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 120, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s131052718", "group_id": "codeNet:p02830", "input_text": "let () =\n  let n, s, t = Scanf.scanf \"%d\\n%s %s\\n\" @@ fun a b c -> a, b, c in\n  let ans = Array.make (n*2) 'x' in\n  for i = 0 to n-1 do\n    ans.(2*i) <- s.[i]; ans.(2*i+1) <- t.[i];\n  done;\n  print_endline (Array.fold_left (fun s a -> s ^ Char.escaped a) \"\" ans)", "language": "OCaml", "metadata": {"date": 1589912725, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s131052718.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s131052718", "user_id": "u307426615"}, "prompt_components": {"gold_output": "icpc\n", "input_to_evaluate": "let () =\n  let n, s, t = Scanf.scanf \"%d\\n%s %s\\n\" @@ fun a b c -> a, b, c in\n  let ans = Array.make (n*2) 'x' in\n  for i = 0 to n-1 do\n    ans.(2*i) <- s.[i]; ans.(2*i+1) <- t.[i];\n  done;\n  print_endline (Array.fold_left (fun s a -> s ^ Char.escaped a) \"\" ans)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are strings s and t of length N each, both consisting of lowercase English letters.\n\nLet us form a new string by alternating the characters of S and the characters of T, as follows: the first character of S, the first character of T, the second character of S, the second character of T, ..., the N-th character of S, the N-th character of T. Print this new string.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n|S| = |T| = N\n\nS and T are strings consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS T\n\nOutput\n\nPrint the string formed.\n\nSample Input 1\n\n2\nip cc\n\nSample Output 1\n\nicpc\n\nSample Input 2\n\n8\nhmhmnknk uuuuuuuu\n\nSample Output 2\n\nhumuhumunukunuku\n\nSample Input 3\n\n5\naaaaa aaaaa\n\nSample Output 3\n\naaaaaaaaaa", "sample_input": "2\nip cc\n"}, "reference_outputs": ["icpc\n"], "source_document_id": "p02830", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are strings s and t of length N each, both consisting of lowercase English letters.\n\nLet us form a new string by alternating the characters of S and the characters of T, as follows: the first character of S, the first character of T, the second character of S, the second character of T, ..., the N-th character of S, the N-th character of T. Print this new string.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n|S| = |T| = N\n\nS and T are strings consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS T\n\nOutput\n\nPrint the string formed.\n\nSample Input 1\n\n2\nip cc\n\nSample Output 1\n\nicpc\n\nSample Input 2\n\n8\nhmhmnknk uuuuuuuu\n\nSample Output 2\n\nhumuhumunukunuku\n\nSample Input 3\n\n5\naaaaa aaaaa\n\nSample Output 3\n\naaaaaaaaaa", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 262, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s284140387", "group_id": "codeNet:p02831", "input_text": "let (a, b) = Scanf.scanf \"%d %d\\n\" @@ fun a b -> (a, b)\n\nlet rec gcd = function\n  | (x, 0) -> x\n  | (x, y) -> gcd (y, x mod y)\n\nlet lcm (x, y) = x * (y / gcd (x, y))\n\nlet () = print_int (lcm (a, b))", "language": "OCaml", "metadata": {"date": 1588216203, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s284140387.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s284140387", "user_id": "u811309788"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let (a, b) = Scanf.scanf \"%d %d\\n\" @@ fun a b -> (a, b)\n\nlet rec gcd = function\n  | (x, 0) -> x\n  | (x, y) -> gcd (y, x mod y)\n\nlet lcm (x, y) = x * (y / gcd (x, y))\n\nlet () = print_int (lcm (a, b))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi is organizing a party.\n\nAt the party, each guest will receive one or more snack pieces.\n\nTakahashi predicts that the number of guests at this party will be A or B.\n\nFind the minimum number of pieces that can be evenly distributed to the guests in both of the cases predicted.\n\nWe assume that a piece cannot be divided and distributed to multiple guests.\n\nConstraints\n\n1 \\leq A, B \\leq 10^5\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of pieces that can be evenly distributed to the guests in both of the cases with A guests and B guests.\n\nSample Input 1\n\n2 3\n\nSample Output 1\n\n6\n\nWhen we have six snack pieces, each guest can take three pieces if we have two guests, and each guest can take two if we have three guests.\n\nSample Input 2\n\n123 456\n\nSample Output 2\n\n18696\n\nSample Input 3\n\n100000 99999\n\nSample Output 3\n\n9999900000", "sample_input": "2 3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02831", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi is organizing a party.\n\nAt the party, each guest will receive one or more snack pieces.\n\nTakahashi predicts that the number of guests at this party will be A or B.\n\nFind the minimum number of pieces that can be evenly distributed to the guests in both of the cases predicted.\n\nWe assume that a piece cannot be divided and distributed to multiple guests.\n\nConstraints\n\n1 \\leq A, B \\leq 10^5\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of pieces that can be evenly distributed to the guests in both of the cases with A guests and B guests.\n\nSample Input 1\n\n2 3\n\nSample Output 1\n\n6\n\nWhen we have six snack pieces, each guest can take three pieces if we have two guests, and each guest can take two if we have three guests.\n\nSample Input 2\n\n123 456\n\nSample Output 2\n\n18696\n\nSample Input 3\n\n100000 99999\n\nSample Output 3\n\n9999900000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 198, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s121509617", "group_id": "codeNet:p02831", "input_text": "let rec gcd n m =\n  if m = 0 then n\n  else gcd m (n mod m)\n\nlet lcm n m = n / gcd n m * m\n\nlet () = Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d %d\" lcm\n", "language": "OCaml", "metadata": {"date": 1577072514, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s121509617.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s121509617", "user_id": "u504158101"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let rec gcd n m =\n  if m = 0 then n\n  else gcd m (n mod m)\n\nlet lcm n m = n / gcd n m * m\n\nlet () = Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d %d\" lcm\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi is organizing a party.\n\nAt the party, each guest will receive one or more snack pieces.\n\nTakahashi predicts that the number of guests at this party will be A or B.\n\nFind the minimum number of pieces that can be evenly distributed to the guests in both of the cases predicted.\n\nWe assume that a piece cannot be divided and distributed to multiple guests.\n\nConstraints\n\n1 \\leq A, B \\leq 10^5\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of pieces that can be evenly distributed to the guests in both of the cases with A guests and B guests.\n\nSample Input 1\n\n2 3\n\nSample Output 1\n\n6\n\nWhen we have six snack pieces, each guest can take three pieces if we have two guests, and each guest can take two if we have three guests.\n\nSample Input 2\n\n123 456\n\nSample Output 2\n\n18696\n\nSample Input 3\n\n100000 99999\n\nSample Output 3\n\n9999900000", "sample_input": "2 3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02831", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi is organizing a party.\n\nAt the party, each guest will receive one or more snack pieces.\n\nTakahashi predicts that the number of guests at this party will be A or B.\n\nFind the minimum number of pieces that can be evenly distributed to the guests in both of the cases predicted.\n\nWe assume that a piece cannot be divided and distributed to multiple guests.\n\nConstraints\n\n1 \\leq A, B \\leq 10^5\n\nA \\neq B\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of pieces that can be evenly distributed to the guests in both of the cases with A guests and B guests.\n\nSample Input 1\n\n2 3\n\nSample Output 1\n\n6\n\nWhen we have six snack pieces, each guest can take three pieces if we have two guests, and each guest can take two if we have three guests.\n\nSample Input 2\n\n123 456\n\nSample Output 2\n\n18696\n\nSample Input 3\n\n100000 99999\n\nSample Output 3\n\n9999900000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 148, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s600734022", "group_id": "codeNet:p02832", "input_text": "let n = read_int ()\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet k = Array.fold_left (fun c a -> if a = c then c + 1 else c) 1 a_s - 1\nlet _ = Printf.printf \"%d\\n\" @@ if k = 0 then -1 else n - k", "language": "OCaml", "metadata": {"date": 1577163646, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s600734022.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s600734022", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let n = read_int ()\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet k = Array.fold_left (fun c a -> if a = c then c + 1 else c) 1 a_s - 1\nlet _ = Printf.printf \"%d\\n\" @@ if k = 0 then -1 else n - k", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N bricks arranged in a row from left to right.\n\nThe i-th brick from the left (1 \\leq i \\leq N) has an integer a_i written on it.\n\nAmong them, you can break at most N-1 bricks of your choice.\n\nLet us say there are K bricks remaining. Snuke will be satisfied if, for each integer i (1 \\leq i \\leq K), the i-th of those brick from the left has the integer i written on it.\n\nFind the minimum number of bricks you need to break to satisfy Snuke's desire. If his desire is unsatisfiable, print -1 instead.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 200000\n\n1 \\leq a_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum number of bricks that need to be broken to satisfy Snuke's desire, or print -1 if his desire is unsatisfiable.\n\nSample Input 1\n\n3\n2 1 2\n\nSample Output 1\n\n1\n\nIf we break the leftmost brick, the remaining bricks have integers 1 and 2 written on them from left to right, in which case Snuke will be satisfied.\n\nSample Input 2\n\n3\n2 2 2\n\nSample Output 2\n\n-1\n\nIn this case, there is no way to break some of the bricks to satisfy Snuke's desire.\n\nSample Input 3\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 3\n\n7\n\nSample Input 4\n\n1\n1\n\nSample Output 4\n\n0\n\nThere may be no need to break the bricks at all.", "sample_input": "3\n2 1 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02832", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N bricks arranged in a row from left to right.\n\nThe i-th brick from the left (1 \\leq i \\leq N) has an integer a_i written on it.\n\nAmong them, you can break at most N-1 bricks of your choice.\n\nLet us say there are K bricks remaining. Snuke will be satisfied if, for each integer i (1 \\leq i \\leq K), the i-th of those brick from the left has the integer i written on it.\n\nFind the minimum number of bricks you need to break to satisfy Snuke's desire. If his desire is unsatisfiable, print -1 instead.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 200000\n\n1 \\leq a_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum number of bricks that need to be broken to satisfy Snuke's desire, or print -1 if his desire is unsatisfiable.\n\nSample Input 1\n\n3\n2 1 2\n\nSample Output 1\n\n1\n\nIf we break the leftmost brick, the remaining bricks have integers 1 and 2 written on them from left to right, in which case Snuke will be satisfied.\n\nSample Input 2\n\n3\n2 2 2\n\nSample Output 2\n\n-1\n\nIn this case, there is no way to break some of the bricks to satisfy Snuke's desire.\n\nSample Input 3\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 3\n\n7\n\nSample Input 4\n\n1\n1\n\nSample Output 4\n\n0\n\nThere may be no need to break the bricks at all.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 212, "cpu_time_ms": 56, "memory_kb": 6016}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s507088483", "group_id": "codeNet:p02835", "input_text": "let blackjack a1 a2 a3 =\n  if a1 + a2 + a3 <= 21 then \"win\" else \"bust\"\n\nlet a1, a2, a3 =\n  Scanf.sscanf (read_line ()) \"%d %d %d\" (fun a1 a2 a3 -> (a1, a2, a3))\nlet ans = blackjack a1 a2 a3\nlet () = print_endline ans\n", "language": "OCaml", "metadata": {"date": 1595545544, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s507088483.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s507088483", "user_id": "u272377260"}, "prompt_components": {"gold_output": "win\n", "input_to_evaluate": "let blackjack a1 a2 a3 =\n  if a1 + a2 + a3 <= 21 then \"win\" else \"bust\"\n\nlet a1, a2, a3 =\n  Scanf.sscanf (read_line ()) \"%d %d %d\" (fun a1 a2 a3 -> (a1, a2, a3))\nlet ans = blackjack a1 a2 a3\nlet () = print_endline ans\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven are three integers A_1, A_2, and A_3.\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nConstraints\n\n1 \\leq A_i \\leq 13 \\ \\ (i=1,2,3)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nSample Input 1\n\n5 7 9\n\nSample Output 1\n\nwin\n\n5+7+9=21, so print win.\n\nSample Input 2\n\n13 7 2\n\nSample Output 2\n\nbust\n\n13+7+2=22, so print bust.", "sample_input": "5 7 9\n"}, "reference_outputs": ["win\n"], "source_document_id": "p02835", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven are three integers A_1, A_2, and A_3.\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nConstraints\n\n1 \\leq A_i \\leq 13 \\ \\ (i=1,2,3)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nSample Input 1\n\n5 7 9\n\nSample Output 1\n\nwin\n\n5+7+9=21, so print win.\n\nSample Input 2\n\n13 7 2\n\nSample Output 2\n\nbust\n\n13+7+2=22, so print bust.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 218, "cpu_time_ms": 7, "memory_kb": 3724}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s084598281", "group_id": "codeNet:p02837", "input_text": "open Batteries\nlet rec print_list lst=\n  match lst with\n  | [] -> Printf.printf \"\\n\"\n  | first :: rest -> Printf.printf \"%b \" first ; print_list rest\n\nlet count_list lst target =\n  let rec loop l =\n    match l with\n    | [] -> 0\n    | first :: rest -> if first = target then 1 + loop rest else loop rest\n  in loop lst\n\n\n\n(* bitの数字の2真数の時の右からn番目の数字が0か1か *)\nlet is_bit_one bit n = if bit land (1 lsl n) = 0 then false else true\n\n\nlet bit_list bit n =\n  let rec get i =\n    match i with \n    | i when i = n -> []\n    | _ -> if is_bit_one bit i then true :: get (i+1) else false :: get (i+1)\n  in get 0\n\n\ntype syogen = { user : int; is_honest : bool }\nlet rec get_syogen i a = \n  if i >= a then [] else\n    Scanf.sscanf (read_line()) \"%d %d\" (fun x y -> { user=x-1; is_honest=if y = i then true else false }) :: get_syogen (i+1) a\n\nlet n = read_int ()\nlet data = Array.init n (fun a -> get_syogen 0 @@ read_int ())\n\nlet rec check_true ary syogen_list =\n  match syogen_list with\n  | [] -> true\n  | first :: rest ->\n    if ary.(first.user) = first.is_honest then check_true ary rest else false\n\nlet rec check_false ary syogen_list =\n  match syogen_list with\n  | [] -> true\n  | first :: rest ->\n    if ary.(first.user) != first.is_honest then check_false ary rest else false\n\nlet check_syogen ary i syogen_list =\n  if i = 1 then check_true ary syogen_list else true\n\nlet rec is_true ary i =\n  if i >= n then true else if check_syogen ary i data.(i) then is_true ary (i+1) else false\n\nlet check bit =\n  let b_list = bit_list bit n in \n  if is_true (Array.of_list @@ b_list) 0 then (count_list b_list true) else 0\n\nlet rec bit_loop bit =\n  if bit > n * n then min_int else max (check bit) (bit_loop @@ bit+1)\n\nlet _ = Printf.printf \"%d\\n\" @@ bit_loop 0\n(* 3\n   1\n   2 1\n   1\n   1 1\n   1\n   2 0 *)\n\n", "language": "OCaml", "metadata": {"date": 1587218034, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s084598281.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s084598281", "user_id": "u511870776"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Batteries\nlet rec print_list lst=\n  match lst with\n  | [] -> Printf.printf \"\\n\"\n  | first :: rest -> Printf.printf \"%b \" first ; print_list rest\n\nlet count_list lst target =\n  let rec loop l =\n    match l with\n    | [] -> 0\n    | first :: rest -> if first = target then 1 + loop rest else loop rest\n  in loop lst\n\n\n\n(* bitの数字の2真数の時の右からn番目の数字が0か1か *)\nlet is_bit_one bit n = if bit land (1 lsl n) = 0 then false else true\n\n\nlet bit_list bit n =\n  let rec get i =\n    match i with \n    | i when i = n -> []\n    | _ -> if is_bit_one bit i then true :: get (i+1) else false :: get (i+1)\n  in get 0\n\n\ntype syogen = { user : int; is_honest : bool }\nlet rec get_syogen i a = \n  if i >= a then [] else\n    Scanf.sscanf (read_line()) \"%d %d\" (fun x y -> { user=x-1; is_honest=if y = i then true else false }) :: get_syogen (i+1) a\n\nlet n = read_int ()\nlet data = Array.init n (fun a -> get_syogen 0 @@ read_int ())\n\nlet rec check_true ary syogen_list =\n  match syogen_list with\n  | [] -> true\n  | first :: rest ->\n    if ary.(first.user) = first.is_honest then check_true ary rest else false\n\nlet rec check_false ary syogen_list =\n  match syogen_list with\n  | [] -> true\n  | first :: rest ->\n    if ary.(first.user) != first.is_honest then check_false ary rest else false\n\nlet check_syogen ary i syogen_list =\n  if i = 1 then check_true ary syogen_list else true\n\nlet rec is_true ary i =\n  if i >= n then true else if check_syogen ary i data.(i) then is_true ary (i+1) else false\n\nlet check bit =\n  let b_list = bit_list bit n in \n  if is_true (Array.of_list @@ b_list) 0 then (count_list b_list true) else 0\n\nlet rec bit_loop bit =\n  if bit > n * n then min_int else max (check bit) (bit_loop @@ bit+1)\n\nlet _ = Printf.printf \"%d\\n\" @@ bit_loop 0\n(* 3\n   1\n   2 1\n   1\n   1 1\n   1\n   2 0 *)\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N people numbered 1 to N. Each of them is either an honest person whose testimonies are always correct or an unkind person whose testimonies may be correct or not.\n\nPerson i gives A_i testimonies. The j-th testimony by Person i is represented by two integers x_{ij} and y_{ij}. If y_{ij} = 1, the testimony says Person x_{ij} is honest; if y_{ij} = 0, it says Person x_{ij} is unkind.\n\nHow many honest persons can be among those N people at most?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 15\n\n0 \\leq A_i \\leq N - 1\n\n1 \\leq x_{ij} \\leq N\n\nx_{ij} \\neq i\n\nx_{ij_1} \\neq x_{ij_2} (j_1 \\neq j_2)\n\ny_{ij} = 0, 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\nx_{11} y_{11}\nx_{12} y_{12}\n:\nx_{1A_1} y_{1A_1}\nA_2\nx_{21} y_{21}\nx_{22} y_{22}\n:\nx_{2A_2} y_{2A_2}\n:\nA_N\nx_{N1} y_{N1}\nx_{N2} y_{N2}\n:\nx_{NA_N} y_{NA_N}\n\nOutput\n\nPrint the maximum possible number of honest persons among the N people.\n\nSample Input 1\n\n3\n1\n2 1\n1\n1 1\n1\n2 0\n\nSample Output 1\n\n2\n\nIf Person 1 and Person 2 are honest and Person 3 is unkind, we have two honest persons without inconsistencies, which is the maximum possible number of honest persons.\n\nSample Input 2\n\n3\n2\n2 1\n3 0\n2\n3 1\n1 0\n2\n1 1\n2 0\n\nSample Output 2\n\n0\n\nAssuming that one or more of them are honest immediately leads to a contradiction.\n\nSample Input 3\n\n2\n1\n2 0\n1\n1 0\n\nSample Output 3\n\n1", "sample_input": "3\n1\n2 1\n1\n1 1\n1\n2 0\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02837", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N people numbered 1 to N. Each of them is either an honest person whose testimonies are always correct or an unkind person whose testimonies may be correct or not.\n\nPerson i gives A_i testimonies. The j-th testimony by Person i is represented by two integers x_{ij} and y_{ij}. If y_{ij} = 1, the testimony says Person x_{ij} is honest; if y_{ij} = 0, it says Person x_{ij} is unkind.\n\nHow many honest persons can be among those N people at most?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 15\n\n0 \\leq A_i \\leq N - 1\n\n1 \\leq x_{ij} \\leq N\n\nx_{ij} \\neq i\n\nx_{ij_1} \\neq x_{ij_2} (j_1 \\neq j_2)\n\ny_{ij} = 0, 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\nx_{11} y_{11}\nx_{12} y_{12}\n:\nx_{1A_1} y_{1A_1}\nA_2\nx_{21} y_{21}\nx_{22} y_{22}\n:\nx_{2A_2} y_{2A_2}\n:\nA_N\nx_{N1} y_{N1}\nx_{N2} y_{N2}\n:\nx_{NA_N} y_{NA_N}\n\nOutput\n\nPrint the maximum possible number of honest persons among the N people.\n\nSample Input 1\n\n3\n1\n2 1\n1\n1 1\n1\n2 0\n\nSample Output 1\n\n2\n\nIf Person 1 and Person 2 are honest and Person 3 is unkind, we have two honest persons without inconsistencies, which is the maximum possible number of honest persons.\n\nSample Input 2\n\n3\n2\n2 1\n3 0\n2\n3 1\n1 0\n2\n1 1\n2 0\n\nSample Output 2\n\n0\n\nAssuming that one or more of them are honest immediately leads to a contradiction.\n\nSample Input 3\n\n2\n1\n2 0\n1\n1 0\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1828, "cpu_time_ms": 9, "memory_kb": 1920}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s262096839", "group_id": "codeNet:p02837", "input_text": "let popcnt x =\n  let x = (x land 0x5555555555555555) + ((x lsr 1) land 0x5555555555555555) in\n  let x = (x land 0x3333333333333333) + ((x lsr 2) land 0x3333333333333333) in\n  let x = (x land 0x0f0f0f0f0f0f0f0f) + ((x lsr 4) land 0x0f0f0f0f0f0f0f0f) in\n  let x = (x land 0x00ff00ff00ff00ff) + ((x lsr 8) land 0x00ff00ff00ff00ff) in\n  let x = (x land 0x0000ffff0000ffff) + ((x lsr 16) land 0x0000ffff0000ffff) in\n  (x land 0x00000000ffffffff) + ((x lsr 32) land 0x00000000ffffffff)\n\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let xyss =\n    Array.init n @@ fun _ ->\n      Scanf.scanf \"%d\\n\" @@ fun a ->\n        Array.to_list @@ Array.init a @@ fun _ ->\n          Scanf.scanf \"%d %d\\n\" @@ fun x y -> x, y in\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left max min_int @@\n  Array.init (1 lsl n) @@ fun ans ->\n    if\n      Array.fold_left ( && ) true @@\n      Array.init n @@ fun i ->\n        if ans land (1 lsl i) = 0\n        then true\n        else\n          List.for_all (fun (x, y) ->\n            ans land (1 lsl (x - 1)) = y lsl (x - 1)) xyss.(i)\n    then popcnt ans\n    else 0\n\n", "language": "OCaml", "metadata": {"date": 1575858222, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s262096839.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s262096839", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let popcnt x =\n  let x = (x land 0x5555555555555555) + ((x lsr 1) land 0x5555555555555555) in\n  let x = (x land 0x3333333333333333) + ((x lsr 2) land 0x3333333333333333) in\n  let x = (x land 0x0f0f0f0f0f0f0f0f) + ((x lsr 4) land 0x0f0f0f0f0f0f0f0f) in\n  let x = (x land 0x00ff00ff00ff00ff) + ((x lsr 8) land 0x00ff00ff00ff00ff) in\n  let x = (x land 0x0000ffff0000ffff) + ((x lsr 16) land 0x0000ffff0000ffff) in\n  (x land 0x00000000ffffffff) + ((x lsr 32) land 0x00000000ffffffff)\n\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let xyss =\n    Array.init n @@ fun _ ->\n      Scanf.scanf \"%d\\n\" @@ fun a ->\n        Array.to_list @@ Array.init a @@ fun _ ->\n          Scanf.scanf \"%d %d\\n\" @@ fun x y -> x, y in\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left max min_int @@\n  Array.init (1 lsl n) @@ fun ans ->\n    if\n      Array.fold_left ( && ) true @@\n      Array.init n @@ fun i ->\n        if ans land (1 lsl i) = 0\n        then true\n        else\n          List.for_all (fun (x, y) ->\n            ans land (1 lsl (x - 1)) = y lsl (x - 1)) xyss.(i)\n    then popcnt ans\n    else 0\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N people numbered 1 to N. Each of them is either an honest person whose testimonies are always correct or an unkind person whose testimonies may be correct or not.\n\nPerson i gives A_i testimonies. The j-th testimony by Person i is represented by two integers x_{ij} and y_{ij}. If y_{ij} = 1, the testimony says Person x_{ij} is honest; if y_{ij} = 0, it says Person x_{ij} is unkind.\n\nHow many honest persons can be among those N people at most?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 15\n\n0 \\leq A_i \\leq N - 1\n\n1 \\leq x_{ij} \\leq N\n\nx_{ij} \\neq i\n\nx_{ij_1} \\neq x_{ij_2} (j_1 \\neq j_2)\n\ny_{ij} = 0, 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\nx_{11} y_{11}\nx_{12} y_{12}\n:\nx_{1A_1} y_{1A_1}\nA_2\nx_{21} y_{21}\nx_{22} y_{22}\n:\nx_{2A_2} y_{2A_2}\n:\nA_N\nx_{N1} y_{N1}\nx_{N2} y_{N2}\n:\nx_{NA_N} y_{NA_N}\n\nOutput\n\nPrint the maximum possible number of honest persons among the N people.\n\nSample Input 1\n\n3\n1\n2 1\n1\n1 1\n1\n2 0\n\nSample Output 1\n\n2\n\nIf Person 1 and Person 2 are honest and Person 3 is unkind, we have two honest persons without inconsistencies, which is the maximum possible number of honest persons.\n\nSample Input 2\n\n3\n2\n2 1\n3 0\n2\n3 1\n1 0\n2\n1 1\n2 0\n\nSample Output 2\n\n0\n\nAssuming that one or more of them are honest immediately leads to a contradiction.\n\nSample Input 3\n\n2\n1\n2 0\n1\n1 0\n\nSample Output 3\n\n1", "sample_input": "3\n1\n2 1\n1\n1 1\n1\n2 0\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02837", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N people numbered 1 to N. Each of them is either an honest person whose testimonies are always correct or an unkind person whose testimonies may be correct or not.\n\nPerson i gives A_i testimonies. The j-th testimony by Person i is represented by two integers x_{ij} and y_{ij}. If y_{ij} = 1, the testimony says Person x_{ij} is honest; if y_{ij} = 0, it says Person x_{ij} is unkind.\n\nHow many honest persons can be among those N people at most?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 15\n\n0 \\leq A_i \\leq N - 1\n\n1 \\leq x_{ij} \\leq N\n\nx_{ij} \\neq i\n\nx_{ij_1} \\neq x_{ij_2} (j_1 \\neq j_2)\n\ny_{ij} = 0, 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\nx_{11} y_{11}\nx_{12} y_{12}\n:\nx_{1A_1} y_{1A_1}\nA_2\nx_{21} y_{21}\nx_{22} y_{22}\n:\nx_{2A_2} y_{2A_2}\n:\nA_N\nx_{N1} y_{N1}\nx_{N2} y_{N2}\n:\nx_{NA_N} y_{NA_N}\n\nOutput\n\nPrint the maximum possible number of honest persons among the N people.\n\nSample Input 1\n\n3\n1\n2 1\n1\n1 1\n1\n2 0\n\nSample Output 1\n\n2\n\nIf Person 1 and Person 2 are honest and Person 3 is unkind, we have two honest persons without inconsistencies, which is the maximum possible number of honest persons.\n\nSample Input 2\n\n3\n2\n2 1\n3 0\n2\n3 1\n1 0\n2\n1 1\n2 0\n\nSample Output 2\n\n0\n\nAssuming that one or more of them are honest immediately leads to a contradiction.\n\nSample Input 3\n\n2\n1\n2 0\n1\n1 0\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1074, "cpu_time_ms": 15, "memory_kb": 4736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s956693114", "group_id": "codeNet:p02839", "input_text": "let () =\n    let main () =\n        let h, w = Scanf.scanf \"%d %d\" (fun h w -> h, w) in\n        let a = Array.init h (fun _ -> Array.init w (fun _ -> Scanf.scanf \" %d\" (fun n -> n))) in\n        let b = Array.init h (fun _ -> Array.init w (fun _ -> Scanf.scanf \" %d\" (fun n -> n))) in\n        let m = (h + w) * 2 * 80 in\n        let m2 = m / 2 in\n        let ar = Array.init (h + 1) (\n            fun y -> Array.init (w + 1) (\n                fun x -> Array.init m (\n                    fun t -> t = m2 && (y = 0 || x = 0))))\n        in\n        for y = 1 to h do\n            for x = 1 to w do\n                for k = 0 to m - 1 do\n                    if ar.(y - 1).(x).(k) || ar.(y).(x - 1).(k) then (\n                        ar.(y).(x).(k + a.(y - 1).(x - 1) - b.(y - 1).(x - 1)) <- true;\n                        ar.(y).(x).(k - a.(y - 1).(x - 1) + b.(y - 1).(x - 1)) <- true\n                    )\n                done\n            done\n        done;\n        let rec loop i acc =\n            if i = m then acc else\n                let acc = if ar.(h).(w).(i) then min acc (abs (i - m2)) else acc in\n                loop (i + 1) acc\n        in\n        let s = loop 0 max_int in\n        Printf.printf \"%d\\n\" s\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1575865742, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s956693114.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s956693114", "user_id": "u342443598"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "let () =\n    let main () =\n        let h, w = Scanf.scanf \"%d %d\" (fun h w -> h, w) in\n        let a = Array.init h (fun _ -> Array.init w (fun _ -> Scanf.scanf \" %d\" (fun n -> n))) in\n        let b = Array.init h (fun _ -> Array.init w (fun _ -> Scanf.scanf \" %d\" (fun n -> n))) in\n        let m = (h + w) * 2 * 80 in\n        let m2 = m / 2 in\n        let ar = Array.init (h + 1) (\n            fun y -> Array.init (w + 1) (\n                fun x -> Array.init m (\n                    fun t -> t = m2 && (y = 0 || x = 0))))\n        in\n        for y = 1 to h do\n            for x = 1 to w do\n                for k = 0 to m - 1 do\n                    if ar.(y - 1).(x).(k) || ar.(y).(x - 1).(k) then (\n                        ar.(y).(x).(k + a.(y - 1).(x - 1) - b.(y - 1).(x - 1)) <- true;\n                        ar.(y).(x).(k - a.(y - 1).(x - 1) + b.(y - 1).(x - 1)) <- true\n                    )\n                done\n            done\n        done;\n        let rec loop i acc =\n            if i = m then acc else\n                let acc = if ar.(h).(w).(i) then min acc (abs (i - m2)) else acc in\n                loop (i + 1) acc\n        in\n        let s = loop 0 max_int in\n        Printf.printf \"%d\\n\" s\n    in\n    main ()", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a grid with H horizontal rows and W vertical columns. Let (i,j) denote the square at the i-th row from the top and the j-th column from the left.\n\nThe square (i, j) has two numbers A_{ij} and B_{ij} written on it.\n\nFirst, for each square, Takahashi paints one of the written numbers red and the other blue.\n\nThen, he travels from the square (1, 1) to the square (H, W). In one move, he can move from a square (i, j) to the square (i+1, j) or the square (i, j+1). He must not leave the grid.\n\nLet the unbalancedness be the absolute difference of the sum of red numbers and the sum of blue numbers written on the squares along Takahashi's path, including the squares (1, 1) and (H, W).\n\nTakahashi wants to make the unbalancedness as small as possible by appropriately painting the grid and traveling on it.\n\nFind the minimum unbalancedness possible.\n\nConstraints\n\n2 \\leq H \\leq 80\n\n2 \\leq W \\leq 80\n\n0 \\leq A_{ij} \\leq 80\n\n0 \\leq B_{ij} \\leq 80\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11} A_{12} \\ldots A_{1W}\n:\nA_{H1} A_{H2} \\ldots A_{HW}\nB_{11} B_{12} \\ldots B_{1W}\n:\nB_{H1} B_{H2} \\ldots B_{HW}\n\nOutput\n\nPrint the minimum unbalancedness possible.\n\nSample Input 1\n\n2 2\n1 2\n3 4\n3 4\n2 1\n\nSample Output 1\n\n0\n\nBy painting the grid and traveling on it as shown in the figure below, the sum of red numbers and the sum of blue numbers are 3+3+1=7 and 1+2+4=7, respectively, for the unbalancedness of 0.\n\nSample Input 2\n\n2 3\n1 10 80\n80 10 1\n1 2 3\n4 5 6\n\nSample Output 2\n\n2", "sample_input": "2 2\n1 2\n3 4\n3 4\n2 1\n"}, "reference_outputs": ["0\n"], "source_document_id": "p02839", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a grid with H horizontal rows and W vertical columns. Let (i,j) denote the square at the i-th row from the top and the j-th column from the left.\n\nThe square (i, j) has two numbers A_{ij} and B_{ij} written on it.\n\nFirst, for each square, Takahashi paints one of the written numbers red and the other blue.\n\nThen, he travels from the square (1, 1) to the square (H, W). In one move, he can move from a square (i, j) to the square (i+1, j) or the square (i, j+1). He must not leave the grid.\n\nLet the unbalancedness be the absolute difference of the sum of red numbers and the sum of blue numbers written on the squares along Takahashi's path, including the squares (1, 1) and (H, W).\n\nTakahashi wants to make the unbalancedness as small as possible by appropriately painting the grid and traveling on it.\n\nFind the minimum unbalancedness possible.\n\nConstraints\n\n2 \\leq H \\leq 80\n\n2 \\leq W \\leq 80\n\n0 \\leq A_{ij} \\leq 80\n\n0 \\leq B_{ij} \\leq 80\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11} A_{12} \\ldots A_{1W}\n:\nA_{H1} A_{H2} \\ldots A_{HW}\nB_{11} B_{12} \\ldots B_{1W}\n:\nB_{H1} B_{H2} \\ldots B_{HW}\n\nOutput\n\nPrint the minimum unbalancedness possible.\n\nSample Input 1\n\n2 2\n1 2\n3 4\n3 4\n2 1\n\nSample Output 1\n\n0\n\nBy painting the grid and traveling on it as shown in the figure below, the sum of red numbers and the sum of blue numbers are 3+3+1=7 and 1+2+4=7, respectively, for the unbalancedness of 0.\n\nSample Input 2\n\n2 3\n1 10 80\n80 10 1\n1 2 3\n4 5 6\n\nSample Output 2\n\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1224, "cpu_time_ms": 2111, "memory_kb": 1154792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s550248204", "group_id": "codeNet:p02839", "input_text": "module IntSet = Set.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet add x s =\n  if 160 <= x\n  then s\n  else IntSet.add x s\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun h w ->\n  let ass =\n    Array.init h @@ fun _ ->\n      Array.init w @@ fun _ ->\n        Scanf.scanf \"%d \" @@ fun a -> a in\n  let bss =\n    Array.init h @@ fun _ ->\n      Array.init w @@ fun _ ->\n        Scanf.scanf \"%d \" @@ fun b -> b in\n  let dp = Array.make_matrix (h + 1) (w + 1) IntSet.empty in\n  dp.(0).(1) <- IntSet.singleton 0;\n  for i = 0 to h - 1 do\n    for j = 0 to w - 1 do\n      dp.(i + 1).(j + 1) <-\n        IntSet.fold (fun sum s ->\n          add (abs (sum + ass.(i).(j) - bss.(i).(j))) @@\n          add (abs (sum - ass.(i).(j) + bss.(i).(j))) s) dp.(i).(j + 1) @@\n        IntSet.fold (fun sum s ->\n          add (abs (sum + ass.(i).(j) - bss.(i).(j))) @@\n          add (abs (sum - ass.(i).(j) + bss.(i).(j))) s) dp.(i + 1).(j) IntSet.empty\n    done\n  done;\n  Printf.printf \"%d\\n\" @@\n  IntSet.fold min dp.(h).(w) max_int\n\n", "language": "OCaml", "metadata": {"date": 1575859947, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s550248204.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s550248204", "user_id": "u504158101"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "module IntSet = Set.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet add x s =\n  if 160 <= x\n  then s\n  else IntSet.add x s\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun h w ->\n  let ass =\n    Array.init h @@ fun _ ->\n      Array.init w @@ fun _ ->\n        Scanf.scanf \"%d \" @@ fun a -> a in\n  let bss =\n    Array.init h @@ fun _ ->\n      Array.init w @@ fun _ ->\n        Scanf.scanf \"%d \" @@ fun b -> b in\n  let dp = Array.make_matrix (h + 1) (w + 1) IntSet.empty in\n  dp.(0).(1) <- IntSet.singleton 0;\n  for i = 0 to h - 1 do\n    for j = 0 to w - 1 do\n      dp.(i + 1).(j + 1) <-\n        IntSet.fold (fun sum s ->\n          add (abs (sum + ass.(i).(j) - bss.(i).(j))) @@\n          add (abs (sum - ass.(i).(j) + bss.(i).(j))) s) dp.(i).(j + 1) @@\n        IntSet.fold (fun sum s ->\n          add (abs (sum + ass.(i).(j) - bss.(i).(j))) @@\n          add (abs (sum - ass.(i).(j) + bss.(i).(j))) s) dp.(i + 1).(j) IntSet.empty\n    done\n  done;\n  Printf.printf \"%d\\n\" @@\n  IntSet.fold min dp.(h).(w) max_int\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a grid with H horizontal rows and W vertical columns. Let (i,j) denote the square at the i-th row from the top and the j-th column from the left.\n\nThe square (i, j) has two numbers A_{ij} and B_{ij} written on it.\n\nFirst, for each square, Takahashi paints one of the written numbers red and the other blue.\n\nThen, he travels from the square (1, 1) to the square (H, W). In one move, he can move from a square (i, j) to the square (i+1, j) or the square (i, j+1). He must not leave the grid.\n\nLet the unbalancedness be the absolute difference of the sum of red numbers and the sum of blue numbers written on the squares along Takahashi's path, including the squares (1, 1) and (H, W).\n\nTakahashi wants to make the unbalancedness as small as possible by appropriately painting the grid and traveling on it.\n\nFind the minimum unbalancedness possible.\n\nConstraints\n\n2 \\leq H \\leq 80\n\n2 \\leq W \\leq 80\n\n0 \\leq A_{ij} \\leq 80\n\n0 \\leq B_{ij} \\leq 80\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11} A_{12} \\ldots A_{1W}\n:\nA_{H1} A_{H2} \\ldots A_{HW}\nB_{11} B_{12} \\ldots B_{1W}\n:\nB_{H1} B_{H2} \\ldots B_{HW}\n\nOutput\n\nPrint the minimum unbalancedness possible.\n\nSample Input 1\n\n2 2\n1 2\n3 4\n3 4\n2 1\n\nSample Output 1\n\n0\n\nBy painting the grid and traveling on it as shown in the figure below, the sum of red numbers and the sum of blue numbers are 3+3+1=7 and 1+2+4=7, respectively, for the unbalancedness of 0.\n\nSample Input 2\n\n2 3\n1 10 80\n80 10 1\n1 2 3\n4 5 6\n\nSample Output 2\n\n2", "sample_input": "2 2\n1 2\n3 4\n3 4\n2 1\n"}, "reference_outputs": ["0\n"], "source_document_id": "p02839", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a grid with H horizontal rows and W vertical columns. Let (i,j) denote the square at the i-th row from the top and the j-th column from the left.\n\nThe square (i, j) has two numbers A_{ij} and B_{ij} written on it.\n\nFirst, for each square, Takahashi paints one of the written numbers red and the other blue.\n\nThen, he travels from the square (1, 1) to the square (H, W). In one move, he can move from a square (i, j) to the square (i+1, j) or the square (i, j+1). He must not leave the grid.\n\nLet the unbalancedness be the absolute difference of the sum of red numbers and the sum of blue numbers written on the squares along Takahashi's path, including the squares (1, 1) and (H, W).\n\nTakahashi wants to make the unbalancedness as small as possible by appropriately painting the grid and traveling on it.\n\nFind the minimum unbalancedness possible.\n\nConstraints\n\n2 \\leq H \\leq 80\n\n2 \\leq W \\leq 80\n\n0 \\leq A_{ij} \\leq 80\n\n0 \\leq B_{ij} \\leq 80\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11} A_{12} \\ldots A_{1W}\n:\nA_{H1} A_{H2} \\ldots A_{HW}\nB_{11} B_{12} \\ldots B_{1W}\n:\nB_{H1} B_{H2} \\ldots B_{HW}\n\nOutput\n\nPrint the minimum unbalancedness possible.\n\nSample Input 1\n\n2 2\n1 2\n3 4\n3 4\n2 1\n\nSample Output 1\n\n0\n\nBy painting the grid and traveling on it as shown in the figure below, the sum of red numbers and the sum of blue numbers are 3+3+1=7 and 1+2+4=7, respectively, for the unbalancedness of 0.\n\nSample Input 2\n\n2 3\n1 10 80\n80 10 1\n1 2 3\n4 5 6\n\nSample Output 2\n\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1011, "cpu_time_ms": 658, "memory_kb": 43260}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s210303643", "group_id": "codeNet:p02839", "input_text": "module IntSet = Set.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun h w ->\n  let ass =\n    Array.init h @@ fun _ ->\n      Array.init w @@ fun _ ->\n        Scanf.scanf \"%d \" @@ fun a -> a in\n  let bss =\n    Array.init h @@ fun _ ->\n      Array.init w @@ fun _ ->\n        Scanf.scanf \"%d \" @@ fun b -> b in\n  let dp = Array.make_matrix (h + 1) (w + 1) IntSet.empty in\n  dp.(0).(1) <- IntSet.singleton 0;\n  for i = 0 to h - 1 do\n    for j = 0 to w - 1 do\n      dp.(i + 1).(j + 1) <-\n        IntSet.fold (fun sum s ->\n          IntSet.add (abs (sum + ass.(i).(j) - bss.(i).(j))) @@\n          IntSet.add (abs (sum - ass.(i).(j) + bss.(i).(j))) s) dp.(i).(j + 1) @@\n        IntSet.fold (fun sum s ->\n          IntSet.add (abs (sum + ass.(i).(j) - bss.(i).(j))) @@\n          IntSet.add (abs (sum - ass.(i).(j) + bss.(i).(j))) s) dp.(i + 1).(j) IntSet.empty\n    done\n  done;\n  Printf.printf \"%d\\n\" @@\n  IntSet.fold min dp.(h).(w) max_int\n\n", "language": "OCaml", "metadata": {"date": 1575859789, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s210303643.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s210303643", "user_id": "u504158101"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "module IntSet = Set.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun h w ->\n  let ass =\n    Array.init h @@ fun _ ->\n      Array.init w @@ fun _ ->\n        Scanf.scanf \"%d \" @@ fun a -> a in\n  let bss =\n    Array.init h @@ fun _ ->\n      Array.init w @@ fun _ ->\n        Scanf.scanf \"%d \" @@ fun b -> b in\n  let dp = Array.make_matrix (h + 1) (w + 1) IntSet.empty in\n  dp.(0).(1) <- IntSet.singleton 0;\n  for i = 0 to h - 1 do\n    for j = 0 to w - 1 do\n      dp.(i + 1).(j + 1) <-\n        IntSet.fold (fun sum s ->\n          IntSet.add (abs (sum + ass.(i).(j) - bss.(i).(j))) @@\n          IntSet.add (abs (sum - ass.(i).(j) + bss.(i).(j))) s) dp.(i).(j + 1) @@\n        IntSet.fold (fun sum s ->\n          IntSet.add (abs (sum + ass.(i).(j) - bss.(i).(j))) @@\n          IntSet.add (abs (sum - ass.(i).(j) + bss.(i).(j))) s) dp.(i + 1).(j) IntSet.empty\n    done\n  done;\n  Printf.printf \"%d\\n\" @@\n  IntSet.fold min dp.(h).(w) max_int\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a grid with H horizontal rows and W vertical columns. Let (i,j) denote the square at the i-th row from the top and the j-th column from the left.\n\nThe square (i, j) has two numbers A_{ij} and B_{ij} written on it.\n\nFirst, for each square, Takahashi paints one of the written numbers red and the other blue.\n\nThen, he travels from the square (1, 1) to the square (H, W). In one move, he can move from a square (i, j) to the square (i+1, j) or the square (i, j+1). He must not leave the grid.\n\nLet the unbalancedness be the absolute difference of the sum of red numbers and the sum of blue numbers written on the squares along Takahashi's path, including the squares (1, 1) and (H, W).\n\nTakahashi wants to make the unbalancedness as small as possible by appropriately painting the grid and traveling on it.\n\nFind the minimum unbalancedness possible.\n\nConstraints\n\n2 \\leq H \\leq 80\n\n2 \\leq W \\leq 80\n\n0 \\leq A_{ij} \\leq 80\n\n0 \\leq B_{ij} \\leq 80\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11} A_{12} \\ldots A_{1W}\n:\nA_{H1} A_{H2} \\ldots A_{HW}\nB_{11} B_{12} \\ldots B_{1W}\n:\nB_{H1} B_{H2} \\ldots B_{HW}\n\nOutput\n\nPrint the minimum unbalancedness possible.\n\nSample Input 1\n\n2 2\n1 2\n3 4\n3 4\n2 1\n\nSample Output 1\n\n0\n\nBy painting the grid and traveling on it as shown in the figure below, the sum of red numbers and the sum of blue numbers are 3+3+1=7 and 1+2+4=7, respectively, for the unbalancedness of 0.\n\nSample Input 2\n\n2 3\n1 10 80\n80 10 1\n1 2 3\n4 5 6\n\nSample Output 2\n\n2", "sample_input": "2 2\n1 2\n3 4\n3 4\n2 1\n"}, "reference_outputs": ["0\n"], "source_document_id": "p02839", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a grid with H horizontal rows and W vertical columns. Let (i,j) denote the square at the i-th row from the top and the j-th column from the left.\n\nThe square (i, j) has two numbers A_{ij} and B_{ij} written on it.\n\nFirst, for each square, Takahashi paints one of the written numbers red and the other blue.\n\nThen, he travels from the square (1, 1) to the square (H, W). In one move, he can move from a square (i, j) to the square (i+1, j) or the square (i, j+1). He must not leave the grid.\n\nLet the unbalancedness be the absolute difference of the sum of red numbers and the sum of blue numbers written on the squares along Takahashi's path, including the squares (1, 1) and (H, W).\n\nTakahashi wants to make the unbalancedness as small as possible by appropriately painting the grid and traveling on it.\n\nFind the minimum unbalancedness possible.\n\nConstraints\n\n2 \\leq H \\leq 80\n\n2 \\leq W \\leq 80\n\n0 \\leq A_{ij} \\leq 80\n\n0 \\leq B_{ij} \\leq 80\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nA_{11} A_{12} \\ldots A_{1W}\n:\nA_{H1} A_{H2} \\ldots A_{HW}\nB_{11} B_{12} \\ldots B_{1W}\n:\nB_{H1} B_{H2} \\ldots B_{HW}\n\nOutput\n\nPrint the minimum unbalancedness possible.\n\nSample Input 1\n\n2 2\n1 2\n3 4\n3 4\n2 1\n\nSample Output 1\n\n0\n\nBy painting the grid and traveling on it as shown in the figure below, the sum of red numbers and the sum of blue numbers are 3+3+1=7 and 1+2+4=7, respectively, for the unbalancedness of 0.\n\nSample Input 2\n\n2 3\n1 10 80\n80 10 1\n1 2 3\n4 5 6\n\nSample Output 2\n\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 979, "cpu_time_ms": 2106, "memory_kb": 102904}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s568301440", "group_id": "codeNet:p02841", "input_text": "Scanf.scanf \"%d %d %d %d\" (fun m1 d1 m2 d2 -> if m1 = m2 then \"0\" else \"1\") |> print_endline\n", "language": "OCaml", "metadata": {"date": 1575254924, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s568301440.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s568301440", "user_id": "u798181098"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d %d\" (fun m1 d1 m2 d2 -> if m1 = m2 then \"0\" else \"1\") |> print_endline\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 93, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s969236782", "group_id": "codeNet:p02842", "input_text": "open Printf\nopen Scanf\n\nlet tax x = x * 108 / 100\n  \nlet solve n =\n  let rec f s l =\n    let m = (s + l) / 2 in\n    let t = tax m in\n    if s + 1 = l then \":(\"\n    else if t = n then string_of_int m\n    else if t > n then f s m\n    else f m l\n  in f 0 50000\n\nlet () =\n  scanf \"%d \" solve |> printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1580942240, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s969236782.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s969236782", "user_id": "u388783188"}, "prompt_components": {"gold_output": "400\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet tax x = x * 108 / 100\n  \nlet solve n =\n  let rec f s l =\n    let m = (s + l) / 2 in\n    let t = tax m in\n    if s + 1 = l then \":(\"\n    else if t = n then string_of_int m\n    else if t > n then f s m\n    else f m l\n  in f 0 50000\n\nlet () =\n  scanf \"%d \" solve |> printf \"%s\\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s879015532", "group_id": "codeNet:p02842", "input_text": "let n = read_int ()\nlet x = (100 * n + 107) / 108\nlet _ = print_endline @@ if 108 * x / 100 = n then string_of_int x else \":(\"", "language": "OCaml", "metadata": {"date": 1575321333, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s879015532.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s879015532", "user_id": "u732304692"}, "prompt_components": {"gold_output": "400\n", "input_to_evaluate": "let n = read_int ()\nlet x = (100 * n + 107) / 108\nlet _ = print_endline @@ if 108 * x / 100 = n then string_of_int x else \":(\"", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 126, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s821937806", "group_id": "codeNet:p02845", "input_text": "let m_1e9 = int_of_float 1e9 + 7\nlet ( +^ ) x y = (x + y) mod m_1e9\nlet ( -^ ) x y = x - y + if x < y then m_1e9 else 0\nlet ( *^ ) x y = ((x mod m_1e9) * (y mod m_1e9)) mod m_1e9\nlet split_string ?(pattern=\" \") = Str.split @@ Str.regexp pattern\n\nlet n = Scanf.sscanf (read_line ()) \"%d\" @@ fun n -> n\nlet a = read_line () |> split_string |> List.map int_of_string\n\nlet rec loop ans arr = function\n  | [] -> Printf.printf \"%d\\n\" @@ ans\n  | x :: xs -> \n    let t = Array.fold_left (fun s i -> s + if i = x then 1 else 0) 0 arr in\n    if arr.(0) = x then arr.(0) <- arr.(0) + 1\n    else if arr.(1) = x then arr.(1) <- arr.(1) + 1\n    else arr.(2) <- arr.(2) + 1;\n    loop (ans *^ t) arr xs\n\nlet () = loop 1 (Array.make 3 0) a", "language": "OCaml", "metadata": {"date": 1590545797, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s821937806.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s821937806", "user_id": "u811309788"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let m_1e9 = int_of_float 1e9 + 7\nlet ( +^ ) x y = (x + y) mod m_1e9\nlet ( -^ ) x y = x - y + if x < y then m_1e9 else 0\nlet ( *^ ) x y = ((x mod m_1e9) * (y mod m_1e9)) mod m_1e9\nlet split_string ?(pattern=\" \") = Str.split @@ Str.regexp pattern\n\nlet n = Scanf.sscanf (read_line ()) \"%d\" @@ fun n -> n\nlet a = read_line () |> split_string |> List.map int_of_string\n\nlet rec loop ans arr = function\n  | [] -> Printf.printf \"%d\\n\" @@ ans\n  | x :: xs -> \n    let t = Array.fold_left (fun s i -> s + if i = x then 1 else 0) 0 arr in\n    if arr.(0) = x then arr.(0) <- arr.(0) + 1\n    else if arr.(1) = x then arr.(1) <- arr.(1) + 1\n    else arr.(2) <- arr.(2) + 1;\n    loop (ans *^ t) arr xs\n\nlet () = loop 1 (Array.make 3 0) a", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 722, "cpu_time_ms": 38, "memory_kb": 13696}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s565069042", "group_id": "codeNet:p02845", "input_text": "let m = 1000000007\nlet ( +^ ) x y = (x + y) mod m\nlet ( *^ ) x y = (x * y) mod m\n\nmodule IntTripleMap = Map.Make (struct\n  type t = int * int * int\n  let compare = compare\nend)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  let m =\n    Array.fold_left (fun m a ->\n      IntTripleMap.fold (fun (r, g, b) n m ->\n        let m =\n          if r <> a then m else \n          IntTripleMap.add (r + 1, g, b) \n          (n +^\n            try IntTripleMap.find (r + 1, g, b) m\n            with Not_found -> 0) m in\n        let m =\n          if g <> a then m else \n          IntTripleMap.add (r, g + 1, b) \n            (n +^\n              try IntTripleMap.find (r, g + 1, b) m\n              with Not_found -> 0) m in\n        let m =\n          if b <> a then m else \n          IntTripleMap.add (r, g, b + 1) \n            (n +^\n              try IntTripleMap.find (r, g, b + 1) m\n              with Not_found -> 0) m in\n        m) m IntTripleMap.empty) (IntTripleMap.singleton (0, 0, 0) 1) as_ in\n  Printf.printf \"%d\\n\" @@\n  IntTripleMap.fold (fun _ -> ( +^ )) m 0\n\n", "language": "OCaml", "metadata": {"date": 1575709209, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s565069042.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s565069042", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let m = 1000000007\nlet ( +^ ) x y = (x + y) mod m\nlet ( *^ ) x y = (x * y) mod m\n\nmodule IntTripleMap = Map.Make (struct\n  type t = int * int * int\n  let compare = compare\nend)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  let m =\n    Array.fold_left (fun m a ->\n      IntTripleMap.fold (fun (r, g, b) n m ->\n        let m =\n          if r <> a then m else \n          IntTripleMap.add (r + 1, g, b) \n          (n +^\n            try IntTripleMap.find (r + 1, g, b) m\n            with Not_found -> 0) m in\n        let m =\n          if g <> a then m else \n          IntTripleMap.add (r, g + 1, b) \n            (n +^\n              try IntTripleMap.find (r, g + 1, b) m\n              with Not_found -> 0) m in\n        let m =\n          if b <> a then m else \n          IntTripleMap.add (r, g, b + 1) \n            (n +^\n              try IntTripleMap.find (r, g, b + 1) m\n              with Not_found -> 0) m in\n        m) m IntTripleMap.empty) (IntTripleMap.singleton (0, 0, 0) 1) as_ in\n  Printf.printf \"%d\\n\" @@\n  IntTripleMap.fold (fun _ -> ( +^ )) m 0\n\n", "problem_context": "Score: 500 points\n\nProblem Statement\n\nN people are standing in a queue, numbered 1, 2, 3, ..., N from front to back. Each person wears a hat, which is red, blue, or green.\n\nThe person numbered i says:\n\n\"In front of me, exactly A_i people are wearing hats with the same color as mine.\"\n\nAssuming that all these statements are correct, find the number of possible combinations of colors of the N people's hats.\n\nSince the count can be enormous, compute it modulo 1000000007.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\n0 \\leq A_i \\leq N-1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 A_3 ... A_N\n\nOutput\n\nPrint the number of possible combinations of colors of the N people's hats, modulo 1000000007.\n\nSample Input 1\n\n6\n0 1 2 3 4 5\n\nSample Output 1\n\n3\n\nWe have three possible combinations, as follows:\n\nRed, Red, Red, Red, Red, Red\n\nBlue, Blue, Blue, Blue, Blue, Blue\n\nGreen, Green, Green, Green, Green, Green\n\nSample Input 2\n\n3\n0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n54\n0 0 1 0 1 2 1 2 3 2 3 3 4 4 5 4 6 5 7 8 5 6 6 7 7 8 8 9 9 10 10 11 9 12 10 13 14 11 11 12 12 13 13 14 14 15 15 15 16 16 16 17 17 17\n\nSample Output 3\n\n115295190", "sample_input": "6\n0 1 2 3 4 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02845", "source_text": "Score: 500 points\n\nProblem Statement\n\nN people are standing in a queue, numbered 1, 2, 3, ..., N from front to back. Each person wears a hat, which is red, blue, or green.\n\nThe person numbered i says:\n\n\"In front of me, exactly A_i people are wearing hats with the same color as mine.\"\n\nAssuming that all these statements are correct, find the number of possible combinations of colors of the N people's hats.\n\nSince the count can be enormous, compute it modulo 1000000007.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\n0 \\leq A_i \\leq N-1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 A_3 ... A_N\n\nOutput\n\nPrint the number of possible combinations of colors of the N people's hats, modulo 1000000007.\n\nSample Input 1\n\n6\n0 1 2 3 4 5\n\nSample Output 1\n\n3\n\nWe have three possible combinations, as follows:\n\nRed, Red, Red, Red, Red, Red\n\nBlue, Blue, Blue, Blue, Blue, Blue\n\nGreen, Green, Green, Green, Green, Green\n\nSample Input 2\n\n3\n0 0 0\n\nSample Output 2\n\n6\n\nSample Input 3\n\n54\n0 0 1 0 1 2 1 2 3 2 3 3 4 4 5 4 6 5 7 8 5 6 6 7 7 8 8 9 9 10 10 11 9 12 10 13 14 11 11 12 12 13 13 14 14 15 15 15 16 16 16 17 17 17\n\nSample Output 3\n\n115295190", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1121, "cpu_time_ms": 128, "memory_kb": 5376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s560614257", "group_id": "codeNet:p02846", "input_text": "let () =\n    let main () =\n        let t1, t2 = Scanf.sscanf (read_line ()) \"%d %d\" (fun t1 t2 -> t1, t2) in\n        let a1, a2 = Scanf.sscanf (read_line ()) \"%d %d\" (fun a1 a2 -> a1, a2) in\n        let b1, b2 = Scanf.sscanf (read_line ()) \"%d %d\" (fun b1 b2 -> b1, b2) in\n        let r =\n            if a1 = b1 then (-1) else (\n                let m1a = t1 * a1 in\n                let m1b = t1 * b1 in\n                let m2a = m1a + t2 * a2 in\n                let m2b = m1b + t2 * b2 in\n                if m2a = m2b then (-1) else\n                    if (m1a > m1b && m2a > m2b) || \n                       (m1a < m1b && m2a < m2b) then 0 else (\n                           let d1 = t1 * (max a1 b1 - min a1 b1) in\n                           let d2 = t2 * (max a2 b2 - min a2 b2) in\n                           let rec loop d acc =\n                               if d = 0 then acc else\n                               if d - d2 > 0 then acc else\n                                   if d - d2 + d1 < 0 then acc + 1 else\n                                       loop (d - d2 + d1) (acc + 2)\n                           in\n                           let c = d1 / (d2 - d1) in\n                           loop (d1 + (d1 - d2) * c) (2 * c) \n                       )\n            )\n        in\n        if r < 0 then Printf.printf \"infinity\\n\" else Printf.printf \"%d\\n\" r\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1575257656, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s560614257.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s560614257", "user_id": "u342443598"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () =\n    let main () =\n        let t1, t2 = Scanf.sscanf (read_line ()) \"%d %d\" (fun t1 t2 -> t1, t2) in\n        let a1, a2 = Scanf.sscanf (read_line ()) \"%d %d\" (fun a1 a2 -> a1, a2) in\n        let b1, b2 = Scanf.sscanf (read_line ()) \"%d %d\" (fun b1 b2 -> b1, b2) in\n        let r =\n            if a1 = b1 then (-1) else (\n                let m1a = t1 * a1 in\n                let m1b = t1 * b1 in\n                let m2a = m1a + t2 * a2 in\n                let m2b = m1b + t2 * b2 in\n                if m2a = m2b then (-1) else\n                    if (m1a > m1b && m2a > m2b) || \n                       (m1a < m1b && m2a < m2b) then 0 else (\n                           let d1 = t1 * (max a1 b1 - min a1 b1) in\n                           let d2 = t2 * (max a2 b2 - min a2 b2) in\n                           let rec loop d acc =\n                               if d = 0 then acc else\n                               if d - d2 > 0 then acc else\n                                   if d - d2 + d1 < 0 then acc + 1 else\n                                       loop (d - d2 + d1) (acc + 2)\n                           in\n                           let c = d1 / (d2 - d1) in\n                           loop (d1 + (d1 - d2) * c) (2 * c) \n                       )\n            )\n        in\n        if r < 0 then Printf.printf \"infinity\\n\" else Printf.printf \"%d\\n\" r\n    in\n    main ()", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1374, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s870595784", "group_id": "codeNet:p02847", "input_text": "Printf.printf \"%d\\n\" (match (read_line ()) with\n| \"SUN\" -> 7\n| \"MON\" -> 6\n| \"TUE\" -> 5\n| \"WED\" -> 4\n| \"THU\" -> 3\n| \"FRI\" -> 2\n| \"SAT\" -> 1 |_->0)", "language": "OCaml", "metadata": {"date": 1574647317, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s870595784.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s870595784", "user_id": "u342443598"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "Printf.printf \"%d\\n\" (match (read_line ()) with\n| \"SUN\" -> 7\n| \"MON\" -> 6\n| \"TUE\" -> 5\n| \"WED\" -> 4\n| \"THU\" -> 3\n| \"FRI\" -> 2\n| \"SAT\" -> 1 |_->0)", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s254336400", "group_id": "codeNet:p02850", "input_text": "let ($) f g = fun x -> g (f x)\nlet n = Scanf.sscanf (read_line ()) \"%d\" @@ fun n -> n\nlet ab = Array.init (n - 1) @@ fun _ -> Scanf.sscanf (read_line ()) \"%d %d\" @@ fun a b -> (a - 1, b - 1)\n\nmodule IntMap = Map.Make(struct type t = int let compare = compare end)\n\nlet edges = \n  let add k v idx map =\n    let vs = try IntMap.find k map with Not_found -> [] in\n    IntMap.add k ((idx, v) :: vs) map in\n  fst @@ Array.fold_left (fun (map, i) (a, b) ->\n    (add b a i @@ add a b i map, i + 1)\n  ) (IntMap.empty, 0) ab\n\nlet () =\n  let arr = Array.make (n - 1) 0 in\n  let used = Array.make n false in\n  let k = IntMap.bindings edges |> List.map (snd $ List.length) |> List.fold_left max 0 in\n  let que = Queue.create () in\n  Queue.add (0, k + 1) que;\n  while not (Queue.is_empty que) do\n    let node, col = Queue.pop que in\n    let children = IntMap.find node edges |> List.filter (fun (_, v) -> not used.(v)) |> List.rev in\n    used.(node) <- true;\n    List.iteri (fun idx (i, v) -> \n      let c = idx + if idx < col - 1 then 1 else 2 in\n      arr.(i) <- c;\n      Queue.add (v, c) que;\n    ) children;\n\n  done;\n  Printf.printf \"%d\\n\" k;\n  Array.iter (Printf.printf \"%d\\n\") arr;\n", "language": "OCaml", "metadata": {"date": 1594339514, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02850.html", "problem_id": "p02850", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02850/input.txt", "sample_output_relpath": "derived/input_output/data/p02850/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02850/OCaml/s254336400.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s254336400", "user_id": "u811309788"}, "prompt_components": {"gold_output": "2\n1\n2\n", "input_to_evaluate": "let ($) f g = fun x -> g (f x)\nlet n = Scanf.sscanf (read_line ()) \"%d\" @@ fun n -> n\nlet ab = Array.init (n - 1) @@ fun _ -> Scanf.sscanf (read_line ()) \"%d %d\" @@ fun a b -> (a - 1, b - 1)\n\nmodule IntMap = Map.Make(struct type t = int let compare = compare end)\n\nlet edges = \n  let add k v idx map =\n    let vs = try IntMap.find k map with Not_found -> [] in\n    IntMap.add k ((idx, v) :: vs) map in\n  fst @@ Array.fold_left (fun (map, i) (a, b) ->\n    (add b a i @@ add a b i map, i + 1)\n  ) (IntMap.empty, 0) ab\n\nlet () =\n  let arr = Array.make (n - 1) 0 in\n  let used = Array.make n false in\n  let k = IntMap.bindings edges |> List.map (snd $ List.length) |> List.fold_left max 0 in\n  let que = Queue.create () in\n  Queue.add (0, k + 1) que;\n  while not (Queue.is_empty que) do\n    let node, col = Queue.pop que in\n    let children = IntMap.find node edges |> List.filter (fun (_, v) -> not used.(v)) |> List.rev in\n    used.(node) <- true;\n    List.iteri (fun idx (i, v) -> \n      let c = idx + if idx < col - 1 then 1 else 2 in\n      arr.(i) <- c;\n      Queue.add (v, c) que;\n    ) children;\n\n  done;\n  Printf.printf \"%d\\n\" k;\n  Array.iter (Printf.printf \"%d\\n\") arr;\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a tree G with N vertices.\nThe vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.\n\nConsider painting the edges in G with some number of colors.\nWe want to paint them so that, for each vertex, the colors of the edges incident to that vertex are all different.\n\nAmong the colorings satisfying the condition above, construct one that uses the minimum number of colors.\n\nConstraints\n\n2 \\le N \\le 10^5\n\n1 \\le a_i \\lt b_i \\le N\n\nAll values in input are integers.\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\na_2 b_2\n\\vdots\na_{N-1} b_{N-1}\n\nOutput\n\nPrint N lines.\n\nThe first line should contain K, the number of colors used.\n\nThe (i+1)-th line (1 \\le i \\le N-1) should contain c_i, the integer representing the color of the i-th edge, where 1 \\le c_i \\le K must hold.\n\nIf there are multiple colorings with the minimum number of colors that satisfy the condition, printing any of them will be accepted.\n\nSample Input 1\n\n3\n1 2\n2 3\n\nSample Output 1\n\n2\n1\n2\n\nSample Input 2\n\n8\n1 2\n2 3\n2 4\n2 5\n4 7\n5 6\n6 8\n\nSample Output 2\n\n4\n1\n2\n3\n4\n1\n1\n2\n\nSample Input 3\n\n6\n1 2\n1 3\n1 4\n1 5\n1 6\n\nSample Output 3\n\n5\n1\n2\n3\n4\n5", "sample_input": "3\n1 2\n2 3\n"}, "reference_outputs": ["2\n1\n2\n"], "source_document_id": "p02850", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a tree G with N vertices.\nThe vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.\n\nConsider painting the edges in G with some number of colors.\nWe want to paint them so that, for each vertex, the colors of the edges incident to that vertex are all different.\n\nAmong the colorings satisfying the condition above, construct one that uses the minimum number of colors.\n\nConstraints\n\n2 \\le N \\le 10^5\n\n1 \\le a_i \\lt b_i \\le N\n\nAll values in input are integers.\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\na_2 b_2\n\\vdots\na_{N-1} b_{N-1}\n\nOutput\n\nPrint N lines.\n\nThe first line should contain K, the number of colors used.\n\nThe (i+1)-th line (1 \\le i \\le N-1) should contain c_i, the integer representing the color of the i-th edge, where 1 \\le c_i \\le K must hold.\n\nIf there are multiple colorings with the minimum number of colors that satisfy the condition, printing any of them will be accepted.\n\nSample Input 1\n\n3\n1 2\n2 3\n\nSample Output 1\n\n2\n1\n2\n\nSample Input 2\n\n8\n1 2\n2 3\n2 4\n2 5\n4 7\n5 6\n6 8\n\nSample Output 2\n\n4\n1\n2\n3\n4\n1\n1\n2\n\nSample Input 3\n\n6\n1 2\n1 3\n1 4\n1 5\n1 6\n\nSample Output 3\n\n5\n1\n2\n3\n4\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1175, "cpu_time_ms": 479, "memory_kb": 42224}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s991163581", "group_id": "codeNet:p02850", "input_text": "type edge = {a: int; b: int; i: int}\n\nlet degrees edges =\n  let n = (List.length edges) + 1 in\n  let rec helper edges acc =\n    match edges with\n    | [] -> acc\n    | {a=a; b=b} :: rst ->\n      acc.(a) <- acc.(a) + 1;\n      acc.(b) <- acc.(b) + 1;\n      helper rst acc in\n  helper edges (Array.make n 0)\n;;\n\nlet solve n edges =\n  let k =\n    let rec find_max l i m =\n      if i == Array.length l then m\n      else if l.(i) > m then find_max l (i+1) l.(i)\n      else find_max l (i+1) m in\n    find_max (degrees edges) 0 0 in\n  let p = Array.make n 0 in\n  let cs = Array.make (n-1) 0 in\n  let rec choose_color es prev cnt =\n    match es with\n    | [] -> cs\n    | e :: rst ->\n      let cnt = if e.a == prev then cnt else 0 in\n      let color = if e.a == 0 then cnt\n        else if cnt < p.(e.a) then cnt else cnt + 1 in\n      p.(e.b) <- color; cs.(e.i) <- color;\n      choose_color rst e.a (cnt+1) in\n  (k, choose_color edges 0 0)\n;;\n\nlet read () =\n  let n = read_int () in\n  let rec read_edges i acc =\n    if i == n-1 then acc else\n      let input = Str.split (Str.regexp \" \") (read_line ()) in\n      let a::b::[] = List.map int_of_string input in\n      let edge = {a=a-1; b=b-1; i=i} in\n      read_edges (i+1) (edge :: acc) in\n  let edges = List.sort (fun e1 e2 -> e1.a - e2.a) (read_edges 0 []) in\n  (n, edges) in\nlet print k colors =\n  print_endline (string_of_int k);\n  for i = 0 to ((Array.length colors) - 1) do\n    print_endline (string_of_int (colors.(i) + 1))\n  done in\nlet n, edges = read() in\nlet k, colors = solve n edges in\nprint k colors\n", "language": "OCaml", "metadata": {"date": 1575432656, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02850.html", "problem_id": "p02850", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02850/input.txt", "sample_output_relpath": "derived/input_output/data/p02850/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02850/OCaml/s991163581.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s991163581", "user_id": "u320354968"}, "prompt_components": {"gold_output": "2\n1\n2\n", "input_to_evaluate": "type edge = {a: int; b: int; i: int}\n\nlet degrees edges =\n  let n = (List.length edges) + 1 in\n  let rec helper edges acc =\n    match edges with\n    | [] -> acc\n    | {a=a; b=b} :: rst ->\n      acc.(a) <- acc.(a) + 1;\n      acc.(b) <- acc.(b) + 1;\n      helper rst acc in\n  helper edges (Array.make n 0)\n;;\n\nlet solve n edges =\n  let k =\n    let rec find_max l i m =\n      if i == Array.length l then m\n      else if l.(i) > m then find_max l (i+1) l.(i)\n      else find_max l (i+1) m in\n    find_max (degrees edges) 0 0 in\n  let p = Array.make n 0 in\n  let cs = Array.make (n-1) 0 in\n  let rec choose_color es prev cnt =\n    match es with\n    | [] -> cs\n    | e :: rst ->\n      let cnt = if e.a == prev then cnt else 0 in\n      let color = if e.a == 0 then cnt\n        else if cnt < p.(e.a) then cnt else cnt + 1 in\n      p.(e.b) <- color; cs.(e.i) <- color;\n      choose_color rst e.a (cnt+1) in\n  (k, choose_color edges 0 0)\n;;\n\nlet read () =\n  let n = read_int () in\n  let rec read_edges i acc =\n    if i == n-1 then acc else\n      let input = Str.split (Str.regexp \" \") (read_line ()) in\n      let a::b::[] = List.map int_of_string input in\n      let edge = {a=a-1; b=b-1; i=i} in\n      read_edges (i+1) (edge :: acc) in\n  let edges = List.sort (fun e1 e2 -> e1.a - e2.a) (read_edges 0 []) in\n  (n, edges) in\nlet print k colors =\n  print_endline (string_of_int k);\n  for i = 0 to ((Array.length colors) - 1) do\n    print_endline (string_of_int (colors.(i) + 1))\n  done in\nlet n, edges = read() in\nlet k, colors = solve n edges in\nprint k colors\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is a tree G with N vertices.\nThe vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.\n\nConsider painting the edges in G with some number of colors.\nWe want to paint them so that, for each vertex, the colors of the edges incident to that vertex are all different.\n\nAmong the colorings satisfying the condition above, construct one that uses the minimum number of colors.\n\nConstraints\n\n2 \\le N \\le 10^5\n\n1 \\le a_i \\lt b_i \\le N\n\nAll values in input are integers.\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\na_2 b_2\n\\vdots\na_{N-1} b_{N-1}\n\nOutput\n\nPrint N lines.\n\nThe first line should contain K, the number of colors used.\n\nThe (i+1)-th line (1 \\le i \\le N-1) should contain c_i, the integer representing the color of the i-th edge, where 1 \\le c_i \\le K must hold.\n\nIf there are multiple colorings with the minimum number of colors that satisfy the condition, printing any of them will be accepted.\n\nSample Input 1\n\n3\n1 2\n2 3\n\nSample Output 1\n\n2\n1\n2\n\nSample Input 2\n\n8\n1 2\n2 3\n2 4\n2 5\n4 7\n5 6\n6 8\n\nSample Output 2\n\n4\n1\n2\n3\n4\n1\n1\n2\n\nSample Input 3\n\n6\n1 2\n1 3\n1 4\n1 5\n1 6\n\nSample Output 3\n\n5\n1\n2\n3\n4\n5", "sample_input": "3\n1 2\n2 3\n"}, "reference_outputs": ["2\n1\n2\n"], "source_document_id": "p02850", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is a tree G with N vertices.\nThe vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.\n\nConsider painting the edges in G with some number of colors.\nWe want to paint them so that, for each vertex, the colors of the edges incident to that vertex are all different.\n\nAmong the colorings satisfying the condition above, construct one that uses the minimum number of colors.\n\nConstraints\n\n2 \\le N \\le 10^5\n\n1 \\le a_i \\lt b_i \\le N\n\nAll values in input are integers.\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\na_2 b_2\n\\vdots\na_{N-1} b_{N-1}\n\nOutput\n\nPrint N lines.\n\nThe first line should contain K, the number of colors used.\n\nThe (i+1)-th line (1 \\le i \\le N-1) should contain c_i, the integer representing the color of the i-th edge, where 1 \\le c_i \\le K must hold.\n\nIf there are multiple colorings with the minimum number of colors that satisfy the condition, printing any of them will be accepted.\n\nSample Input 1\n\n3\n1 2\n2 3\n\nSample Output 1\n\n2\n1\n2\n\nSample Input 2\n\n8\n1 2\n2 3\n2 4\n2 5\n4 7\n5 6\n6 8\n\nSample Output 2\n\n4\n1\n2\n3\n4\n1\n1\n2\n\nSample Input 3\n\n6\n1 2\n1 3\n1 4\n1 5\n1 6\n\nSample Output 3\n\n5\n1\n2\n3\n4\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1550, "cpu_time_ms": 372, "memory_kb": 19200}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s826277421", "group_id": "codeNet:p02851", "input_text": "module M = Map.Make (struct type t = int let compare = compare end)\n\nlet () =\n    let split s =\n        let rec loop i cur flag acc =\n            if i = String.length s then ( if flag then cur :: acc else acc) else (\n                match flag, s.[i] with\n                | true,  ' ' -> loop (i + 1) \"\" false (cur :: acc)\n                | false, ' ' -> loop (i + 1) \"\" false acc\n                | true,  v   -> loop (i + 1) (Printf.sprintf \"%s%c\" cur v) true acc\n                | false, v   -> loop (i + 1) (Printf.sprintf \"%s%c\" cur v) true acc\n            )\n        in\n        List.map int_of_string (List.rev (loop 0 \"\" false []))\n    in\n    let main () =\n        let n, k = Scanf.sscanf (read_line ()) \"%d %d\" (fun n k -> n, k) in\n        let a = Array.of_list (split (read_line ())) in\n        let arr = Array.make (n + 1) 0 in\n        let rec loop i sum =\n            if i < n then (\n                let sum = sum + a.(i) - 1 in\n                arr.(i + 1) <- sum mod k;\n                loop (i + 1) sum\n            )\n        in\n        loop 0 0;\n        let add k v map = M.add k (v + try M.find k map with _ -> 0) map in\n        let rec loop i map acc =\n            if i > n then acc else\n                let map = if i >= k then add arr.(i - k) (-1) map else map in\n                let acc = acc + try M.find arr.(i) map with _ -> 0 in\n                let map = add arr.(i) 1 map in\n                loop (i + 1) map acc\n        in\n        let r = loop 1 (M.add 0 1 M.empty) 0 in\n        Printf.printf \"%d\\n\" r\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1574654012, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s826277421.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s826277421", "user_id": "u342443598"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "module M = Map.Make (struct type t = int let compare = compare end)\n\nlet () =\n    let split s =\n        let rec loop i cur flag acc =\n            if i = String.length s then ( if flag then cur :: acc else acc) else (\n                match flag, s.[i] with\n                | true,  ' ' -> loop (i + 1) \"\" false (cur :: acc)\n                | false, ' ' -> loop (i + 1) \"\" false acc\n                | true,  v   -> loop (i + 1) (Printf.sprintf \"%s%c\" cur v) true acc\n                | false, v   -> loop (i + 1) (Printf.sprintf \"%s%c\" cur v) true acc\n            )\n        in\n        List.map int_of_string (List.rev (loop 0 \"\" false []))\n    in\n    let main () =\n        let n, k = Scanf.sscanf (read_line ()) \"%d %d\" (fun n k -> n, k) in\n        let a = Array.of_list (split (read_line ())) in\n        let arr = Array.make (n + 1) 0 in\n        let rec loop i sum =\n            if i < n then (\n                let sum = sum + a.(i) - 1 in\n                arr.(i + 1) <- sum mod k;\n                loop (i + 1) sum\n            )\n        in\n        loop 0 0;\n        let add k v map = M.add k (v + try M.find k map with _ -> 0) map in\n        let rec loop i map acc =\n            if i > n then acc else\n                let map = if i >= k then add arr.(i - k) (-1) map else map in\n                let acc = acc + try M.find arr.(i) map with _ -> 0 in\n                let map = add arr.(i) 1 map in\n                loop (i + 1) map acc\n        in\n        let r = loop 1 (M.add 0 1 M.empty) 0 in\n        Printf.printf \"%d\\n\" r\n    in\n    main ()", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1540, "cpu_time_ms": 594, "memory_kb": 34568}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s649364862", "group_id": "codeNet:p02856", "input_text": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list ?sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list ?sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list ?sep conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet m = scan \"%d\" id\nlet ls = scan_lines m \"%d %d\" Tuple2.make\n\nlet rec calc v n =\n  if n = 1 then (v, 0)\n  else\n    let (w, m) = if v * 2 / 10 = 1 then\n        v*2 mod 10 + v*2 / 10, 2\n      else v * 2, 1\n    in\n    let (x, o) = calc w (n/2) in\n    if n mod 2 = 0 then\n      (x, n/2 * m + o)\n    else\n      ((v+x) mod 10 + v*2/10, n/2 * m + o + 1 + (v+x)/10)\n\nlet () =\n  ListL.map ls ~f:(fun (v, n) ->\n      calc v n)\n  |> List.reduce (fun (v,n) (w, m) ->\n      ((v+w) mod 10, n + m + 1 + (v+w)/10))\n  |> Tuple2.second\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1590904897, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s649364862.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s649364862", "user_id": "u802614675"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list ?sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list ?sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list ?sep conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet m = scan \"%d\" id\nlet ls = scan_lines m \"%d %d\" Tuple2.make\n\nlet rec calc v n =\n  if n = 1 then (v, 0)\n  else\n    let (w, m) = if v * 2 / 10 = 1 then\n        v*2 mod 10 + v*2 / 10, 2\n      else v * 2, 1\n    in\n    let (x, o) = calc w (n/2) in\n    if n mod 2 = 0 then\n      (x, n/2 * m + o)\n    else\n      ((v+x) mod 10 + v*2/10, n/2 * m + o + 1 + (v+x)/10)\n\nlet () =\n  ListL.map ls ~f:(fun (v, n) ->\n      calc v n)\n  |> List.reduce (fun (v,n) (w, m) ->\n      ((v+w) mod 10, n + m + 1 + (v+w)/10))\n  |> Tuple2.second\n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score: 500 points\n\nProblem Statement\n\nN programmers are going to participate in the preliminary stage of DDCC 20XX. Due to the size of the venue, however, at most 9 contestants can participate in the finals.\n\nThe preliminary stage consists of several rounds, which will take place as follows:\n\nAll the N contestants will participate in the first round.\n\nWhen X contestants participate in some round, the number of contestants advancing to the next round will be decided as follows:\n\nThe organizer will choose two consecutive digits in the decimal notation of X, and replace them with the sum of these digits. The number resulted will be the number of contestants advancing to the next round.\n\nFor example, when X = 2378, the number of contestants advancing to the next round will be 578 (if 2 and 3 are chosen), 2108 (if 3 and 7 are chosen), or 2315 (if 7 and 8 are chosen).\n\nWhen X = 100, the number of contestants advancing to the next round will be 10, no matter which two digits are chosen.\n\nThe preliminary stage ends when 9 or fewer contestants remain.\n\nRingo, the chief organizer, wants to hold as many rounds as possible.\nFind the maximum possible number of rounds in the preliminary stage.\n\nSince the number of contestants, N, can be enormous, it is given to you as two integer sequences d_1, \\ldots, d_M and c_1, \\ldots, c_M, which means the following: the decimal notation of N consists of c_1 + c_2 + \\ldots + c_M digits, whose first c_1 digits are all d_1, the following c_2 digits are all d_2, \\ldots, and the last c_M digits are all d_M.\n\nConstraints\n\n1 \\leq M \\leq 200000\n\n0 \\leq d_i \\leq 9\n\nd_1 \\neq 0\n\nd_i \\neq d_{i+1}\n\nc_i \\geq 1\n\n2 \\leq c_1 + \\ldots + c_M \\leq 10^{15}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM\nd_1 c_1\nd_2 c_2\n:\nd_M c_M\n\nOutput\n\nPrint the maximum possible number of rounds in the preliminary stage.\n\nSample Input 1\n\n2\n2 2\n9 1\n\nSample Output 1\n\n3\n\nIn this case, N = 229 contestants will participate in the first round. One possible progression of the preliminary stage is as follows:\n\n229 contestants participate in Round 1, 49 contestants participate in Round 2, 13 contestants participate in Round 3, and 4 contestants advance to the finals.\n\nHere, three rounds take place in the preliminary stage, which is the maximum possible number.\n\nSample Input 2\n\n3\n1 1\n0 8\n7 1\n\nSample Output 2\n\n9\n\nIn this case, 1000000007 will participate in the first round.", "sample_input": "2\n2 2\n9 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02856", "source_text": "Score: 500 points\n\nProblem Statement\n\nN programmers are going to participate in the preliminary stage of DDCC 20XX. Due to the size of the venue, however, at most 9 contestants can participate in the finals.\n\nThe preliminary stage consists of several rounds, which will take place as follows:\n\nAll the N contestants will participate in the first round.\n\nWhen X contestants participate in some round, the number of contestants advancing to the next round will be decided as follows:\n\nThe organizer will choose two consecutive digits in the decimal notation of X, and replace them with the sum of these digits. The number resulted will be the number of contestants advancing to the next round.\n\nFor example, when X = 2378, the number of contestants advancing to the next round will be 578 (if 2 and 3 are chosen), 2108 (if 3 and 7 are chosen), or 2315 (if 7 and 8 are chosen).\n\nWhen X = 100, the number of contestants advancing to the next round will be 10, no matter which two digits are chosen.\n\nThe preliminary stage ends when 9 or fewer contestants remain.\n\nRingo, the chief organizer, wants to hold as many rounds as possible.\nFind the maximum possible number of rounds in the preliminary stage.\n\nSince the number of contestants, N, can be enormous, it is given to you as two integer sequences d_1, \\ldots, d_M and c_1, \\ldots, c_M, which means the following: the decimal notation of N consists of c_1 + c_2 + \\ldots + c_M digits, whose first c_1 digits are all d_1, the following c_2 digits are all d_2, \\ldots, and the last c_M digits are all d_M.\n\nConstraints\n\n1 \\leq M \\leq 200000\n\n0 \\leq d_i \\leq 9\n\nd_1 \\neq 0\n\nd_i \\neq d_{i+1}\n\nc_i \\geq 1\n\n2 \\leq c_1 + \\ldots + c_M \\leq 10^{15}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM\nd_1 c_1\nd_2 c_2\n:\nd_M c_M\n\nOutput\n\nPrint the maximum possible number of rounds in the preliminary stage.\n\nSample Input 1\n\n2\n2 2\n9 1\n\nSample Output 1\n\n3\n\nIn this case, N = 229 contestants will participate in the first round. One possible progression of the preliminary stage is as follows:\n\n229 contestants participate in Round 1, 49 contestants participate in Round 2, 13 contestants participate in Round 3, and 4 contestants advance to the finals.\n\nHere, three rounds take place in the preliminary stage, which is the maximum possible number.\n\nSample Input 2\n\n3\n1 1\n0 8\n7 1\n\nSample Output 2\n\n9\n\nIn this case, 1000000007 will participate in the first round.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2550, "cpu_time_ms": 282, "memory_kb": 24704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s501646958", "group_id": "codeNet:p02859", "input_text": "let r = read_int ()\nlet _ = print_endline (string_of_int (r * r))", "language": "OCaml", "metadata": {"date": 1583899910, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s501646958.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s501646958", "user_id": "u511870776"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let r = read_int ()\nlet _ = print_endline (string_of_int (r * r))", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 65, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s634208122", "group_id": "codeNet:p02859", "input_text": "let input = int_of_string(read_line()) in\n    print_int(input*input)", "language": "OCaml", "metadata": {"date": 1583204373, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s634208122.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s634208122", "user_id": "u697502900"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let input = int_of_string(read_line()) in\n    print_int(input*input)", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 68, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s183222087", "group_id": "codeNet:p02862", "input_text": "let m = 1000000007\nlet ( * ) a b = a * b mod m\nlet rec f n a = if n <= 1 then a else f (n - 1) (a * n)\nlet rec g b n = if n <= 0 then 1 else let p = g b (n / 2) in p * p * if n mod 2 = 0 then 1 else b\nlet c n r = if n < r || n < 0 || r < 0 then 0 else f n 1 * g (f r 1) (m - 2) * g (f (n - r) 1) (m - 2)\nlet _ = Scanf.scanf \"%d %d\" @@ fun x y -> Printf.printf \"%d\\n\" @@ if (x + y) mod 3 > 0 then 0 else c ((x + y) / 3) (y - (x + y) / 3)", "language": "OCaml", "metadata": {"date": 1581793604, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s183222087.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s183222087", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let m = 1000000007\nlet ( * ) a b = a * b mod m\nlet rec f n a = if n <= 1 then a else f (n - 1) (a * n)\nlet rec g b n = if n <= 0 then 1 else let p = g b (n / 2) in p * p * if n mod 2 = 0 then 1 else b\nlet c n r = if n < r || n < 0 || r < 0 then 0 else f n 1 * g (f r 1) (m - 2) * g (f (n - r) 1) (m - 2)\nlet _ = Scanf.scanf \"%d %d\" @@ fun x y -> Printf.printf \"%d\\n\" @@ if (x + y) mod 3 > 0 then 0 else c ((x + y) / 3) (y - (x + y) / 3)", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 10, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s192093597", "group_id": "codeNet:p02862", "input_text": "let rec power ( * ) e m n =\n  if n <= 0 then e\n  else power ( * ) (if n land 1 = 0 then e else m * e) (m * m) (n lsr 1)\n\nlet m = 1000000007\nlet ( *^ ) x y = (x * y) mod m\n\nlet perm n k = Array.fold_left ( *^ ) 1 @@ Array.init k @@ ( + ) @@ n - k + 1\nlet comb n k = power ( *^ ) (perm n k) (perm k k) (m - 2)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun x y ->\n  Printf.printf \"%d\\n\" @@ if\n    2 * x - y < 0 ||\n    0 < (2 * x - y) mod 3 ||\n    2 * y - x < 0 ||\n    0 < (2 * y - x) mod 3\n  then 0\n  else comb ((x + y) / 3) ((2 * x - y) / 3)\n", "language": "OCaml", "metadata": {"date": 1573958309, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s192093597.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s192093597", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let rec power ( * ) e m n =\n  if n <= 0 then e\n  else power ( * ) (if n land 1 = 0 then e else m * e) (m * m) (n lsr 1)\n\nlet m = 1000000007\nlet ( *^ ) x y = (x * y) mod m\n\nlet perm n k = Array.fold_left ( *^ ) 1 @@ Array.init k @@ ( + ) @@ n - k + 1\nlet comb n k = power ( *^ ) (perm n k) (perm k k) (m - 2)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun x y ->\n  Printf.printf \"%d\\n\" @@ if\n    2 * x - y < 0 ||\n    0 < (2 * x - y) mod 3 ||\n    2 * y - x < 0 ||\n    0 < (2 * y - x) mod 3\n  then 0\n  else comb ((x + y) / 3) ((2 * x - y) / 3)\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 533, "cpu_time_ms": 15, "memory_kb": 8320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s035767894", "group_id": "codeNet:p02865", "input_text": "Scanf.sscanf (read_line ()) \"%d\" (fun a -> let r = (a - 1) / 2 in Printf.printf \"%d\\n\" r)", "language": "OCaml", "metadata": {"date": 1573351260, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02865.html", "problem_id": "p02865", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02865/input.txt", "sample_output_relpath": "derived/input_output/data/p02865/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02865/OCaml/s035767894.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s035767894", "user_id": "u342443598"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "Scanf.sscanf (read_line ()) \"%d\" (fun a -> let r = (a - 1) / 2 in Printf.printf \"%d\\n\" r)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHow many ways are there to choose two distinct positive integers totaling N, disregarding the order?\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n1\n\nThere is only one way to choose two distinct integers totaling 4: to choose 1 and 3. (Choosing 3 and 1 is not considered different from this.)\n\nSample Input 2\n\n999999\n\nSample Output 2\n\n499999", "sample_input": "4\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02865", "source_text": "Score : 100 points\n\nProblem Statement\n\nHow many ways are there to choose two distinct positive integers totaling N, disregarding the order?\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n1\n\nThere is only one way to choose two distinct integers totaling 4: to choose 1 and 3. (Choosing 3 and 1 is not considered different from this.)\n\nSample Input 2\n\n999999\n\nSample Output 2\n\n499999", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 89, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s627166986", "group_id": "codeNet:p02873", "input_text": "let id x = x\n\nlet init n f =\n  let rec g i ns = if i = 0 then 0 :: ns else g (i - 1) (i :: ns) in\n  List.map f (g n [])\n\nlet split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\n\nlet s = split_string @@ Scanf.scanf \"%s\\n\" id\n\nlet f (lst, arr) a =\n  match arr with\n    | [] -> failwith \"\"\n    | x :: xs -> (a, if a = lst then (x + 1) :: xs else 1 :: x :: xs)\n\nlet ss = \n  let t = List.rev_append \n    (if List.hd (List.rev s) = \"<\" then [0] else [])\n    (snd @@ List.fold_left f (List.hd s, [1]) (List.tl s)) in\n  if List.hd s = \">\" then 0 :: t else t\n\nlet rec g = function\n  | ([] | _ :: []) -> []\n  | x :: y :: xs -> if x > y then x :: (y - 1) :: g xs else (x - 1) :: y :: g xs\n\nlet () = \n  ss\n    |> g \n    |> List.map (fun i -> i * (i + 1) / 2) \n    |> List.fold_left (+) 0\n    |> print_int;\n  print_newline ()", "language": "OCaml", "metadata": {"date": 1588605700, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s627166986.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s627166986", "user_id": "u811309788"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let id x = x\n\nlet init n f =\n  let rec g i ns = if i = 0 then 0 :: ns else g (i - 1) (i :: ns) in\n  List.map f (g n [])\n\nlet split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\n\nlet s = split_string @@ Scanf.scanf \"%s\\n\" id\n\nlet f (lst, arr) a =\n  match arr with\n    | [] -> failwith \"\"\n    | x :: xs -> (a, if a = lst then (x + 1) :: xs else 1 :: x :: xs)\n\nlet ss = \n  let t = List.rev_append \n    (if List.hd (List.rev s) = \"<\" then [0] else [])\n    (snd @@ List.fold_left f (List.hd s, [1]) (List.tl s)) in\n  if List.hd s = \">\" then 0 :: t else t\n\nlet rec g = function\n  | ([] | _ :: []) -> []\n  | x :: y :: xs -> if x > y then x :: (y - 1) :: g xs else (x - 1) :: y :: g xs\n\nlet () = \n  ss\n    |> g \n    |> List.map (fun i -> i * (i + 1) / 2) \n    |> List.fold_left (+) 0\n    |> print_int;\n  print_newline ()", "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+1}\n\nIf S_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+1}\n\nIf S_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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 821, "cpu_time_ms": 271, "memory_kb": 62720}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s034619857", "group_id": "codeNet:p02874", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let l = Array.make n 0 in\n    let r = Array.make n 0 in\n    for i = 0 to n - 1 do\n        Scanf.scanf \" %d %d\" (fun a b -> l.(i) <- a; r.(i) <- b + 1)\n    done;\n\n    let rec loop i p q =\n        if i = n then p, q else\n            let p = if l.(i) > l.(p) then i else p in\n            let q = if r.(i) < r.(q) then i else q in\n            loop (i + 1) p q\n    in\n    let p, q = loop 0 0 0 in\n\n    let result1 =\n        let rec loop j acc =\n            if j = n then acc + max (r.(q) - l.(p)) 0 else\n            if j = p || j = q then loop (j + 1) acc else\n                loop (j + 1) (max acc (r.(j) - l.(j)))\n        in\n        loop 0 0\n    in\n \n    Printf.printf \"%d\\n\" @@ (\n        let work = Array.init n (fun i -> max (r.(i) - l.(p)) 0, max (r.(q) - l.(i)) 0) in\n        Array.sort (fun (a0, b0) (a1, b1) -> compare (a0, -b0) (a1, -b1)) work;\n        let s = Array.make (n + 1) 0 in\n        let t = Array.make (n + 1) 0 in\n        t.(0) <- r.(q) - l.(q);\n        s.(n) <- r.(p) - l.(p);\n        for i = 1 to n do\n            t.(i) <- min t.(i - 1) (snd work.(i - 1));\n        done;\n        for i = n - 1 downto 0 do\n            s.(i) <- min s.(i + 1) (fst work.(i));\n        done;\n\n        let rec loop i acc =\n            if i = n + 1 then acc else loop (i + 1) (max acc (s.(i) + t.(i)))\n        in\n        loop 0 result1\n    )\n)", "language": "OCaml", "metadata": {"date": 1599409384, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02874.html", "problem_id": "p02874", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02874/input.txt", "sample_output_relpath": "derived/input_output/data/p02874/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02874/OCaml/s034619857.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s034619857", "user_id": "u342443598"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let l = Array.make n 0 in\n    let r = Array.make n 0 in\n    for i = 0 to n - 1 do\n        Scanf.scanf \" %d %d\" (fun a b -> l.(i) <- a; r.(i) <- b + 1)\n    done;\n\n    let rec loop i p q =\n        if i = n then p, q else\n            let p = if l.(i) > l.(p) then i else p in\n            let q = if r.(i) < r.(q) then i else q in\n            loop (i + 1) p q\n    in\n    let p, q = loop 0 0 0 in\n\n    let result1 =\n        let rec loop j acc =\n            if j = n then acc + max (r.(q) - l.(p)) 0 else\n            if j = p || j = q then loop (j + 1) acc else\n                loop (j + 1) (max acc (r.(j) - l.(j)))\n        in\n        loop 0 0\n    in\n \n    Printf.printf \"%d\\n\" @@ (\n        let work = Array.init n (fun i -> max (r.(i) - l.(p)) 0, max (r.(q) - l.(i)) 0) in\n        Array.sort (fun (a0, b0) (a1, b1) -> compare (a0, -b0) (a1, -b1)) work;\n        let s = Array.make (n + 1) 0 in\n        let t = Array.make (n + 1) 0 in\n        t.(0) <- r.(q) - l.(q);\n        s.(n) <- r.(p) - l.(p);\n        for i = 1 to n do\n            t.(i) <- min t.(i - 1) (snd work.(i - 1));\n        done;\n        for i = n - 1 downto 0 do\n            s.(i) <- min s.(i + 1) (fst work.(i));\n        done;\n\n        let rec loop i acc =\n            if i = n + 1 then acc else loop (i + 1) (max acc (s.(i) + t.(i)))\n        in\n        loop 0 result1\n    )\n)", "problem_context": "Score : 600 points\n\nProblem Statement\n\n10^9 contestants, numbered 1 to 10^9, will compete in a competition.\nThere will be two contests in this competition.\n\nThe organizer prepared N problems, numbered 1 to N, to use in these contests.\nWhen Problem i is presented in a contest, it will be solved by all contestants from Contestant L_i to Contestant R_i (inclusive), and will not be solved by any other contestants.\n\nThe organizer will use these N problems in the two contests.\nEach problem must be used in exactly one of the contests, and each contest must have at least one problem.\n\nThe joyfulness of each contest is the number of contestants who will solve all the problems in the contest.\nFind the maximum possible total joyfulness of the two contests.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 R_1\nL_2 R_2\n\\vdots\nL_N R_N\n\nOutput\n\nPrint the maximum possible total joyfulness of the two contests.\n\nSample Input 1\n\n4\n4 7\n1 4\n5 8\n2 5\n\nSample Output 1\n\n6\n\nThe optimal choice is:\n\nUse Problem 1 and 3 in the first contest. Contestant 5, 6, and 7 will solve both of them, so the joyfulness of this contest is 3.\n\nUse Problem 2 and 4 in the second contest. Contestant 2, 3, and 4 will solve both of them, so the joyfulness of this contest is 3.\n\nThe total joyfulness of these two contests is 6. We cannot make the total joyfulness greater than 6.\n\nSample Input 2\n\n4\n1 20\n2 19\n3 18\n4 17\n\nSample Output 2\n\n34\n\nSample Input 3\n\n10\n457835016 996058008\n456475528 529149798\n455108441 512701454\n455817105 523506955\n457368248 814532746\n455073228 459494089\n456651538 774276744\n457667152 974637457\n457293701 800549465\n456580262 636471526\n\nSample Output 3\n\n540049931", "sample_input": "4\n4 7\n1 4\n5 8\n2 5\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02874", "source_text": "Score : 600 points\n\nProblem Statement\n\n10^9 contestants, numbered 1 to 10^9, will compete in a competition.\nThere will be two contests in this competition.\n\nThe organizer prepared N problems, numbered 1 to N, to use in these contests.\nWhen Problem i is presented in a contest, it will be solved by all contestants from Contestant L_i to Contestant R_i (inclusive), and will not be solved by any other contestants.\n\nThe organizer will use these N problems in the two contests.\nEach problem must be used in exactly one of the contests, and each contest must have at least one problem.\n\nThe joyfulness of each contest is the number of contestants who will solve all the problems in the contest.\nFind the maximum possible total joyfulness of the two contests.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 R_1\nL_2 R_2\n\\vdots\nL_N R_N\n\nOutput\n\nPrint the maximum possible total joyfulness of the two contests.\n\nSample Input 1\n\n4\n4 7\n1 4\n5 8\n2 5\n\nSample Output 1\n\n6\n\nThe optimal choice is:\n\nUse Problem 1 and 3 in the first contest. Contestant 5, 6, and 7 will solve both of them, so the joyfulness of this contest is 3.\n\nUse Problem 2 and 4 in the second contest. Contestant 2, 3, and 4 will solve both of them, so the joyfulness of this contest is 3.\n\nThe total joyfulness of these two contests is 6. We cannot make the total joyfulness greater than 6.\n\nSample Input 2\n\n4\n1 20\n2 19\n3 18\n4 17\n\nSample Output 2\n\n34\n\nSample Input 3\n\n10\n457835016 996058008\n456475528 529149798\n455108441 512701454\n455817105 523506955\n457368248 814532746\n455073228 459494089\n456651538 774276744\n457667152 974637457\n457293701 800549465\n456580262 636471526\n\nSample Output 3\n\n540049931", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1367, "cpu_time_ms": 136, "memory_kb": 12860}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s706658979", "group_id": "codeNet:p02874", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let l = Array.make n 0 in\n    let r = Array.make n 0 in\n    for i = 0 to n - 1 do\n        Scanf.scanf \" %d %d\" (fun a b -> l.(i) <- a; r.(i) <- b + 1)\n    done;\n\n    let rec loop i p q =\n        if i = n then p, q else\n            let p = if l.(i) > l.(p) then i else p in\n            let q = if r.(i) < r.(q) then i else q in\n            loop (i + 1) p q\n    in\n    let p, q = loop 0 0 0 in\n\n    let result1 =\n        let rec loop j acc =\n            if j = n then acc + max (r.(q) - l.(p)) 0 else\n            if j = p || j = q then loop (j + 1) acc else\n                loop (j + 1) (max acc (r.(j) - l.(j)))\n        in\n        loop 0 0\n    in\n \n    let result2 = (\n        let work = Array.init n (fun i -> max (r.(i) - l.(p)) 0, max (r.(q) - l.(i)) 0) in\n        Array.sort (fun (a0, b0) (a1, b1) -> compare (-b0, a0) (-b1, a1)) work;\n        let s = Array.make (n + 1) 0 in\n        let t = Array.make (n + 1) 0 in\n        t.(0) <- r.(q) - l.(q);\n        s.(n) <- r.(p) - l.(p);\n        for i = 1 to n do\n            let _, b = work.(i - 1) in\n            t.(i) <- min t.(i - 1) b;\n        done;\n        for i = n - 1 downto 0 do\n            let a, _ = work.(i) in\n            s.(i) <- min s.(i + 1) a;\n        done;\n\n        let rec loop i acc =\n            if i = n + 1 then acc else loop (i + 1) (max acc (s.(i) + t.(i)))\n        in\n        loop 0 result1\n    )\n    in\n    Printf.printf \"%d\\n\" result1\n)", "language": "OCaml", "metadata": {"date": 1599409252, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02874.html", "problem_id": "p02874", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02874/input.txt", "sample_output_relpath": "derived/input_output/data/p02874/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02874/OCaml/s706658979.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s706658979", "user_id": "u342443598"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let l = Array.make n 0 in\n    let r = Array.make n 0 in\n    for i = 0 to n - 1 do\n        Scanf.scanf \" %d %d\" (fun a b -> l.(i) <- a; r.(i) <- b + 1)\n    done;\n\n    let rec loop i p q =\n        if i = n then p, q else\n            let p = if l.(i) > l.(p) then i else p in\n            let q = if r.(i) < r.(q) then i else q in\n            loop (i + 1) p q\n    in\n    let p, q = loop 0 0 0 in\n\n    let result1 =\n        let rec loop j acc =\n            if j = n then acc + max (r.(q) - l.(p)) 0 else\n            if j = p || j = q then loop (j + 1) acc else\n                loop (j + 1) (max acc (r.(j) - l.(j)))\n        in\n        loop 0 0\n    in\n \n    let result2 = (\n        let work = Array.init n (fun i -> max (r.(i) - l.(p)) 0, max (r.(q) - l.(i)) 0) in\n        Array.sort (fun (a0, b0) (a1, b1) -> compare (-b0, a0) (-b1, a1)) work;\n        let s = Array.make (n + 1) 0 in\n        let t = Array.make (n + 1) 0 in\n        t.(0) <- r.(q) - l.(q);\n        s.(n) <- r.(p) - l.(p);\n        for i = 1 to n do\n            let _, b = work.(i - 1) in\n            t.(i) <- min t.(i - 1) b;\n        done;\n        for i = n - 1 downto 0 do\n            let a, _ = work.(i) in\n            s.(i) <- min s.(i + 1) a;\n        done;\n\n        let rec loop i acc =\n            if i = n + 1 then acc else loop (i + 1) (max acc (s.(i) + t.(i)))\n        in\n        loop 0 result1\n    )\n    in\n    Printf.printf \"%d\\n\" result1\n)", "problem_context": "Score : 600 points\n\nProblem Statement\n\n10^9 contestants, numbered 1 to 10^9, will compete in a competition.\nThere will be two contests in this competition.\n\nThe organizer prepared N problems, numbered 1 to N, to use in these contests.\nWhen Problem i is presented in a contest, it will be solved by all contestants from Contestant L_i to Contestant R_i (inclusive), and will not be solved by any other contestants.\n\nThe organizer will use these N problems in the two contests.\nEach problem must be used in exactly one of the contests, and each contest must have at least one problem.\n\nThe joyfulness of each contest is the number of contestants who will solve all the problems in the contest.\nFind the maximum possible total joyfulness of the two contests.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 R_1\nL_2 R_2\n\\vdots\nL_N R_N\n\nOutput\n\nPrint the maximum possible total joyfulness of the two contests.\n\nSample Input 1\n\n4\n4 7\n1 4\n5 8\n2 5\n\nSample Output 1\n\n6\n\nThe optimal choice is:\n\nUse Problem 1 and 3 in the first contest. Contestant 5, 6, and 7 will solve both of them, so the joyfulness of this contest is 3.\n\nUse Problem 2 and 4 in the second contest. Contestant 2, 3, and 4 will solve both of them, so the joyfulness of this contest is 3.\n\nThe total joyfulness of these two contests is 6. We cannot make the total joyfulness greater than 6.\n\nSample Input 2\n\n4\n1 20\n2 19\n3 18\n4 17\n\nSample Output 2\n\n34\n\nSample Input 3\n\n10\n457835016 996058008\n456475528 529149798\n455108441 512701454\n455817105 523506955\n457368248 814532746\n455073228 459494089\n456651538 774276744\n457667152 974637457\n457293701 800549465\n456580262 636471526\n\nSample Output 3\n\n540049931", "sample_input": "4\n4 7\n1 4\n5 8\n2 5\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02874", "source_text": "Score : 600 points\n\nProblem Statement\n\n10^9 contestants, numbered 1 to 10^9, will compete in a competition.\nThere will be two contests in this competition.\n\nThe organizer prepared N problems, numbered 1 to N, to use in these contests.\nWhen Problem i is presented in a contest, it will be solved by all contestants from Contestant L_i to Contestant R_i (inclusive), and will not be solved by any other contestants.\n\nThe organizer will use these N problems in the two contests.\nEach problem must be used in exactly one of the contests, and each contest must have at least one problem.\n\nThe joyfulness of each contest is the number of contestants who will solve all the problems in the contest.\nFind the maximum possible total joyfulness of the two contests.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 R_1\nL_2 R_2\n\\vdots\nL_N R_N\n\nOutput\n\nPrint the maximum possible total joyfulness of the two contests.\n\nSample Input 1\n\n4\n4 7\n1 4\n5 8\n2 5\n\nSample Output 1\n\n6\n\nThe optimal choice is:\n\nUse Problem 1 and 3 in the first contest. Contestant 5, 6, and 7 will solve both of them, so the joyfulness of this contest is 3.\n\nUse Problem 2 and 4 in the second contest. Contestant 2, 3, and 4 will solve both of them, so the joyfulness of this contest is 3.\n\nThe total joyfulness of these two contests is 6. We cannot make the total joyfulness greater than 6.\n\nSample Input 2\n\n4\n1 20\n2 19\n3 18\n4 17\n\nSample Output 2\n\n34\n\nSample Input 3\n\n10\n457835016 996058008\n456475528 529149798\n455108441 512701454\n455817105 523506955\n457368248 814532746\n455073228 459494089\n456651538 774276744\n457667152 974637457\n457293701 800549465\n456580262 636471526\n\nSample Output 3\n\n540049931", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1441, "cpu_time_ms": 133, "memory_kb": 12900}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s994194245", "group_id": "codeNet:p02880", "input_text": "let () =\n  let rec check num a b =\n    if b = 0 then false else if a * b = num then true \n    else if a = 1 then check num 9 (b-1)\n    else check num (a-1) b in\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  Printf.printf \"%s\\n\" (if (check n 9 9) then \"Yes\" else \"No\")\n", "language": "OCaml", "metadata": {"date": 1599420606, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s994194245.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s994194245", "user_id": "u307426615"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n  let rec check num a b =\n    if b = 0 then false else if a * b = num then true \n    else if a = 1 then check num 9 (b-1)\n    else check num (a-1) b in\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  Printf.printf \"%s\\n\" (if (check n 9 9) then \"Yes\" else \"No\")\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together.\n\nGiven an integer N, determine whether N can be represented as the product of two integers between 1 and 9. If it can, print Yes; if it cannot, print No.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N can be represented as the product of two integers between 1 and 9 (inclusive), print Yes; if it cannot, print No.\n\nSample Input 1\n\n10\n\nSample Output 1\n\nYes\n\n10 can be represented as, for example, 2 \\times 5.\n\nSample Input 2\n\n50\n\nSample Output 2\n\nNo\n\n50 cannot be represented as the product of two integers between 1 and 9.\n\nSample Input 3\n\n81\n\nSample Output 3\n\nYes", "sample_input": "10\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02880", "source_text": "Score : 200 points\n\nProblem Statement\n\nHaving learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclusive) together.\n\nGiven an integer N, determine whether N can be represented as the product of two integers between 1 and 9. If it can, print Yes; if it cannot, print No.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N can be represented as the product of two integers between 1 and 9 (inclusive), print Yes; if it cannot, print No.\n\nSample Input 1\n\n10\n\nSample Output 1\n\nYes\n\n10 can be represented as, for example, 2 \\times 5.\n\nSample Input 2\n\n50\n\nSample Output 2\n\nNo\n\n50 cannot be represented as the product of two integers between 1 and 9.\n\nSample Input 3\n\n81\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 257, "cpu_time_ms": 8, "memory_kb": 3720}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s583380893", "group_id": "codeNet:p02881", "input_text": "let scan_int () = Scanf.scanf \" %d\" (fun x -> x)\nlet print_int n = Printf.printf \"%d\\n\" n\n\nlet rec solve i n ans =\n  if i * i > n then ans\n  else\n    if n mod i = 0 then solve (i+1) n (min ans (i + (n/i) - 2))\n    else solve (i+1) n ans\n\nlet init_val = int_of_float 1e12\n\nlet () =\n  let n = scan_int() in\n  print_int (solve 1 n init_val)", "language": "OCaml", "metadata": {"date": 1572300726, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s583380893.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s583380893", "user_id": "u521364030"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let scan_int () = Scanf.scanf \" %d\" (fun x -> x)\nlet print_int n = Printf.printf \"%d\\n\" n\n\nlet rec solve i n ans =\n  if i * i > n then ans\n  else\n    if n mod i = 0 then solve (i+1) n (min ans (i + (n/i) - 2))\n    else solve (i+1) n ans\n\nlet init_val = int_of_float 1e12\n\nlet () =\n  let n = scan_int() in\n  print_int (solve 1 n init_val)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi is standing on a multiplication table with infinitely many rows and columns.\n\nThe square (i,j) contains the integer i \\times j. Initially, Takahashi is standing at (1,1).\n\nIn one move, he can move from (i,j) to either (i+1,j) or (i,j+1).\n\nGiven an integer N, find the minimum number of moves needed to reach a square that contains N.\n\nConstraints\n\n2 \\leq N \\leq 10^{12}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum number of moves needed to reach a square that contains the integer N.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n5\n\n(2,5) can be reached in five moves. We cannot reach a square that contains 10 in less than five moves.\n\nSample Input 2\n\n50\n\nSample Output 2\n\n13\n\n(5, 10) can be reached in 13 moves.\n\nSample Input 3\n\n10000000019\n\nSample Output 3\n\n10000000018\n\nBoth input and output may be enormous.", "sample_input": "10\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02881", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi is standing on a multiplication table with infinitely many rows and columns.\n\nThe square (i,j) contains the integer i \\times j. Initially, Takahashi is standing at (1,1).\n\nIn one move, he can move from (i,j) to either (i+1,j) or (i,j+1).\n\nGiven an integer N, find the minimum number of moves needed to reach a square that contains N.\n\nConstraints\n\n2 \\leq N \\leq 10^{12}\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum number of moves needed to reach a square that contains the integer N.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n5\n\n(2,5) can be reached in five moves. We cannot reach a square that contains 10 in less than five moves.\n\nSample Input 2\n\n50\n\nSample Output 2\n\n13\n\n(5, 10) can be reached in 13 moves.\n\nSample Input 3\n\n10000000019\n\nSample Output 3\n\n10000000018\n\nBoth input and output may be enormous.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 337, "cpu_time_ms": 12, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s841846910", "group_id": "codeNet:p02882", "input_text": "let a, b, x = Scanf.scanf \" %f %f %f\" @@ fun a b c -> a, b, c\nlet f r = 180. *. r /. acos (-1.) |> Printf.printf \"%.10f\\n\"\nlet _ = f @@ if x <= b *. a *. a /. 2. then let d = 2. *. x /. (a *. b) in let k = sqrt (b *. b +. d *. d) in acos @@ 2. *. x /. (a *. k) /. b\n  else atan2 (2. *. (a *. b -. x /. a)) (a *. a)", "language": "OCaml", "metadata": {"date": 1572799817, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s841846910.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s841846910", "user_id": "u732304692"}, "prompt_components": {"gold_output": "45.0000000000\n", "input_to_evaluate": "let a, b, x = Scanf.scanf \" %f %f %f\" @@ fun a b c -> a, b, c\nlet f r = 180. *. r /. acos (-1.) |> Printf.printf \"%.10f\\n\"\nlet _ = f @@ if x <= b *. a *. a /. 2. then let d = 2. *. x /. (a *. b) in let k = sqrt (b *. b +. d *. d) in acos @@ 2. *. x /. (a *. k) /. b\n  else atan2 (2. *. (a *. b -. x /. a)) (a *. a)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\\mathrm{cm} and whose height is b~\\mathrm{cm}. (The thickness of the bottle can be ignored.)\n\nWe will pour x~\\mathrm{cm}^3 of water into the bottle, and gradually tilt the bottle around one of the sides of the base.\n\nWhen will the water be spilled? More formally, find the maximum angle in which we can tilt the bottle without spilling any water.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq a \\leq 100\n\n1 \\leq b \\leq 100\n\n1 \\leq x \\leq a^2b\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the maximum angle in which we can tilt the bottle without spilling any water, in degrees.\nYour output will be judged as correct when the absolute or relative error from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n2 2 4\n\nSample Output 1\n\n45.0000000000\n\nThis bottle has a cubic shape, and it is half-full. The water gets spilled when we tilt the bottle more than 45 degrees.\n\nSample Input 2\n\n12 21 10\n\nSample Output 2\n\n89.7834636934\n\nThis bottle is almost empty. When the water gets spilled, the bottle is nearly horizontal.\n\nSample Input 3\n\n3 1 8\n\nSample Output 3\n\n4.2363947991\n\nThis bottle is almost full. When the water gets spilled, the bottle is still nearly vertical.", "sample_input": "2 2 4\n"}, "reference_outputs": ["45.0000000000\n"], "source_document_id": "p02882", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi has a water bottle with the shape of a rectangular prism whose base is a square of side a~\\mathrm{cm} and whose height is b~\\mathrm{cm}. (The thickness of the bottle can be ignored.)\n\nWe will pour x~\\mathrm{cm}^3 of water into the bottle, and gradually tilt the bottle around one of the sides of the base.\n\nWhen will the water be spilled? More formally, find the maximum angle in which we can tilt the bottle without spilling any water.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq a \\leq 100\n\n1 \\leq b \\leq 100\n\n1 \\leq x \\leq a^2b\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the maximum angle in which we can tilt the bottle without spilling any water, in degrees.\nYour output will be judged as correct when the absolute or relative error from the judge's output is at most 10^{-6}.\n\nSample Input 1\n\n2 2 4\n\nSample Output 1\n\n45.0000000000\n\nThis bottle has a cubic shape, and it is half-full. The water gets spilled when we tilt the bottle more than 45 degrees.\n\nSample Input 2\n\n12 21 10\n\nSample Output 2\n\n89.7834636934\n\nThis bottle is almost empty. When the water gets spilled, the bottle is nearly horizontal.\n\nSample Input 3\n\n3 1 8\n\nSample Output 3\n\n4.2363947991\n\nThis bottle is almost full. When the water gets spilled, the bottle is still nearly vertical.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 314, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s469480872", "group_id": "codeNet:p02885", "input_text": "let a, b = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> (a, b))\nlet h = a - (b * 2)\n\nlet () = print_int (if h < 0 then 0 else h)", "language": "OCaml", "metadata": {"date": 1589907698, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02885.html", "problem_id": "p02885", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02885/input.txt", "sample_output_relpath": "derived/input_output/data/p02885/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02885/OCaml/s469480872.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s469480872", "user_id": "u173515518"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let a, b = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> (a, b))\nlet h = a - (b * 2)\n\nlet () = print_int (if h < 0 then 0 else h)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThe window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the whole window.)\n\nWe will close the window so as to minimize the total horizontal length of the uncovered part of the window.\nFind the total horizontal length of the uncovered parts of the window then.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the total horizontal length of the uncovered parts of the window.\n\nSample Input 1\n\n12 4\n\nSample Output 1\n\n4\n\nWe have a window with a horizontal length of 12, and two curtains, each of length 4, that cover both ends of the window, for example. The uncovered part has a horizontal length of 4.\n\nSample Input 2\n\n20 15\n\nSample Output 2\n\n0\n\nIf the window is completely covered, print 0.\n\nSample Input 3\n\n20 30\n\nSample Output 3\n\n0\n\nEach curtain may be longer than the window.", "sample_input": "12 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02885", "source_text": "Score : 100 points\n\nProblem Statement\n\nThe window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the whole window.)\n\nWe will close the window so as to minimize the total horizontal length of the uncovered part of the window.\nFind the total horizontal length of the uncovered parts of the window then.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the total horizontal length of the uncovered parts of the window.\n\nSample Input 1\n\n12 4\n\nSample Output 1\n\n4\n\nWe have a window with a horizontal length of 12, and two curtains, each of length 4, that cover both ends of the window, for example. The uncovered part has a horizontal length of 4.\n\nSample Input 2\n\n20 15\n\nSample Output 2\n\n0\n\nIf the window is completely covered, print 0.\n\nSample Input 3\n\n20 30\n\nSample Output 3\n\n0\n\nEach curtain may be longer than the window.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 131, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s429124266", "group_id": "codeNet:p02885", "input_text": "let _ = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> \n  match a - (b * 2) with\n  | x when x <= 0 -> print_endline \"0\"\n  | x -> print_endline (string_of_int x)\n)", "language": "OCaml", "metadata": {"date": 1583931044, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02885.html", "problem_id": "p02885", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02885/input.txt", "sample_output_relpath": "derived/input_output/data/p02885/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02885/OCaml/s429124266.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s429124266", "user_id": "u511870776"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let _ = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> \n  match a - (b * 2) with\n  | x when x <= 0 -> print_endline \"0\"\n  | x -> print_endline (string_of_int x)\n)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThe window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the whole window.)\n\nWe will close the window so as to minimize the total horizontal length of the uncovered part of the window.\nFind the total horizontal length of the uncovered parts of the window then.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the total horizontal length of the uncovered parts of the window.\n\nSample Input 1\n\n12 4\n\nSample Output 1\n\n4\n\nWe have a window with a horizontal length of 12, and two curtains, each of length 4, that cover both ends of the window, for example. The uncovered part has a horizontal length of 4.\n\nSample Input 2\n\n20 15\n\nSample Output 2\n\n0\n\nIf the window is completely covered, print 0.\n\nSample Input 3\n\n20 30\n\nSample Output 3\n\n0\n\nEach curtain may be longer than the window.", "sample_input": "12 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02885", "source_text": "Score : 100 points\n\nProblem Statement\n\nThe window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the whole window.)\n\nWe will close the window so as to minimize the total horizontal length of the uncovered part of the window.\nFind the total horizontal length of the uncovered parts of the window then.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the total horizontal length of the uncovered parts of the window.\n\nSample Input 1\n\n12 4\n\nSample Output 1\n\n4\n\nWe have a window with a horizontal length of 12, and two curtains, each of length 4, that cover both ends of the window, for example. The uncovered part has a horizontal length of 4.\n\nSample Input 2\n\n20 15\n\nSample Output 2\n\n0\n\nIf the window is completely covered, print 0.\n\nSample Input 3\n\n20 30\n\nSample Output 3\n\n0\n\nEach curtain may be longer than the window.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 163, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s466880041", "group_id": "codeNet:p02886", "input_text": "let n = Scanf.scanf \" %d\" (+) 0\nlet ds = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet ans = ref 0\nlet _ = Array.iteri (fun i d -> for j = i + 1 to n - 1 do ans := !ans + d * ds.(j) done) ds; Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1571545568, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s466880041.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s466880041", "user_id": "u732304692"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "let n = Scanf.scanf \" %d\" (+) 0\nlet ds = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet ans = ref 0\nlet _ = Array.iteri (fun i d -> for j = i + 1 to n - 1 do ans := !ans + d * ds.(j) done) ds; Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIt's now the season of TAKOYAKI FESTIVAL!\n\nThis year, N takoyaki (a ball-shaped food with a piece of octopus inside) will be served. The deliciousness of the i-th takoyaki is d_i.\n\nAs is commonly known, when you eat two takoyaki of deliciousness x and y together, you restore x \\times y health points.\n\nThere are \\frac{N \\times (N - 1)}{2} ways to choose two from the N takoyaki served in the festival. For each of these choices, find the health points restored from eating the two takoyaki, then compute the sum of these \\frac{N \\times (N - 1)}{2} values.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\n0 \\leq d_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the sum of the health points restored from eating two takoyaki over all possible choices of two takoyaki from the N takoyaki served.\n\nSample Input 1\n\n3\n3 1 2\n\nSample Output 1\n\n11\n\nThere are three possible choices:\n\nEat the first and second takoyaki. You will restore 3 health points.\n\nEat the second and third takoyaki. You will restore 2 health points.\n\nEat the first and third takoyaki. You will restore 6 health points.\n\nThe sum of these values is 11.\n\nSample Input 2\n\n7\n5 0 7 8 3 3 2\n\nSample Output 2\n\n312", "sample_input": "3\n3 1 2\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02886", "source_text": "Score : 200 points\n\nProblem Statement\n\nIt's now the season of TAKOYAKI FESTIVAL!\n\nThis year, N takoyaki (a ball-shaped food with a piece of octopus inside) will be served. The deliciousness of the i-th takoyaki is d_i.\n\nAs is commonly known, when you eat two takoyaki of deliciousness x and y together, you restore x \\times y health points.\n\nThere are \\frac{N \\times (N - 1)}{2} ways to choose two from the N takoyaki served in the festival. For each of these choices, find the health points restored from eating the two takoyaki, then compute the sum of these \\frac{N \\times (N - 1)}{2} values.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\n0 \\leq d_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the sum of the health points restored from eating two takoyaki over all possible choices of two takoyaki from the N takoyaki served.\n\nSample Input 1\n\n3\n3 1 2\n\nSample Output 1\n\n11\n\nThere are three possible choices:\n\nEat the first and second takoyaki. You will restore 3 health points.\n\nEat the second and third takoyaki. You will restore 2 health points.\n\nEat the first and third takoyaki. You will restore 6 health points.\n\nThe sum of these values is 11.\n\nSample Input 2\n\n7\n5 0 7 8 3 3 2\n\nSample Output 2\n\n312", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 224, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s834294140", "group_id": "codeNet:p02886", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ds = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun d -> d in\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left (Array.fold_left ( + )) 0 @@\n  Array.init n @@ fun i ->\n    Array.init n @@ fun j ->\n      if i <= j\n      then 0\n      else ds.(i) * ds.(j)\n\n", "language": "OCaml", "metadata": {"date": 1571537653, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s834294140.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s834294140", "user_id": "u504158101"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ds = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun d -> d in\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left (Array.fold_left ( + )) 0 @@\n  Array.init n @@ fun i ->\n    Array.init n @@ fun j ->\n      if i <= j\n      then 0\n      else ds.(i) * ds.(j)\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIt's now the season of TAKOYAKI FESTIVAL!\n\nThis year, N takoyaki (a ball-shaped food with a piece of octopus inside) will be served. The deliciousness of the i-th takoyaki is d_i.\n\nAs is commonly known, when you eat two takoyaki of deliciousness x and y together, you restore x \\times y health points.\n\nThere are \\frac{N \\times (N - 1)}{2} ways to choose two from the N takoyaki served in the festival. For each of these choices, find the health points restored from eating the two takoyaki, then compute the sum of these \\frac{N \\times (N - 1)}{2} values.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\n0 \\leq d_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the sum of the health points restored from eating two takoyaki over all possible choices of two takoyaki from the N takoyaki served.\n\nSample Input 1\n\n3\n3 1 2\n\nSample Output 1\n\n11\n\nThere are three possible choices:\n\nEat the first and second takoyaki. You will restore 3 health points.\n\nEat the second and third takoyaki. You will restore 2 health points.\n\nEat the first and third takoyaki. You will restore 6 health points.\n\nThe sum of these values is 11.\n\nSample Input 2\n\n7\n5 0 7 8 3 3 2\n\nSample Output 2\n\n312", "sample_input": "3\n3 1 2\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02886", "source_text": "Score : 200 points\n\nProblem Statement\n\nIt's now the season of TAKOYAKI FESTIVAL!\n\nThis year, N takoyaki (a ball-shaped food with a piece of octopus inside) will be served. The deliciousness of the i-th takoyaki is d_i.\n\nAs is commonly known, when you eat two takoyaki of deliciousness x and y together, you restore x \\times y health points.\n\nThere are \\frac{N \\times (N - 1)}{2} ways to choose two from the N takoyaki served in the festival. For each of these choices, find the health points restored from eating the two takoyaki, then compute the sum of these \\frac{N \\times (N - 1)}{2} values.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\n0 \\leq d_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the sum of the health points restored from eating two takoyaki over all possible choices of two takoyaki from the N takoyaki served.\n\nSample Input 1\n\n3\n3 1 2\n\nSample Output 1\n\n11\n\nThere are three possible choices:\n\nEat the first and second takoyaki. You will restore 3 health points.\n\nEat the second and third takoyaki. You will restore 2 health points.\n\nEat the first and third takoyaki. You will restore 6 health points.\n\nThe sum of these values is 11.\n\nSample Input 2\n\n7\n5 0 7 8 3 3 2\n\nSample Output 2\n\n312", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 297, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s171486997", "group_id": "codeNet:p02887", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ans = ref 1 in\n  Scanf.scanf \"%s\" @@ fun s -> \n  for i=1 to n-1 do\n    if s.[i] <> s.[i-1] then ans := !ans + 1\n  done;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1594979209, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s171486997.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s171486997", "user_id": "u052332717"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ans = ref 1 in\n  Scanf.scanf \"%s\" @@ fun s -> \n  for i=1 to n-1 do\n    if s.[i] <> s.[i-1] then ans := !ans + 1\n  done;\n  Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N slimes lining up from left to right. The colors of these slimes will be given as a string S of length N consisting of lowercase English letters. The i-th slime from the left has the color that corresponds to the i-th character of S.\n\nAdjacent slimes with the same color will fuse into one larger slime without changing the color. If there were a slime adjacent to this group of slimes before fusion, that slime is now adjacent to the new larger slime.\n\nUltimately, how many slimes will be there?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the final number of slimes.\n\nSample Input 1\n\n10\naabbbbaaca\n\nSample Output 1\n\n5\n\nUltimately, these slimes will fuse into abaca.\n\nSample Input 2\n\n5\naaaaa\n\nSample Output 2\n\n1\n\nAll the slimes will fuse into one.\n\nSample Input 3\n\n20\nxxzaffeeeeddfkkkkllq\n\nSample Output 3\n\n10", "sample_input": "10\naabbbbaaca\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02887", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N slimes lining up from left to right. The colors of these slimes will be given as a string S of length N consisting of lowercase English letters. The i-th slime from the left has the color that corresponds to the i-th character of S.\n\nAdjacent slimes with the same color will fuse into one larger slime without changing the color. If there were a slime adjacent to this group of slimes before fusion, that slime is now adjacent to the new larger slime.\n\nUltimately, how many slimes will be there?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the final number of slimes.\n\nSample Input 1\n\n10\naabbbbaaca\n\nSample Output 1\n\n5\n\nUltimately, these slimes will fuse into abaca.\n\nSample Input 2\n\n5\naaaaa\n\nSample Output 2\n\n1\n\nAll the slimes will fuse into one.\n\nSample Input 3\n\n20\nxxzaffeeeeddfkkkkllq\n\nSample Output 3\n\n10", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 4168}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s882007332", "group_id": "codeNet:p02887", "input_text": "let () =\n  let _ = Scanf.sscanf (input_line stdin) \"%d\" (fun a -> a) in\n  let s = input_line stdin in\n  let n = ref 0 in\n  let prev_c = ref ' ' in \n  let _ = String.iter (fun c -> if !prev_c  <> c then n := !n + 1; prev_c := c) s\n  in\n  print_int !n;\n  print_newline ()\n", "language": "OCaml", "metadata": {"date": 1572628313, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s882007332.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s882007332", "user_id": "u977566741"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let () =\n  let _ = Scanf.sscanf (input_line stdin) \"%d\" (fun a -> a) in\n  let s = input_line stdin in\n  let n = ref 0 in\n  let prev_c = ref ' ' in \n  let _ = String.iter (fun c -> if !prev_c  <> c then n := !n + 1; prev_c := c) s\n  in\n  print_int !n;\n  print_newline ()\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N slimes lining up from left to right. The colors of these slimes will be given as a string S of length N consisting of lowercase English letters. The i-th slime from the left has the color that corresponds to the i-th character of S.\n\nAdjacent slimes with the same color will fuse into one larger slime without changing the color. If there were a slime adjacent to this group of slimes before fusion, that slime is now adjacent to the new larger slime.\n\nUltimately, how many slimes will be there?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the final number of slimes.\n\nSample Input 1\n\n10\naabbbbaaca\n\nSample Output 1\n\n5\n\nUltimately, these slimes will fuse into abaca.\n\nSample Input 2\n\n5\naaaaa\n\nSample Output 2\n\n1\n\nAll the slimes will fuse into one.\n\nSample Input 3\n\n20\nxxzaffeeeeddfkkkkllq\n\nSample Output 3\n\n10", "sample_input": "10\naabbbbaaca\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02887", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N slimes lining up from left to right. The colors of these slimes will be given as a string S of length N consisting of lowercase English letters. The i-th slime from the left has the color that corresponds to the i-th character of S.\n\nAdjacent slimes with the same color will fuse into one larger slime without changing the color. If there were a slime adjacent to this group of slimes before fusion, that slime is now adjacent to the new larger slime.\n\nUltimately, how many slimes will be there?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the final number of slimes.\n\nSample Input 1\n\n10\naabbbbaaca\n\nSample Output 1\n\n5\n\nUltimately, these slimes will fuse into abaca.\n\nSample Input 2\n\n5\naaaaa\n\nSample Output 2\n\n1\n\nAll the slimes will fuse into one.\n\nSample Input 3\n\n20\nxxzaffeeeeddfkkkkllq\n\nSample Output 3\n\n10", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 270, "cpu_time_ms": 2, "memory_kb": 2688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s454332577", "group_id": "codeNet:p02887", "input_text": "let () =\n    let main () =\n        let n = int_of_string (read_line ()) in\n        let s = read_line () ^ \"$\" in\n        let rec loop i prev acc =\n            if i > n then acc else loop (i + 1) s.[i] (acc + if prev = s.[i] then 0 else 1)\n        in\n        Printf.printf \"%d\\n\" (loop 1 s.[0] 0)\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1571533777, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s454332577.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s454332577", "user_id": "u342443598"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let () =\n    let main () =\n        let n = int_of_string (read_line ()) in\n        let s = read_line () ^ \"$\" in\n        let rec loop i prev acc =\n            if i > n then acc else loop (i + 1) s.[i] (acc + if prev = s.[i] then 0 else 1)\n        in\n        Printf.printf \"%d\\n\" (loop 1 s.[0] 0)\n    in\n    main ()", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N slimes lining up from left to right. The colors of these slimes will be given as a string S of length N consisting of lowercase English letters. The i-th slime from the left has the color that corresponds to the i-th character of S.\n\nAdjacent slimes with the same color will fuse into one larger slime without changing the color. If there were a slime adjacent to this group of slimes before fusion, that slime is now adjacent to the new larger slime.\n\nUltimately, how many slimes will be there?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the final number of slimes.\n\nSample Input 1\n\n10\naabbbbaaca\n\nSample Output 1\n\n5\n\nUltimately, these slimes will fuse into abaca.\n\nSample Input 2\n\n5\naaaaa\n\nSample Output 2\n\n1\n\nAll the slimes will fuse into one.\n\nSample Input 3\n\n20\nxxzaffeeeeddfkkkkllq\n\nSample Output 3\n\n10", "sample_input": "10\naabbbbaaca\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02887", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N slimes lining up from left to right. The colors of these slimes will be given as a string S of length N consisting of lowercase English letters. The i-th slime from the left has the color that corresponds to the i-th character of S.\n\nAdjacent slimes with the same color will fuse into one larger slime without changing the color. If there were a slime adjacent to this group of slimes before fusion, that slime is now adjacent to the new larger slime.\n\nUltimately, how many slimes will be there?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the final number of slimes.\n\nSample Input 1\n\n10\naabbbbaaca\n\nSample Output 1\n\n5\n\nUltimately, these slimes will fuse into abaca.\n\nSample Input 2\n\n5\naaaaa\n\nSample Output 2\n\n1\n\nAll the slimes will fuse into one.\n\nSample Input 3\n\n20\nxxzaffeeeeddfkkkkllq\n\nSample Output 3\n\n10", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 314, "cpu_time_ms": 2, "memory_kb": 4480}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s721863687", "group_id": "codeNet:p02888", "input_text": "let split_string ?(pattern=\" \") = Str.split @@ Str.regexp pattern\nlet n = Scanf.sscanf (read_line ()) \"%d\" @@ fun n -> n\nlet ls = read_line () |> split_string |> List.map int_of_string |> List.sort compare |> List.rev |> Array.of_list\n\nlet rec loop ai bi l r =\n  if r <= l then begin\n    let l = ref l in\n    while !l < n - 1 && ls.(!l + 1) = ls.(!l) do l := !l + 1 done;\n    max 0 @@ !l - bi - 1\n  end\n  else\n    let mid = (l + r) / 2 in\n    let a, b, c = ls.(ai), ls.(bi), ls.(mid) in\n    if a < b + c && b < c + a && c < a + b then loop ai bi (mid + 1) r\n    else loop ai bi l mid\n\nlet () =\n  let ans = ref 0 in\n  for i = 0 to n - 3 do\n    for j = i + 1 to n - 2 do\n      ans := !ans + loop i j (j + 1) n\n    done\n  done;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1590265520, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02888.html", "problem_id": "p02888", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02888/input.txt", "sample_output_relpath": "derived/input_output/data/p02888/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02888/OCaml/s721863687.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s721863687", "user_id": "u811309788"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let split_string ?(pattern=\" \") = Str.split @@ Str.regexp pattern\nlet n = Scanf.sscanf (read_line ()) \"%d\" @@ fun n -> n\nlet ls = read_line () |> split_string |> List.map int_of_string |> List.sort compare |> List.rev |> Array.of_list\n\nlet rec loop ai bi l r =\n  if r <= l then begin\n    let l = ref l in\n    while !l < n - 1 && ls.(!l + 1) = ls.(!l) do l := !l + 1 done;\n    max 0 @@ !l - bi - 1\n  end\n  else\n    let mid = (l + r) / 2 in\n    let a, b, c = ls.(ai), ls.(bi), ls.(mid) in\n    if a < b + c && b < c + a && c < a + b then loop ai bi (mid + 1) r\n    else loop ai bi l mid\n\nlet () =\n  let ans = ref 0 in\n  for i = 0 to n - 3 do\n    for j = i + 1 to n - 2 do\n      ans := !ans + loop i j (j + 1) n\n    done\n  done;\n  Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi has N sticks that are distinguishable from each other. The length of the i-th stick is L_i.\n\nHe is going to form a triangle using three of these sticks. Let a, b, and c be the lengths of the three sticks used. Here, all of the following conditions must be satisfied:\n\na < b + c\n\nb < c + a\n\nc < a + b\n\nHow many different triangles can be formed? Two triangles are considered different when there is a stick used in only one of them.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 2 \\times 10^3\n\n1 \\leq L_i \\leq 10^3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nConstraints\n\nPrint the number of different triangles that can be formed.\n\nSample Input 1\n\n4\n3 4 2 1\n\nSample Output 1\n\n1\n\nOnly one triangle can be formed: the triangle formed by the first, second, and third sticks.\n\nSample Input 2\n\n3\n1 1000 1\n\nSample Output 2\n\n0\n\nNo triangles can be formed.\n\nSample Input 3\n\n7\n218 786 704 233 645 728 389\n\nSample Output 3\n\n23", "sample_input": "4\n3 4 2 1\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02888", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi has N sticks that are distinguishable from each other. The length of the i-th stick is L_i.\n\nHe is going to form a triangle using three of these sticks. Let a, b, and c be the lengths of the three sticks used. Here, all of the following conditions must be satisfied:\n\na < b + c\n\nb < c + a\n\nc < a + b\n\nHow many different triangles can be formed? Two triangles are considered different when there is a stick used in only one of them.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 2 \\times 10^3\n\n1 \\leq L_i \\leq 10^3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nConstraints\n\nPrint the number of different triangles that can be formed.\n\nSample Input 1\n\n4\n3 4 2 1\n\nSample Output 1\n\n1\n\nOnly one triangle can be formed: the triangle formed by the first, second, and third sticks.\n\nSample Input 2\n\n3\n1 1000 1\n\nSample Output 2\n\n0\n\nNo triangles can be formed.\n\nSample Input 3\n\n7\n218 786 704 233 645 728 389\n\nSample Output 3\n\n23", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 752, "cpu_time_ms": 144, "memory_kb": 4736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s483479566", "group_id": "codeNet:p02898", "input_text": "let () = Scanf.scanf \"%d %d\" @@ fun n k ->\n  let array = Array.init n @@ fun _ -> Scanf.scanf \" %d\" Fun.id in\n  let ans = Array.fold_left (fun a elt -> if elt >= k then a + 1 else a) 0 array in\n  Printf.printf \"%d\\n\" ans", "language": "OCaml", "metadata": {"date": 1596412478, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s483479566.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s483479566", "user_id": "u052332717"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\" @@ fun n k ->\n  let array = Array.init n @@ fun _ -> Scanf.scanf \" %d\" Fun.id in\n  let ans = Array.fold_left (fun a elt -> if elt >= k then a + 1 else a) 0 array in\n  Printf.printf \"%d\\n\" ans", "problem_context": "Score : 200 points\n\nProblem Statement\n\nN friends of Takahashi has come to a theme park.\n\nTo ride the most popular roller coaster in the park, you must be at least K centimeters tall.\n\nThe i-th friend is h_i centimeters tall.\n\nHow many of the Takahashi's friends can ride the roller coaster?\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le K \\le 500\n\n1 \\le h_i \\le 500\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the number of people among the Takahashi's friends who can ride the roller coaster.\n\nSample Input 1\n\n4 150\n150 140 100 200\n\nSample Output 1\n\n2\n\nTwo of them can ride the roller coaster: the first and fourth friends.\n\nSample Input 2\n\n1 500\n499\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5 1\n100 200 300 400 500\n\nSample Output 3\n\n5", "sample_input": "4 150\n150 140 100 200\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02898", "source_text": "Score : 200 points\n\nProblem Statement\n\nN friends of Takahashi has come to a theme park.\n\nTo ride the most popular roller coaster in the park, you must be at least K centimeters tall.\n\nThe i-th friend is h_i centimeters tall.\n\nHow many of the Takahashi's friends can ride the roller coaster?\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le K \\le 500\n\n1 \\le h_i \\le 500\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the number of people among the Takahashi's friends who can ride the roller coaster.\n\nSample Input 1\n\n4 150\n150 140 100 200\n\nSample Output 1\n\n2\n\nTwo of them can ride the roller coaster: the first and fourth friends.\n\nSample Input 2\n\n1 500\n499\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5 1\n100 200 300 400 500\n\nSample Output 3\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 220, "cpu_time_ms": 29, "memory_kb": 6668}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s650753253", "group_id": "codeNet:p02899", "input_text": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  let a = Array.init n @@ fun i -> Scanf.scanf \"%d \" @@ fun d -> (i+1,d) in\n  let _ = Array.fast_sort (fun (_,x) (_,y) -> compare x y) a in\n  for i = 0 to n - 2 do\n    print_int (fst a.(i)); print_string \" \";\n  done;\n  print_int (fst a.(n-1)); print_newline ();", "language": "OCaml", "metadata": {"date": 1599423908, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s650753253.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s650753253", "user_id": "u307426615"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  let a = Array.init n @@ fun i -> Scanf.scanf \"%d \" @@ fun d -> (i+1,d) in\n  let _ = Array.fast_sort (fun (_,x) (_,y) -> compare x y) a in\n  for i = 0 to n - 2 do\n    print_int (fst a.(i)); print_string \" \";\n  done;\n  print_int (fst a.(n-1)); print_newline ();", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi is a teacher responsible for a class of N students.\n\nThe students are given distinct student numbers from 1 to N.\n\nToday, all the students entered the classroom at different times.\n\nAccording to Takahashi's record, there were A_i students in the classroom when student number i entered the classroom (including student number i).\n\nFrom these records, reconstruct the order in which the students entered the classroom.\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le A_i \\le N\n\nA_i \\neq A_j (i \\neq j)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint the student numbers of the students in the order the students entered the classroom.\n\nSample Input 1\n\n3\n2 3 1\n\nSample Output 1\n\n3 1 2\n\nFirst, student number 3 entered the classroom.\n\nThen, student number 1 entered the classroom.\n\nFinally, student number 2 entered the classroom.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\n1 2 3 4 5\n\nSample Input 3\n\n8\n8 2 7 3 4 5 6 1\n\nSample Output 3\n\n8 2 4 5 6 7 3 1", "sample_input": "3\n2 3 1\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02899", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi is a teacher responsible for a class of N students.\n\nThe students are given distinct student numbers from 1 to N.\n\nToday, all the students entered the classroom at different times.\n\nAccording to Takahashi's record, there were A_i students in the classroom when student number i entered the classroom (including student number i).\n\nFrom these records, reconstruct the order in which the students entered the classroom.\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le A_i \\le N\n\nA_i \\neq A_j (i \\neq j)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint the student numbers of the students in the order the students entered the classroom.\n\nSample Input 1\n\n3\n2 3 1\n\nSample Output 1\n\n3 1 2\n\nFirst, student number 3 entered the classroom.\n\nThen, student number 1 entered the classroom.\n\nFinally, student number 2 entered the classroom.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\n1 2 3 4 5\n\nSample Input 3\n\n8\n8 2 7 3 4 5 6 1\n\nSample Output 3\n\n8 2 4 5 6 7 3 1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 303, "cpu_time_ms": 81, "memory_kb": 9800}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s962178967", "group_id": "codeNet:p02899", "input_text": "let cmp a b = if snd a = snd b then 0 else if snd a > snd b then 1 else -1\n\nlet () =\n  let n = read_int () in\n  let st = Array.init n (fun i -> Scanf.scanf \" %d\" (fun a -> (i + 1, a))) in\n  Array.sort cmp st ;\n  Array.iter (fun a -> Printf.printf \"%d \" (fst a)) st\n", "language": "OCaml", "metadata": {"date": 1585683148, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s962178967.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s962178967", "user_id": "u575440531"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "let cmp a b = if snd a = snd b then 0 else if snd a > snd b then 1 else -1\n\nlet () =\n  let n = read_int () in\n  let st = Array.init n (fun i -> Scanf.scanf \" %d\" (fun a -> (i + 1, a))) in\n  Array.sort cmp st ;\n  Array.iter (fun a -> Printf.printf \"%d \" (fst a)) st\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi is a teacher responsible for a class of N students.\n\nThe students are given distinct student numbers from 1 to N.\n\nToday, all the students entered the classroom at different times.\n\nAccording to Takahashi's record, there were A_i students in the classroom when student number i entered the classroom (including student number i).\n\nFrom these records, reconstruct the order in which the students entered the classroom.\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le A_i \\le N\n\nA_i \\neq A_j (i \\neq j)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint the student numbers of the students in the order the students entered the classroom.\n\nSample Input 1\n\n3\n2 3 1\n\nSample Output 1\n\n3 1 2\n\nFirst, student number 3 entered the classroom.\n\nThen, student number 1 entered the classroom.\n\nFinally, student number 2 entered the classroom.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\n1 2 3 4 5\n\nSample Input 3\n\n8\n8 2 7 3 4 5 6 1\n\nSample Output 3\n\n8 2 4 5 6 7 3 1", "sample_input": "3\n2 3 1\n"}, "reference_outputs": ["3 1 2\n"], "source_document_id": "p02899", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi is a teacher responsible for a class of N students.\n\nThe students are given distinct student numbers from 1 to N.\n\nToday, all the students entered the classroom at different times.\n\nAccording to Takahashi's record, there were A_i students in the classroom when student number i entered the classroom (including student number i).\n\nFrom these records, reconstruct the order in which the students entered the classroom.\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le A_i \\le N\n\nA_i \\neq A_j (i \\neq j)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint the student numbers of the students in the order the students entered the classroom.\n\nSample Input 1\n\n3\n2 3 1\n\nSample Output 1\n\n3 1 2\n\nFirst, student number 3 entered the classroom.\n\nThen, student number 1 entered the classroom.\n\nFinally, student number 2 entered the classroom.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\n1 2 3 4 5\n\nSample Input 3\n\n8\n8 2 7 3 4 5 6 1\n\nSample Output 3\n\n8 2 4 5 6 7 3 1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 265, "cpu_time_ms": 138, "memory_kb": 7168}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s530982088", "group_id": "codeNet:p02900", "input_text": "Scanf.scanf \"%d %d\" (fun a b ->\n    let rec gcd a b = if b = 0 then a else gcd b (a mod b) in\n\n    let rec loop rest i acc =\n        if rest = 1 then acc else\n            if i * i > rest then acc + 1 else\n                if rest mod i > 0 then loop rest (i + 1) acc else\n                    let rec loop2 rest =\n                        if rest mod i = 0 then loop2 (rest / i) else rest\n                    in\n                    loop (loop2 rest) (i + 1) (acc + 1)\n    in\n    loop (gcd a b) 2 1 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1594779854, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s530982088.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s530982088", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun a b ->\n    let rec gcd a b = if b = 0 then a else gcd b (a mod b) in\n\n    let rec loop rest i acc =\n        if rest = 1 then acc else\n            if i * i > rest then acc + 1 else\n                if rest mod i > 0 then loop rest (i + 1) acc else\n                    let rec loop2 rest =\n                        if rest mod i = 0 then loop2 (rest / i) else rest\n                    in\n                    loop (loop2 rest) (i + 1) (acc + 1)\n    in\n    loop (gcd a b) 2 1 |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "sample_input": "12 18\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02900", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 520, "cpu_time_ms": 23, "memory_kb": 3776}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s036581271", "group_id": "codeNet:p02900", "input_text": "let filter n =\n  match n with\n  | 1 ->\n      true\n  | 2 ->\n      true\n  | n ->\n      if n < 2 || n mod 2 = 0 then false\n      else\n        let rec f i =\n          if float_of_int i > sqrt (float_of_int n) then true\n          else if n mod i = 0 then false\n          else f (i + 2)\n        in\n        f 3\n\nlet find_all_array f arr =\n  let rec iter f i result =\n    if i > Array.length arr - 1 then Array.of_list result\n    else if f arr.(i) then iter f (i + 1) (arr.(i) :: result)\n    else iter f (i + 1) result\n  in\n  iter f 0 []\n\nlet common_div sml lrg =\n  let num = Array.init sml (fun i -> i + 1) and acc = ref [] in\n  for i = 0 to sml - 1 do\n    if sml mod num.(i) = 0 && lrg mod num.(i) = 0 then acc := num.(i) :: !acc\n  done ;\n  Array.of_list @@ List.rev !acc\n\nlet () =\n  let a, b = Scanf.scanf \"%d %d\\n\" (fun a b -> (a, b)) in\n  let divs = common_div a b in\n  print_int @@ Array.length @@ find_all_array filter divs\n", "language": "OCaml", "metadata": {"date": 1585685829, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s036581271.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s036581271", "user_id": "u575440531"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let filter n =\n  match n with\n  | 1 ->\n      true\n  | 2 ->\n      true\n  | n ->\n      if n < 2 || n mod 2 = 0 then false\n      else\n        let rec f i =\n          if float_of_int i > sqrt (float_of_int n) then true\n          else if n mod i = 0 then false\n          else f (i + 2)\n        in\n        f 3\n\nlet find_all_array f arr =\n  let rec iter f i result =\n    if i > Array.length arr - 1 then Array.of_list result\n    else if f arr.(i) then iter f (i + 1) (arr.(i) :: result)\n    else iter f (i + 1) result\n  in\n  iter f 0 []\n\nlet common_div sml lrg =\n  let num = Array.init sml (fun i -> i + 1) and acc = ref [] in\n  for i = 0 to sml - 1 do\n    if sml mod num.(i) = 0 && lrg mod num.(i) = 0 then acc := num.(i) :: !acc\n  done ;\n  Array.of_list @@ List.rev !acc\n\nlet () =\n  let a, b = Scanf.scanf \"%d %d\\n\" (fun a b -> (a, b)) in\n  let divs = common_div a b in\n  print_int @@ Array.length @@ find_all_array filter divs\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "sample_input": "12 18\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02900", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 923, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s680467178", "group_id": "codeNet:p02900", "input_text": "let factors : int -> (int * int) list = fun n ->\n  let rec loop_i n i =\n    if i * i > n then\n      if n == 1 then [] else [(n, 1)]\n    else if n mod i = 0 then\n      let (n', c) = loop_j (n/i) i 1\n      in\n      (i, c) :: loop_i n' (i + 1)\n    else\n      loop_i n (i + 1)\n  and loop_j n i j =\n    if n mod i = 0 then\n      loop_j (n / i) i (j + 1)\n    else\n      (n, j)\n  in\n  loop_i n 2\n\nlet rec print_int_list = function\n    [] -> ()\n  | (x :: xs) ->\n     print_int x;\n     print_char ' ';\n     print_int_list xs\n\nlet rec merge = function\n    ([], _) -> []\n  | (_, []) -> []\n  | ((x, cx)::xs, (y,cy)::ys) ->\n     if x = y then\n       x :: merge (xs, ys)\n     else if x < y then\n       merge (xs, (y,cy)::ys)\n     else\n       merge ((x,cx)::xs, ys)\n\nlet () =\n  let (a, b) = Scanf.sscanf (input_line stdin) \"%d %d\" (fun a b -> (a, b)) in\n  let facta = factors a in\n  let factb = factors b in\n  let ans_l  = 1 :: merge (facta, factb) in\n  let ans = List.length ans_l\n  in\n  print_int ans;\n  print_newline ()\n", "language": "OCaml", "metadata": {"date": 1572573203, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s680467178.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s680467178", "user_id": "u977566741"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let factors : int -> (int * int) list = fun n ->\n  let rec loop_i n i =\n    if i * i > n then\n      if n == 1 then [] else [(n, 1)]\n    else if n mod i = 0 then\n      let (n', c) = loop_j (n/i) i 1\n      in\n      (i, c) :: loop_i n' (i + 1)\n    else\n      loop_i n (i + 1)\n  and loop_j n i j =\n    if n mod i = 0 then\n      loop_j (n / i) i (j + 1)\n    else\n      (n, j)\n  in\n  loop_i n 2\n\nlet rec print_int_list = function\n    [] -> ()\n  | (x :: xs) ->\n     print_int x;\n     print_char ' ';\n     print_int_list xs\n\nlet rec merge = function\n    ([], _) -> []\n  | (_, []) -> []\n  | ((x, cx)::xs, (y,cy)::ys) ->\n     if x = y then\n       x :: merge (xs, ys)\n     else if x < y then\n       merge (xs, (y,cy)::ys)\n     else\n       merge ((x,cx)::xs, ys)\n\nlet () =\n  let (a, b) = Scanf.sscanf (input_line stdin) \"%d %d\" (fun a b -> (a, b)) in\n  let facta = factors a in\n  let factb = factors b in\n  let ans_l  = 1 :: merge (facta, factb) in\n  let ans = List.length ans_l\n  in\n  print_int ans;\n  print_newline ()\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "sample_input": "12 18\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02900", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are positive integers A and B.\n\nLet us choose some number of positive common divisors of A and B.\n\nHere, any two of the chosen divisors must be coprime.\n\nAt most, how many divisors can we choose?\n\nDefinition of common divisor\n\nAn integer d is said to be a common divisor of integers x and y when d divides both x and y.\n\nDefinition of being coprime\n\nIntegers x and y are said to be coprime when x and y have no positive common divisors other than 1.\n\nDefinition of dividing\n\nAn integer x is said to divide another integer y when there exists an integer \\alpha such that y = \\alpha x.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of divisors that can be chosen to satisfy the condition.\n\nSample Input 1\n\n12 18\n\nSample Output 1\n\n3\n\n12 and 18 have the following positive common divisors: 1, 2, 3, and 6.\n\n1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.\n\nSample Input 2\n\n420 660\n\nSample Output 2\n\n4\n\nSample Input 3\n\n1 2019\n\nSample Output 3\n\n1\n\n1 and 2019 have no positive common divisors other than 1.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1008, "cpu_time_ms": 21, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s761817678", "group_id": "codeNet:p02901", "input_text": "Scanf.scanf \"%d %d\" (fun n m ->\n    let lim = 1 lsl n in\n    let sentinel = max_int / 2 in\n    let dp = Array.make lim sentinel in\n    dp.(0) <- 0;\n    for i = 1 to m do\n        Scanf.scanf \" %d %d\" (fun x y ->\n            let rec loop i acc =\n                if i = y then acc else\n                    let c = Scanf.scanf \" %d\" (fun c -> c) in\n                    loop (i + 1) (acc lor (1 lsl (c - 1)))\n            in\n            let c = loop 0 0 in\n            for j = 0 to lim - 1 do\n                dp.(j lor c) <- min dp.(j lor c) (dp.(j) + x)\n            done\n        )\n    done;\n    Printf.printf \"%d\\n\" @@ if dp.(lim - 1) = sentinel then -1 else dp.(lim - 1)\n)", "language": "OCaml", "metadata": {"date": 1594779531, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p02901.html", "problem_id": "p02901", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02901/input.txt", "sample_output_relpath": "derived/input_output/data/p02901/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02901/OCaml/s761817678.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s761817678", "user_id": "u342443598"}, "prompt_components": {"gold_output": "25\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n m ->\n    let lim = 1 lsl n in\n    let sentinel = max_int / 2 in\n    let dp = Array.make lim sentinel in\n    dp.(0) <- 0;\n    for i = 1 to m do\n        Scanf.scanf \" %d %d\" (fun x y ->\n            let rec loop i acc =\n                if i = y then acc else\n                    let c = Scanf.scanf \" %d\" (fun c -> c) in\n                    loop (i + 1) (acc lor (1 lsl (c - 1)))\n            in\n            let c = loop 0 0 in\n            for j = 0 to lim - 1 do\n                dp.(j lor c) <- min dp.(j lor c) (dp.(j) + x)\n            done\n        )\n    done;\n    Printf.printf \"%d\\n\" @@ if dp.(lim - 1) = sentinel then -1 else dp.(lim - 1)\n)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N locked treasure boxes, numbered 1 to N.\n\nA shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{i{b_i}}. Each key purchased can be used any number of times.\n\nFind the minimum cost required to unlock all the treasure boxes. If it is impossible to unlock all of them, print -1.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 12\n\n1 \\leq M \\leq 10^3\n\n1 \\leq a_i \\leq 10^5\n\n1 \\leq b_i \\leq N\n\n1 \\leq c_{i1} < c_{i2} < ... < c_{i{b_i}} \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\nc_{11} c_{12} ... c_{1{b_1}}\n:\na_M b_M\nc_{M1} c_{M2} ... c_{M{b_M}}\n\nOutput\n\nPrint the minimum cost required to unlock all the treasure boxes.\nIf it is impossible to unlock all of them, print -1.\n\nSample Input 1\n\n2 3\n10 1\n1\n15 1\n2\n30 2\n1 2\n\nSample Output 1\n\n25\n\nWe can unlock all the boxes by purchasing the first and second keys, at the cost of 25 yen, which is the minimum cost required.\n\nSample Input 2\n\n12 1\n100000 1\n2\n\nSample Output 2\n\n-1\n\nWe cannot unlock all the boxes.\n\nSample Input 3\n\n4 6\n67786 3\n1 3 4\n3497 1\n2\n44908 3\n2 3 4\n2156 3\n2 3 4\n26230 1\n2\n86918 1\n3\n\nSample Output 3\n\n69942", "sample_input": "2 3\n10 1\n1\n15 1\n2\n30 2\n1 2\n"}, "reference_outputs": ["25\n"], "source_document_id": "p02901", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N locked treasure boxes, numbered 1 to N.\n\nA shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{i{b_i}}. Each key purchased can be used any number of times.\n\nFind the minimum cost required to unlock all the treasure boxes. If it is impossible to unlock all of them, print -1.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 12\n\n1 \\leq M \\leq 10^3\n\n1 \\leq a_i \\leq 10^5\n\n1 \\leq b_i \\leq N\n\n1 \\leq c_{i1} < c_{i2} < ... < c_{i{b_i}} \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\nc_{11} c_{12} ... c_{1{b_1}}\n:\na_M b_M\nc_{M1} c_{M2} ... c_{M{b_M}}\n\nOutput\n\nPrint the minimum cost required to unlock all the treasure boxes.\nIf it is impossible to unlock all of them, print -1.\n\nSample Input 1\n\n2 3\n10 1\n1\n15 1\n2\n30 2\n1 2\n\nSample Output 1\n\n25\n\nWe can unlock all the boxes by purchasing the first and second keys, at the cost of 25 yen, which is the minimum cost required.\n\nSample Input 2\n\n12 1\n100000 1\n2\n\nSample Output 2\n\n-1\n\nWe cannot unlock all the boxes.\n\nSample Input 3\n\n4 6\n67786 3\n1 3 4\n3497 1\n2\n44908 3\n2 3 4\n2156 3\n2 3 4\n26230 1\n2\n86918 1\n3\n\nSample Output 3\n\n69942", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 668, "cpu_time_ms": 57, "memory_kb": 5924}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s344357714", "group_id": "codeNet:p02901", "input_text": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let acss = Array.init m @@ fun _ ->\n    Scanf.scanf \"%d %d\\n\" @@ fun a b ->\n      a,\n      Array.fold_left ( lor ) 0 @@\n      Array.init b @@ fun _ -> Scanf.scanf \"%d \" @@ fun c -> 1 lsl (c - 1) in\n  let dp = Array.make (1 lsl n) 1145141919 in\n  dp.(0) <- 0;\n  for i = 0 to (1 lsl n) - 1 do\n    Array.iter (fun (a, cs) ->\n      dp.(i lor cs) <- min dp.(i lor cs) (a + dp.(i))) acss\n  done;\n  Printf.printf \"%d\\n\" @@\n  if dp.((1 lsl n) - 1) = 1145141919\n  then -1\n  else dp.((1 lsl n) - 1)\n\n", "language": "OCaml", "metadata": {"date": 1569721955, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02901.html", "problem_id": "p02901", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02901/input.txt", "sample_output_relpath": "derived/input_output/data/p02901/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02901/OCaml/s344357714.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s344357714", "user_id": "u504158101"}, "prompt_components": {"gold_output": "25\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let acss = Array.init m @@ fun _ ->\n    Scanf.scanf \"%d %d\\n\" @@ fun a b ->\n      a,\n      Array.fold_left ( lor ) 0 @@\n      Array.init b @@ fun _ -> Scanf.scanf \"%d \" @@ fun c -> 1 lsl (c - 1) in\n  let dp = Array.make (1 lsl n) 1145141919 in\n  dp.(0) <- 0;\n  for i = 0 to (1 lsl n) - 1 do\n    Array.iter (fun (a, cs) ->\n      dp.(i lor cs) <- min dp.(i lor cs) (a + dp.(i))) acss\n  done;\n  Printf.printf \"%d\\n\" @@\n  if dp.((1 lsl n) - 1) = 1145141919\n  then -1\n  else dp.((1 lsl n) - 1)\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have N locked treasure boxes, numbered 1 to N.\n\nA shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{i{b_i}}. Each key purchased can be used any number of times.\n\nFind the minimum cost required to unlock all the treasure boxes. If it is impossible to unlock all of them, print -1.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 12\n\n1 \\leq M \\leq 10^3\n\n1 \\leq a_i \\leq 10^5\n\n1 \\leq b_i \\leq N\n\n1 \\leq c_{i1} < c_{i2} < ... < c_{i{b_i}} \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\nc_{11} c_{12} ... c_{1{b_1}}\n:\na_M b_M\nc_{M1} c_{M2} ... c_{M{b_M}}\n\nOutput\n\nPrint the minimum cost required to unlock all the treasure boxes.\nIf it is impossible to unlock all of them, print -1.\n\nSample Input 1\n\n2 3\n10 1\n1\n15 1\n2\n30 2\n1 2\n\nSample Output 1\n\n25\n\nWe can unlock all the boxes by purchasing the first and second keys, at the cost of 25 yen, which is the minimum cost required.\n\nSample Input 2\n\n12 1\n100000 1\n2\n\nSample Output 2\n\n-1\n\nWe cannot unlock all the boxes.\n\nSample Input 3\n\n4 6\n67786 3\n1 3 4\n3497 1\n2\n44908 3\n2 3 4\n2156 3\n2 3 4\n26230 1\n2\n86918 1\n3\n\nSample Output 3\n\n69942", "sample_input": "2 3\n10 1\n1\n15 1\n2\n30 2\n1 2\n"}, "reference_outputs": ["25\n"], "source_document_id": "p02901", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have N locked treasure boxes, numbered 1 to N.\n\nA shop sells M keys. The i-th key is sold for a_i yen (the currency of Japan), and it can unlock b_i of the boxes: Box c_{i1}, c_{i2}, ..., c_{i{b_i}}. Each key purchased can be used any number of times.\n\nFind the minimum cost required to unlock all the treasure boxes. If it is impossible to unlock all of them, print -1.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 12\n\n1 \\leq M \\leq 10^3\n\n1 \\leq a_i \\leq 10^5\n\n1 \\leq b_i \\leq N\n\n1 \\leq c_{i1} < c_{i2} < ... < c_{i{b_i}} \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\nc_{11} c_{12} ... c_{1{b_1}}\n:\na_M b_M\nc_{M1} c_{M2} ... c_{M{b_M}}\n\nOutput\n\nPrint the minimum cost required to unlock all the treasure boxes.\nIf it is impossible to unlock all of them, print -1.\n\nSample Input 1\n\n2 3\n10 1\n1\n15 1\n2\n30 2\n1 2\n\nSample Output 1\n\n25\n\nWe can unlock all the boxes by purchasing the first and second keys, at the cost of 25 yen, which is the minimum cost required.\n\nSample Input 2\n\n12 1\n100000 1\n2\n\nSample Output 2\n\n-1\n\nWe cannot unlock all the boxes.\n\nSample Input 3\n\n4 6\n67786 3\n1 3 4\n3497 1\n2\n44908 3\n2 3 4\n2156 3\n2 3 4\n26230 1\n2\n86918 1\n3\n\nSample Output 3\n\n69942", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 537, "cpu_time_ms": 63, "memory_kb": 2688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s442460415", "group_id": "codeNet:p02902", "input_text": "let rec drop n xs =\n  if n = 0\n  then xs\n  else drop (n - 1) (List.tl xs)\n\nexception Exit of int list\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let es = Array.make n [] in\n  let visited = Array.make n false in\n  let trace = Array.make n None in\n  for i = 0 to m - 1 do\n    Scanf.scanf \"%d %d\\n\" @@ fun a b ->\n      es.(a - 1) <- b - 1 :: es.(a - 1)\n  done;\n  let rec visit vs v =\n    match trace.(v) with\n    | Some us -> raise (Exit (drop (List.length us) (List.rev vs)))\n    | None ->\n        if not visited.(v) then begin\n          visited.(v) <- true;\n          trace.(v) <- Some vs;\n          List.iter (fun u -> visit (v :: vs) u) es.(v);\n          trace.(v) <- None\n        end in\n  try\n    for v = 0 to n - 1 do\n      visit [] v\n    done;\n    print_endline \"-1\"\n  with Exit vs ->\n    Printf.printf \"%d\\n\" (List.length vs);\n    List.iter (fun v -> Printf.printf \"%d\\n\" @@ v + 1) vs\n", "language": "OCaml", "metadata": {"date": 1569725679, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02902.html", "problem_id": "p02902", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02902/input.txt", "sample_output_relpath": "derived/input_output/data/p02902/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02902/OCaml/s442460415.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s442460415", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3\n1\n2\n4\n", "input_to_evaluate": "let rec drop n xs =\n  if n = 0\n  then xs\n  else drop (n - 1) (List.tl xs)\n\nexception Exit of int list\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let es = Array.make n [] in\n  let visited = Array.make n false in\n  let trace = Array.make n None in\n  for i = 0 to m - 1 do\n    Scanf.scanf \"%d %d\\n\" @@ fun a b ->\n      es.(a - 1) <- b - 1 :: es.(a - 1)\n  done;\n  let rec visit vs v =\n    match trace.(v) with\n    | Some us -> raise (Exit (drop (List.length us) (List.rev vs)))\n    | None ->\n        if not visited.(v) then begin\n          visited.(v) <- true;\n          trace.(v) <- Some vs;\n          List.iter (fun u -> visit (v :: vs) u) es.(v);\n          trace.(v) <- None\n        end in\n  try\n    for v = 0 to n - 1 do\n      visit [] v\n    done;\n    print_endline \"-1\"\n  with Exit vs ->\n    Printf.printf \"%d\\n\" (List.length vs);\n    List.iter (fun v -> Printf.printf \"%d\\n\" @@ v + 1) vs\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven is a directed graph G with N vertices and M edges.\n\nThe vertices are numbered 1 to N, and the i-th edge is directed from Vertex A_i to Vertex B_i.\n\nIt is guaranteed that the graph contains no self-loops or multiple edges.\n\nDetermine whether there exists an induced subgraph (see Notes) of G such that the in-degree and out-degree of every vertex are both 1. If the answer is yes, show one such subgraph.\n\nHere the null graph is not considered as a subgraph.\n\nNotes\n\nFor a directed graph G = (V, E), we call a directed graph G' = (V', E') satisfying the following conditions an induced subgraph of G:\n\nV' is a (non-empty) subset of V.\n\nE' is the set of all the edges in E that have both endpoints in V'.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n0 \\leq M \\leq 2000\n\n1 \\leq A_i,B_i \\leq N\n\nA_i \\neq B_i\n\nAll pairs (A_i, B_i) are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n:\nA_M B_M\n\nOutput\n\nIf there is no induced subgraph of G that satisfies the condition, print -1.\nOtherwise, print an induced subgraph of G that satisfies the condition, in the following format:\n\nK\nv_1\nv_2\n:\nv_K\n\nThis represents the induced subgraph of G with K vertices whose vertex set is \\{v_1, v_2, \\ldots, v_K\\}. (The order of v_1, v_2, \\ldots, v_K does not matter.)\nIf there are multiple subgraphs of G that satisfy the condition, printing any of them is accepted.\n\nSample Input 1\n\n4 5\n1 2\n2 3\n2 4\n4 1\n4 3\n\nSample Output 1\n\n3\n1\n2\n4\n\nThe induced subgraph of G whose vertex set is \\{1, 2, 4\\} has the edge set \\{(1, 2), (2, 4), (4, 1)\\}. The in-degree and out-degree of every vertex in this graph are both 1.\n\nSample Input 2\n\n4 5\n1 2\n2 3\n2 4\n1 4\n4 3\n\nSample Output 2\n\n-1\n\nThere is no induced subgraph of G that satisfies the condition.\n\nSample Input 3\n\n6 9\n1 2\n2 3\n3 4\n4 5\n5 6\n5 1\n5 2\n6 1\n6 2\n\nSample Output 3\n\n4\n2\n3\n4\n5", "sample_input": "4 5\n1 2\n2 3\n2 4\n4 1\n4 3\n"}, "reference_outputs": ["3\n1\n2\n4\n"], "source_document_id": "p02902", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven is a directed graph G with N vertices and M edges.\n\nThe vertices are numbered 1 to N, and the i-th edge is directed from Vertex A_i to Vertex B_i.\n\nIt is guaranteed that the graph contains no self-loops or multiple edges.\n\nDetermine whether there exists an induced subgraph (see Notes) of G such that the in-degree and out-degree of every vertex are both 1. If the answer is yes, show one such subgraph.\n\nHere the null graph is not considered as a subgraph.\n\nNotes\n\nFor a directed graph G = (V, E), we call a directed graph G' = (V', E') satisfying the following conditions an induced subgraph of G:\n\nV' is a (non-empty) subset of V.\n\nE' is the set of all the edges in E that have both endpoints in V'.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n0 \\leq M \\leq 2000\n\n1 \\leq A_i,B_i \\leq N\n\nA_i \\neq B_i\n\nAll pairs (A_i, B_i) are distinct.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n:\nA_M B_M\n\nOutput\n\nIf there is no induced subgraph of G that satisfies the condition, print -1.\nOtherwise, print an induced subgraph of G that satisfies the condition, in the following format:\n\nK\nv_1\nv_2\n:\nv_K\n\nThis represents the induced subgraph of G with K vertices whose vertex set is \\{v_1, v_2, \\ldots, v_K\\}. (The order of v_1, v_2, \\ldots, v_K does not matter.)\nIf there are multiple subgraphs of G that satisfy the condition, printing any of them is accepted.\n\nSample Input 1\n\n4 5\n1 2\n2 3\n2 4\n4 1\n4 3\n\nSample Output 1\n\n3\n1\n2\n4\n\nThe induced subgraph of G whose vertex set is \\{1, 2, 4\\} has the edge set \\{(1, 2), (2, 4), (4, 1)\\}. The in-degree and out-degree of every vertex in this graph are both 1.\n\nSample Input 2\n\n4 5\n1 2\n2 3\n2 4\n1 4\n4 3\n\nSample Output 2\n\n-1\n\nThere is no induced subgraph of G that satisfies the condition.\n\nSample Input 3\n\n6 9\n1 2\n2 3\n3 4\n4 5\n5 6\n5 1\n5 2\n6 1\n6 2\n\nSample Output 3\n\n4\n2\n3\n4\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 895, "cpu_time_ms": 2, "memory_kb": 1408}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s369595180", "group_id": "codeNet:p02903", "input_text": "let (h, w, a, b) = Scanf.sscanf (read_line ()) \"%d %d %d %d\" @@ fun h w a b -> (h, w, a, b)\n\nlet () =\n  Array.iter (fun arr ->\n    Array.iter print_int arr;\n    print_newline ()\n  ) @@ Array.init h @@ fun i -> Array.init w @@ fun j -> \n    if i < h - a then\n      if j < w - b then 1 else 0\n    else\n      if j < w - b then 0 else 1", "language": "OCaml", "metadata": {"date": 1589733996, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s369595180.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s369595180", "user_id": "u811309788"}, "prompt_components": {"gold_output": "100\n010\n001\n", "input_to_evaluate": "let (h, w, a, b) = Scanf.sscanf (read_line ()) \"%d %d %d %d\" @@ fun h w a b -> (h, w, a, b)\n\nlet () =\n  Array.iter (fun arr ->\n    Array.iter print_int arr;\n    print_newline ()\n  ) @@ Array.init h @@ fun i -> Array.init w @@ fun j -> \n    if i < h - a then\n      if j < w - b then 1 else 0\n    else\n      if j < w - b then 0 else 1", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 332, "cpu_time_ms": 211, "memory_kb": 11520}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s051659671", "group_id": "codeNet:p02904", "input_text": "module IntMap = Map.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet add a s =\n  IntMap.add a (1 + try IntMap.find a s with Not_found -> 0) s\n\nlet remove a s =\n  match IntMap.find a s with\n  | exception Not_found -> s\n  | 1 -> IntMap.remove a s\n  | n -> IntMap.add a (n - 1) s\n\nmodule SegTree = struct\n  module type SemiGroup = sig\n    type t\n    val op : t -> t -> t\n  end\n\n  module Make (S : SemiGroup) : sig\n    type t\n    type elt\n\n    (* 与えられたリストの要素からなるセグ木を作る *)\n    val of_list : elt list -> t\n    (* f 0, ... f (n - 1)のn要素からなるセグ木を作る *)\n    val init : int -> (int -> elt) -> t\n    (*\n     * update i f t\n     * i番目の要素x_iをf x_iに変更したセグ木を作る\n     *)\n    val update : int -> (elt -> elt) -> t -> t\n    (*\n     * query l r t\n     * 添字が[l, r)の要素を半群の演算子で畳み込んだ値を求める\n     *)\n    val query : int -> int -> t -> elt\n  end with type elt = S.t = struct\n    type elt = S.t\n\n    type body =\n      | Leaf of elt\n      | Node of elt * body * body\n    type t = { size : int; body : body }\n\n    (* セグ木の要素をどのように左右に分配するか\n       正整数nについて lsize n + rsize n = n が成り立たなくてはならない *)\n    let lsize n = n lsr 1\n    let rsize n = (n + 1) lsr 1\n\n    (* セグ木の保持する要素を半群の演算子で畳み込んだもの *)\n    let data = function\n      | Leaf x\n      | Node (x, _, _) -> x\n\n    let mknode l r = Node (S.op (data l) (data r), l, r)\n\n    let rec of_list l = function\n      | 1 -> Leaf (List.hd l), List.tl l\n      | n ->\n          let t1, l = of_list l (lsize n) in\n          let t2, l = of_list l (rsize n) in\n          mknode t1 t2, l\n    let of_list l =\n      let n = List.length l in\n      assert (0 < n);\n      { size = n; body = fst (of_list l n) }\n\n    let rec init i f = function\n      | 1 -> Leaf (f i)\n      | n -> mknode (init i f (lsize n)) (init (i + lsize n) f (rsize n))\n    let init n f =\n      assert (1 <= n);\n      { size = n; body = init 0 f n }\n\n    let rec update n i f = function\n      | Leaf x -> Leaf (f x)\n      | Node (_, l, r) ->\n          if i < lsize n\n          then mknode (update (lsize n) i f l) r\n          else mknode l (update (rsize n) (i - lsize n) f r)\n    let update i f t =\n      assert (0 <= i && i < t.size);\n      { t with body = update t.size i f t.body }\n\n    let rec query n l r = function\n      | Leaf x -> x\n      | Node (x, left, right) ->\n          if l = 0 && r = n then x\n          else if r <= lsize n then query (lsize n) l r left\n          else if lsize n <= l then query (rsize n) (l - lsize n) (r - lsize n) right\n          else S.op (query (lsize n) l (lsize n) left) (query (rsize n) 0 (r - lsize n) right)\n    let query l r t =\n      assert (0 <= l && l < r && r <= t.size);\n      query t.size l r t.body\n  end\nend\n\nmodule ConjSegTree = SegTree.Make (struct\n  type t = bool\n  let op = ( && )\nend)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let ps = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun p -> p in\n  let st =\n    ConjSegTree.of_list @@\n    Array.to_list @@\n    Array.init (n - 1) @@ fun i -> ps.(i) <= ps.(i + 1) in\n  let (ex, _, acc) =\n    Array.fold_left (fun (ex, s, acc) (p, p', b) ->\n      ex || b,\n      add p' (remove p s),\n      acc +\n      if b || fst (IntMap.min_binding s) = p && fst (IntMap.max_binding s) <= p'\n      then 0\n      else 1)\n    (false, Array.fold_right add (Array.sub ps 0 k) IntMap.empty, 1) @@\n    Array.init (n - k) @@ fun i ->\n      ps.(i), ps.(i + k), ConjSegTree.query (i + 1) (i + k) st in\n  Printf.printf \"%d\\n\" @@\n  acc + if ex && not (ConjSegTree.query 0 (k - 1) st) then 1 else 0\n", "language": "OCaml", "metadata": {"date": 1569159582, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02904.html", "problem_id": "p02904", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02904/input.txt", "sample_output_relpath": "derived/input_output/data/p02904/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02904/OCaml/s051659671.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s051659671", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "module IntMap = Map.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet add a s =\n  IntMap.add a (1 + try IntMap.find a s with Not_found -> 0) s\n\nlet remove a s =\n  match IntMap.find a s with\n  | exception Not_found -> s\n  | 1 -> IntMap.remove a s\n  | n -> IntMap.add a (n - 1) s\n\nmodule SegTree = struct\n  module type SemiGroup = sig\n    type t\n    val op : t -> t -> t\n  end\n\n  module Make (S : SemiGroup) : sig\n    type t\n    type elt\n\n    (* 与えられたリストの要素からなるセグ木を作る *)\n    val of_list : elt list -> t\n    (* f 0, ... f (n - 1)のn要素からなるセグ木を作る *)\n    val init : int -> (int -> elt) -> t\n    (*\n     * update i f t\n     * i番目の要素x_iをf x_iに変更したセグ木を作る\n     *)\n    val update : int -> (elt -> elt) -> t -> t\n    (*\n     * query l r t\n     * 添字が[l, r)の要素を半群の演算子で畳み込んだ値を求める\n     *)\n    val query : int -> int -> t -> elt\n  end with type elt = S.t = struct\n    type elt = S.t\n\n    type body =\n      | Leaf of elt\n      | Node of elt * body * body\n    type t = { size : int; body : body }\n\n    (* セグ木の要素をどのように左右に分配するか\n       正整数nについて lsize n + rsize n = n が成り立たなくてはならない *)\n    let lsize n = n lsr 1\n    let rsize n = (n + 1) lsr 1\n\n    (* セグ木の保持する要素を半群の演算子で畳み込んだもの *)\n    let data = function\n      | Leaf x\n      | Node (x, _, _) -> x\n\n    let mknode l r = Node (S.op (data l) (data r), l, r)\n\n    let rec of_list l = function\n      | 1 -> Leaf (List.hd l), List.tl l\n      | n ->\n          let t1, l = of_list l (lsize n) in\n          let t2, l = of_list l (rsize n) in\n          mknode t1 t2, l\n    let of_list l =\n      let n = List.length l in\n      assert (0 < n);\n      { size = n; body = fst (of_list l n) }\n\n    let rec init i f = function\n      | 1 -> Leaf (f i)\n      | n -> mknode (init i f (lsize n)) (init (i + lsize n) f (rsize n))\n    let init n f =\n      assert (1 <= n);\n      { size = n; body = init 0 f n }\n\n    let rec update n i f = function\n      | Leaf x -> Leaf (f x)\n      | Node (_, l, r) ->\n          if i < lsize n\n          then mknode (update (lsize n) i f l) r\n          else mknode l (update (rsize n) (i - lsize n) f r)\n    let update i f t =\n      assert (0 <= i && i < t.size);\n      { t with body = update t.size i f t.body }\n\n    let rec query n l r = function\n      | Leaf x -> x\n      | Node (x, left, right) ->\n          if l = 0 && r = n then x\n          else if r <= lsize n then query (lsize n) l r left\n          else if lsize n <= l then query (rsize n) (l - lsize n) (r - lsize n) right\n          else S.op (query (lsize n) l (lsize n) left) (query (rsize n) 0 (r - lsize n) right)\n    let query l r t =\n      assert (0 <= l && l < r && r <= t.size);\n      query t.size l r t.body\n  end\nend\n\nmodule ConjSegTree = SegTree.Make (struct\n  type t = bool\n  let op = ( && )\nend)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let ps = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun p -> p in\n  let st =\n    ConjSegTree.of_list @@\n    Array.to_list @@\n    Array.init (n - 1) @@ fun i -> ps.(i) <= ps.(i + 1) in\n  let (ex, _, acc) =\n    Array.fold_left (fun (ex, s, acc) (p, p', b) ->\n      ex || b,\n      add p' (remove p s),\n      acc +\n      if b || fst (IntMap.min_binding s) = p && fst (IntMap.max_binding s) <= p'\n      then 0\n      else 1)\n    (false, Array.fold_right add (Array.sub ps 0 k) IntMap.empty, 1) @@\n    Array.init (n - k) @@ fun i ->\n      ps.(i), ps.(i + k), ConjSegTree.query (i + 1) (i + k) st in\n  Printf.printf \"%d\\n\" @@\n  acc + if ex && not (ConjSegTree.query 0 (k - 1) st) then 1 else 0\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nSnuke has a permutation (P_0,P_1,\\cdots,P_{N-1}) of (0,1,\\cdots,N-1).\n\nNow, he will perform the following operation exactly once:\n\nChoose K consecutive elements in P and sort them in ascending order.\n\nFind the number of permutations that can be produced as P after the operation.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n2 \\leq K \\leq N\n\n0 \\leq P_i \\leq N-1\n\nP_0,P_1,\\cdots,P_{N-1} are all different.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nP_0 P_1 \\cdots P_{N-1}\n\nOutput\n\nPrint the number of permutations that can be produced as P after the operation.\n\nSample Input 1\n\n5 3\n0 2 1 4 3\n\nSample Output 1\n\n2\n\nTwo permutations can be produced as P after the operation: (0,1,2,4,3) and (0,2,1,3,4).\n\nSample Input 2\n\n4 4\n0 1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10 4\n2 0 1 3 7 5 4 6 8 9\n\nSample Output 3\n\n6", "sample_input": "5 3\n0 2 1 4 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02904", "source_text": "Score : 700 points\n\nProblem Statement\n\nSnuke has a permutation (P_0,P_1,\\cdots,P_{N-1}) of (0,1,\\cdots,N-1).\n\nNow, he will perform the following operation exactly once:\n\nChoose K consecutive elements in P and sort them in ascending order.\n\nFind the number of permutations that can be produced as P after the operation.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n2 \\leq K \\leq N\n\n0 \\leq P_i \\leq N-1\n\nP_0,P_1,\\cdots,P_{N-1} are all different.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nP_0 P_1 \\cdots P_{N-1}\n\nOutput\n\nPrint the number of permutations that can be produced as P after the operation.\n\nSample Input 1\n\n5 3\n0 2 1 4 3\n\nSample Output 1\n\n2\n\nTwo permutations can be produced as P after the operation: (0,1,2,4,3) and (0,2,1,3,4).\n\nSample Input 2\n\n4 4\n0 1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n10 4\n2 0 1 3 7 5 4 6 8 9\n\nSample Output 3\n\n6", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3736, "cpu_time_ms": 555, "memory_kb": 39932}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s510384585", "group_id": "codeNet:p02909", "input_text": "let weather s =\n  if s = \"Sunny\" then \"Cloudy\"\n  else if s = \"Cloudy\" then \"Rainy\"\n  else \"Sunny\"\n\nlet () = Printf.printf \"%s\\n\" (weather (read_line ()))", "language": "OCaml", "metadata": {"date": 1595715170, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s510384585.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s510384585", "user_id": "u272377260"}, "prompt_components": {"gold_output": "Cloudy\n", "input_to_evaluate": "let weather s =\n  if s = \"Sunny\" then \"Cloudy\"\n  else if s = \"Cloudy\" then \"Rainy\"\n  else \"Sunny\"\n\nlet () = Printf.printf \"%s\\n\" (weather (read_line ()))", "problem_context": "Score: 100 points\n\nProblem Statement\n\nThe weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...\n\nGiven is a string S representing the weather in the town today. Predict the weather tomorrow.\n\nConstraints\n\nS is Sunny, Cloudy, or Rainy.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint a string representing the expected weather tomorrow, in the same format in which input is given.\n\nSample Input 1\n\nSunny\n\nSample Output 1\n\nCloudy\n\nIn Takahashi's town, a sunny day is followed by a cloudy day.\n\nSample Input 2\n\nRainy\n\nSample Output 2\n\nSunny", "sample_input": "Sunny\n"}, "reference_outputs": ["Cloudy\n"], "source_document_id": "p02909", "source_text": "Score: 100 points\n\nProblem Statement\n\nThe weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...\n\nGiven is a string S representing the weather in the town today. Predict the weather tomorrow.\n\nConstraints\n\nS is Sunny, Cloudy, or Rainy.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint a string representing the expected weather tomorrow, in the same format in which input is given.\n\nSample Input 1\n\nSunny\n\nSample Output 1\n\nCloudy\n\nIn Takahashi's town, a sunny day is followed by a cloudy day.\n\nSample Input 2\n\nRainy\n\nSample Output 2\n\nSunny", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 153, "cpu_time_ms": 7, "memory_kb": 3604}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s500861303", "group_id": "codeNet:p02911", "input_text": "(*\nocamlfind ocamlopt -package batteries -linkpkg main.ml -o a.out\n*)\nopen Batteries\n\nlet n, k, q = Scanf.sscanf (read_line ()) \"%d %d %d\" ( fun n k q -> n, k, q)\nlet lst = List.init q ( fun _ -> Scanf.sscanf (read_line ()) \"%d\" ( fun a -> a))\n\nlet score_lst = List.init n (\n        fun i -> \n                (i + 1, k)\n)\n\nlet rec f lst score_lst =\n        match lst with\n                  [] -> score_lst\n                | first :: rest -> \n                        let nscore_lst = List.map (fun (i, score) ->\n                                if i = first then\n                                        (i, score)\n                                else\n                                        (i, score - 1)\n                        ) score_lst\n                        in\n                                f rest nscore_lst\n\nlet () =\n        List.iter (fun (_, score) ->\n                if score > 0 then\n                        Printf.printf \"Yes\\n\"\n                else\n                        Printf.printf \"No\\n\"\n        ) (f lst score_lst)\n", "language": "OCaml", "metadata": {"date": 1590459412, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s500861303.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s500861303", "user_id": "u280335093"}, "prompt_components": {"gold_output": "No\nNo\nYes\nNo\nNo\nNo\n", "input_to_evaluate": "(*\nocamlfind ocamlopt -package batteries -linkpkg main.ml -o a.out\n*)\nopen Batteries\n\nlet n, k, q = Scanf.sscanf (read_line ()) \"%d %d %d\" ( fun n k q -> n, k, q)\nlet lst = List.init q ( fun _ -> Scanf.sscanf (read_line ()) \"%d\" ( fun a -> a))\n\nlet score_lst = List.init n (\n        fun i -> \n                (i + 1, k)\n)\n\nlet rec f lst score_lst =\n        match lst with\n                  [] -> score_lst\n                | first :: rest -> \n                        let nscore_lst = List.map (fun (i, score) ->\n                                if i = first then\n                                        (i, score)\n                                else\n                                        (i, score - 1)\n                        ) score_lst\n                        in\n                                f rest nscore_lst\n\nlet () =\n        List.iter (fun (_, score) ->\n                if score > 0 then\n                        Printf.printf \"Yes\\n\"\n                else\n                        Printf.printf \"No\\n\"\n        ) (f lst score_lst)\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1038, "cpu_time_ms": 2106, "memory_kb": 33436}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s521098358", "group_id": "codeNet:p02911", "input_text": "let () =\n    let main () =\n        let n, k, q = Scanf.sscanf (read_line ()) \"%d %d %d\" (fun a b c -> a, b, c) in\n        let p = Array.make n (k - q) in\n        for i = 1 to q do\n            let a = int_of_string (read_line ()) - 1 in\n            p.(a) <- p.(a) + 1\n        done;\n        Array.iter (fun v -> print_endline (if v > 0 then \"Yes\" else \"No\")) p\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1568596195, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s521098358.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s521098358", "user_id": "u342443598"}, "prompt_components": {"gold_output": "No\nNo\nYes\nNo\nNo\nNo\n", "input_to_evaluate": "let () =\n    let main () =\n        let n, k, q = Scanf.sscanf (read_line ()) \"%d %d %d\" (fun a b c -> a, b, c) in\n        let p = Array.make n (k - q) in\n        for i = 1 to q do\n            let a = int_of_string (read_line ()) - 1 in\n            p.(a) <- p.(a) + 1\n        done;\n        Array.iter (fun v -> print_endline (if v > 0 then \"Yes\" else \"No\")) p\n    in\n    main ()", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 152, "memory_kb": 7040}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s253884062", "group_id": "codeNet:p02915", "input_text": "let n = read_int ()\nlet () = print_int (n*n*n)", "language": "OCaml", "metadata": {"date": 1588325442, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s253884062.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s253884062", "user_id": "u307426615"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "let n = read_int ()\nlet () = print_int (n*n*n)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is going to set a 3-character password.\n\nHow many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?\n\nConstraints\n\n1 \\leq N \\leq 9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of possible passwords.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n8\n\nThere are eight possible passwords: 111, 112, 121, 122, 211, 212, 221, and 222.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nThere is only one possible password if you can only use one kind of character.", "sample_input": "2\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02915", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is going to set a 3-character password.\n\nHow many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?\n\nConstraints\n\n1 \\leq N \\leq 9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of possible passwords.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n8\n\nThere are eight possible passwords: 111, 112, 121, 122, 211, 212, 221, and 222.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nThere is only one possible password if you can only use one kind of character.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 46, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s847954058", "group_id": "codeNet:p02915", "input_text": "open Printf\nopen Scanf\n\nlet solve n = n * n * n\n\nlet () =\n  scanf \"%d \" solve |> printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1582402888, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s847954058.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s847954058", "user_id": "u388783188"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve n = n * n * n\n\nlet () =\n  scanf \"%d \" solve |> printf \"%d\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is going to set a 3-character password.\n\nHow many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?\n\nConstraints\n\n1 \\leq N \\leq 9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of possible passwords.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n8\n\nThere are eight possible passwords: 111, 112, 121, 122, 211, 212, 221, and 222.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nThere is only one possible password if you can only use one kind of character.", "sample_input": "2\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02915", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is going to set a 3-character password.\n\nHow many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?\n\nConstraints\n\n1 \\leq N \\leq 9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of possible passwords.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n8\n\nThere are eight possible passwords: 111, 112, 121, 122, 211, 212, 221, and 222.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nThere is only one possible password if you can only use one kind of character.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 95, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s566112305", "group_id": "codeNet:p02915", "input_text": "let n = read_int ()\nlet _ = Printf.printf \"%d\\n\" @@ n * n * n", "language": "OCaml", "metadata": {"date": 1567949640, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s566112305.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s566112305", "user_id": "u732304692"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "let n = read_int ()\nlet _ = Printf.printf \"%d\\n\" @@ n * n * n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is going to set a 3-character password.\n\nHow many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?\n\nConstraints\n\n1 \\leq N \\leq 9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of possible passwords.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n8\n\nThere are eight possible passwords: 111, 112, 121, 122, 211, 212, 221, and 222.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nThere is only one possible password if you can only use one kind of character.", "sample_input": "2\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02915", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is going to set a 3-character password.\n\nHow many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?\n\nConstraints\n\n1 \\leq N \\leq 9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of possible passwords.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n8\n\nThere are eight possible passwords: 111, 112, 121, 122, 211, 212, 221, and 222.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nThere is only one possible password if you can only use one kind of character.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 61, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s264961110", "group_id": "codeNet:p02916", "input_text": "let f () = Scanf.scanf \" %d\" (+) 0\nlet n = f ()\nlet a_s = Array.init n @@ fun _ -> f ()\nlet bs = Array.init n @@ fun _ -> f ()\nlet cs = Array.init (n - 1) @@ fun _ -> f ()\nlet ans = ref @@ Array.fold_left (+) 0 bs\nlet _ = for i = 0 to n - 2 do if a_s.(i + 1) = a_s.(i) + 1 then ans := !ans + cs.(a_s.(i) - 1) done; Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1567951332, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s264961110.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s264961110", "user_id": "u732304692"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "let f () = Scanf.scanf \" %d\" (+) 0\nlet n = f ()\nlet a_s = Array.init n @@ fun _ -> f ()\nlet bs = Array.init n @@ fun _ -> f ()\nlet cs = Array.init (n - 1) @@ fun _ -> f ()\nlet ans = ref @@ Array.fold_left (+) 0 bs\nlet _ = for i = 0 to n - 2 do if a_s.(i + 1) = a_s.(i) + 1 then ans := !ans + cs.(a_s.(i) - 1) done; Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi went to an all-you-can-eat buffet with N kinds of dishes and ate all of them (Dish 1, Dish 2, \\ldots, Dish N) once.\n\nThe i-th dish (1 \\leq i \\leq N) he ate was Dish A_i.\n\nWhen he eats Dish i (1 \\leq i \\leq N), he gains B_i satisfaction points.\n\nAdditionally, when he eats Dish i+1 just after eating Dish i (1 \\leq i \\leq N - 1), he gains C_i more satisfaction points.\n\nFind the sum of the satisfaction points he gained.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 20\n\n1 \\leq A_i \\leq N\n\nA_1, A_2, ..., A_N are all different.\n\n1 \\leq B_i \\leq 50\n\n1 \\leq C_i \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\nB_1 B_2 ... B_N\nC_1 C_2 ... C_{N-1}\n\nOutput\n\nPrint the sum of the satisfaction points Takahashi gained, as an integer.\n\nSample Input 1\n\n3\n3 1 2\n2 5 4\n3 6\n\nSample Output 1\n\n14\n\nTakahashi gained 14 satisfaction points in total, as follows:\n\nFirst, he ate Dish 3 and gained 4 satisfaction points.\n\nNext, he ate Dish 1 and gained 2 satisfaction points.\n\nLastly, he ate Dish 2 and gained 5 + 3 = 8 satisfaction points.\n\nSample Input 2\n\n4\n2 3 4 1\n13 5 8 24\n45 9 15\n\nSample Output 2\n\n74\n\nSample Input 3\n\n2\n1 2\n50 50\n50\n\nSample Output 3\n\n150", "sample_input": "3\n3 1 2\n2 5 4\n3 6\n"}, "reference_outputs": ["14\n"], "source_document_id": "p02916", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi went to an all-you-can-eat buffet with N kinds of dishes and ate all of them (Dish 1, Dish 2, \\ldots, Dish N) once.\n\nThe i-th dish (1 \\leq i \\leq N) he ate was Dish A_i.\n\nWhen he eats Dish i (1 \\leq i \\leq N), he gains B_i satisfaction points.\n\nAdditionally, when he eats Dish i+1 just after eating Dish i (1 \\leq i \\leq N - 1), he gains C_i more satisfaction points.\n\nFind the sum of the satisfaction points he gained.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 20\n\n1 \\leq A_i \\leq N\n\nA_1, A_2, ..., A_N are all different.\n\n1 \\leq B_i \\leq 50\n\n1 \\leq C_i \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\nB_1 B_2 ... B_N\nC_1 C_2 ... C_{N-1}\n\nOutput\n\nPrint the sum of the satisfaction points Takahashi gained, as an integer.\n\nSample Input 1\n\n3\n3 1 2\n2 5 4\n3 6\n\nSample Output 1\n\n14\n\nTakahashi gained 14 satisfaction points in total, as follows:\n\nFirst, he ate Dish 3 and gained 4 satisfaction points.\n\nNext, he ate Dish 1 and gained 2 satisfaction points.\n\nLastly, he ate Dish 2 and gained 5 + 3 = 8 satisfaction points.\n\nSample Input 2\n\n4\n2 3 4 1\n13 5 8 24\n45 9 15\n\nSample Output 2\n\n74\n\nSample Input 3\n\n2\n1 2\n50 50\n50\n\nSample Output 3\n\n150", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 340, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s587528869", "group_id": "codeNet:p02917", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let bb = Array.init (n - 1) @@ fun _ -> Scanf.scanf \" %d\" Fun.id in\n  let ans = ref bb.(0) in\n  for i = 1 to n - 2 do\n    ans := !ans + min bb.(i) bb.(i - 1)\n  done;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1596422101, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s587528869.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s587528869", "user_id": "u052332717"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let bb = Array.init (n - 1) @@ fun _ -> Scanf.scanf \" %d\" Fun.id in\n  let ans = ref bb.(0) in\n  for i = 1 to n - 2 do\n    ans := !ans + min bb.(i) bb.(i - 1)\n  done;\n  Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is an integer sequence A of length N whose values are unknown.\n\nGiven is an integer sequence B of length N-1 which is known to satisfy the following:\n\nB_i \\geq \\max(A_i, A_{i+1})\n\nFind the maximum possible sum of the elements of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n0 \\leq B_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nB_1 B_2 ... B_{N-1}\n\nOutput\n\nPrint the maximum possible sum of the elements of A.\n\nSample Input 1\n\n3\n2 5\n\nSample Output 1\n\n9\n\nA can be, for example, ( 2 , 1 , 5 ), ( -1 , -2 , -3 ), or ( 2 , 2 , 5 ). Among those candidates, A = ( 2 , 2 , 5 ) has the maximum possible sum.\n\nSample Input 2\n\n2\n3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n6\n0 153 10 10 23\n\nSample Output 3\n\n53", "sample_input": "3\n2 5\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02917", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is an integer sequence A of length N whose values are unknown.\n\nGiven is an integer sequence B of length N-1 which is known to satisfy the following:\n\nB_i \\geq \\max(A_i, A_{i+1})\n\nFind the maximum possible sum of the elements of A.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n0 \\leq B_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nB_1 B_2 ... B_{N-1}\n\nOutput\n\nPrint the maximum possible sum of the elements of A.\n\nSample Input 1\n\n3\n2 5\n\nSample Output 1\n\n9\n\nA can be, for example, ( 2 , 1 , 5 ), ( -1 , -2 , -3 ), or ( 2 , 2 , 5 ). Among those candidates, A = ( 2 , 2 , 5 ) has the maximum possible sum.\n\nSample Input 2\n\n2\n3\n\nSample Output 2\n\n6\n\nSample Input 3\n\n6\n0 153 10 10 23\n\nSample Output 3\n\n53", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 10, "memory_kb": 3852}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s738306049", "group_id": "codeNet:p02918", "input_text": "let h = ref 0\nlet n, k, t = Scanf.scanf \"%d %d %s\" @@ fun n k s -> String.iteri (fun i c -> if i > 0 && s.[i - 1] = s.[i] then incr h) s; n, k, min k @@ (n - 1 - !h) / 2\nlet _ = Printf.printf \"%d\\n\" @@ if k > t then n - 1 else !h + 2 * t", "language": "OCaml", "metadata": {"date": 1582763997, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s738306049.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s738306049", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let h = ref 0\nlet n, k, t = Scanf.scanf \"%d %d %s\" @@ fun n k s -> String.iteri (fun i c -> if i > 0 && s.[i - 1] = s.[i] then incr h) s; n, k, min k @@ (n - 1 - !h) / 2\nlet _ = Printf.printf \"%d\\n\" @@ if k > t then n - 1 else !h + 2 * t", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 4480}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s180820163", "group_id": "codeNet:p02918", "input_text": "let () = Scanf.scanf \"%d %d\\n%s\" @@ fun n k s ->\n  let ss = Array.make n 1 in\n  let ls = Array.make n 0 in\n  for i = 1 to n - 1 do\n    if s.[i - 1] = s.[i]\n    then begin\n      ss.(i) <- ss.(i - 1);\n      ls.(ss.(i)) <- 1 + ls.(ss.(i))\n    end else begin\n      ss.(i) <- ss.(i - 1) + 1\n    end\n  done;\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left ( + ) 0 ls + min (ss.(n - 1) - 1) (2 * k)\n", "language": "OCaml", "metadata": {"date": 1567910321, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s180820163.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s180820163", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\\n%s\" @@ fun n k s ->\n  let ss = Array.make n 1 in\n  let ls = Array.make n 0 in\n  for i = 1 to n - 1 do\n    if s.[i - 1] = s.[i]\n    then begin\n      ss.(i) <- ss.(i - 1);\n      ls.(ss.(i)) <- 1 + ls.(ss.(i))\n    end else begin\n      ss.(i) <- ss.(i - 1) + 1\n    end\n  done;\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left ( + ) 0 ls + min (ss.(n - 1) - 1) (2 * k)\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 4224}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s852432414", "group_id": "codeNet:p02921", "input_text": "open Printf\nopen Scanf\n\nlet solve s1 s2 =\n  let f ct i = if String.get s1 i = String.get s2 i then ct + 1 else ct in\n  List.fold_left f 0 [0; 1; 2]\n\nlet () =\n  scanf \"%s %s \" solve |> printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1582382254, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s852432414.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s852432414", "user_id": "u388783188"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve s1 s2 =\n  let f ct i = if String.get s1 i = String.get s2 i then ct + 1 else ct in\n  List.fold_left f 0 [0; 1; 2]\n\nlet () =\n  scanf \"%s %s \" solve |> printf \"%d\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will be given a string S of length 3 representing the weather forecast for three days in the past.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the forecast for the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nYou will also be given a string T of length 3 representing the actual weather on those three days.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the actual weather on the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nPrint the number of days for which the forecast was correct.\n\nConstraints\n\nS and T are strings of length 3 each.\n\nS and T consist of S, C, and R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the number of days for which the forecast was correct.\n\nSample Input 1\n\nCSS\nCSR\n\nSample Output 1\n\n2\n\nFor the first day, it was forecast to be cloudy, and it was indeed cloudy.\n\nFor the second day, it was forecast to be sunny, and it was indeed sunny.\n\nFor the third day, it was forecast to be sunny, but it was rainy.\n\nThus, the forecast was correct for two days in this case.\n\nSample Input 2\n\nSSR\nSSR\n\nSample Output 2\n\n3\n\nSample Input 3\n\nRRR\nSSS\n\nSample Output 3\n\n0", "sample_input": "CSS\nCSR\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02921", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will be given a string S of length 3 representing the weather forecast for three days in the past.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the forecast for the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nYou will also be given a string T of length 3 representing the actual weather on those three days.\n\nThe i-th character (1 \\leq i \\leq 3) of S represents the actual weather on the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.\n\nPrint the number of days for which the forecast was correct.\n\nConstraints\n\nS and T are strings of length 3 each.\n\nS and T consist of S, C, and R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the number of days for which the forecast was correct.\n\nSample Input 1\n\nCSS\nCSR\n\nSample Output 1\n\n2\n\nFor the first day, it was forecast to be cloudy, and it was indeed cloudy.\n\nFor the second day, it was forecast to be sunny, and it was indeed sunny.\n\nFor the third day, it was forecast to be sunny, but it was rainy.\n\nThus, the forecast was correct for two days in this case.\n\nSample Input 2\n\nSSR\nSSR\n\nSample Output 2\n\n3\n\nSample Input 3\n\nRRR\nSSS\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 198, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s098131084", "group_id": "codeNet:p02922", "input_text": "let _ = Scanf.sscanf (read_line()) \"%d %d\" (fun a b ->\n   let rec loop i ans =\n    if ans >= b then i else\n    loop (i+1) (ans - 1 + a)\n  in loop 0 1\n) |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1586937254, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s098131084.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s098131084", "user_id": "u511870776"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let _ = Scanf.sscanf (read_line()) \"%d %d\" (fun a b ->\n   let rec loop i ans =\n    if ans >= b then i else\n    loop (i+1) (ans - 1 + a)\n  in loop 0 1\n) |> Printf.printf \"%d\\n\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "sample_input": "4 10\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02922", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi's house has only one socket.\n\nTakahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.\n\nOne power strip with A sockets can extend one empty socket into A empty sockets.\n\nFind the minimum number of power strips required.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq A \\leq 20\n\n1 \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the minimum number of power strips required.\n\nSample Input 1\n\n4 10\n\nSample Output 1\n\n3\n\n3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.\n\nSample Input 2\n\n8 9\n\nSample Output 2\n\n2\n\n2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.\n\nSample Input 3\n\n8 8\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 175, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s849672616", "group_id": "codeNet:p02923", "input_text": "(* Vicfred\n * https://atcoder.jp/contests/abc139/tasks/abc139_c\n * implementation\n * *)\nlet n = Scanf.scanf \"%d\\n\" ( + ) 0\nlet hs = Array.init n @@ fun _ -> Scanf.scanf \" %d\" ( + ) 0\nlet maxima = ref 0\nlet main =\n    Array.fold_left (fun (m, p) h -> if h <= p then incr maxima else maxima := 0;\n    max m !maxima, h) (0, 0) hs |> fst |> Printf.printf \"%d\\n\"\n\n", "language": "OCaml", "metadata": {"date": 1593769406, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s849672616.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s849672616", "user_id": "u737840172"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(* Vicfred\n * https://atcoder.jp/contests/abc139/tasks/abc139_c\n * implementation\n * *)\nlet n = Scanf.scanf \"%d\\n\" ( + ) 0\nlet hs = Array.init n @@ fun _ -> Scanf.scanf \" %d\" ( + ) 0\nlet maxima = ref 0\nlet main =\n    Array.fold_left (fun (m, p) h -> if h <= p then incr maxima else maxima := 0;\n    max m !maxima, h) (0, 0) hs |> fst |> Printf.printf \"%d\\n\"\n\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 40, "memory_kb": 6736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s505184640", "group_id": "codeNet:p02925", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ass =\n    Array.init n @@ fun _ ->\n      Array.init (n - 1) @@ fun _ ->\n        Scanf.scanf \"%d \" @@ fun a -> a - 1 in\n  let es = Array.make_matrix n n [] in\n  for i = 0 to n - 1 do\n    for j = 0 to n - 3 do\n      es.(min i ass.(i).(j)).(max i ass.(i).(j)) <-\n        (min i ass.(i).(j + 1), max i ass.(i).(j + 1)) ::\n        es.(min i ass.(i).(j)).(max i ass.(i).(j))\n    done\n  done;\n  let dp = Array.make_matrix n n (-1) in\n  let vs = Array.make_matrix n n false in\n  let rec visit acc (i, j) =\n    if vs.(i).(j)\n    then raise Not_found\n    else begin\n      vs.(i).(j) <- true;\n      let ans = List.fold_left visit ((i, j) :: acc) es.(i).(j) in\n      vs.(i).(j) <- false;\n      ans\n    end in\n  try\n    let sort =\n      Array.fold_left visit [] @@\n      Array.init n @@ fun i ->\n        (min i ass.(i).(0), max i ass.(i).(0)) in\n    let rec update prev (i, j) =\n      if dp.(i).(j) <= prev\n      then begin\n        dp.(i).(j) <- prev + 1;\n        List.iter (update dp.(i).(j)) es.(i).(j)\n      end in\n    List.iter (update 0) sort;\n    Printf.printf \"%d\\n\" @@\n    Array.fold_left (Array.fold_left max) min_int dp\n  with Not_found -> print_endline \"-1\"\n\n", "language": "OCaml", "metadata": {"date": 1567372739, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s505184640.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s505184640", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ass =\n    Array.init n @@ fun _ ->\n      Array.init (n - 1) @@ fun _ ->\n        Scanf.scanf \"%d \" @@ fun a -> a - 1 in\n  let es = Array.make_matrix n n [] in\n  for i = 0 to n - 1 do\n    for j = 0 to n - 3 do\n      es.(min i ass.(i).(j)).(max i ass.(i).(j)) <-\n        (min i ass.(i).(j + 1), max i ass.(i).(j + 1)) ::\n        es.(min i ass.(i).(j)).(max i ass.(i).(j))\n    done\n  done;\n  let dp = Array.make_matrix n n (-1) in\n  let vs = Array.make_matrix n n false in\n  let rec visit acc (i, j) =\n    if vs.(i).(j)\n    then raise Not_found\n    else begin\n      vs.(i).(j) <- true;\n      let ans = List.fold_left visit ((i, j) :: acc) es.(i).(j) in\n      vs.(i).(j) <- false;\n      ans\n    end in\n  try\n    let sort =\n      Array.fold_left visit [] @@\n      Array.init n @@ fun i ->\n        (min i ass.(i).(0), max i ass.(i).(0)) in\n    let rec update prev (i, j) =\n      if dp.(i).(j) <= prev\n      then begin\n        dp.(i).(j) <- prev + 1;\n        List.iter (update dp.(i).(j)) es.(i).(j)\n      end in\n    List.iter (update 0) sort;\n    Printf.printf \"%d\\n\" @@\n    Array.fold_left (Array.fold_left max) min_int dp\n  with Not_found -> print_endline \"-1\"\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nN players will participate in a tennis tournament. We will call them Player 1, Player 2, \\ldots, Player N.\n\nThe tournament is round-robin format, and there will be N(N-1)/2 matches in total.\nIs it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.\n\nEach player plays at most one matches in a day.\n\nEach player i (1 \\leq i \\leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} in this order.\n\nConstraints\n\n3 \\leq N \\leq 1000\n\n1 \\leq A_{i, j} \\leq N\n\nA_{i, j} \\neq i\n\nA_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} \\ldots A_{1, N-1}\nA_{2, 1} A_{2, 2} \\ldots A_{2, N-1}\n:\nA_{N, 1} A_{N, 2} \\ldots A_{N, N-1}\n\nOutput\n\nIf it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print -1.\n\nSample Input 1\n\n3\n2 3\n1 3\n1 2\n\nSample Output 1\n\n3\n\nAll the conditions can be satisfied if the matches are scheduled for three days as follows:\n\nDay 1: Player 1 vs Player 2\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 2 vs Player 3\n\nThis is the minimum number of days required.\n\nSample Input 2\n\n4\n2 3 4\n1 3 4\n4 1 2\n3 1 2\n\nSample Output 2\n\n4\n\nAll the conditions can be satisfied if the matches are scheduled for four days as follows:\n\nDay 1: Player 1 vs Player 2, Player 3 vs Player 4\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 1 vs Player 4, Player 2 vs Player 3\n\nDay 4: Player 2 vs Player 4\n\nThis is the minimum number of days required.\n\nSample Input 3\n\n3\n2 3\n3 1\n1 2\n\nSample Output 3\n\n-1\n\nAny scheduling of the matches violates some condition.", "sample_input": "3\n2 3\n1 3\n1 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02925", "source_text": "Score : 500 points\n\nProblem Statement\n\nN players will participate in a tennis tournament. We will call them Player 1, Player 2, \\ldots, Player N.\n\nThe tournament is round-robin format, and there will be N(N-1)/2 matches in total.\nIs it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.\n\nEach player plays at most one matches in a day.\n\nEach player i (1 \\leq i \\leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} in this order.\n\nConstraints\n\n3 \\leq N \\leq 1000\n\n1 \\leq A_{i, j} \\leq N\n\nA_{i, j} \\neq i\n\nA_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} \\ldots A_{1, N-1}\nA_{2, 1} A_{2, 2} \\ldots A_{2, N-1}\n:\nA_{N, 1} A_{N, 2} \\ldots A_{N, N-1}\n\nOutput\n\nIf it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print -1.\n\nSample Input 1\n\n3\n2 3\n1 3\n1 2\n\nSample Output 1\n\n3\n\nAll the conditions can be satisfied if the matches are scheduled for three days as follows:\n\nDay 1: Player 1 vs Player 2\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 2 vs Player 3\n\nThis is the minimum number of days required.\n\nSample Input 2\n\n4\n2 3 4\n1 3 4\n4 1 2\n3 1 2\n\nSample Output 2\n\n4\n\nAll the conditions can be satisfied if the matches are scheduled for four days as follows:\n\nDay 1: Player 1 vs Player 2, Player 3 vs Player 4\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 1 vs Player 4, Player 2 vs Player 3\n\nDay 4: Player 2 vs Player 4\n\nThis is the minimum number of days required.\n\nSample Input 3\n\n3\n2 3\n3 1\n1 2\n\nSample Output 3\n\n-1\n\nAny scheduling of the matches violates some condition.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1203, "cpu_time_ms": 2112, "memory_kb": 675120}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s517127903", "group_id": "codeNet:p02925", "input_text": "module M = Map.Make (struct type t = int let compare = compare end)\n\nlet () =\n    let split s =\n        let rec loop i cur flag acc =\n            if i = String.length s then ( if flag then cur :: acc else acc) else (\n                match flag, s.[i] with\n                | true,  ' ' -> loop (i + 1) \"\" false (cur :: acc)\n                | false, ' ' -> loop (i + 1) \"\" false acc\n                | true,  v   -> loop (i + 1) (Printf.sprintf \"%s%c\" cur v) true acc\n                | false, v   -> loop (i + 1) (Printf.sprintf \"%s%c\" cur v) true acc\n            )\n        in\n        List.map int_of_string (List.rev (loop 0 \"\" false []))\n    in\n    let main () =\n        let n = int_of_string (read_line ()) in\n        let a = Array.init n (fun _ -> Array.of_list (split (read_line ()))) in\n        let add key v l map =\n            l.(v) <- l.(v) + 1;\n            M.add key (v :: try M.find key map with _ -> []) map\n        in\n        let canonical (a, b) = if a < b then a * 1024 + b else b * 1024 + a in\n        let l = Array.make (1024 * 1024) 0 in\n        let rec loop_i i map =\n            let rec loop_j j map =\n                if j = n - 1 then map else\n                    let v = a.(i).(j) in\n                    let k = canonical (i + 1, v) in\n                    let map =\n                        if j = 0 then (\n                            if v > i + 1 then add 0 k l map else map\n                        ) else (\n                            let vv = a.(i).(j - 1) in\n                            add (canonical (i + 1, vv)) k l map\n                        )\n                    in\n                    loop_j (j + 1) map\n            in\n            if i = n then map else loop_i (i + 1) (loop_j 0 map)\n        in\n        let map = loop_i 0 (M.singleton 0 []) in\n        let rec emit day rest check map next arr = function\n            | [] -> if rest = 0 then day else\n                    if next <> [] then emit (day + 1) rest check map [] (Array.make (n + 1) false) next\n                    else (-1)\n            | cd :: tl ->\n                    let c = cd lsr 10 in\n                    let d = cd land 1023 in\n                    if arr.(c) || arr.(d) then emit day rest check map (cd :: next) arr tl else\n                        (*\n                        let () = Printf.printf \"day %d: can emit %d,%d\\n\" day c d in\n        *)\n                        let () = arr.(c) <- true in\n                        let () = arr.(d) <- true in\n                        let next = List.fold_left (fun acc cd ->\n                            check.(cd) <- check.(cd) - 1;\n                            if check.(cd) = 0 then cd :: acc else acc\n                        ) next (try M.find cd map with _ -> [])\n                        in\n                        emit day (rest - 1) check map next arr tl\n        in\n        let init = List.fold_left (fun acc cd ->\n            l.(cd) <- l.(cd) - 1;\n            if l.(cd) = 0 then cd :: acc else acc) [] (M.find 0 map)\n        in\n        (*\n        let () = List.iter (fun (c, d) -> Printf.printf \"(%d, %d) \" c d) init in\n        let () = print_newline () in\n    *)\n        let r = emit 1 (n * (n - 1) / 2) l map [] (Array.make (n + 1) false) init in\n        Printf.printf \"%d\\n\" r\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1567372349, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s517127903.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s517127903", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "module M = Map.Make (struct type t = int let compare = compare end)\n\nlet () =\n    let split s =\n        let rec loop i cur flag acc =\n            if i = String.length s then ( if flag then cur :: acc else acc) else (\n                match flag, s.[i] with\n                | true,  ' ' -> loop (i + 1) \"\" false (cur :: acc)\n                | false, ' ' -> loop (i + 1) \"\" false acc\n                | true,  v   -> loop (i + 1) (Printf.sprintf \"%s%c\" cur v) true acc\n                | false, v   -> loop (i + 1) (Printf.sprintf \"%s%c\" cur v) true acc\n            )\n        in\n        List.map int_of_string (List.rev (loop 0 \"\" false []))\n    in\n    let main () =\n        let n = int_of_string (read_line ()) in\n        let a = Array.init n (fun _ -> Array.of_list (split (read_line ()))) in\n        let add key v l map =\n            l.(v) <- l.(v) + 1;\n            M.add key (v :: try M.find key map with _ -> []) map\n        in\n        let canonical (a, b) = if a < b then a * 1024 + b else b * 1024 + a in\n        let l = Array.make (1024 * 1024) 0 in\n        let rec loop_i i map =\n            let rec loop_j j map =\n                if j = n - 1 then map else\n                    let v = a.(i).(j) in\n                    let k = canonical (i + 1, v) in\n                    let map =\n                        if j = 0 then (\n                            if v > i + 1 then add 0 k l map else map\n                        ) else (\n                            let vv = a.(i).(j - 1) in\n                            add (canonical (i + 1, vv)) k l map\n                        )\n                    in\n                    loop_j (j + 1) map\n            in\n            if i = n then map else loop_i (i + 1) (loop_j 0 map)\n        in\n        let map = loop_i 0 (M.singleton 0 []) in\n        let rec emit day rest check map next arr = function\n            | [] -> if rest = 0 then day else\n                    if next <> [] then emit (day + 1) rest check map [] (Array.make (n + 1) false) next\n                    else (-1)\n            | cd :: tl ->\n                    let c = cd lsr 10 in\n                    let d = cd land 1023 in\n                    if arr.(c) || arr.(d) then emit day rest check map (cd :: next) arr tl else\n                        (*\n                        let () = Printf.printf \"day %d: can emit %d,%d\\n\" day c d in\n        *)\n                        let () = arr.(c) <- true in\n                        let () = arr.(d) <- true in\n                        let next = List.fold_left (fun acc cd ->\n                            check.(cd) <- check.(cd) - 1;\n                            if check.(cd) = 0 then cd :: acc else acc\n                        ) next (try M.find cd map with _ -> [])\n                        in\n                        emit day (rest - 1) check map next arr tl\n        in\n        let init = List.fold_left (fun acc cd ->\n            l.(cd) <- l.(cd) - 1;\n            if l.(cd) = 0 then cd :: acc else acc) [] (M.find 0 map)\n        in\n        (*\n        let () = List.iter (fun (c, d) -> Printf.printf \"(%d, %d) \" c d) init in\n        let () = print_newline () in\n    *)\n        let r = emit 1 (n * (n - 1) / 2) l map [] (Array.make (n + 1) false) init in\n        Printf.printf \"%d\\n\" r\n    in\n    main ()", "problem_context": "Score : 500 points\n\nProblem Statement\n\nN players will participate in a tennis tournament. We will call them Player 1, Player 2, \\ldots, Player N.\n\nThe tournament is round-robin format, and there will be N(N-1)/2 matches in total.\nIs it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.\n\nEach player plays at most one matches in a day.\n\nEach player i (1 \\leq i \\leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} in this order.\n\nConstraints\n\n3 \\leq N \\leq 1000\n\n1 \\leq A_{i, j} \\leq N\n\nA_{i, j} \\neq i\n\nA_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} \\ldots A_{1, N-1}\nA_{2, 1} A_{2, 2} \\ldots A_{2, N-1}\n:\nA_{N, 1} A_{N, 2} \\ldots A_{N, N-1}\n\nOutput\n\nIf it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print -1.\n\nSample Input 1\n\n3\n2 3\n1 3\n1 2\n\nSample Output 1\n\n3\n\nAll the conditions can be satisfied if the matches are scheduled for three days as follows:\n\nDay 1: Player 1 vs Player 2\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 2 vs Player 3\n\nThis is the minimum number of days required.\n\nSample Input 2\n\n4\n2 3 4\n1 3 4\n4 1 2\n3 1 2\n\nSample Output 2\n\n4\n\nAll the conditions can be satisfied if the matches are scheduled for four days as follows:\n\nDay 1: Player 1 vs Player 2, Player 3 vs Player 4\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 1 vs Player 4, Player 2 vs Player 3\n\nDay 4: Player 2 vs Player 4\n\nThis is the minimum number of days required.\n\nSample Input 3\n\n3\n2 3\n3 1\n1 2\n\nSample Output 3\n\n-1\n\nAny scheduling of the matches violates some condition.", "sample_input": "3\n2 3\n1 3\n1 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02925", "source_text": "Score : 500 points\n\nProblem Statement\n\nN players will participate in a tennis tournament. We will call them Player 1, Player 2, \\ldots, Player N.\n\nThe tournament is round-robin format, and there will be N(N-1)/2 matches in total.\nIs it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.\n\nEach player plays at most one matches in a day.\n\nEach player i (1 \\leq i \\leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} in this order.\n\nConstraints\n\n3 \\leq N \\leq 1000\n\n1 \\leq A_{i, j} \\leq N\n\nA_{i, j} \\neq i\n\nA_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} \\ldots A_{1, N-1}\nA_{2, 1} A_{2, 2} \\ldots A_{2, N-1}\n:\nA_{N, 1} A_{N, 2} \\ldots A_{N, N-1}\n\nOutput\n\nIf it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print -1.\n\nSample Input 1\n\n3\n2 3\n1 3\n1 2\n\nSample Output 1\n\n3\n\nAll the conditions can be satisfied if the matches are scheduled for three days as follows:\n\nDay 1: Player 1 vs Player 2\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 2 vs Player 3\n\nThis is the minimum number of days required.\n\nSample Input 2\n\n4\n2 3 4\n1 3 4\n4 1 2\n3 1 2\n\nSample Output 2\n\n4\n\nAll the conditions can be satisfied if the matches are scheduled for four days as follows:\n\nDay 1: Player 1 vs Player 2, Player 3 vs Player 4\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 1 vs Player 4, Player 2 vs Player 3\n\nDay 4: Player 2 vs Player 4\n\nThis is the minimum number of days required.\n\nSample Input 3\n\n3\n2 3\n3 1\n1 2\n\nSample Output 3\n\n-1\n\nAny scheduling of the matches violates some condition.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3241, "cpu_time_ms": 2106, "memory_kb": 170616}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s622603428", "group_id": "codeNet:p02925", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ass =\n    Array.init n @@ fun _ ->\n      Array.init (n - 1) @@ fun _ ->\n        Scanf.scanf \"%d \" @@ fun a -> a - 1 in\n  let es = Array.make_matrix n n [] in\n  for i = 0 to n - 1 do\n    for j = 0 to n - 3 do\n      es.(i).(ass.(i).(j)) <-\n        (i, ass.(i).(j + 1)) ::\n        (ass.(i).(j + 1), i) ::\n        es.(i).(ass.(i).(j));\n      es.(ass.(i).(j)).(i) <-\n        (i, ass.(i).(j + 1)) ::\n        (ass.(i).(j + 1), i) :: es.(ass.(i).(j)).(i);\n    done\n  done;\n  let dp = Array.make_matrix n n (-1) in\n  let vs = Array.make_matrix n n false in\n  let rec visit prev mark i j =\n    if vs.(i).(j)\n    then raise Not_found\n    else if dp.(i).(j) <= prev\n    then begin\n      vs.(i).(j) <- true;\n      dp.(i).(j) <- 1 + prev;\n      List.iter (fun (k, l) -> visit dp.(i).(j) mark k l) es.(i).(j);\n      vs.(i).(j) <- false\n    end in\n  try\n    for i = 0 to n - 1 do\n      visit 0 i i ass.(i).(0)\n    done;\n    Printf.printf \"%d\\n\" @@\n    Array.fold_left (Array.fold_left max) min_int dp\n  with Not_found -> print_endline \"-1\"\n\n", "language": "OCaml", "metadata": {"date": 1567371266, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s622603428.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s622603428", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ass =\n    Array.init n @@ fun _ ->\n      Array.init (n - 1) @@ fun _ ->\n        Scanf.scanf \"%d \" @@ fun a -> a - 1 in\n  let es = Array.make_matrix n n [] in\n  for i = 0 to n - 1 do\n    for j = 0 to n - 3 do\n      es.(i).(ass.(i).(j)) <-\n        (i, ass.(i).(j + 1)) ::\n        (ass.(i).(j + 1), i) ::\n        es.(i).(ass.(i).(j));\n      es.(ass.(i).(j)).(i) <-\n        (i, ass.(i).(j + 1)) ::\n        (ass.(i).(j + 1), i) :: es.(ass.(i).(j)).(i);\n    done\n  done;\n  let dp = Array.make_matrix n n (-1) in\n  let vs = Array.make_matrix n n false in\n  let rec visit prev mark i j =\n    if vs.(i).(j)\n    then raise Not_found\n    else if dp.(i).(j) <= prev\n    then begin\n      vs.(i).(j) <- true;\n      dp.(i).(j) <- 1 + prev;\n      List.iter (fun (k, l) -> visit dp.(i).(j) mark k l) es.(i).(j);\n      vs.(i).(j) <- false\n    end in\n  try\n    for i = 0 to n - 1 do\n      visit 0 i i ass.(i).(0)\n    done;\n    Printf.printf \"%d\\n\" @@\n    Array.fold_left (Array.fold_left max) min_int dp\n  with Not_found -> print_endline \"-1\"\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nN players will participate in a tennis tournament. We will call them Player 1, Player 2, \\ldots, Player N.\n\nThe tournament is round-robin format, and there will be N(N-1)/2 matches in total.\nIs it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.\n\nEach player plays at most one matches in a day.\n\nEach player i (1 \\leq i \\leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} in this order.\n\nConstraints\n\n3 \\leq N \\leq 1000\n\n1 \\leq A_{i, j} \\leq N\n\nA_{i, j} \\neq i\n\nA_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} \\ldots A_{1, N-1}\nA_{2, 1} A_{2, 2} \\ldots A_{2, N-1}\n:\nA_{N, 1} A_{N, 2} \\ldots A_{N, N-1}\n\nOutput\n\nIf it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print -1.\n\nSample Input 1\n\n3\n2 3\n1 3\n1 2\n\nSample Output 1\n\n3\n\nAll the conditions can be satisfied if the matches are scheduled for three days as follows:\n\nDay 1: Player 1 vs Player 2\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 2 vs Player 3\n\nThis is the minimum number of days required.\n\nSample Input 2\n\n4\n2 3 4\n1 3 4\n4 1 2\n3 1 2\n\nSample Output 2\n\n4\n\nAll the conditions can be satisfied if the matches are scheduled for four days as follows:\n\nDay 1: Player 1 vs Player 2, Player 3 vs Player 4\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 1 vs Player 4, Player 2 vs Player 3\n\nDay 4: Player 2 vs Player 4\n\nThis is the minimum number of days required.\n\nSample Input 3\n\n3\n2 3\n3 1\n1 2\n\nSample Output 3\n\n-1\n\nAny scheduling of the matches violates some condition.", "sample_input": "3\n2 3\n1 3\n1 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02925", "source_text": "Score : 500 points\n\nProblem Statement\n\nN players will participate in a tennis tournament. We will call them Player 1, Player 2, \\ldots, Player N.\n\nThe tournament is round-robin format, and there will be N(N-1)/2 matches in total.\nIs it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.\n\nEach player plays at most one matches in a day.\n\nEach player i (1 \\leq i \\leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} in this order.\n\nConstraints\n\n3 \\leq N \\leq 1000\n\n1 \\leq A_{i, j} \\leq N\n\nA_{i, j} \\neq i\n\nA_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} \\ldots A_{1, N-1}\nA_{2, 1} A_{2, 2} \\ldots A_{2, N-1}\n:\nA_{N, 1} A_{N, 2} \\ldots A_{N, N-1}\n\nOutput\n\nIf it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print -1.\n\nSample Input 1\n\n3\n2 3\n1 3\n1 2\n\nSample Output 1\n\n3\n\nAll the conditions can be satisfied if the matches are scheduled for three days as follows:\n\nDay 1: Player 1 vs Player 2\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 2 vs Player 3\n\nThis is the minimum number of days required.\n\nSample Input 2\n\n4\n2 3 4\n1 3 4\n4 1 2\n3 1 2\n\nSample Output 2\n\n4\n\nAll the conditions can be satisfied if the matches are scheduled for four days as follows:\n\nDay 1: Player 1 vs Player 2, Player 3 vs Player 4\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 1 vs Player 4, Player 2 vs Player 3\n\nDay 4: Player 2 vs Player 4\n\nThis is the minimum number of days required.\n\nSample Input 3\n\n3\n2 3\n3 1\n1 2\n\nSample Output 3\n\n-1\n\nAny scheduling of the matches violates some condition.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1071, "cpu_time_ms": 2108, "memory_kb": 256504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s770495296", "group_id": "codeNet:p02925", "input_text": "open Printf\nopen Scanf\n\nlet read_intlist: unit -> int list = fun () ->\n  let sl = Str.split (Str.regexp \" \") @@ read_line () in\n  List.map (fun s -> sscanf s \"%d\" (fun x -> x)) sl\n\nlet n = sscanf (read_line ()) \"%d\" (fun x -> x)\nlet a: int array array = Array.make (n+1) [|0|]\nlet () = for y = 1 to n do\n           a.(y) <- 0 :: (read_intlist ()) @ [0] |> Array.of_list\n         done\n\n(*  *)\nlet ans = ref 0\nlet inds = Array.make (n+1) 1\n\nlet () =\n  let bflag = ref true in\n  while !bflag do\n    let dp = Array.make (n+1) false in\n    let flag = ref true in\n\n    for i = 1 to n do\n      let x = inds.(i) in\n      if not dp.(i) && x < n then begin\n        let target = a.(i).(x) in\n        if not dp.(target) && a.(target).(inds.(target)) = i then begin\n            dp.(i) <- true;\n            dp.(target) <- true;\n\n            inds.(i) <- inds.(i) + 1;\n            inds.(target) <- inds.(target) + 1;\n\n            if !flag then\n              flag := false\n          end\n        end;\n    done;\n\n    if !flag then\n      let hoge = List.tl (Array.to_list inds)\n                 |> List.for_all (fun e -> e = n) in\n      if hoge then\n        bflag := false\n      else begin\n          ans := -1;\n          bflag := false\n        end\n    else\n      incr ans\n  done\n\nlet () = print_endline @@ string_of_int !ans\n        \n               \n", "language": "OCaml", "metadata": {"date": 1567367794, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s770495296.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s770495296", "user_id": "u098968285"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet read_intlist: unit -> int list = fun () ->\n  let sl = Str.split (Str.regexp \" \") @@ read_line () in\n  List.map (fun s -> sscanf s \"%d\" (fun x -> x)) sl\n\nlet n = sscanf (read_line ()) \"%d\" (fun x -> x)\nlet a: int array array = Array.make (n+1) [|0|]\nlet () = for y = 1 to n do\n           a.(y) <- 0 :: (read_intlist ()) @ [0] |> Array.of_list\n         done\n\n(*  *)\nlet ans = ref 0\nlet inds = Array.make (n+1) 1\n\nlet () =\n  let bflag = ref true in\n  while !bflag do\n    let dp = Array.make (n+1) false in\n    let flag = ref true in\n\n    for i = 1 to n do\n      let x = inds.(i) in\n      if not dp.(i) && x < n then begin\n        let target = a.(i).(x) in\n        if not dp.(target) && a.(target).(inds.(target)) = i then begin\n            dp.(i) <- true;\n            dp.(target) <- true;\n\n            inds.(i) <- inds.(i) + 1;\n            inds.(target) <- inds.(target) + 1;\n\n            if !flag then\n              flag := false\n          end\n        end;\n    done;\n\n    if !flag then\n      let hoge = List.tl (Array.to_list inds)\n                 |> List.for_all (fun e -> e = n) in\n      if hoge then\n        bflag := false\n      else begin\n          ans := -1;\n          bflag := false\n        end\n    else\n      incr ans\n  done\n\nlet () = print_endline @@ string_of_int !ans\n        \n               \n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nN players will participate in a tennis tournament. We will call them Player 1, Player 2, \\ldots, Player N.\n\nThe tournament is round-robin format, and there will be N(N-1)/2 matches in total.\nIs it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.\n\nEach player plays at most one matches in a day.\n\nEach player i (1 \\leq i \\leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} in this order.\n\nConstraints\n\n3 \\leq N \\leq 1000\n\n1 \\leq A_{i, j} \\leq N\n\nA_{i, j} \\neq i\n\nA_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} \\ldots A_{1, N-1}\nA_{2, 1} A_{2, 2} \\ldots A_{2, N-1}\n:\nA_{N, 1} A_{N, 2} \\ldots A_{N, N-1}\n\nOutput\n\nIf it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print -1.\n\nSample Input 1\n\n3\n2 3\n1 3\n1 2\n\nSample Output 1\n\n3\n\nAll the conditions can be satisfied if the matches are scheduled for three days as follows:\n\nDay 1: Player 1 vs Player 2\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 2 vs Player 3\n\nThis is the minimum number of days required.\n\nSample Input 2\n\n4\n2 3 4\n1 3 4\n4 1 2\n3 1 2\n\nSample Output 2\n\n4\n\nAll the conditions can be satisfied if the matches are scheduled for four days as follows:\n\nDay 1: Player 1 vs Player 2, Player 3 vs Player 4\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 1 vs Player 4, Player 2 vs Player 3\n\nDay 4: Player 2 vs Player 4\n\nThis is the minimum number of days required.\n\nSample Input 3\n\n3\n2 3\n3 1\n1 2\n\nSample Output 3\n\n-1\n\nAny scheduling of the matches violates some condition.", "sample_input": "3\n2 3\n1 3\n1 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02925", "source_text": "Score : 500 points\n\nProblem Statement\n\nN players will participate in a tennis tournament. We will call them Player 1, Player 2, \\ldots, Player N.\n\nThe tournament is round-robin format, and there will be N(N-1)/2 matches in total.\nIs it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.\n\nEach player plays at most one matches in a day.\n\nEach player i (1 \\leq i \\leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} in this order.\n\nConstraints\n\n3 \\leq N \\leq 1000\n\n1 \\leq A_{i, j} \\leq N\n\nA_{i, j} \\neq i\n\nA_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} \\ldots A_{1, N-1}\nA_{2, 1} A_{2, 2} \\ldots A_{2, N-1}\n:\nA_{N, 1} A_{N, 2} \\ldots A_{N, N-1}\n\nOutput\n\nIf it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print -1.\n\nSample Input 1\n\n3\n2 3\n1 3\n1 2\n\nSample Output 1\n\n3\n\nAll the conditions can be satisfied if the matches are scheduled for three days as follows:\n\nDay 1: Player 1 vs Player 2\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 2 vs Player 3\n\nThis is the minimum number of days required.\n\nSample Input 2\n\n4\n2 3 4\n1 3 4\n4 1 2\n3 1 2\n\nSample Output 2\n\n4\n\nAll the conditions can be satisfied if the matches are scheduled for four days as follows:\n\nDay 1: Player 1 vs Player 2, Player 3 vs Player 4\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 1 vs Player 4, Player 2 vs Player 3\n\nDay 4: Player 2 vs Player 4\n\nThis is the minimum number of days required.\n\nSample Input 3\n\n3\n2 3\n3 1\n1 2\n\nSample Output 3\n\n-1\n\nAny scheduling of the matches violates some condition.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2105, "memory_kb": 23552}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s991079987", "group_id": "codeNet:p02926", "input_text": "open Scanf;;\nopen Printf;;\n\nlet rint () = scanf \" %d\" (fun x -> x);;\nlet rpoint () = scanf \" %f %f\" (fun x y -> x, y);;\n\nlet () =\n  let n = rint () in\n  let ps = Array.init n (fun _ -> rpoint ()) in\n  Array.sort (fun (a, b) (c, d) -> compare (atan2 b a) (atan2 d c)) ps;\n  let ans = ref 0.0 in\n  for i = 0 to n - 1 do\n    let x = ref 0.0 in\n    let y = ref 0.0 in\n    for j = 0 to n - 1 do\n      x := !x +. fst ps.((i + j) mod n);\n      y := !y +. snd ps.((i + j) mod n);\n      ans := max !ans (!x *. !x +. !y *. !y);\n    done;\n  done;\n  printf \"%.15f\\n\" (sqrt !ans);\n", "language": "OCaml", "metadata": {"date": 1567401487, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s991079987.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s991079987", "user_id": "u006493569"}, "prompt_components": {"gold_output": "10.000000000000000000000000000000000000000000000000\n", "input_to_evaluate": "open Scanf;;\nopen Printf;;\n\nlet rint () = scanf \" %d\" (fun x -> x);;\nlet rpoint () = scanf \" %f %f\" (fun x y -> x, y);;\n\nlet () =\n  let n = rint () in\n  let ps = Array.init n (fun _ -> rpoint ()) in\n  Array.sort (fun (a, b) (c, d) -> compare (atan2 b a) (atan2 d c)) ps;\n  let ans = ref 0.0 in\n  for i = 0 to n - 1 do\n    let x = ref 0.0 in\n    let y = ref 0.0 in\n    for j = 0 to n - 1 do\n      x := !x +. fst ps.((i + j) mod n);\n      y := !y +. snd ps.((i + j) mod n);\n      ans := max !ans (!x *. !x +. !y *. !y);\n    done;\n  done;\n  printf \"%.15f\\n\" (sqrt !ans);\n", "problem_context": "Score: 600 points\n\nProblem Statement\n\nE869120 is initially standing at the origin (0, 0) in a two-dimensional plane.\n\nHe has N engines, which can be used as follows:\n\nWhen E869120 uses the i-th engine, his X- and Y-coordinate change by x_i and y_i, respectively. In other words, if E869120 uses the i-th engine from coordinates (X, Y), he will move to the coordinates (X + x_i, Y + y_i).\n\nE869120 can use these engines in any order, but each engine can be used at most once. He may also choose not to use some of the engines.\n\nHe wants to go as far as possible from the origin.\nLet (X, Y) be his final coordinates. Find the maximum possible value of \\sqrt{X^2 + Y^2}, the distance from the origin.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n-1 \\ 000 \\ 000 \\leq x_i \\leq 1 \\ 000 \\ 000\n\n-1 \\ 000 \\ 000 \\leq y_i \\leq 1 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n: :\nx_N y_N\n\nOutput\n\nPrint the maximum possible final distance from the origin, as a real value.\nYour output is considered correct when the relative or absolute error from the true answer is at most 10^{-10}.\n\nSample Input 1\n\n3\n0 10\n5 -5\n-5 -5\n\nSample Output 1\n\n10.000000000000000000000000000000000000000000000000\n\nThe final distance from the origin can be 10 if we use the engines in one of the following three ways:\n\nUse Engine 1 to move to (0, 10).\n\nUse Engine 2 to move to (5, -5), and then use Engine 3 to move to (0, -10).\n\nUse Engine 3 to move to (-5, -5), and then use Engine 2 to move to (0, -10).\n\nThe distance cannot be greater than 10, so the maximum possible distance is 10.\n\nSample Input 2\n\n5\n1 1\n1 0\n0 1\n-1 0\n0 -1\n\nSample Output 2\n\n2.828427124746190097603377448419396157139343750753\n\nThe maximum possible final distance is 2 \\sqrt{2} = 2.82842....\nOne of the ways to achieve it is:\n\nUse Engine 1 to move to (1, 1), and then use Engine 2 to move to (2, 1), and finally use Engine 3 to move to (2, 2).\n\nSample Input 3\n\n5\n1 1\n2 2\n3 3\n4 4\n5 5\n\nSample Output 3\n\n21.213203435596425732025330863145471178545078130654\n\nIf we use all the engines in the order 1 \\rightarrow 2 \\rightarrow 3 \\rightarrow 4 \\rightarrow 5, we will end up at (15, 15), with the distance 15 \\sqrt{2} = 21.2132... from the origin.\n\nSample Input 4\n\n3\n0 0\n0 1\n1 0\n\nSample Output 4\n\n1.414213562373095048801688724209698078569671875376\n\nThere can be useless engines with (x_i, y_i) = (0, 0).\n\nSample Input 5\n\n1\n90447 91000\n\nSample Output 5\n\n128303.000000000000000000000000000000000000000000000000\n\nNote that there can be only one engine.\n\nSample Input 6\n\n2\n96000 -72000\n-72000 54000\n\nSample Output 6\n\n120000.000000000000000000000000000000000000000000000000\n\nThere can be only two engines, too.\n\nSample Input 7\n\n10\n1 2\n3 4\n5 6\n7 8\n9 10\n11 12\n13 14\n15 16\n17 18\n19 20\n\nSample Output 7\n\n148.660687473185055226120082139313966514489855137208", "sample_input": "3\n0 10\n5 -5\n-5 -5\n"}, "reference_outputs": ["10.000000000000000000000000000000000000000000000000\n"], "source_document_id": "p02926", "source_text": "Score: 600 points\n\nProblem Statement\n\nE869120 is initially standing at the origin (0, 0) in a two-dimensional plane.\n\nHe has N engines, which can be used as follows:\n\nWhen E869120 uses the i-th engine, his X- and Y-coordinate change by x_i and y_i, respectively. In other words, if E869120 uses the i-th engine from coordinates (X, Y), he will move to the coordinates (X + x_i, Y + y_i).\n\nE869120 can use these engines in any order, but each engine can be used at most once. He may also choose not to use some of the engines.\n\nHe wants to go as far as possible from the origin.\nLet (X, Y) be his final coordinates. Find the maximum possible value of \\sqrt{X^2 + Y^2}, the distance from the origin.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n-1 \\ 000 \\ 000 \\leq x_i \\leq 1 \\ 000 \\ 000\n\n-1 \\ 000 \\ 000 \\leq y_i \\leq 1 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n: :\nx_N y_N\n\nOutput\n\nPrint the maximum possible final distance from the origin, as a real value.\nYour output is considered correct when the relative or absolute error from the true answer is at most 10^{-10}.\n\nSample Input 1\n\n3\n0 10\n5 -5\n-5 -5\n\nSample Output 1\n\n10.000000000000000000000000000000000000000000000000\n\nThe final distance from the origin can be 10 if we use the engines in one of the following three ways:\n\nUse Engine 1 to move to (0, 10).\n\nUse Engine 2 to move to (5, -5), and then use Engine 3 to move to (0, -10).\n\nUse Engine 3 to move to (-5, -5), and then use Engine 2 to move to (0, -10).\n\nThe distance cannot be greater than 10, so the maximum possible distance is 10.\n\nSample Input 2\n\n5\n1 1\n1 0\n0 1\n-1 0\n0 -1\n\nSample Output 2\n\n2.828427124746190097603377448419396157139343750753\n\nThe maximum possible final distance is 2 \\sqrt{2} = 2.82842....\nOne of the ways to achieve it is:\n\nUse Engine 1 to move to (1, 1), and then use Engine 2 to move to (2, 1), and finally use Engine 3 to move to (2, 2).\n\nSample Input 3\n\n5\n1 1\n2 2\n3 3\n4 4\n5 5\n\nSample Output 3\n\n21.213203435596425732025330863145471178545078130654\n\nIf we use all the engines in the order 1 \\rightarrow 2 \\rightarrow 3 \\rightarrow 4 \\rightarrow 5, we will end up at (15, 15), with the distance 15 \\sqrt{2} = 21.2132... from the origin.\n\nSample Input 4\n\n3\n0 0\n0 1\n1 0\n\nSample Output 4\n\n1.414213562373095048801688724209698078569671875376\n\nThere can be useless engines with (x_i, y_i) = (0, 0).\n\nSample Input 5\n\n1\n90447 91000\n\nSample Output 5\n\n128303.000000000000000000000000000000000000000000000000\n\nNote that there can be only one engine.\n\nSample Input 6\n\n2\n96000 -72000\n-72000 54000\n\nSample Output 6\n\n120000.000000000000000000000000000000000000000000000000\n\nThere can be only two engines, too.\n\nSample Input 7\n\n10\n1 2\n3 4\n5 6\n7 8\n9 10\n11 12\n13 14\n15 16\n17 18\n19 20\n\nSample Output 7\n\n148.660687473185055226120082139313966514489855137208", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 568, "cpu_time_ms": 2, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s833064396", "group_id": "codeNet:p02927", "input_text": "let scan_int () = Scanf.scanf \" %d\" (fun x -> x)\nlet print_int n = Printf.printf \"%d\\n\" n\n\nlet () = \n  let m = scan_int() and d = scan_int() in\n  let rec loop mi di cnt =\n    let d1 = di mod 10 and d10 = di / 10 in\n    let cnt =\n      if d1 > 1 && d10 > 1 && d1 * d10 = mi then cnt+1\n      else cnt in\n    if di = d then\n      if mi = m then cnt\n      else loop (mi+1) 1 cnt\n    else loop mi (di+1) cnt in\n  print_int (loop 1 1 0)", "language": "OCaml", "metadata": {"date": 1567231670, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s833064396.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s833064396", "user_id": "u521364030"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let scan_int () = Scanf.scanf \" %d\" (fun x -> x)\nlet print_int n = Printf.printf \"%d\\n\" n\n\nlet () = \n  let m = scan_int() and d = scan_int() in\n  let rec loop mi di cnt =\n    let d1 = di mod 10 and d10 = di / 10 in\n    let cnt =\n      if d1 > 1 && d10 > 1 && d1 * d10 = mi then cnt+1\n      else cnt in\n    if di = d then\n      if mi = m then cnt\n      else loop (mi+1) 1 cnt\n    else loop mi (di+1) cnt in\n  print_int (loop 1 1 0)", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 430, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s670553875", "group_id": "codeNet:p02927", "input_text": "let m, d = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet f m d = d mod 10 >= 2 && d / 10 >= 2 && d / 10 * (d mod 10) = m\nlet ans = ref 0\nlet _ = for i = 2 to m do for j = 2 to d do if f i j then incr ans done done; Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1566772460, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s670553875.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s670553875", "user_id": "u732304692"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let m, d = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet f m d = d mod 10 >= 2 && d / 10 >= 2 && d / 10 * (d mod 10) = m\nlet ans = ref 0\nlet _ = for i = 2 to m do for j = 2 to d do if f i j then incr ans done done; Printf.printf \"%d\\n\" !ans", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 238, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s098773750", "group_id": "codeNet:p02929", "input_text": "let scan_int () = Scanf.scanf \" %d\" (fun x -> x)\nlet print_int n = Printf.printf \"%d\\n\" n\n\nlet modulo = 1000000007\nlet modmul a b = a * b mod modulo\n\nlet () =\n  let n = scan_int() in\n  let s = read_line() in\n  let rec loop i curr ret =\n    if i = 2 * n && curr = 0 then ret\n    else if i = 2 * n || curr < 0 then 0 \n    else\n      if s.[i] = 'B' then\n        if curr mod 2 = 1 then loop (i+1) (curr-1) (modmul ret curr)\n        else loop (i+1) (curr+1) ret\n      else\n        if curr mod 2 = 1 then loop (i+1) (curr+1) ret\n        else loop (i+1) (curr-1) (modmul ret curr) in\n  let rec calc_factorial i n ret =\n    if i > n then ret else calc_factorial (i+1) n (modmul ret i) in\n  let a = loop 0 0 1 and b = calc_factorial 1 n 1 in\n  print_int (modmul a b)\n\n", "language": "OCaml", "metadata": {"date": 1567232973, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s098773750.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s098773750", "user_id": "u521364030"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let scan_int () = Scanf.scanf \" %d\" (fun x -> x)\nlet print_int n = Printf.printf \"%d\\n\" n\n\nlet modulo = 1000000007\nlet modmul a b = a * b mod modulo\n\nlet () =\n  let n = scan_int() in\n  let s = read_line() in\n  let rec loop i curr ret =\n    if i = 2 * n && curr = 0 then ret\n    else if i = 2 * n || curr < 0 then 0 \n    else\n      if s.[i] = 'B' then\n        if curr mod 2 = 1 then loop (i+1) (curr-1) (modmul ret curr)\n        else loop (i+1) (curr+1) ret\n      else\n        if curr mod 2 = 1 then loop (i+1) (curr+1) ret\n        else loop (i+1) (curr-1) (modmul ret curr) in\n  let rec calc_factorial i n ret =\n    if i > n then ret else calc_factorial (i+1) n (modmul ret i) in\n  let a = loop 0 0 1 and b = calc_factorial 1 n 1 in\n  print_int (modmul a b)\n\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 759, "cpu_time_ms": 3, "memory_kb": 2688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s740102839", "group_id": "codeNet:p02934", "input_text": "let () = Scanf.scanf \"%d\" @@ fun n ->\n  let aa = Array.init n @@ fun _ -> Scanf.scanf \" %d\" Fun.id in\n  let ans = ref 0.0 in\n  for i = 0 to n - 1 do\n    ans := !ans +. 1.0 /. float_of_int aa.(i)\n  done;\n  Printf.printf \"%f\\n\" (1.0 /. !ans)", "language": "OCaml", "metadata": {"date": 1596477883, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s740102839.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s740102839", "user_id": "u052332717"}, "prompt_components": {"gold_output": "7.5\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\" @@ fun n ->\n  let aa = Array.init n @@ fun _ -> Scanf.scanf \" %d\" Fun.id in\n  let ans = ref 0.0 in\n  for i = 0 to n - 1 do\n    ans := !ans +. 1.0 /. float_of_int aa.(i)\n  done;\n  Printf.printf \"%f\\n\" (1.0 /. !ans)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven is a sequence of N integers A_1, \\ldots, A_N.\n\nFind the (multiplicative) inverse of the sum of the inverses of these numbers, \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint a decimal number (or an integer) representing the value of \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nYour output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10 30\n\nSample Output 1\n\n7.5\n\n\\frac{1}{\\frac{1}{10} + \\frac{1}{30}} = \\frac{1}{\\frac{4}{30}} = \\frac{30}{4} = 7.5.\n\nPrinting 7.50001, 7.49999, and so on will also be accepted.\n\nSample Input 2\n\n3\n200 200 200\n\nSample Output 2\n\n66.66666666666667\n\n\\frac{1}{\\frac{1}{200} + \\frac{1}{200} + \\frac{1}{200}} = \\frac{1}{\\frac{3}{200}} = \\frac{200}{3} = 66.6666....\n\nPrinting 6.66666e+1 and so on will also be accepted.\n\nSample Input 3\n\n1\n1000\n\nSample Output 3\n\n1000\n\n\\frac{1}{\\frac{1}{1000}} = 1000.\n\nPrinting +1000.0 and so on will also be accepted.", "sample_input": "2\n10 30\n"}, "reference_outputs": ["7.5\n"], "source_document_id": "p02934", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven is a sequence of N integers A_1, \\ldots, A_N.\n\nFind the (multiplicative) inverse of the sum of the inverses of these numbers, \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint a decimal number (or an integer) representing the value of \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nYour output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10 30\n\nSample Output 1\n\n7.5\n\n\\frac{1}{\\frac{1}{10} + \\frac{1}{30}} = \\frac{1}{\\frac{4}{30}} = \\frac{30}{4} = 7.5.\n\nPrinting 7.50001, 7.49999, and so on will also be accepted.\n\nSample Input 2\n\n3\n200 200 200\n\nSample Output 2\n\n66.66666666666667\n\n\\frac{1}{\\frac{1}{200} + \\frac{1}{200} + \\frac{1}{200}} = \\frac{1}{\\frac{3}{200}} = \\frac{200}{3} = 66.6666....\n\nPrinting 6.66666e+1 and so on will also be accepted.\n\nSample Input 3\n\n1\n1000\n\nSample Output 3\n\n1000\n\n\\frac{1}{\\frac{1}{1000}} = 1000.\n\nPrinting +1000.0 and so on will also be accepted.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 239, "cpu_time_ms": 9, "memory_kb": 3916}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s005883504", "group_id": "codeNet:p02934", "input_text": "open Printf\nopen Scanf\n\nlet () =\n  let n = scanf \"%d\" (fun x -> x) in\n  Array.init n (fun _ -> scanf \" %f\" (fun x -> x))\n  |> Array.map (fun x -> 1.0 /. x)\n  |> Array.fold_left (+.) 0.0\n  |> (fun x -> 1.0 /. x)\n  |> printf \"%.15f\\n\"", "language": "OCaml", "metadata": {"date": 1566351912, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s005883504.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s005883504", "user_id": "u006493569"}, "prompt_components": {"gold_output": "7.5\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet () =\n  let n = scanf \"%d\" (fun x -> x) in\n  Array.init n (fun _ -> scanf \" %f\" (fun x -> x))\n  |> Array.map (fun x -> 1.0 /. x)\n  |> Array.fold_left (+.) 0.0\n  |> (fun x -> 1.0 /. x)\n  |> printf \"%.15f\\n\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven is a sequence of N integers A_1, \\ldots, A_N.\n\nFind the (multiplicative) inverse of the sum of the inverses of these numbers, \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint a decimal number (or an integer) representing the value of \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nYour output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10 30\n\nSample Output 1\n\n7.5\n\n\\frac{1}{\\frac{1}{10} + \\frac{1}{30}} = \\frac{1}{\\frac{4}{30}} = \\frac{30}{4} = 7.5.\n\nPrinting 7.50001, 7.49999, and so on will also be accepted.\n\nSample Input 2\n\n3\n200 200 200\n\nSample Output 2\n\n66.66666666666667\n\n\\frac{1}{\\frac{1}{200} + \\frac{1}{200} + \\frac{1}{200}} = \\frac{1}{\\frac{3}{200}} = \\frac{200}{3} = 66.6666....\n\nPrinting 6.66666e+1 and so on will also be accepted.\n\nSample Input 3\n\n1\n1000\n\nSample Output 3\n\n1000\n\n\\frac{1}{\\frac{1}{1000}} = 1000.\n\nPrinting +1000.0 and so on will also be accepted.", "sample_input": "2\n10 30\n"}, "reference_outputs": ["7.5\n"], "source_document_id": "p02934", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven is a sequence of N integers A_1, \\ldots, A_N.\n\nFind the (multiplicative) inverse of the sum of the inverses of these numbers, \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq A_i \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 \\ldots A_N\n\nOutput\n\nPrint a decimal number (or an integer) representing the value of \\frac{1}{\\frac{1}{A_1} + \\ldots + \\frac{1}{A_N}}.\n\nYour output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n10 30\n\nSample Output 1\n\n7.5\n\n\\frac{1}{\\frac{1}{10} + \\frac{1}{30}} = \\frac{1}{\\frac{4}{30}} = \\frac{30}{4} = 7.5.\n\nPrinting 7.50001, 7.49999, and so on will also be accepted.\n\nSample Input 2\n\n3\n200 200 200\n\nSample Output 2\n\n66.66666666666667\n\n\\frac{1}{\\frac{1}{200} + \\frac{1}{200} + \\frac{1}{200}} = \\frac{1}{\\frac{3}{200}} = \\frac{200}{3} = 66.6666....\n\nPrinting 6.66666e+1 and so on will also be accepted.\n\nSample Input 3\n\n1\n1000\n\nSample Output 3\n\n1000\n\n\\frac{1}{\\frac{1}{1000}} = 1000.\n\nPrinting +1000.0 and so on will also be accepted.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 232, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s761588786", "group_id": "codeNet:p02935", "input_text": "let n = Scanf.scanf \" %d\" (+) 0\nlet vs = Array.init n @@ fun _ -> Scanf.scanf \" %f\" (+.) 0.\nlet _ = Array.sort compare vs; Printf.printf \"%.9f\\n\" @@ Array.fold_left (fun a v -> (a +. v) /. 2.) vs.(0) vs", "language": "OCaml", "metadata": {"date": 1566237600, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s761588786.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s761588786", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3.5\n", "input_to_evaluate": "let n = Scanf.scanf \" %d\" (+) 0\nlet vs = Array.init n @@ fun _ -> Scanf.scanf \" %f\" (+.) 0.\nlet _ = Array.sort compare vs; Printf.printf \"%.9f\\n\" @@ Array.fold_left (fun a v -> (a +. v) /. 2.) vs.(0) vs", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou have a pot and N ingredients. Each ingredient has a real number parameter called value, and the value of the i-th ingredient (1 \\leq i \\leq N) is v_i.\n\nWhen you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 where x and y are the values of the ingredients consumed, and you can put this ingredient again in the pot.\n\nAfter you compose ingredients in this way N-1 times, you will end up with one ingredient. Find the maximum possible value of this ingredient.\n\nConstraints\n\n2 \\leq N \\leq 50\n\n1 \\leq v_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nv_1 v_2 \\ldots v_N\n\nOutput\n\nPrint a decimal number (or an integer) representing the maximum possible value of the last ingredient remaining.\n\nYour output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n3 4\n\nSample Output 1\n\n3.5\n\nIf you start with two ingredients, the only choice is to put both of them in the pot. The value of the ingredient resulting from the ingredients of values 3 and 4 is (3 + 4) / 2 = 3.5.\n\nPrinting 3.50001, 3.49999, and so on will also be accepted.\n\nSample Input 2\n\n3\n500 300 200\n\nSample Output 2\n\n375\n\nYou start with three ingredients this time, and you can choose what to use in the first composition. There are three possible choices:\n\nUse the ingredients of values 500 and 300 to produce an ingredient of value (500 + 300) / 2 = 400. The next composition will use this ingredient and the ingredient of value 200, resulting in an ingredient of value (400 + 200) / 2 = 300.\n\nUse the ingredients of values 500 and 200 to produce an ingredient of value (500 + 200) / 2 = 350. The next composition will use this ingredient and the ingredient of value 300, resulting in an ingredient of value (350 + 300) / 2 = 325.\n\nUse the ingredients of values 300 and 200 to produce an ingredient of value (300 + 200) / 2 = 250. The next composition will use this ingredient and the ingredient of value 500, resulting in an ingredient of value (250 + 500) / 2 = 375.\n\nThus, the maximum possible value of the last ingredient remaining is 375.\n\nPrinting 375.0 and so on will also be accepted.\n\nSample Input 3\n\n5\n138 138 138 138 138\n\nSample Output 3\n\n138", "sample_input": "2\n3 4\n"}, "reference_outputs": ["3.5\n"], "source_document_id": "p02935", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou have a pot and N ingredients. Each ingredient has a real number parameter called value, and the value of the i-th ingredient (1 \\leq i \\leq N) is v_i.\n\nWhen you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 where x and y are the values of the ingredients consumed, and you can put this ingredient again in the pot.\n\nAfter you compose ingredients in this way N-1 times, you will end up with one ingredient. Find the maximum possible value of this ingredient.\n\nConstraints\n\n2 \\leq N \\leq 50\n\n1 \\leq v_i \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nv_1 v_2 \\ldots v_N\n\nOutput\n\nPrint a decimal number (or an integer) representing the maximum possible value of the last ingredient remaining.\n\nYour output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.\n\nSample Input 1\n\n2\n3 4\n\nSample Output 1\n\n3.5\n\nIf you start with two ingredients, the only choice is to put both of them in the pot. The value of the ingredient resulting from the ingredients of values 3 and 4 is (3 + 4) / 2 = 3.5.\n\nPrinting 3.50001, 3.49999, and so on will also be accepted.\n\nSample Input 2\n\n3\n500 300 200\n\nSample Output 2\n\n375\n\nYou start with three ingredients this time, and you can choose what to use in the first composition. There are three possible choices:\n\nUse the ingredients of values 500 and 300 to produce an ingredient of value (500 + 300) / 2 = 400. The next composition will use this ingredient and the ingredient of value 200, resulting in an ingredient of value (400 + 200) / 2 = 300.\n\nUse the ingredients of values 500 and 200 to produce an ingredient of value (500 + 200) / 2 = 350. The next composition will use this ingredient and the ingredient of value 300, resulting in an ingredient of value (350 + 300) / 2 = 325.\n\nUse the ingredients of values 300 and 200 to produce an ingredient of value (300 + 200) / 2 = 250. The next composition will use this ingredient and the ingredient of value 500, resulting in an ingredient of value (250 + 500) / 2 = 375.\n\nThus, the maximum possible value of the last ingredient remaining is 375.\n\nPrinting 375.0 and so on will also be accepted.\n\nSample Input 3\n\n5\n138 138 138 138 138\n\nSample Output 3\n\n138", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 202, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s441857312", "group_id": "codeNet:p02937", "input_text": "let ioc c = int_of_char c - int_of_char 'a'\n\nlet s = read_line()\nlet t = read_line()\nlet n = String.length s\nlet m = String.length t\nlet d = Array.init 26 (fun _ -> Array.make (n + 1) ~-1)\n\nlet rec f i j s =\n  if i = m then s + j\n  else\n    let k = ioc t.[i] in\n    if d.(k).(0) = -1 then -1\n    else\n      let j = d.(k).(j) in\n      if j = -1 then f (i + 1) (d.(k).(0) + 1) (s + n)\n      else f (i + 1) (j + 1) s\n\nlet () =\n  for i = 0 to n - 1 do\n    d.(ioc s.[i]).(i) <- i\n  done;\n\n  Array.iter (fun d ->\n    for i = 0 to n - 1 do\n      let j = n - 1 - i in\n      if d.(j) = -1 then\n        d.(j) <- d.(j + 1)\n      done\n  ) d;\n\n  d.(ioc s.[0]).(0) <- 0;\n\n  Printf.printf \"%d\\n\" (f 0 0 0)\n", "language": "OCaml", "metadata": {"date": 1600026769, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s441857312.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s441857312", "user_id": "u752907799"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let ioc c = int_of_char c - int_of_char 'a'\n\nlet s = read_line()\nlet t = read_line()\nlet n = String.length s\nlet m = String.length t\nlet d = Array.init 26 (fun _ -> Array.make (n + 1) ~-1)\n\nlet rec f i j s =\n  if i = m then s + j\n  else\n    let k = ioc t.[i] in\n    if d.(k).(0) = -1 then -1\n    else\n      let j = d.(k).(j) in\n      if j = -1 then f (i + 1) (d.(k).(0) + 1) (s + n)\n      else f (i + 1) (j + 1) s\n\nlet () =\n  for i = 0 to n - 1 do\n    d.(ioc s.[i]).(i) <- i\n  done;\n\n  Array.iter (fun d ->\n    for i = 0 to n - 1 do\n      let j = n - 1 - i in\n      if d.(j) = -1 then\n        d.(j) <- d.(j + 1)\n      done\n  ) d;\n\n  d.(ioc s.[0]).(0) <- 0;\n\n  Printf.printf \"%d\\n\" (f 0 0 0)\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 691, "cpu_time_ms": 42, "memory_kb": 24764}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s672143806", "group_id": "codeNet:p02945", "input_text": "let test a b =\n  Printf.printf \"%d\\n\" (max (max (a+b) (a-b)) (a*b));;\n\nScanf.sscanf (read_line ()) \"%d %d\" (fun a b -> test a b);;", "language": "OCaml", "metadata": {"date": 1586978764, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s672143806.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s672143806", "user_id": "u471147483"}, "prompt_components": {"gold_output": "-10\n", "input_to_evaluate": "let test a b =\n  Printf.printf \"%d\\n\" (max (max (a+b) (a-b)) (a*b));;\n\nScanf.sscanf (read_line ()) \"%d %d\" (fun a b -> test a b);;", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have two integers: A and B.\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nConstraints\n\nAll values in input are integers.\n\n-100 \\leq A,\\ B \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nSample Input 1\n\n-13 3\n\nSample Output 1\n\n-10\n\nThe largest number among A + B = -10, A - B = -16, and A \\times B = -39 is -10.\n\nSample Input 2\n\n1 -33\n\nSample Output 2\n\n34\n\nThe largest number among A + B = -32, A - B = 34, and A \\times B = -33 is 34.\n\nSample Input 3\n\n13 3\n\nSample Output 3\n\n39\n\nThe largest number among A + B = 16, A - B = 10, and A \\times B = 39 is 39.", "sample_input": "-13 3\n"}, "reference_outputs": ["-10\n"], "source_document_id": "p02945", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have two integers: A and B.\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nConstraints\n\nAll values in input are integers.\n\n-100 \\leq A,\\ B \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nSample Input 1\n\n-13 3\n\nSample Output 1\n\n-10\n\nThe largest number among A + B = -10, A - B = -16, and A \\times B = -39 is -10.\n\nSample Input 2\n\n1 -33\n\nSample Output 2\n\n34\n\nThe largest number among A + B = -32, A - B = 34, and A \\times B = -33 is 34.\n\nSample Input 3\n\n13 3\n\nSample Output 3\n\n39\n\nThe largest number among A + B = 16, A - B = 10, and A \\times B = 39 is 39.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s156038596", "group_id": "codeNet:p02945", "input_text": "open Printf\nopen Scanf\n\nlet solve a b = max (a + b) @@ max (a - b) (a * b)\n\nlet () =\n  scanf \"%d %d \" solve |> printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1582404663, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s156038596.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s156038596", "user_id": "u388783188"}, "prompt_components": {"gold_output": "-10\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve a b = max (a + b) @@ max (a - b) (a * b)\n\nlet () =\n  scanf \"%d %d \" solve |> printf \"%d\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have two integers: A and B.\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nConstraints\n\nAll values in input are integers.\n\n-100 \\leq A,\\ B \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nSample Input 1\n\n-13 3\n\nSample Output 1\n\n-10\n\nThe largest number among A + B = -10, A - B = -16, and A \\times B = -39 is -10.\n\nSample Input 2\n\n1 -33\n\nSample Output 2\n\n34\n\nThe largest number among A + B = -32, A - B = 34, and A \\times B = -33 is 34.\n\nSample Input 3\n\n13 3\n\nSample Output 3\n\n39\n\nThe largest number among A + B = 16, A - B = 10, and A \\times B = 39 is 39.", "sample_input": "-13 3\n"}, "reference_outputs": ["-10\n"], "source_document_id": "p02945", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have two integers: A and B.\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nConstraints\n\nAll values in input are integers.\n\n-100 \\leq A,\\ B \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nSample Input 1\n\n-13 3\n\nSample Output 1\n\n-10\n\nThe largest number among A + B = -10, A - B = -16, and A \\times B = -39 is -10.\n\nSample Input 2\n\n1 -33\n\nSample Output 2\n\n34\n\nThe largest number among A + B = -32, A - B = 34, and A \\times B = -33 is 34.\n\nSample Input 3\n\n13 3\n\nSample Output 3\n\n39\n\nThe largest number among A + B = 16, A - B = 10, and A \\times B = 39 is 39.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 125, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s345892982", "group_id": "codeNet:p02945", "input_text": "let () =\n    Scanf.scanf \"%d %d\\n\" @@ fun a b ->\n    Printf.printf \"%d\\n\" @@ max (a + b) @@ max (a - b) (a * b)\n", "language": "OCaml", "metadata": {"date": 1565485339, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s345892982.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s345892982", "user_id": "u420267469"}, "prompt_components": {"gold_output": "-10\n", "input_to_evaluate": "let () =\n    Scanf.scanf \"%d %d\\n\" @@ fun a b ->\n    Printf.printf \"%d\\n\" @@ max (a + b) @@ max (a - b) (a * b)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have two integers: A and B.\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nConstraints\n\nAll values in input are integers.\n\n-100 \\leq A,\\ B \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nSample Input 1\n\n-13 3\n\nSample Output 1\n\n-10\n\nThe largest number among A + B = -10, A - B = -16, and A \\times B = -39 is -10.\n\nSample Input 2\n\n1 -33\n\nSample Output 2\n\n34\n\nThe largest number among A + B = -32, A - B = 34, and A \\times B = -33 is 34.\n\nSample Input 3\n\n13 3\n\nSample Output 3\n\n39\n\nThe largest number among A + B = 16, A - B = 10, and A \\times B = 39 is 39.", "sample_input": "-13 3\n"}, "reference_outputs": ["-10\n"], "source_document_id": "p02945", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have two integers: A and B.\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nConstraints\n\nAll values in input are integers.\n\n-100 \\leq A,\\ B \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest number among A + B, A - B, and A \\times B.\n\nSample Input 1\n\n-13 3\n\nSample Output 1\n\n-10\n\nThe largest number among A + B = -10, A - B = -16, and A \\times B = -39 is -10.\n\nSample Input 2\n\n1 -33\n\nSample Output 2\n\n34\n\nThe largest number among A + B = -32, A - B = 34, and A \\times B = -33 is 34.\n\nSample Input 3\n\n13 3\n\nSample Output 3\n\n39\n\nThe largest number among A + B = 16, A - B = 10, and A \\times B = 39 is 39.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 112, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s646772432", "group_id": "codeNet:p02948", "input_text": "type 'a t = Empty | Node of (int * 'a * 'a t * 'a t)\n\nlet rec merge q1 q2 =\n    match q1, q2 with\n    | Empty, _ -> q2\n    | _, Empty -> q1\n    | Node(n1, v1, l1, r1), Node(n2, v2, l2, r2) ->\n        if v1 < v2\n        then Node(n1 + n2, v2, q1, merge l2 r2)\n        else Node(n1 + n2, v1, merge l1 r1, q2)\n\nlet pop q =\n    match q with\n    | Empty -> failwith \"pop\"\n    | Node(_, _, l, r) ->\n        match l, r with\n        | Empty, Empty -> Empty\n        | Node(_, _, _, _), Empty -> l\n        | Node(nl, vl, ll, rl), Node(nr, vr, lr, rr) ->\n            if vl < vr\n            then Node(nl + nr, vr, l, merge lr rr)\n            else Node(nl + nr, vl, merge ll rl, r)\n        | _, _ -> failwith \"pop\"\n\nlet rec push x q =\n    match q with\n    | Empty -> Node(1, x, Empty, Empty)\n    | Node(_, v, l, r) ->\n        let large = max x v in\n        let small = min x v in\n        match l, r with\n        | Empty, Empty         -> Node(2, large, Node(1, small, Empty, Empty), Empty)\n        | Node(n, _, _, _), Empty -> Node(n + 1, large, l, Node(1, small, Empty, Empty))\n        | Node(nl, _, _, _), Node(nr, _, _, _) ->\n            if nl > nr\n            then Node(nl + nr + 2, large, l, push small r)\n            else Node(nl + nr + 2, large, push small l, r)\n        | _, _ -> failwith \"push\"\n\nlet top q =\n    match q with\n    | Empty -> failwith \"top\"\n    | Node(_, v, _, _) -> v\n\nlet rec insert_while i ws q =\n    match ws with\n    | w :: ws' when fst w = i ->\n        insert_while i ws' (push (snd w) q)\n    | _ -> (ws, q)\n\nlet rec solve ws m q i sum =\n    if i > m then sum\n    else\n        let (ws', q') = insert_while i ws q in\n        if q' = Empty\n        then solve ws' m q' (i + 1) sum\n        else solve ws' m (pop q') (i + 1) (sum + top q')\n\nlet rec input n =\n    if n = 0 then []\n    else Scanf.scanf \"%d %d\\n\" @@ fun a b ->\n        let ws = input (n - 1) in\n        (a, b) :: ws\n\nlet () =\n    Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n    let ws = input n in\n    let ws' = List.sort (fun a b -> compare (fst a) (fst b)) ws in\n    Printf.printf \"%d\\n\" @@ solve ws' m Empty 1 0\n", "language": "OCaml", "metadata": {"date": 1565657146, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s646772432.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s646772432", "user_id": "u420267469"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "type 'a t = Empty | Node of (int * 'a * 'a t * 'a t)\n\nlet rec merge q1 q2 =\n    match q1, q2 with\n    | Empty, _ -> q2\n    | _, Empty -> q1\n    | Node(n1, v1, l1, r1), Node(n2, v2, l2, r2) ->\n        if v1 < v2\n        then Node(n1 + n2, v2, q1, merge l2 r2)\n        else Node(n1 + n2, v1, merge l1 r1, q2)\n\nlet pop q =\n    match q with\n    | Empty -> failwith \"pop\"\n    | Node(_, _, l, r) ->\n        match l, r with\n        | Empty, Empty -> Empty\n        | Node(_, _, _, _), Empty -> l\n        | Node(nl, vl, ll, rl), Node(nr, vr, lr, rr) ->\n            if vl < vr\n            then Node(nl + nr, vr, l, merge lr rr)\n            else Node(nl + nr, vl, merge ll rl, r)\n        | _, _ -> failwith \"pop\"\n\nlet rec push x q =\n    match q with\n    | Empty -> Node(1, x, Empty, Empty)\n    | Node(_, v, l, r) ->\n        let large = max x v in\n        let small = min x v in\n        match l, r with\n        | Empty, Empty         -> Node(2, large, Node(1, small, Empty, Empty), Empty)\n        | Node(n, _, _, _), Empty -> Node(n + 1, large, l, Node(1, small, Empty, Empty))\n        | Node(nl, _, _, _), Node(nr, _, _, _) ->\n            if nl > nr\n            then Node(nl + nr + 2, large, l, push small r)\n            else Node(nl + nr + 2, large, push small l, r)\n        | _, _ -> failwith \"push\"\n\nlet top q =\n    match q with\n    | Empty -> failwith \"top\"\n    | Node(_, v, _, _) -> v\n\nlet rec insert_while i ws q =\n    match ws with\n    | w :: ws' when fst w = i ->\n        insert_while i ws' (push (snd w) q)\n    | _ -> (ws, q)\n\nlet rec solve ws m q i sum =\n    if i > m then sum\n    else\n        let (ws', q') = insert_while i ws q in\n        if q' = Empty\n        then solve ws' m q' (i + 1) sum\n        else solve ws' m (pop q') (i + 1) (sum + top q')\n\nlet rec input n =\n    if n = 0 then []\n    else Scanf.scanf \"%d %d\\n\" @@ fun a b ->\n        let ws = input (n - 1) in\n        (a, b) :: ws\n\nlet () =\n    Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n    let ws = input n in\n    let ws' = List.sort (fun a b -> compare (fst a) (fst b)) ws in\n    Printf.printf \"%d\\n\" @@ solve ws' m Empty 1 0\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.\n\nYou can take and complete at most one of these jobs in a day.\n\nHowever, you cannot retake a job that you have already done.\n\nFind the maximum total reward that you can earn no later than M days from today.\n\nYou can already start working today.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i \\leq 10^5\n\n1 \\leq B_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the maximum total reward that you can earn no later than M days from today.\n\nSample Input 1\n\n3 4\n4 3\n4 1\n2 2\n\nSample Output 1\n\n5\n\nYou can earn the total reward of 5 by taking the jobs as follows:\n\nTake and complete the first job today. You will earn the reward of 3 after four days from today.\n\nTake and complete the third job tomorrow. You will earn the reward of 2 after two days from tomorrow, that is, after three days from today.\n\nSample Input 2\n\n5 3\n1 2\n1 3\n1 4\n2 1\n2 3\n\nSample Output 2\n\n10\n\nSample Input 3\n\n1 1\n2 1\n\nSample Output 3\n\n0", "sample_input": "3 4\n4 3\n4 1\n2 2\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02948", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.\n\nYou can take and complete at most one of these jobs in a day.\n\nHowever, you cannot retake a job that you have already done.\n\nFind the maximum total reward that you can earn no later than M days from today.\n\nYou can already start working today.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i \\leq 10^5\n\n1 \\leq B_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_N B_N\n\nOutput\n\nPrint the maximum total reward that you can earn no later than M days from today.\n\nSample Input 1\n\n3 4\n4 3\n4 1\n2 2\n\nSample Output 1\n\n5\n\nYou can earn the total reward of 5 by taking the jobs as follows:\n\nTake and complete the first job today. You will earn the reward of 3 after four days from today.\n\nTake and complete the third job tomorrow. You will earn the reward of 2 after two days from tomorrow, that is, after three days from today.\n\nSample Input 2\n\n5 3\n1 2\n1 3\n1 4\n2 1\n2 3\n\nSample Output 2\n\n10\n\nSample Input 3\n\n1 1\n2 1\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2082, "cpu_time_ms": 270, "memory_kb": 19968}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s285159215", "group_id": "codeNet:p02951", "input_text": "let transfer a b c =\n  let remain = c - (a - b) in\n    if remain > 0 then remain else 0\n\nlet a, b, c = Scanf.sscanf (read_line ()) \"%d %d %d \" (fun a b c -> (a, b, c))\nlet () = Printf.printf \"%d\\n\" (transfer a b c)", "language": "OCaml", "metadata": {"date": 1595772552, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s285159215.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s285159215", "user_id": "u272377260"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let transfer a b c =\n  let remain = c - (a - b) in\n    if remain > 0 then remain else 0\n\nlet a, b, c = Scanf.sscanf (read_line ()) \"%d %d %d \" (fun a b c -> (a, b, c))\nlet () = Printf.printf \"%d\\n\" (transfer a b c)", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 214, "cpu_time_ms": 8, "memory_kb": 3812}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s397955142", "group_id": "codeNet:p02951", "input_text": "open Printf\nopen Scanf\n\nlet readint () = scanf \" %d\" (fun x -> x)\n\nlet () =\n  let a = readint () and b = readint () and c = readint () in\n  printf \"%d\\n\" @@ max 0 (c - (a - b))\n", "language": "OCaml", "metadata": {"date": 1565292103, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s397955142.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s397955142", "user_id": "u006493569"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet readint () = scanf \" %d\" (fun x -> x)\n\nlet () =\n  let a = readint () and b = readint () and c = readint () in\n  printf \"%d\\n\" @@ max 0 (c - (a - b))\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 177, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s847876962", "group_id": "codeNet:p02951", "input_text": "let () = Scanf.scanf \"%d %d %d\" @@ fun a b c ->\n    Printf.printf \"%d\" @@ max 0 (c - a + b)\n", "language": "OCaml", "metadata": {"date": 1564966981, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s847876962.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s847876962", "user_id": "u604818425"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" @@ fun a b c ->\n    Printf.printf \"%d\" @@ max 0 (c - a + b)\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s470662165", "group_id": "codeNet:p02955", "input_text": "let rec divisors acc acc' i n =\n  match compare n (i * i) with\n  | -1 -> List.rev_append acc acc'\n  | 0 -> List.rev_append acc (i :: acc')\n  | 1 ->\n      ( if 0 < n mod i\n        then divisors acc acc'\n        else divisors (i :: acc) (n / i :: acc') ) (i + 1) n\nlet divisors = divisors [] [] 1\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  let ms = Array.make n 0 in\n  let acc = Array.make (n + 1) 0 in\n  let acc' = Array.make (n + 1) 0 in\n  Printf.printf \"%d\\n\" @@\n  List.fold_left max min_int @@\n  List.filter (fun d ->\n    for i = 0 to n - 1 do\n      ms.(i) <- as_.(i) mod d;\n    done;\n    Array.sort compare ms;\n    for i = 0 to n - 1 do\n      acc.(i + 1) <- acc.(i) + ms.(i)\n    done;\n    for i = n - 1 downto 0 do\n      acc'.(i) <- acc'.(i + 1) + d - ms.(i)\n    done;\n    Array.fold_left ( || ) false @@\n    Array.init (n + 1) @@ fun i ->\n      acc.(i) = acc'.(i) && acc.(i) <= k) @@\n  divisors @@\n  Array.fold_left ( + ) 0 as_", "language": "OCaml", "metadata": {"date": 1568834251, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s470662165.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s470662165", "user_id": "u504158101"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "let rec divisors acc acc' i n =\n  match compare n (i * i) with\n  | -1 -> List.rev_append acc acc'\n  | 0 -> List.rev_append acc (i :: acc')\n  | 1 ->\n      ( if 0 < n mod i\n        then divisors acc acc'\n        else divisors (i :: acc) (n / i :: acc') ) (i + 1) n\nlet divisors = divisors [] [] 1\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  let ms = Array.make n 0 in\n  let acc = Array.make (n + 1) 0 in\n  let acc' = Array.make (n + 1) 0 in\n  Printf.printf \"%d\\n\" @@\n  List.fold_left max min_int @@\n  List.filter (fun d ->\n    for i = 0 to n - 1 do\n      ms.(i) <- as_.(i) mod d;\n    done;\n    Array.sort compare ms;\n    for i = 0 to n - 1 do\n      acc.(i + 1) <- acc.(i) + ms.(i)\n    done;\n    for i = n - 1 downto 0 do\n      acc'.(i) <- acc'.(i + 1) + d - ms.(i)\n    done;\n    Array.fold_left ( || ) false @@\n    Array.init (n + 1) @@ fun i ->\n      acc.(i) = acc'.(i) && acc.(i) <= k) @@\n  divisors @@\n  Array.fold_left ( + ) 0 as_", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1008, "cpu_time_ms": 184, "memory_kb": 6400}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s825413477", "group_id": "codeNet:p02957", "input_text": "let _ = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b ->\n  match a + b with\n  | x when x mod 2 = 1 -> print_endline \"IMPOSSIBLE\"\n  | x -> print_endline (string_of_int (x / 2))\n)", "language": "OCaml", "metadata": {"date": 1583931424, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s825413477.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s825413477", "user_id": "u511870776"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "let _ = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b ->\n  match a + b with\n  | x when x mod 2 = 1 -> print_endline \"IMPOSSIBLE\"\n  | x -> print_endline (string_of_int (x / 2))\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s353162548", "group_id": "codeNet:p02957", "input_text": "let a, b = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet _ = if (a + b) mod 2 = 1 then print_endline \"IMPOSSIBLE\" else Printf.printf \"%d\\n\" @@ (a + b) / 2", "language": "OCaml", "metadata": {"date": 1573007225, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s353162548.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s353162548", "user_id": "u732304692"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "let a, b = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet _ = if (a + b) mod 2 = 1 then print_endline \"IMPOSSIBLE\" else Printf.printf \"%d\\n\" @@ (a + b) / 2", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 152, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s006446444", "group_id": "codeNet:p02958", "input_text": "(* Vicfred\n * https://atcoder.jp/contests/abc135/tasks/abc135_b\n * greedy\n * *)\nlet n = Scanf.scanf \"%d\\n\" ( + ) 0\nlet ps = Array.init n @@ fun _ -> Scanf.scanf \" %d\" ( + ) 0\nlet swaps = Array.fold_left ( + ) 0 @@ Array.init n @@ fun i -> if (i + 1) != ps.(i) then 1 else 0\nlet _ = Printf.printf \"%s\\n\" (if swaps <= 2 then \"YES\" else \"NO\")\n", "language": "OCaml", "metadata": {"date": 1594051714, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s006446444.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s006446444", "user_id": "u737840172"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "(* Vicfred\n * https://atcoder.jp/contests/abc135/tasks/abc135_b\n * greedy\n * *)\nlet n = Scanf.scanf \"%d\\n\" ( + ) 0\nlet ps = Array.init n @@ fun _ -> Scanf.scanf \" %d\" ( + ) 0\nlet swaps = Array.fold_left ( + ) 0 @@ Array.init n @@ fun i -> if (i + 1) != ps.(i) then 1 else 0\nlet _ = Printf.printf \"%s\\n\" (if swaps <= 2 then \"YES\" else \"NO\")\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a sequence p = {p_1,\\ p_2,\\ ...,\\ p_N} which is a permutation of {1,\\ 2,\\ ...,\\ N}.\n\nYou can perform the following operation at most once: choose integers i and j (1 \\leq i < j \\leq N), and swap p_i and p_j. Note that you can also choose not to perform it.\n\nPrint YES if you can sort p in ascending order in this way, and NO otherwise.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\np is a permutation of {1,\\ 2,\\ ...,\\ N}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\np_1 p_2 ... p_N\n\nOutput\n\nPrint YES if you can sort p in ascending order in the way stated in the problem statement, and NO otherwise.\n\nSample Input 1\n\n5\n5 2 3 4 1\n\nSample Output 1\n\nYES\n\nYou can sort p in ascending order by swapping p_1 and p_5.\n\nSample Input 2\n\n5\n2 4 3 5 1\n\nSample Output 2\n\nNO\n\nIn this case, swapping any two elements does not sort p in ascending order.\n\nSample Input 3\n\n7\n1 2 3 4 5 6 7\n\nSample Output 3\n\nYES\n\np is already sorted in ascending order, so no operation is needed.", "sample_input": "5\n5 2 3 4 1\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p02958", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a sequence p = {p_1,\\ p_2,\\ ...,\\ p_N} which is a permutation of {1,\\ 2,\\ ...,\\ N}.\n\nYou can perform the following operation at most once: choose integers i and j (1 \\leq i < j \\leq N), and swap p_i and p_j. Note that you can also choose not to perform it.\n\nPrint YES if you can sort p in ascending order in this way, and NO otherwise.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\np is a permutation of {1,\\ 2,\\ ...,\\ N}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\np_1 p_2 ... p_N\n\nOutput\n\nPrint YES if you can sort p in ascending order in the way stated in the problem statement, and NO otherwise.\n\nSample Input 1\n\n5\n5 2 3 4 1\n\nSample Output 1\n\nYES\n\nYou can sort p in ascending order by swapping p_1 and p_5.\n\nSample Input 2\n\n5\n2 4 3 5 1\n\nSample Output 2\n\nNO\n\nIn this case, swapping any two elements does not sort p in ascending order.\n\nSample Input 3\n\n7\n1 2 3 4 5 6 7\n\nSample Output 3\n\nYES\n\np is already sorted in ascending order, so no operation is needed.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 340, "cpu_time_ms": 8, "memory_kb": 3708}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s595579704", "group_id": "codeNet:p02960", "input_text": "let () =\n    let main () =\n        let m = 1_000_000_000 + 7 in\n        let (+@) a b = (a + b) mod m in\n        let s = read_line () in\n        let a = Array.make 13 0 in\n        let l = String.length s in\n        let rec loop i a =\n            if i = l then a else\n                let b = Array.make 13 0 in\n                let () =\n                    if s.[i] = '?' then (\n                        for j = 0 to 12 do\n                            for k = 0 to 9 do\n                                b.((j * 10 + k) mod 13) <- b.((j * 10 + k) mod 13) +@ a.(j)\n                            done\n                        done\n                    ) else (\n                        let k = int_of_char s.[i] - int_of_char '0' in\n                        for j = 0 to 12 do\n                            b.((j * 10 + k) mod 13) <- b.((j * 10 + k) mod 13) +@ a.(j)\n                        done\n                    )\n                in\n                loop (i + 1) b\n        in\n        let a = loop 0 (Array.init 13 (fun i -> if i = 0 then 1 else 0)) in\n        Printf.printf \"%d\\n\" a.(5)\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1564277579, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s595579704.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s595579704", "user_id": "u342443598"}, "prompt_components": {"gold_output": "768\n", "input_to_evaluate": "let () =\n    let main () =\n        let m = 1_000_000_000 + 7 in\n        let (+@) a b = (a + b) mod m in\n        let s = read_line () in\n        let a = Array.make 13 0 in\n        let l = String.length s in\n        let rec loop i a =\n            if i = l then a else\n                let b = Array.make 13 0 in\n                let () =\n                    if s.[i] = '?' then (\n                        for j = 0 to 12 do\n                            for k = 0 to 9 do\n                                b.((j * 10 + k) mod 13) <- b.((j * 10 + k) mod 13) +@ a.(j)\n                            done\n                        done\n                    ) else (\n                        let k = int_of_char s.[i] - int_of_char '0' in\n                        for j = 0 to 12 do\n                            b.((j * 10 + k) mod 13) <- b.((j * 10 + k) mod 13) +@ a.(j)\n                        done\n                    )\n                in\n                loop (i + 1) b\n        in\n        let a = loop 0 (Array.init 13 (fun i -> if i = 0 then 1 else 0)) in\n        Printf.printf \"%d\\n\" a.(5)\n    in\n    main ()", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1091, "cpu_time_ms": 74, "memory_kb": 4864}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s830156496", "group_id": "codeNet:p02963", "input_text": "let rec floor_sqrt acc acc_x_2_x_r sq_acc_minus_z r sq_r =\n  if r = 0 then acc\n  else\n    let sq_acc_minus_z' = sq_acc_minus_z + acc_x_2_x_r + sq_r in\n    ( if sq_acc_minus_z' <= 0 then\n        floor_sqrt (acc + r) ((acc_x_2_x_r lsr 1) + sq_r) sq_acc_minus_z'\n      else\n        floor_sqrt acc (acc_x_2_x_r lsr 1) sq_acc_minus_z) (r lsr 1) (sq_r lsr 2)\nlet floor_sqrt z = floor_sqrt 0 0 (~-z) (1 lsl 30) (1 lsl 60)\n\nlet ceil_sqrt n =\n  let m = floor_sqrt n in\n  if n <= m * m then m else m + 1\n\nlet () = Scanf.scanf \"%d\" @@ fun s ->\n  let x1 = ceil_sqrt s in\n  Printf.printf \"0 0 %d %d 1 %d\" x1 (x1 * x1 - s) x1\n\n", "language": "OCaml", "metadata": {"date": 1568454037, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s830156496.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s830156496", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1 0 2 2 0 1\n", "input_to_evaluate": "let rec floor_sqrt acc acc_x_2_x_r sq_acc_minus_z r sq_r =\n  if r = 0 then acc\n  else\n    let sq_acc_minus_z' = sq_acc_minus_z + acc_x_2_x_r + sq_r in\n    ( if sq_acc_minus_z' <= 0 then\n        floor_sqrt (acc + r) ((acc_x_2_x_r lsr 1) + sq_r) sq_acc_minus_z'\n      else\n        floor_sqrt acc (acc_x_2_x_r lsr 1) sq_acc_minus_z) (r lsr 1) (sq_r lsr 2)\nlet floor_sqrt z = floor_sqrt 0 0 (~-z) (1 lsl 30) (1 lsl 60)\n\nlet ceil_sqrt n =\n  let m = floor_sqrt n in\n  if n <= m * m then m else m + 1\n\nlet () = Scanf.scanf \"%d\" @@ fun s ->\n  let x1 = ceil_sqrt s in\n  Printf.printf \"0 0 %d %d 1 %d\" x1 (x1 * x1 - s) x1\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is an integer S.\nFind a combination of six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfies all of the following conditions:\n\n0 \\leq X_1,Y_1,X_2,Y_2,X_3,Y_3 \\leq 10^9\n\nThe area of the triangle in a two-dimensional plane whose vertices are (X_1,Y_1),(X_2,Y_2), and (X_3,Y_3) is S/2.\n\nWe can prove that there always exist six integers that satisfy the conditions under the constraints of this problem.\n\nConstraints\n\n1 \\leq S \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfy the conditions, in this order, with spaces in between.\nIf multiple solutions exist, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1 0 2 2 0 1\n\nThe area of the triangle in a two-dimensional plane whose vertices are (1,0),(2,2), and (0,1) is 3/2.\nPrinting 3 0 3 1 0 1 or 1 0 0 1 2 2 will also be accepted.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n0 0 10 0 0 10\n\nSample Input 3\n\n311114770564041497\n\nSample Output 3\n\n314159265 358979323 846264338 327950288 419716939 937510582", "sample_input": "3\n"}, "reference_outputs": ["1 0 2 2 0 1\n"], "source_document_id": "p02963", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is an integer S.\nFind a combination of six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfies all of the following conditions:\n\n0 \\leq X_1,Y_1,X_2,Y_2,X_3,Y_3 \\leq 10^9\n\nThe area of the triangle in a two-dimensional plane whose vertices are (X_1,Y_1),(X_2,Y_2), and (X_3,Y_3) is S/2.\n\nWe can prove that there always exist six integers that satisfy the conditions under the constraints of this problem.\n\nConstraints\n\n1 \\leq S \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfy the conditions, in this order, with spaces in between.\nIf multiple solutions exist, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1 0 2 2 0 1\n\nThe area of the triangle in a two-dimensional plane whose vertices are (1,0),(2,2), and (0,1) is 3/2.\nPrinting 3 0 3 1 0 1 or 1 0 0 1 2 2 will also be accepted.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n0 0 10 0 0 10\n\nSample Input 3\n\n311114770564041497\n\nSample Output 3\n\n314159265 358979323 846264338 327950288 419716939 937510582", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 613, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s751107844", "group_id": "codeNet:p02963", "input_text": "let rec lower_bound l r p =\n  if r <= 1 + l\n  then r\n  else let m = (l + r) / 2 in\n       if p m\n       then lower_bound l m p\n       else lower_bound m r p\n\nlet () = Scanf.scanf \"%d\" @@ fun s ->\n  let x1 = lower_bound 0 s @@ fun x1 -> s <= x1 * x1 in\n  Printf.printf \"0 0 %d %d 1 %d\" x1 (x1 * x1 - s) x1\n\n", "language": "OCaml", "metadata": {"date": 1568453711, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s751107844.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s751107844", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1 0 2 2 0 1\n", "input_to_evaluate": "let rec lower_bound l r p =\n  if r <= 1 + l\n  then r\n  else let m = (l + r) / 2 in\n       if p m\n       then lower_bound l m p\n       else lower_bound m r p\n\nlet () = Scanf.scanf \"%d\" @@ fun s ->\n  let x1 = lower_bound 0 s @@ fun x1 -> s <= x1 * x1 in\n  Printf.printf \"0 0 %d %d 1 %d\" x1 (x1 * x1 - s) x1\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is an integer S.\nFind a combination of six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfies all of the following conditions:\n\n0 \\leq X_1,Y_1,X_2,Y_2,X_3,Y_3 \\leq 10^9\n\nThe area of the triangle in a two-dimensional plane whose vertices are (X_1,Y_1),(X_2,Y_2), and (X_3,Y_3) is S/2.\n\nWe can prove that there always exist six integers that satisfy the conditions under the constraints of this problem.\n\nConstraints\n\n1 \\leq S \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfy the conditions, in this order, with spaces in between.\nIf multiple solutions exist, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1 0 2 2 0 1\n\nThe area of the triangle in a two-dimensional plane whose vertices are (1,0),(2,2), and (0,1) is 3/2.\nPrinting 3 0 3 1 0 1 or 1 0 0 1 2 2 will also be accepted.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n0 0 10 0 0 10\n\nSample Input 3\n\n311114770564041497\n\nSample Output 3\n\n314159265 358979323 846264338 327950288 419716939 937510582", "sample_input": "3\n"}, "reference_outputs": ["1 0 2 2 0 1\n"], "source_document_id": "p02963", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is an integer S.\nFind a combination of six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfies all of the following conditions:\n\n0 \\leq X_1,Y_1,X_2,Y_2,X_3,Y_3 \\leq 10^9\n\nThe area of the triangle in a two-dimensional plane whose vertices are (X_1,Y_1),(X_2,Y_2), and (X_3,Y_3) is S/2.\n\nWe can prove that there always exist six integers that satisfy the conditions under the constraints of this problem.\n\nConstraints\n\n1 \\leq S \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfy the conditions, in this order, with spaces in between.\nIf multiple solutions exist, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1 0 2 2 0 1\n\nThe area of the triangle in a two-dimensional plane whose vertices are (1,0),(2,2), and (0,1) is 3/2.\nPrinting 3 0 3 1 0 1 or 1 0 0 1 2 2 will also be accepted.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n0 0 10 0 0 10\n\nSample Input 3\n\n311114770564041497\n\nSample Output 3\n\n314159265 358979323 846264338 327950288 419716939 937510582", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 306, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s994404834", "group_id": "codeNet:p02963", "input_text": "let () =\n    let main n =\n        let s = n in\n        let x1 = 0 in\n        let y1 = 0 in\n        let sq = int_of_float (ceil (sqrt (float (s)))) in\n        let rec loop offs =\n            let x2 = sq + offs in\n            let y3 = sq - offs in\n            let sq2 = x2 * y3 - s in\n            if x2 > 1_000_000_000 || sq2 < 0 then failwith \"??\" else\n                let rec loop_2 sq3 count =\n                    if count > 400000 || sq3 > sq2 then loop (offs + 1) else\n                    if sq2 mod sq3 = 0 then\n                        let x3 = sq3 in\n                        let y2 = sq2 / sq3 in\n                        x1, y1, x2, y2, x3, y3\n                    else loop_2 (sq3 + 1) (count + 1)\n                in\n                if sq2 = 0 then x1, y1, x2, 0, 0, y3 else\n                let sq3 = int_of_float (floor (sqrt (float (sq2)))) in\n                loop_2 sq3 0\n        in\n        loop 0\n    in\n    let x1, y1, x2, y2, x3, y3 = main (int_of_string (read_line ())) in\n    Printf.printf \"%d %d %d %d %d %d\\n\" x1 y1 x2 y2 x3 y3", "language": "OCaml", "metadata": {"date": 1563761787, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s994404834.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s994404834", "user_id": "u342443598"}, "prompt_components": {"gold_output": "1 0 2 2 0 1\n", "input_to_evaluate": "let () =\n    let main n =\n        let s = n in\n        let x1 = 0 in\n        let y1 = 0 in\n        let sq = int_of_float (ceil (sqrt (float (s)))) in\n        let rec loop offs =\n            let x2 = sq + offs in\n            let y3 = sq - offs in\n            let sq2 = x2 * y3 - s in\n            if x2 > 1_000_000_000 || sq2 < 0 then failwith \"??\" else\n                let rec loop_2 sq3 count =\n                    if count > 400000 || sq3 > sq2 then loop (offs + 1) else\n                    if sq2 mod sq3 = 0 then\n                        let x3 = sq3 in\n                        let y2 = sq2 / sq3 in\n                        x1, y1, x2, y2, x3, y3\n                    else loop_2 (sq3 + 1) (count + 1)\n                in\n                if sq2 = 0 then x1, y1, x2, 0, 0, y3 else\n                let sq3 = int_of_float (floor (sqrt (float (sq2)))) in\n                loop_2 sq3 0\n        in\n        loop 0\n    in\n    let x1, y1, x2, y2, x3, y3 = main (int_of_string (read_line ())) in\n    Printf.printf \"%d %d %d %d %d %d\\n\" x1 y1 x2 y2 x3 y3", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is an integer S.\nFind a combination of six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfies all of the following conditions:\n\n0 \\leq X_1,Y_1,X_2,Y_2,X_3,Y_3 \\leq 10^9\n\nThe area of the triangle in a two-dimensional plane whose vertices are (X_1,Y_1),(X_2,Y_2), and (X_3,Y_3) is S/2.\n\nWe can prove that there always exist six integers that satisfy the conditions under the constraints of this problem.\n\nConstraints\n\n1 \\leq S \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfy the conditions, in this order, with spaces in between.\nIf multiple solutions exist, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1 0 2 2 0 1\n\nThe area of the triangle in a two-dimensional plane whose vertices are (1,0),(2,2), and (0,1) is 3/2.\nPrinting 3 0 3 1 0 1 or 1 0 0 1 2 2 will also be accepted.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n0 0 10 0 0 10\n\nSample Input 3\n\n311114770564041497\n\nSample Output 3\n\n314159265 358979323 846264338 327950288 419716939 937510582", "sample_input": "3\n"}, "reference_outputs": ["1 0 2 2 0 1\n"], "source_document_id": "p02963", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is an integer S.\nFind a combination of six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfies all of the following conditions:\n\n0 \\leq X_1,Y_1,X_2,Y_2,X_3,Y_3 \\leq 10^9\n\nThe area of the triangle in a two-dimensional plane whose vertices are (X_1,Y_1),(X_2,Y_2), and (X_3,Y_3) is S/2.\n\nWe can prove that there always exist six integers that satisfy the conditions under the constraints of this problem.\n\nConstraints\n\n1 \\leq S \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfy the conditions, in this order, with spaces in between.\nIf multiple solutions exist, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1 0 2 2 0 1\n\nThe area of the triangle in a two-dimensional plane whose vertices are (1,0),(2,2), and (0,1) is 3/2.\nPrinting 3 0 3 1 0 1 or 1 0 0 1 2 2 will also be accepted.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n0 0 10 0 0 10\n\nSample Input 3\n\n311114770564041497\n\nSample Output 3\n\n314159265 358979323 846264338 327950288 419716939 937510582", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1042, "cpu_time_ms": 7, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s517122738", "group_id": "codeNet:p02969", "input_text": "(* Vicfred\n * https://atcoder.jp/contests/abc134/tasks/abc134_a\n * math, implementation\n * *)\nScanf.scanf \"%d\\n\" @@ fun r ->\n    Printf.printf \"%d\\n\" @@\n    3 * r * r\n\n", "language": "OCaml", "metadata": {"date": 1594055406, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s517122738.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s517122738", "user_id": "u737840172"}, "prompt_components": {"gold_output": "48\n", "input_to_evaluate": "(* Vicfred\n * https://atcoder.jp/contests/abc134/tasks/abc134_a\n * math, implementation\n * *)\nScanf.scanf \"%d\\n\" @@ fun r ->\n    Printf.printf \"%d\\n\" @@\n    3 * r * r\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIt is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.\n\nGiven an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.\n\nConstraints\n\n1 \\leq r \\leq 100\n\nr is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr\n\nOutput\n\nPrint an integer representing the area of the regular dodecagon.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n48\n\nThe area of the regular dodecagon is 3 \\times 4^2 = 48.\n\nSample Input 2\n\n15\n\nSample Output 2\n\n675\n\nSample Input 3\n\n80\n\nSample Output 3\n\n19200", "sample_input": "4\n"}, "reference_outputs": ["48\n"], "source_document_id": "p02969", "source_text": "Score : 100 points\n\nProblem Statement\n\nIt is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.\n\nGiven an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.\n\nConstraints\n\n1 \\leq r \\leq 100\n\nr is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr\n\nOutput\n\nPrint an integer representing the area of the regular dodecagon.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n48\n\nThe area of the regular dodecagon is 3 \\times 4^2 = 48.\n\nSample Input 2\n\n15\n\nSample Output 2\n\n675\n\nSample Input 3\n\n80\n\nSample Output 3\n\n19200", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 168, "cpu_time_ms": 8, "memory_kb": 3804}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s043057661", "group_id": "codeNet:p02970", "input_text": "let answer a b =\n  let n = a / (b * 2 + 1) in\n  let m = a mod (b * 2 + 1) in\n    if m == 0 then n else n + 1\n\nlet () = Scanf.scanf \"%d %d\" (fun a b -> print_endline (string_of_int (answer a b)))\n", "language": "OCaml", "metadata": {"date": 1563837439, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s043057661.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s043057661", "user_id": "u950428333"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let answer a b =\n  let n = a / (b * 2 + 1) in\n  let m = a mod (b * 2 + 1) in\n    if m == 0 then n else n + 1\n\nlet () = Scanf.scanf \"%d %d\" (fun a b -> print_endline (string_of_int (answer a b)))\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 195, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s215437903", "group_id": "codeNet:p02972", "input_text": "let readInt () = Scanf.scanf \" %d\" (fun x -> x)\n\nlet solve n a =\n  let b = Array.make n (-1) in\n  let rec go i =\n    if i < 1 then ()\n    else\n    let rec sumPrev s j =\n      if j > n then s else sumPrev (s + b.(j-1)) (j + i)\n    in\n    let tot = sumPrev 0 (2*i) mod 2 in\n    (*Printf.printf \"%d %d %d\\n\" i tot a.(i-1);*)\n    b.(i-1) <- if tot = a.(i-1) then 0 else 1;\n    go (i-1)\n  in go n;\n  let rec go (k, acc) i =\n    if i < 1 then (k, acc)\n    else go (if b.(i-1) = 1 then (k+1, i :: acc) else (k, acc)) (i-1)\n  in go (0, []) n\n\nlet main () =\n  let n = readInt () in\n  let a = Array.init n (fun _ -> readInt ()) in\n  let (k, ans) = solve n a in\n  Printf.printf \"%d\\n\" k;\n  ans |> List.iter (fun x -> Printf.printf \"%d \" x);\n  print_endline \"\"\n\nlet () = main ()\n", "language": "OCaml", "metadata": {"date": 1563673161, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s215437903.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s215437903", "user_id": "u310083442"}, "prompt_components": {"gold_output": "1\n1\n", "input_to_evaluate": "let readInt () = Scanf.scanf \" %d\" (fun x -> x)\n\nlet solve n a =\n  let b = Array.make n (-1) in\n  let rec go i =\n    if i < 1 then ()\n    else\n    let rec sumPrev s j =\n      if j > n then s else sumPrev (s + b.(j-1)) (j + i)\n    in\n    let tot = sumPrev 0 (2*i) mod 2 in\n    (*Printf.printf \"%d %d %d\\n\" i tot a.(i-1);*)\n    b.(i-1) <- if tot = a.(i-1) then 0 else 1;\n    go (i-1)\n  in go n;\n  let rec go (k, acc) i =\n    if i < 1 then (k, acc)\n    else go (if b.(i-1) = 1 then (k+1, i :: acc) else (k, acc)) (i-1)\n  in go (0, []) n\n\nlet main () =\n  let n = readInt () in\n  let a = Array.init n (fun _ -> readInt ()) in\n  let (k, ans) = solve n a in\n  Printf.printf \"%d\\n\" k;\n  ans |> List.iter (fun x -> Printf.printf \"%d \" x);\n  print_endline \"\"\n\nlet () = 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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 767, "cpu_time_ms": 71, "memory_kb": 9344}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s784525236", "group_id": "codeNet:p02975", "input_text": "module IntMap = Map.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet remove a s =\n  match IntMap.find a s with\n  | exception Not_found -> s\n  | 1 -> IntMap.remove a s\n  | n -> IntMap.add a (n - 1) s\n\nlet add a s =\n  IntMap.add a (1 + try IntMap.find a s with Not_found -> 0) s\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ =\n    Array.fold_right add\n      (Array.init n (fun _ ->\n        Scanf.scanf \"%d \" (fun a -> a)))\n      IntMap.empty in\n  let rec solve s a1 a2 = function\n    | 0 -> true\n    | n -> IntMap.mem a2 s && solve (remove a2 s) a2 (a1 lxor a2) (n - 1) in\n  print_endline @@\n  if\n    solve as_ (fst (IntMap.min_binding as_)) (fst (IntMap.max_binding as_)) n\n  then \"Yes\"\n  else \"No\"\n", "language": "OCaml", "metadata": {"date": 1568451128, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s784525236.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s784525236", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "module IntMap = Map.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet remove a s =\n  match IntMap.find a s with\n  | exception Not_found -> s\n  | 1 -> IntMap.remove a s\n  | n -> IntMap.add a (n - 1) s\n\nlet add a s =\n  IntMap.add a (1 + try IntMap.find a s with Not_found -> 0) s\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ =\n    Array.fold_right add\n      (Array.init n (fun _ ->\n        Scanf.scanf \"%d \" (fun a -> a)))\n      IntMap.empty in\n  let rec solve s a1 a2 = function\n    | 0 -> true\n    | n -> IntMap.mem a2 s && solve (remove a2 s) a2 (a1 lxor a2) (n - 1) in\n  print_endline @@\n  if\n    solve as_ (fst (IntMap.min_binding as_)) (fst (IntMap.max_binding as_)) n\n  then \"Yes\"\n  else \"No\"\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has N hats. The i-th hat has an integer a_i written on it.\n\nThere are N camels standing in a circle.\nSnuke will put one of his hats on each of these camels.\n\nIf there exists a way to distribute the hats to the camels such that the following condition is satisfied for every camel, print Yes; otherwise, print No.\n\nThe bitwise XOR of the numbers written on the hats on both adjacent camels is equal to the number on the hat on itself.\n\nWhat is XOR?\n\nThe bitwise XOR x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n of n non-negative integers x_1, x_2, \\ldots, x_n is defined as follows:\n\n- When x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if the number of integers among x_1, x_2, \\ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.\n\nFor example, 3 \\oplus 5 = 6.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^{5}\n\n0 \\leq a_i \\leq 10^{9}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYes\n\nIf we put the hats with 1, 2, and 3 in this order, clockwise, the condition will be satisfied for every camel, so the answer is Yes.\n\nSample Input 2\n\n4\n1 2 4 8\n\nSample Output 2\n\nNo\n\nThere is no such way to distribute the hats; the answer is No.", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02975", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has N hats. The i-th hat has an integer a_i written on it.\n\nThere are N camels standing in a circle.\nSnuke will put one of his hats on each of these camels.\n\nIf there exists a way to distribute the hats to the camels such that the following condition is satisfied for every camel, print Yes; otherwise, print No.\n\nThe bitwise XOR of the numbers written on the hats on both adjacent camels is equal to the number on the hat on itself.\n\nWhat is XOR?\n\nThe bitwise XOR x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n of n non-negative integers x_1, x_2, \\ldots, x_n is defined as follows:\n\n- When x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if the number of integers among x_1, x_2, \\ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.\n\nFor example, 3 \\oplus 5 = 6.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^{5}\n\n0 \\leq a_i \\leq 10^{9}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYes\n\nIf we put the hats with 1, 2, and 3 in this order, clockwise, the condition will be satisfied for every camel, so the answer is Yes.\n\nSample Input 2\n\n4\n1 2 4 8\n\nSample Output 2\n\nNo\n\nThere is no such way to distribute the hats; the answer is No.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 716, "cpu_time_ms": 106, "memory_kb": 10496}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s991240327", "group_id": "codeNet:p02975", "input_text": "module IntSet = Set.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let a :: as_ =\n    Array.to_list @@\n    Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  print_endline @@\n  if\n    let s = IntSet.of_list as_ in\n    List.exists (fun a' ->\n      let rec solve s a1 a2 = function\n        | 0 -> a2 = a\n        | n -> IntSet.mem a2 s && solve (IntSet.remove a2 s) a2 (a1 lxor a2) (n - 1) in\n      solve s a a' (n - 1)) as_\n  then \"Yes\"\n  else \"No\"\n", "language": "OCaml", "metadata": {"date": 1568449575, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s991240327.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s991240327", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "module IntSet = Set.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let a :: as_ =\n    Array.to_list @@\n    Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  print_endline @@\n  if\n    let s = IntSet.of_list as_ in\n    List.exists (fun a' ->\n      let rec solve s a1 a2 = function\n        | 0 -> a2 = a\n        | n -> IntSet.mem a2 s && solve (IntSet.remove a2 s) a2 (a1 lxor a2) (n - 1) in\n      solve s a a' (n - 1)) as_\n  then \"Yes\"\n  else \"No\"\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has N hats. The i-th hat has an integer a_i written on it.\n\nThere are N camels standing in a circle.\nSnuke will put one of his hats on each of these camels.\n\nIf there exists a way to distribute the hats to the camels such that the following condition is satisfied for every camel, print Yes; otherwise, print No.\n\nThe bitwise XOR of the numbers written on the hats on both adjacent camels is equal to the number on the hat on itself.\n\nWhat is XOR?\n\nThe bitwise XOR x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n of n non-negative integers x_1, x_2, \\ldots, x_n is defined as follows:\n\n- When x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if the number of integers among x_1, x_2, \\ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.\n\nFor example, 3 \\oplus 5 = 6.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^{5}\n\n0 \\leq a_i \\leq 10^{9}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYes\n\nIf we put the hats with 1, 2, and 3 in this order, clockwise, the condition will be satisfied for every camel, so the answer is Yes.\n\nSample Input 2\n\n4\n1 2 4 8\n\nSample Output 2\n\nNo\n\nThere is no such way to distribute the hats; the answer is No.", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02975", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has N hats. The i-th hat has an integer a_i written on it.\n\nThere are N camels standing in a circle.\nSnuke will put one of his hats on each of these camels.\n\nIf there exists a way to distribute the hats to the camels such that the following condition is satisfied for every camel, print Yes; otherwise, print No.\n\nThe bitwise XOR of the numbers written on the hats on both adjacent camels is equal to the number on the hat on itself.\n\nWhat is XOR?\n\nThe bitwise XOR x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n of n non-negative integers x_1, x_2, \\ldots, x_n is defined as follows:\n\n- When x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if the number of integers among x_1, x_2, \\ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.\n\nFor example, 3 \\oplus 5 = 6.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^{5}\n\n0 \\leq a_i \\leq 10^{9}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYes\n\nIf we put the hats with 1, 2, and 3 in this order, clockwise, the condition will be satisfied for every camel, so the answer is Yes.\n\nSample Input 2\n\n4\n1 2 4 8\n\nSample Output 2\n\nNo\n\nThere is no such way to distribute the hats; the answer is No.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 511, "cpu_time_ms": 148, "memory_kb": 10496}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s134658663", "group_id": "codeNet:p02975", "input_text": "module M = Map.Make (struct type t = int let compare = compare end)\n\nlet () =\n    let split s =\n        let rec loop i cur flag acc =\n            if i = String.length s then ( if flag then cur :: acc else acc) else (\n                match flag, s.[i] with\n                | true,  ' ' -> loop (i + 1) \"\" false (cur :: acc)\n                | false, ' ' -> loop (i + 1) \"\" false acc\n                | true,  v   -> loop (i + 1) (Printf.sprintf \"%s%c\" cur v) true acc\n                | false, v   -> loop (i + 1) (Printf.sprintf \"%s%c\" cur v) true acc\n            )\n        in\n        List.map int_of_string (List.rev (loop 0 \"\" false []))\n    in\n    let check a =\n        let rep = Array.length a / 3 in\n        let hist = Array.fold_left (fun map v -> M.add v (1 + try M.find v map with _ -> 0) map) M.empty a in\n        let cont = Array.of_list (M.fold (fun k v acc -> (k, v) :: acc) hist []) in\n        match Array.length cont with\n        | 1 -> fst cont.(0) = 0 \n        | 2 -> let (k1, v1) = cont.(0) in\n               let (k2, v2) = cont.(1) in\n               if v1 = rep * 2 && v2 = rep then (\n                   k2 = 0\n               ) else if v2 = rep * 2 && v1 = rep then (\n                   k1 = 0\n               ) else false\n        | 3 -> let (k1, v1) = cont.(0) in\n               let (k2, v2) = cont.(1) in\n               let (k3, v3) = cont.(2) in\n               v1 = rep && v2 = rep && v3 = rep && k1 lxor k2 lxor k3 = 0\n        | _ -> false\n\n    in\n    let main () =\n        let n = int_of_string (read_line ()) in\n        let a = Array.of_list (split (read_line ())) in\n        let flag = if n mod 3 = 0 then (\n            check a\n        ) else Array.fold_left (+) 0 a = 0\n        in\n        print_endline (if flag then \"Yes\" else \"No\")\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1563156350, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s134658663.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s134658663", "user_id": "u342443598"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "module M = Map.Make (struct type t = int let compare = compare end)\n\nlet () =\n    let split s =\n        let rec loop i cur flag acc =\n            if i = String.length s then ( if flag then cur :: acc else acc) else (\n                match flag, s.[i] with\n                | true,  ' ' -> loop (i + 1) \"\" false (cur :: acc)\n                | false, ' ' -> loop (i + 1) \"\" false acc\n                | true,  v   -> loop (i + 1) (Printf.sprintf \"%s%c\" cur v) true acc\n                | false, v   -> loop (i + 1) (Printf.sprintf \"%s%c\" cur v) true acc\n            )\n        in\n        List.map int_of_string (List.rev (loop 0 \"\" false []))\n    in\n    let check a =\n        let rep = Array.length a / 3 in\n        let hist = Array.fold_left (fun map v -> M.add v (1 + try M.find v map with _ -> 0) map) M.empty a in\n        let cont = Array.of_list (M.fold (fun k v acc -> (k, v) :: acc) hist []) in\n        match Array.length cont with\n        | 1 -> fst cont.(0) = 0 \n        | 2 -> let (k1, v1) = cont.(0) in\n               let (k2, v2) = cont.(1) in\n               if v1 = rep * 2 && v2 = rep then (\n                   k2 = 0\n               ) else if v2 = rep * 2 && v1 = rep then (\n                   k1 = 0\n               ) else false\n        | 3 -> let (k1, v1) = cont.(0) in\n               let (k2, v2) = cont.(1) in\n               let (k3, v3) = cont.(2) in\n               v1 = rep && v2 = rep && v3 = rep && k1 lxor k2 lxor k3 = 0\n        | _ -> false\n\n    in\n    let main () =\n        let n = int_of_string (read_line ()) in\n        let a = Array.of_list (split (read_line ())) in\n        let flag = if n mod 3 = 0 then (\n            check a\n        ) else Array.fold_left (+) 0 a = 0\n        in\n        print_endline (if flag then \"Yes\" else \"No\")\n    in\n    main ()", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has N hats. The i-th hat has an integer a_i written on it.\n\nThere are N camels standing in a circle.\nSnuke will put one of his hats on each of these camels.\n\nIf there exists a way to distribute the hats to the camels such that the following condition is satisfied for every camel, print Yes; otherwise, print No.\n\nThe bitwise XOR of the numbers written on the hats on both adjacent camels is equal to the number on the hat on itself.\n\nWhat is XOR?\n\nThe bitwise XOR x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n of n non-negative integers x_1, x_2, \\ldots, x_n is defined as follows:\n\n- When x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if the number of integers among x_1, x_2, \\ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.\n\nFor example, 3 \\oplus 5 = 6.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^{5}\n\n0 \\leq a_i \\leq 10^{9}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYes\n\nIf we put the hats with 1, 2, and 3 in this order, clockwise, the condition will be satisfied for every camel, so the answer is Yes.\n\nSample Input 2\n\n4\n1 2 4 8\n\nSample Output 2\n\nNo\n\nThere is no such way to distribute the hats; the answer is No.", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02975", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has N hats. The i-th hat has an integer a_i written on it.\n\nThere are N camels standing in a circle.\nSnuke will put one of his hats on each of these camels.\n\nIf there exists a way to distribute the hats to the camels such that the following condition is satisfied for every camel, print Yes; otherwise, print No.\n\nThe bitwise XOR of the numbers written on the hats on both adjacent camels is equal to the number on the hat on itself.\n\nWhat is XOR?\n\nThe bitwise XOR x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n of n non-negative integers x_1, x_2, \\ldots, x_n is defined as follows:\n\n- When x_1 \\oplus x_2 \\oplus \\ldots \\oplus x_n is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if the number of integers among x_1, x_2, \\ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.\n\nFor example, 3 \\oplus 5 = 6.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^{5}\n\n0 \\leq a_i \\leq 10^{9}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYes\n\nIf we put the hats with 1, 2, and 3 in this order, clockwise, the condition will be satisfied for every camel, so the answer is Yes.\n\nSample Input 2\n\n4\n1 2 4 8\n\nSample Output 2\n\nNo\n\nThere is no such way to distribute the hats; the answer is No.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1774, "cpu_time_ms": 199, "memory_kb": 17152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s044293352", "group_id": "codeNet:p02977", "input_text": "let () =\n    let main () =\n        let n = int_of_string (read_line ()) in\n        if n = 1 || (n + 1) land n <> 0 then print_endline \"No\" else\n            let () = print_endline \"Yes\" in\n            for i = 1 to n * 2 - 1 do\n                Printf.printf \"%d %d\\n\" i (i + 1)\n            done\n\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1563157845, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02977.html", "problem_id": "p02977", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02977/input.txt", "sample_output_relpath": "derived/input_output/data/p02977/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02977/OCaml/s044293352.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s044293352", "user_id": "u342443598"}, "prompt_components": {"gold_output": "Yes\n1 2\n2 3\n3 4\n4 5\n5 6\n", "input_to_evaluate": "let () =\n    let main () =\n        let n = int_of_string (read_line ()) in\n        if n = 1 || (n + 1) land n <> 0 then print_endline \"No\" else\n            let () = print_endline \"Yes\" in\n            for i = 1 to n * 2 - 1 do\n                Printf.printf \"%d %d\\n\" i (i + 1)\n            done\n\n    in\n    main ()", "problem_context": "Score : 700 points\n\nProblem Statement\n\nYou are given an integer N. Determine if there exists a tree with 2N vertices numbered 1 to 2N satisfying the following condition, and show one such tree if the answer is yes.\n\nAssume that, for each integer i between 1 and N (inclusive), Vertex i and N+i have the weight i. Then, for each integer i between 1 and N, the bitwise XOR of the weights of the vertices on the path between Vertex i and N+i (including themselves) is i.\n\nConstraints\n\nN is an integer.\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\nIf there exists a tree satisfying the condition in the statement, print Yes; otherwise, print No.\nThen, if such a tree exists, print the 2N-1 edges of such a tree in the subsequent 2N-1 lines, in the following format:\n\na_{1} b_{1}\n\\vdots\na_{2N-1} b_{2N-1}\n\nHere each pair (a_i, b_i) means that there is an edge connecting Vertex a_i and b_i. The edges may be printed in any order.\n\nSample Input 1\n\n3\n\nSample Output 1\n\nYes\n1 2\n2 3\n3 4\n4 5\n5 6\n\nThe sample output represents the following graph:\n\nSample Input 2\n\n1\n\nSample Output 2\n\nNo\n\nThere is no tree satisfying the condition.", "sample_input": "3\n"}, "reference_outputs": ["Yes\n1 2\n2 3\n3 4\n4 5\n5 6\n"], "source_document_id": "p02977", "source_text": "Score : 700 points\n\nProblem Statement\n\nYou are given an integer N. Determine if there exists a tree with 2N vertices numbered 1 to 2N satisfying the following condition, and show one such tree if the answer is yes.\n\nAssume that, for each integer i between 1 and N (inclusive), Vertex i and N+i have the weight i. Then, for each integer i between 1 and N, the bitwise XOR of the weights of the vertices on the path between Vertex i and N+i (including themselves) is i.\n\nConstraints\n\nN is an integer.\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\nIf there exists a tree satisfying the condition in the statement, print Yes; otherwise, print No.\nThen, if such a tree exists, print the 2N-1 edges of such a tree in the subsequent 2N-1 lines, in the following format:\n\na_{1} b_{1}\n\\vdots\na_{2N-1} b_{2N-1}\n\nHere each pair (a_i, b_i) means that there is an edge connecting Vertex a_i and b_i. The edges may be printed in any order.\n\nSample Input 1\n\n3\n\nSample Output 1\n\nYes\n1 2\n2 3\n3 4\n4 5\n5 6\n\nThe sample output represents the following graph:\n\nSample Input 2\n\n1\n\nSample Output 2\n\nNo\n\nThere is no tree satisfying the condition.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 312, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s651718635", "group_id": "codeNet:p02981", "input_text": "open Printf\nopen Scanf\n\nlet solve n a b = min (n * a) b\n\nlet () =\n  scanf \"%d %d %d \" solve |> printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1582406452, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s651718635.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s651718635", "user_id": "u388783188"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve n a b = min (n * a) b\n\nlet () =\n  scanf \"%d %d %d \" solve |> printf \"%d\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nN of us are going on a trip, by train or taxi.\n\nThe train will cost each of us A yen (the currency of Japan).\n\nThe taxi will cost us a total of B yen.\n\nHow much is our minimum total travel expense?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq A \\leq 50\n\n1 \\leq B \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint an integer representing the minimum total travel expense.\n\nSample Input 1\n\n4 2 9\n\nSample Output 1\n\n8\n\nThe train will cost us 4 \\times 2 = 8 yen, and the taxi will cost us 9 yen, so the minimum total travel expense is 8 yen.\n\nSample Input 2\n\n4 2 7\n\nSample Output 2\n\n7\n\nSample Input 3\n\n4 2 8\n\nSample Output 3\n\n8", "sample_input": "4 2 9\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02981", "source_text": "Score : 100 points\n\nProblem Statement\n\nN of us are going on a trip, by train or taxi.\n\nThe train will cost each of us A yen (the currency of Japan).\n\nThe taxi will cost us a total of B yen.\n\nHow much is our minimum total travel expense?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq A \\leq 50\n\n1 \\leq B \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint an integer representing the minimum total travel expense.\n\nSample Input 1\n\n4 2 9\n\nSample Output 1\n\n8\n\nThe train will cost us 4 \\times 2 = 8 yen, and the taxi will cost us 9 yen, so the minimum total travel expense is 8 yen.\n\nSample Input 2\n\n4 2 7\n\nSample Output 2\n\n7\n\nSample Input 3\n\n4 2 8\n\nSample Output 3\n\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 109, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s788106651", "group_id": "codeNet:p02981", "input_text": "let () =\n  Scanf.scanf \"%d %d %d\\n\" (fun n a b -> (n,a,b))\n  |> fun (n,a,b) -> min (a*n) b\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1562609349, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s788106651.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s788106651", "user_id": "u785230797"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d %d\\n\" (fun n a b -> (n,a,b))\n  |> fun (n,a,b) -> min (a*n) b\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nN of us are going on a trip, by train or taxi.\n\nThe train will cost each of us A yen (the currency of Japan).\n\nThe taxi will cost us a total of B yen.\n\nHow much is our minimum total travel expense?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq A \\leq 50\n\n1 \\leq B \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint an integer representing the minimum total travel expense.\n\nSample Input 1\n\n4 2 9\n\nSample Output 1\n\n8\n\nThe train will cost us 4 \\times 2 = 8 yen, and the taxi will cost us 9 yen, so the minimum total travel expense is 8 yen.\n\nSample Input 2\n\n4 2 7\n\nSample Output 2\n\n7\n\nSample Input 3\n\n4 2 8\n\nSample Output 3\n\n8", "sample_input": "4 2 9\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02981", "source_text": "Score : 100 points\n\nProblem Statement\n\nN of us are going on a trip, by train or taxi.\n\nThe train will cost each of us A yen (the currency of Japan).\n\nThe taxi will cost us a total of B yen.\n\nHow much is our minimum total travel expense?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq A \\leq 50\n\n1 \\leq B \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint an integer representing the minimum total travel expense.\n\nSample Input 1\n\n4 2 9\n\nSample Output 1\n\n8\n\nThe train will cost us 4 \\times 2 = 8 yen, and the taxi will cost us 9 yen, so the minimum total travel expense is 8 yen.\n\nSample Input 2\n\n4 2 7\n\nSample Output 2\n\n7\n\nSample Input 3\n\n4 2 8\n\nSample Output 3\n\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 116, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s263774404", "group_id": "codeNet:p02981", "input_text": "let n, a, b = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet _ = Printf.printf \"%d\\n\" @@ min b @@ n * a", "language": "OCaml", "metadata": {"date": 1562574782, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s263774404.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s263774404", "user_id": "u732304692"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "let n, a, b = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet _ = Printf.printf \"%d\\n\" @@ min b @@ n * a", "problem_context": "Score : 100 points\n\nProblem Statement\n\nN of us are going on a trip, by train or taxi.\n\nThe train will cost each of us A yen (the currency of Japan).\n\nThe taxi will cost us a total of B yen.\n\nHow much is our minimum total travel expense?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq A \\leq 50\n\n1 \\leq B \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint an integer representing the minimum total travel expense.\n\nSample Input 1\n\n4 2 9\n\nSample Output 1\n\n8\n\nThe train will cost us 4 \\times 2 = 8 yen, and the taxi will cost us 9 yen, so the minimum total travel expense is 8 yen.\n\nSample Input 2\n\n4 2 7\n\nSample Output 2\n\n7\n\nSample Input 3\n\n4 2 8\n\nSample Output 3\n\n8", "sample_input": "4 2 9\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02981", "source_text": "Score : 100 points\n\nProblem Statement\n\nN of us are going on a trip, by train or taxi.\n\nThe train will cost each of us A yen (the currency of Japan).\n\nThe taxi will cost us a total of B yen.\n\nHow much is our minimum total travel expense?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq A \\leq 50\n\n1 \\leq B \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint an integer representing the minimum total travel expense.\n\nSample Input 1\n\n4 2 9\n\nSample Output 1\n\n8\n\nThe train will cost us 4 \\times 2 = 8 yen, and the taxi will cost us 9 yen, so the minimum total travel expense is 8 yen.\n\nSample Input 2\n\n4 2 7\n\nSample Output 2\n\n7\n\nSample Input 3\n\n4 2 8\n\nSample Output 3\n\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 108, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s894133703", "group_id": "codeNet:p02981", "input_text": "let () = Scanf.scanf \"%d %d %d\" @@ fun n a b ->\n  Printf.printf \"%d\\n\" @@ min b (a * n)\n", "language": "OCaml", "metadata": {"date": 1562547692, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s894133703.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s894133703", "user_id": "u504158101"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" @@ fun n a b ->\n  Printf.printf \"%d\\n\" @@ min b (a * n)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nN of us are going on a trip, by train or taxi.\n\nThe train will cost each of us A yen (the currency of Japan).\n\nThe taxi will cost us a total of B yen.\n\nHow much is our minimum total travel expense?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq A \\leq 50\n\n1 \\leq B \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint an integer representing the minimum total travel expense.\n\nSample Input 1\n\n4 2 9\n\nSample Output 1\n\n8\n\nThe train will cost us 4 \\times 2 = 8 yen, and the taxi will cost us 9 yen, so the minimum total travel expense is 8 yen.\n\nSample Input 2\n\n4 2 7\n\nSample Output 2\n\n7\n\nSample Input 3\n\n4 2 8\n\nSample Output 3\n\n8", "sample_input": "4 2 9\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02981", "source_text": "Score : 100 points\n\nProblem Statement\n\nN of us are going on a trip, by train or taxi.\n\nThe train will cost each of us A yen (the currency of Japan).\n\nThe taxi will cost us a total of B yen.\n\nHow much is our minimum total travel expense?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq A \\leq 50\n\n1 \\leq B \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint an integer representing the minimum total travel expense.\n\nSample Input 1\n\n4 2 9\n\nSample Output 1\n\n8\n\nThe train will cost us 4 \\times 2 = 8 yen, and the taxi will cost us 9 yen, so the minimum total travel expense is 8 yen.\n\nSample Input 2\n\n4 2 7\n\nSample Output 2\n\n7\n\nSample Input 3\n\n4 2 8\n\nSample Output 3\n\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 88, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s459325544", "group_id": "codeNet:p02982", "input_text": "let () = Scanf.scanf \"%d %d %d\" @@ fun n a b -> Printf.printf \"%d\\n\" @@ min (n * a) b", "language": "OCaml", "metadata": {"date": 1597255549, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s459325544.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s459325544", "user_id": "u052332717"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" @@ fun n a b -> Printf.printf \"%d\\n\" @@ min (n * a) b", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N points in a D-dimensional space.\n\nThe coordinates of the i-th point are (X_{i1}, X_{i2}, ..., X_{iD}).\n\nThe distance between two points with coordinates (y_1, y_2, ..., y_D) and (z_1, z_2, ..., z_D) is \\sqrt{(y_1 - z_1)^2 + (y_2 - z_2)^2 + ... + (y_D - z_D)^2}.\n\nHow many pairs (i, j) (i < j) are there such that the distance between the i-th point and the j-th point is an integer?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10\n\n1 \\leq D \\leq 10\n\n-20 \\leq X_{ij} \\leq 20\n\nNo two given points have the same coordinates. That is, if i \\neq j, there exists k such that X_{ik} \\neq X_{jk}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_{11} X_{12} ... X_{1D}\nX_{21} X_{22} ... X_{2D}\n\\vdots\nX_{N1} X_{N2} ... X_{ND}\n\nOutput\n\nPrint the number of pairs (i, j) (i < j) such that the distance between the i-th point and the j-th point is an integer.\n\nSample Input 1\n\n3 2\n1 2\n5 5\n-2 8\n\nSample Output 1\n\n1\n\nThe number of pairs with an integer distance is one, as follows:\n\nThe distance between the first point and the second point is \\sqrt{|1-5|^2 + |2-5|^2} = 5, which is an integer.\n\nThe distance between the second point and the third point is \\sqrt{|5-(-2)|^2 + |5-8|^2} = \\sqrt{58}, which is not an integer.\n\nThe distance between the third point and the first point is \\sqrt{|-2-1|^2+|8-2|^2} = 3\\sqrt{5}, which is not an integer.\n\nSample Input 2\n\n3 4\n-3 7 8 2\n-12 1 10 2\n-2 8 9 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 1\n1\n2\n3\n4\n5\n\nSample Output 3\n\n10", "sample_input": "3 2\n1 2\n5 5\n-2 8\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02982", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N points in a D-dimensional space.\n\nThe coordinates of the i-th point are (X_{i1}, X_{i2}, ..., X_{iD}).\n\nThe distance between two points with coordinates (y_1, y_2, ..., y_D) and (z_1, z_2, ..., z_D) is \\sqrt{(y_1 - z_1)^2 + (y_2 - z_2)^2 + ... + (y_D - z_D)^2}.\n\nHow many pairs (i, j) (i < j) are there such that the distance between the i-th point and the j-th point is an integer?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10\n\n1 \\leq D \\leq 10\n\n-20 \\leq X_{ij} \\leq 20\n\nNo two given points have the same coordinates. That is, if i \\neq j, there exists k such that X_{ik} \\neq X_{jk}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_{11} X_{12} ... X_{1D}\nX_{21} X_{22} ... X_{2D}\n\\vdots\nX_{N1} X_{N2} ... X_{ND}\n\nOutput\n\nPrint the number of pairs (i, j) (i < j) such that the distance between the i-th point and the j-th point is an integer.\n\nSample Input 1\n\n3 2\n1 2\n5 5\n-2 8\n\nSample Output 1\n\n1\n\nThe number of pairs with an integer distance is one, as follows:\n\nThe distance between the first point and the second point is \\sqrt{|1-5|^2 + |2-5|^2} = 5, which is an integer.\n\nThe distance between the second point and the third point is \\sqrt{|5-(-2)|^2 + |5-8|^2} = \\sqrt{58}, which is not an integer.\n\nThe distance between the third point and the first point is \\sqrt{|-2-1|^2+|8-2|^2} = 3\\sqrt{5}, which is not an integer.\n\nSample Input 2\n\n3 4\n-3 7 8 2\n-12 1 10 2\n-2 8 9 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 1\n1\n2\n3\n4\n5\n\nSample Output 3\n\n10", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 85, "cpu_time_ms": 6, "memory_kb": 3828}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s996455658", "group_id": "codeNet:p02982", "input_text": "let ans, n, xss = Scanf.(scanf \"%d %d\" @@ fun n d -> ref 0, n, Array.(init n @@ fun _ -> init d @@ fun _ -> scanf \" %d\" (+) 0))\nlet rec f i n = if i * i >= n then i * i = n else f (i + 1) n\nlet g n = n * n\nlet _ = Array.(iteri (fun i xs -> for j = i + 1 to n - 1 do if f 1 @@ fold_left (+) 0 @@ mapi (fun k x -> g (x - xss.(j).(k))) xs then incr ans done) xss); Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1579599376, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s996455658.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s996455658", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let ans, n, xss = Scanf.(scanf \"%d %d\" @@ fun n d -> ref 0, n, Array.(init n @@ fun _ -> init d @@ fun _ -> scanf \" %d\" (+) 0))\nlet rec f i n = if i * i >= n then i * i = n else f (i + 1) n\nlet g n = n * n\nlet _ = Array.(iteri (fun i xs -> for j = i + 1 to n - 1 do if f 1 @@ fold_left (+) 0 @@ mapi (fun k x -> g (x - xss.(j).(k))) xs then incr ans done) xss); Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N points in a D-dimensional space.\n\nThe coordinates of the i-th point are (X_{i1}, X_{i2}, ..., X_{iD}).\n\nThe distance between two points with coordinates (y_1, y_2, ..., y_D) and (z_1, z_2, ..., z_D) is \\sqrt{(y_1 - z_1)^2 + (y_2 - z_2)^2 + ... + (y_D - z_D)^2}.\n\nHow many pairs (i, j) (i < j) are there such that the distance between the i-th point and the j-th point is an integer?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10\n\n1 \\leq D \\leq 10\n\n-20 \\leq X_{ij} \\leq 20\n\nNo two given points have the same coordinates. That is, if i \\neq j, there exists k such that X_{ik} \\neq X_{jk}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_{11} X_{12} ... X_{1D}\nX_{21} X_{22} ... X_{2D}\n\\vdots\nX_{N1} X_{N2} ... X_{ND}\n\nOutput\n\nPrint the number of pairs (i, j) (i < j) such that the distance between the i-th point and the j-th point is an integer.\n\nSample Input 1\n\n3 2\n1 2\n5 5\n-2 8\n\nSample Output 1\n\n1\n\nThe number of pairs with an integer distance is one, as follows:\n\nThe distance between the first point and the second point is \\sqrt{|1-5|^2 + |2-5|^2} = 5, which is an integer.\n\nThe distance between the second point and the third point is \\sqrt{|5-(-2)|^2 + |5-8|^2} = \\sqrt{58}, which is not an integer.\n\nThe distance between the third point and the first point is \\sqrt{|-2-1|^2+|8-2|^2} = 3\\sqrt{5}, which is not an integer.\n\nSample Input 2\n\n3 4\n-3 7 8 2\n-12 1 10 2\n-2 8 9 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 1\n1\n2\n3\n4\n5\n\nSample Output 3\n\n10", "sample_input": "3 2\n1 2\n5 5\n-2 8\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02982", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N points in a D-dimensional space.\n\nThe coordinates of the i-th point are (X_{i1}, X_{i2}, ..., X_{iD}).\n\nThe distance between two points with coordinates (y_1, y_2, ..., y_D) and (z_1, z_2, ..., z_D) is \\sqrt{(y_1 - z_1)^2 + (y_2 - z_2)^2 + ... + (y_D - z_D)^2}.\n\nHow many pairs (i, j) (i < j) are there such that the distance between the i-th point and the j-th point is an integer?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10\n\n1 \\leq D \\leq 10\n\n-20 \\leq X_{ij} \\leq 20\n\nNo two given points have the same coordinates. That is, if i \\neq j, there exists k such that X_{ik} \\neq X_{jk}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_{11} X_{12} ... X_{1D}\nX_{21} X_{22} ... X_{2D}\n\\vdots\nX_{N1} X_{N2} ... X_{ND}\n\nOutput\n\nPrint the number of pairs (i, j) (i < j) such that the distance between the i-th point and the j-th point is an integer.\n\nSample Input 1\n\n3 2\n1 2\n5 5\n-2 8\n\nSample Output 1\n\n1\n\nThe number of pairs with an integer distance is one, as follows:\n\nThe distance between the first point and the second point is \\sqrt{|1-5|^2 + |2-5|^2} = 5, which is an integer.\n\nThe distance between the second point and the third point is \\sqrt{|5-(-2)|^2 + |5-8|^2} = \\sqrt{58}, which is not an integer.\n\nThe distance between the third point and the first point is \\sqrt{|-2-1|^2+|8-2|^2} = 3\\sqrt{5}, which is not an integer.\n\nSample Input 2\n\n3 4\n-3 7 8 2\n-12 1 10 2\n-2 8 9 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 1\n1\n2\n3\n4\n5\n\nSample Output 3\n\n10", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 387, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s353486998", "group_id": "codeNet:p02982", "input_text": "let n, d = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet xss = Array.init n @@ fun _ -> Array.init d @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet g x = x * x\nlet f ys zs = Array.mapi (fun i y -> g @@ y - zs.(i)) ys |> Array.fold_left (+) 0\nlet h n = let rec f i = if i * i >= n then i * i = n else f (i + 1) in f 0\nlet ans = ref 0\nlet _ = Array.iteri (fun i xs -> for j = i + 1 to n - 1 do if h @@ f xs xss.(j) then incr ans done) xss; Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1565286425, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s353486998.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s353486998", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let n, d = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet xss = Array.init n @@ fun _ -> Array.init d @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet g x = x * x\nlet f ys zs = Array.mapi (fun i y -> g @@ y - zs.(i)) ys |> Array.fold_left (+) 0\nlet h n = let rec f i = if i * i >= n then i * i = n else f (i + 1) in f 0\nlet ans = ref 0\nlet _ = Array.iteri (fun i xs -> for j = i + 1 to n - 1 do if h @@ f xs xss.(j) then incr ans done) xss; Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N points in a D-dimensional space.\n\nThe coordinates of the i-th point are (X_{i1}, X_{i2}, ..., X_{iD}).\n\nThe distance between two points with coordinates (y_1, y_2, ..., y_D) and (z_1, z_2, ..., z_D) is \\sqrt{(y_1 - z_1)^2 + (y_2 - z_2)^2 + ... + (y_D - z_D)^2}.\n\nHow many pairs (i, j) (i < j) are there such that the distance between the i-th point and the j-th point is an integer?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10\n\n1 \\leq D \\leq 10\n\n-20 \\leq X_{ij} \\leq 20\n\nNo two given points have the same coordinates. That is, if i \\neq j, there exists k such that X_{ik} \\neq X_{jk}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_{11} X_{12} ... X_{1D}\nX_{21} X_{22} ... X_{2D}\n\\vdots\nX_{N1} X_{N2} ... X_{ND}\n\nOutput\n\nPrint the number of pairs (i, j) (i < j) such that the distance between the i-th point and the j-th point is an integer.\n\nSample Input 1\n\n3 2\n1 2\n5 5\n-2 8\n\nSample Output 1\n\n1\n\nThe number of pairs with an integer distance is one, as follows:\n\nThe distance between the first point and the second point is \\sqrt{|1-5|^2 + |2-5|^2} = 5, which is an integer.\n\nThe distance between the second point and the third point is \\sqrt{|5-(-2)|^2 + |5-8|^2} = \\sqrt{58}, which is not an integer.\n\nThe distance between the third point and the first point is \\sqrt{|-2-1|^2+|8-2|^2} = 3\\sqrt{5}, which is not an integer.\n\nSample Input 2\n\n3 4\n-3 7 8 2\n-12 1 10 2\n-2 8 9 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 1\n1\n2\n3\n4\n5\n\nSample Output 3\n\n10", "sample_input": "3 2\n1 2\n5 5\n-2 8\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02982", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N points in a D-dimensional space.\n\nThe coordinates of the i-th point are (X_{i1}, X_{i2}, ..., X_{iD}).\n\nThe distance between two points with coordinates (y_1, y_2, ..., y_D) and (z_1, z_2, ..., z_D) is \\sqrt{(y_1 - z_1)^2 + (y_2 - z_2)^2 + ... + (y_D - z_D)^2}.\n\nHow many pairs (i, j) (i < j) are there such that the distance between the i-th point and the j-th point is an integer?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10\n\n1 \\leq D \\leq 10\n\n-20 \\leq X_{ij} \\leq 20\n\nNo two given points have the same coordinates. That is, if i \\neq j, there exists k such that X_{ik} \\neq X_{jk}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_{11} X_{12} ... X_{1D}\nX_{21} X_{22} ... X_{2D}\n\\vdots\nX_{N1} X_{N2} ... X_{ND}\n\nOutput\n\nPrint the number of pairs (i, j) (i < j) such that the distance between the i-th point and the j-th point is an integer.\n\nSample Input 1\n\n3 2\n1 2\n5 5\n-2 8\n\nSample Output 1\n\n1\n\nThe number of pairs with an integer distance is one, as follows:\n\nThe distance between the first point and the second point is \\sqrt{|1-5|^2 + |2-5|^2} = 5, which is an integer.\n\nThe distance between the second point and the third point is \\sqrt{|5-(-2)|^2 + |5-8|^2} = \\sqrt{58}, which is not an integer.\n\nThe distance between the third point and the first point is \\sqrt{|-2-1|^2+|8-2|^2} = 3\\sqrt{5}, which is not an integer.\n\nSample Input 2\n\n3 4\n-3 7 8 2\n-12 1 10 2\n-2 8 9 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 1\n1\n2\n3\n4\n5\n\nSample Output 3\n\n10", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 454, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s674069300", "group_id": "codeNet:p02982", "input_text": "let n, d = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet xss = Array.init n @@ fun _ -> Array.init d @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet g x = x * x\nlet f ys zs = Array.fold_left (+) 0 @@ Array.init d @@ fun i -> g @@ ys.(i) - zs.(i)\nlet ans = ref 0\nlet _ =\n  for i = 0 to n - 1 do\n    for j = i + 1 to n - 1 do\n      let x = ref 0 in\n      let b = f xss.(i) xss.(j) in\n      while !x * !x < b do incr x done;\n      if !x * !x = b then incr ans done done;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1562576822, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s674069300.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s674069300", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let n, d = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet xss = Array.init n @@ fun _ -> Array.init d @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet g x = x * x\nlet f ys zs = Array.fold_left (+) 0 @@ Array.init d @@ fun i -> g @@ ys.(i) - zs.(i)\nlet ans = ref 0\nlet _ =\n  for i = 0 to n - 1 do\n    for j = i + 1 to n - 1 do\n      let x = ref 0 in\n      let b = f xss.(i) xss.(j) in\n      while !x * !x < b do incr x done;\n      if !x * !x = b then incr ans done done;\n  Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N points in a D-dimensional space.\n\nThe coordinates of the i-th point are (X_{i1}, X_{i2}, ..., X_{iD}).\n\nThe distance between two points with coordinates (y_1, y_2, ..., y_D) and (z_1, z_2, ..., z_D) is \\sqrt{(y_1 - z_1)^2 + (y_2 - z_2)^2 + ... + (y_D - z_D)^2}.\n\nHow many pairs (i, j) (i < j) are there such that the distance between the i-th point and the j-th point is an integer?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10\n\n1 \\leq D \\leq 10\n\n-20 \\leq X_{ij} \\leq 20\n\nNo two given points have the same coordinates. That is, if i \\neq j, there exists k such that X_{ik} \\neq X_{jk}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_{11} X_{12} ... X_{1D}\nX_{21} X_{22} ... X_{2D}\n\\vdots\nX_{N1} X_{N2} ... X_{ND}\n\nOutput\n\nPrint the number of pairs (i, j) (i < j) such that the distance between the i-th point and the j-th point is an integer.\n\nSample Input 1\n\n3 2\n1 2\n5 5\n-2 8\n\nSample Output 1\n\n1\n\nThe number of pairs with an integer distance is one, as follows:\n\nThe distance between the first point and the second point is \\sqrt{|1-5|^2 + |2-5|^2} = 5, which is an integer.\n\nThe distance between the second point and the third point is \\sqrt{|5-(-2)|^2 + |5-8|^2} = \\sqrt{58}, which is not an integer.\n\nThe distance between the third point and the first point is \\sqrt{|-2-1|^2+|8-2|^2} = 3\\sqrt{5}, which is not an integer.\n\nSample Input 2\n\n3 4\n-3 7 8 2\n-12 1 10 2\n-2 8 9 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 1\n1\n2\n3\n4\n5\n\nSample Output 3\n\n10", "sample_input": "3 2\n1 2\n5 5\n-2 8\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02982", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N points in a D-dimensional space.\n\nThe coordinates of the i-th point are (X_{i1}, X_{i2}, ..., X_{iD}).\n\nThe distance between two points with coordinates (y_1, y_2, ..., y_D) and (z_1, z_2, ..., z_D) is \\sqrt{(y_1 - z_1)^2 + (y_2 - z_2)^2 + ... + (y_D - z_D)^2}.\n\nHow many pairs (i, j) (i < j) are there such that the distance between the i-th point and the j-th point is an integer?\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10\n\n1 \\leq D \\leq 10\n\n-20 \\leq X_{ij} \\leq 20\n\nNo two given points have the same coordinates. That is, if i \\neq j, there exists k such that X_{ik} \\neq X_{jk}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN D\nX_{11} X_{12} ... X_{1D}\nX_{21} X_{22} ... X_{2D}\n\\vdots\nX_{N1} X_{N2} ... X_{ND}\n\nOutput\n\nPrint the number of pairs (i, j) (i < j) such that the distance between the i-th point and the j-th point is an integer.\n\nSample Input 1\n\n3 2\n1 2\n5 5\n-2 8\n\nSample Output 1\n\n1\n\nThe number of pairs with an integer distance is one, as follows:\n\nThe distance between the first point and the second point is \\sqrt{|1-5|^2 + |2-5|^2} = 5, which is an integer.\n\nThe distance between the second point and the third point is \\sqrt{|5-(-2)|^2 + |5-8|^2} = \\sqrt{58}, which is not an integer.\n\nThe distance between the third point and the first point is \\sqrt{|-2-1|^2+|8-2|^2} = 3\\sqrt{5}, which is not an integer.\n\nSample Input 2\n\n3 4\n-3 7 8 2\n-12 1 10 2\n-2 8 9 3\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 1\n1\n2\n3\n4\n5\n\nSample Output 3\n\n10", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s228577783", "group_id": "codeNet:p02986", "input_text": "module IntMap = Map.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n q ->\n  let es = Array.make n [] in\n  for i = 0 to n - 2 do\n    Scanf.scanf \"%d %d %d %d\\n\" @@ fun a b c d ->\n      es.(a - 1) <- (b - 1, c, d) :: es.(a - 1);\n      es.(b - 1) <- (a - 1, c, d) :: es.(b - 1)\n  done;\n  let dist = Array.make n (-1) in\n  let depth = Array.make n 0 in\n  let count_colors = Array.make n IntMap.empty in\n  let acc_colors = Array.make n IntMap.empty in\n  let parent = Array.make_matrix 17 n 0 in\n  let rec visit c cd d dp u v =\n    if 0 <= dist.(v) then ()\n    else begin\n      dist.(v) <- d;\n      depth.(v) <- dp;\n      parent.(0).(v) <- u;\n      acc_colors.(v) <- cd;\n      count_colors.(v) <- c;\n      List.iter (fun (u, c', d') ->\n        visit\n          (IntMap.add c'\n            (1 +\n              try IntMap.find c' c\n              with Not_found -> 0) c)\n          (IntMap.add c'\n            (d' +\n              try IntMap.find c' cd\n              with Not_found -> 0) cd)\n          (d + d') (1 + dp) v u) es.(v)\n    end in\n  visit IntMap.empty IntMap.empty 0 0 0 0;\n  for i = 1 to 16 do\n    for v = 0 to n - 1 do\n      parent.(i).(v) <- parent.(i - 1).(parent.(i - 1).(v))\n    done\n  done;\n  let rec up d v i =\n    if i < 0 then v\n    else up d (if d land (1 lsl i) = 0 then v else parent.(i).(v)) (i - 1) in\n  let up d v = up d v 16 in\n  let rec lca u v = function\n    | 0 ->\n        if parent.(0).(u) = parent.(0).(v)\n        then parent.(0).(u)\n        else parent.(1).(u)\n    | i ->\n        ( if parent.(i).(u) = parent.(i).(v)\n          then lca u v\n          else lca (parent.(i).(u)) (parent.(i).(u)) ) (i - 1) in\n  let lca u v =\n    if u = v then u\n    else\n      lca\n        (if depth.(u) <= depth.(v) then u else up (depth.(u) - depth.(v)) u)\n        (if depth.(v) <= depth.(u) then v else up (depth.(v) - depth.(u)) v) 16 in\n  for i = 0 to q - 1 do\n    Scanf.scanf \"%d %d %d %d\\n\" @@ fun x y u v ->\n      let w = lca (u - 1) (v - 1) in\n      Printf.printf \"%d\\n\" @@\n      (dist.(u - 1) - (try IntMap.find x acc_colors.(u - 1) with Not_found -> 0) + y * (try IntMap.find x count_colors.(u - 1) with Not_found -> 0))\n      + (dist.(v - 1) - (try IntMap.find x acc_colors.(v - 1) with Not_found -> 0) + y * (try IntMap.find x count_colors.(v - 1) with Not_found -> 0))\n      - 2 * (dist.(w) - (try IntMap.find x acc_colors.(w) with Not_found -> 0) + y * (try IntMap.find x count_colors.(w) with Not_found -> 0))\n  done\n\n", "language": "OCaml", "metadata": {"date": 1562555423, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02986.html", "problem_id": "p02986", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02986/input.txt", "sample_output_relpath": "derived/input_output/data/p02986/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02986/OCaml/s228577783.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s228577783", "user_id": "u504158101"}, "prompt_components": {"gold_output": "130\n200\n60\n", "input_to_evaluate": "module IntMap = Map.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n q ->\n  let es = Array.make n [] in\n  for i = 0 to n - 2 do\n    Scanf.scanf \"%d %d %d %d\\n\" @@ fun a b c d ->\n      es.(a - 1) <- (b - 1, c, d) :: es.(a - 1);\n      es.(b - 1) <- (a - 1, c, d) :: es.(b - 1)\n  done;\n  let dist = Array.make n (-1) in\n  let depth = Array.make n 0 in\n  let count_colors = Array.make n IntMap.empty in\n  let acc_colors = Array.make n IntMap.empty in\n  let parent = Array.make_matrix 17 n 0 in\n  let rec visit c cd d dp u v =\n    if 0 <= dist.(v) then ()\n    else begin\n      dist.(v) <- d;\n      depth.(v) <- dp;\n      parent.(0).(v) <- u;\n      acc_colors.(v) <- cd;\n      count_colors.(v) <- c;\n      List.iter (fun (u, c', d') ->\n        visit\n          (IntMap.add c'\n            (1 +\n              try IntMap.find c' c\n              with Not_found -> 0) c)\n          (IntMap.add c'\n            (d' +\n              try IntMap.find c' cd\n              with Not_found -> 0) cd)\n          (d + d') (1 + dp) v u) es.(v)\n    end in\n  visit IntMap.empty IntMap.empty 0 0 0 0;\n  for i = 1 to 16 do\n    for v = 0 to n - 1 do\n      parent.(i).(v) <- parent.(i - 1).(parent.(i - 1).(v))\n    done\n  done;\n  let rec up d v i =\n    if i < 0 then v\n    else up d (if d land (1 lsl i) = 0 then v else parent.(i).(v)) (i - 1) in\n  let up d v = up d v 16 in\n  let rec lca u v = function\n    | 0 ->\n        if parent.(0).(u) = parent.(0).(v)\n        then parent.(0).(u)\n        else parent.(1).(u)\n    | i ->\n        ( if parent.(i).(u) = parent.(i).(v)\n          then lca u v\n          else lca (parent.(i).(u)) (parent.(i).(u)) ) (i - 1) in\n  let lca u v =\n    if u = v then u\n    else\n      lca\n        (if depth.(u) <= depth.(v) then u else up (depth.(u) - depth.(v)) u)\n        (if depth.(v) <= depth.(u) then v else up (depth.(v) - depth.(u)) v) 16 in\n  for i = 0 to q - 1 do\n    Scanf.scanf \"%d %d %d %d\\n\" @@ fun x y u v ->\n      let w = lca (u - 1) (v - 1) in\n      Printf.printf \"%d\\n\" @@\n      (dist.(u - 1) - (try IntMap.find x acc_colors.(u - 1) with Not_found -> 0) + y * (try IntMap.find x count_colors.(u - 1) with Not_found -> 0))\n      + (dist.(v - 1) - (try IntMap.find x acc_colors.(v - 1) with Not_found -> 0) + y * (try IntMap.find x count_colors.(v - 1) with Not_found -> 0))\n      - 2 * (dist.(w) - (try IntMap.find x acc_colors.(w) with Not_found -> 0) + y * (try IntMap.find x count_colors.(w) with Not_found -> 0))\n  done\n\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere is a tree with N vertices numbered 1 to N.\nThe i-th edge in this tree connects Vertex a_i and Vertex b_i, and the color and length of that edge are c_i and d_i, respectively.\nHere the color of each edge is represented by an integer between 1 and N-1 (inclusive). The same integer corresponds to the same color, and different integers correspond to different colors.\n\nAnswer the following Q queries:\n\nQuery j (1 \\leq j \\leq Q): assuming that the length of every edge whose color is x_j is changed to y_j, find the distance between Vertex u_j and Vertex v_j. (The changes of the lengths of edges do not affect the subsequent queries.)\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq a_i, b_i \\leq N\n\n1 \\leq c_i \\leq N-1\n\n1 \\leq d_i \\leq 10^4\n\n1 \\leq x_j \\leq N-1\n\n1 \\leq y_j \\leq 10^4\n\n1 \\leq u_j < v_j \\leq N\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1 c_1 d_1\n:\na_{N-1} b_{N-1} c_{N-1} d_{N-1}\nx_1 y_1 u_1 v_1\n:\nx_Q y_Q u_Q v_Q\n\nOutput\n\nPrint Q lines. The j-th line (1 \\leq j \\leq Q) should contain the answer to Query j.\n\nSample Input 1\n\n5 3\n1 2 1 10\n1 3 2 20\n2 4 4 30\n5 2 1 40\n1 100 1 4\n1 100 1 5\n3 1000 3 4\n\nSample Output 1\n\n130\n200\n60\n\nThe graph in this input is as follows:\n\nHere the edges of Color 1 are shown as solid red lines, the edge of Color 2 is shown as a bold green line, and the edge of Color 4 is shown as a blue dashed line.\n\nQuery 1: Assuming that the length of every edge whose color is 1 is changed to 100, the distance between Vertex 1 and Vertex 4 is 100 + 30 = 130.\n\nQuery 2: Assuming that the length of every edge whose color is 1 is changed to 100, the distance between Vertex 1 and Vertex 5 is 100 + 100 = 200.\n\nQuery 3: Assuming that the length of every edge whose color is 3 is changed to 1000 (there is no such edge), the distance between Vertex 3 and Vertex 4 is 20 + 10 + 30 = 60. Note that the edges of Color 1 now have their original lengths.", "sample_input": "5 3\n1 2 1 10\n1 3 2 20\n2 4 4 30\n5 2 1 40\n1 100 1 4\n1 100 1 5\n3 1000 3 4\n"}, "reference_outputs": ["130\n200\n60\n"], "source_document_id": "p02986", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere is a tree with N vertices numbered 1 to N.\nThe i-th edge in this tree connects Vertex a_i and Vertex b_i, and the color and length of that edge are c_i and d_i, respectively.\nHere the color of each edge is represented by an integer between 1 and N-1 (inclusive). The same integer corresponds to the same color, and different integers correspond to different colors.\n\nAnswer the following Q queries:\n\nQuery j (1 \\leq j \\leq Q): assuming that the length of every edge whose color is x_j is changed to y_j, find the distance between Vertex u_j and Vertex v_j. (The changes of the lengths of edges do not affect the subsequent queries.)\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq a_i, b_i \\leq N\n\n1 \\leq c_i \\leq N-1\n\n1 \\leq d_i \\leq 10^4\n\n1 \\leq x_j \\leq N-1\n\n1 \\leq y_j \\leq 10^4\n\n1 \\leq u_j < v_j \\leq N\n\nThe given graph is a tree.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\na_1 b_1 c_1 d_1\n:\na_{N-1} b_{N-1} c_{N-1} d_{N-1}\nx_1 y_1 u_1 v_1\n:\nx_Q y_Q u_Q v_Q\n\nOutput\n\nPrint Q lines. The j-th line (1 \\leq j \\leq Q) should contain the answer to Query j.\n\nSample Input 1\n\n5 3\n1 2 1 10\n1 3 2 20\n2 4 4 30\n5 2 1 40\n1 100 1 4\n1 100 1 5\n3 1000 3 4\n\nSample Output 1\n\n130\n200\n60\n\nThe graph in this input is as follows:\n\nHere the edges of Color 1 are shown as solid red lines, the edge of Color 2 is shown as a bold green line, and the edge of Color 4 is shown as a blue dashed line.\n\nQuery 1: Assuming that the length of every edge whose color is 1 is changed to 100, the distance between Vertex 1 and Vertex 4 is 100 + 30 = 130.\n\nQuery 2: Assuming that the length of every edge whose color is 1 is changed to 100, the distance between Vertex 1 and Vertex 5 is 100 + 100 = 200.\n\nQuery 3: Assuming that the length of every edge whose color is 3 is changed to 1000 (there is no such edge), the distance between Vertex 3 and Vertex 4 is 20 + 10 + 30 = 60. Note that the edges of Color 1 now have their original lengths.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2482, "cpu_time_ms": 1129, "memory_kb": 118008}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s132326620", "group_id": "codeNet:p02987", "input_text": "let fifty s =\n  if s.[0] = s.[1] && s.[2] = s.[3] && s.[0] <> s.[2] then \"Yes\"\n  else if s.[0] = s.[2] && s.[1] = s.[3] && s.[0] <> s.[1] then \"Yes\"\n  else if s.[0] = s.[3] && s.[1] = s.[2] && s.[0] <> s.[1] then \"Yes\"\n  else \"No\"\n\nlet () = Printf.printf \"%s\\n\" (fifty (read_line ()))\n", "language": "OCaml", "metadata": {"date": 1595783743, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s132326620.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s132326620", "user_id": "u272377260"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let fifty s =\n  if s.[0] = s.[1] && s.[2] = s.[3] && s.[0] <> s.[2] then \"Yes\"\n  else if s.[0] = s.[2] && s.[1] = s.[3] && s.[0] <> s.[1] then \"Yes\"\n  else if s.[0] = s.[3] && s.[1] = s.[2] && s.[0] <> s.[1] then \"Yes\"\n  else \"No\"\n\nlet () = Printf.printf \"%s\\n\" (fifty (read_line ()))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "sample_input": "ASSA\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02987", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 285, "cpu_time_ms": 9, "memory_kb": 3532}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s131346189", "group_id": "codeNet:p02987", "input_text": "let s = Scanf.scanf \" %c%c%c%c\" @@ fun a b c d -> [|a; b; c; d|]\nlet _ =\n  Array.sort compare s;\n  print_endline @@ if s.(0) = s.(1) && s.(2) = s.(3) && s.(1) <> s.(2) then \"Yes\" else \"No\"", "language": "OCaml", "metadata": {"date": 1561885117, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s131346189.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s131346189", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let s = Scanf.scanf \" %c%c%c%c\" @@ fun a b c d -> [|a; b; c; d|]\nlet _ =\n  Array.sort compare s;\n  print_endline @@ if s.(0) = s.(1) && s.(2) = s.(3) && s.(1) <> s.(2) then \"Yes\" else \"No\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "sample_input": "ASSA\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02987", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a 4-character string S consisting of uppercase English letters.\nDetermine if S consists of exactly two kinds of characters which both appear twice in S.\n\nConstraints\n\nThe length of S is 4.\n\nS consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.\n\nSample Input 1\n\nASSA\n\nSample Output 1\n\nYes\n\nS consists of A and S which both appear twice in S.\n\nSample Input 2\n\nSTOP\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nFFEE\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nFREE\n\nSample Output 4\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 188, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s437741976", "group_id": "codeNet:p02988", "input_text": "let () = Scanf.scanf \"%d\" @@ fun n ->\n  let ps = Array.init n @@ fun _ -> Scanf.scanf \" %d\" Fun.id in\n  let ids = Array.init (n - 2) @@ fun i -> i + 1 in\n  let check acm id = if (ps.(id - 1) < ps.(id) && ps.(id) < ps.(id + 1)) || (ps.(id - 1) > ps.(id) && ps.(id) > ps.(id + 1)) \n                      then acm + 1 else acm in\n  let ans = Array.fold_left check 0 ids in\n  Printf.printf \"%d\\n\" ans", "language": "OCaml", "metadata": {"date": 1597336621, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s437741976.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s437741976", "user_id": "u052332717"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\" @@ fun n ->\n  let ps = Array.init n @@ fun _ -> Scanf.scanf \" %d\" Fun.id in\n  let ids = Array.init (n - 2) @@ fun i -> i + 1 in\n  let check acm id = if (ps.(id - 1) < ps.(id) && ps.(id) < ps.(id + 1)) || (ps.(id - 1) > ps.(id) && ps.(id) > ps.(id + 1)) \n                      then acm + 1 else acm in\n  let ans = Array.fold_left check 0 ids in\n  Printf.printf \"%d\\n\" ans", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a permutation p = {p_1,\\ p_2,\\ ...,\\ p_n} of {1,\\ 2,\\ ...,\\ n}.\n\nPrint the number of elements p_i (1 < i < n) that satisfy the following condition:\n\np_i is the second smallest number among the three numbers p_{i - 1}, p_i, and p_{i + 1}.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq n \\leq 20\n\np is a permutation of {1,\\ 2,\\ ...,\\ n}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\np_1 p_2 ... p_n\n\nOutput\n\nPrint the number of elements p_i (1 < i < n) that satisfy the condition.\n\nSample Input 1\n\n5\n1 3 5 4 2\n\nSample Output 1\n\n2\n\np_2 = 3 is the second smallest number among p_1 = 1, p_2 = 3, and p_3 = 5. Also, p_4 = 4 is the second smallest number among p_3 = 5, p_4 = 4, and p_5 = 2. These two elements satisfy the condition.\n\nSample Input 2\n\n9\n9 6 3 2 5 8 7 4 1\n\nSample Output 2\n\n5", "sample_input": "5\n1 3 5 4 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02988", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a permutation p = {p_1,\\ p_2,\\ ...,\\ p_n} of {1,\\ 2,\\ ...,\\ n}.\n\nPrint the number of elements p_i (1 < i < n) that satisfy the following condition:\n\np_i is the second smallest number among the three numbers p_{i - 1}, p_i, and p_{i + 1}.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq n \\leq 20\n\np is a permutation of {1,\\ 2,\\ ...,\\ n}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\np_1 p_2 ... p_n\n\nOutput\n\nPrint the number of elements p_i (1 < i < n) that satisfy the condition.\n\nSample Input 1\n\n5\n1 3 5 4 2\n\nSample Output 1\n\n2\n\np_2 = 3 is the second smallest number among p_1 = 1, p_2 = 3, and p_3 = 5. Also, p_4 = 4 is the second smallest number among p_3 = 5, p_4 = 4, and p_5 = 2. These two elements satisfy the condition.\n\nSample Input 2\n\n9\n9 6 3 2 5 8 7 4 1\n\nSample Output 2\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 396, "cpu_time_ms": 8, "memory_kb": 3820}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s868924201", "group_id": "codeNet:p02988", "input_text": "let n = Scanf.scanf \" %d\" @@ (+) 0\nlet ps = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet ans = ref 0\nlet _ =\n  for i = 0 to n - 3 do\n    if (ps.(i) < ps.(i + 1) && ps.(i + 1) < ps.(i + 2)) || (ps.(i + 2) < ps.(i + 1) && ps.(i + 1) < ps.(i)) then incr ans done;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1561857943, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s868924201.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s868924201", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let n = Scanf.scanf \" %d\" @@ (+) 0\nlet ps = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet ans = ref 0\nlet _ =\n  for i = 0 to n - 3 do\n    if (ps.(i) < ps.(i + 1) && ps.(i + 1) < ps.(i + 2)) || (ps.(i + 2) < ps.(i + 1) && ps.(i + 1) < ps.(i)) then incr ans done;\n  Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a permutation p = {p_1,\\ p_2,\\ ...,\\ p_n} of {1,\\ 2,\\ ...,\\ n}.\n\nPrint the number of elements p_i (1 < i < n) that satisfy the following condition:\n\np_i is the second smallest number among the three numbers p_{i - 1}, p_i, and p_{i + 1}.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq n \\leq 20\n\np is a permutation of {1,\\ 2,\\ ...,\\ n}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\np_1 p_2 ... p_n\n\nOutput\n\nPrint the number of elements p_i (1 < i < n) that satisfy the condition.\n\nSample Input 1\n\n5\n1 3 5 4 2\n\nSample Output 1\n\n2\n\np_2 = 3 is the second smallest number among p_1 = 1, p_2 = 3, and p_3 = 5. Also, p_4 = 4 is the second smallest number among p_3 = 5, p_4 = 4, and p_5 = 2. These two elements satisfy the condition.\n\nSample Input 2\n\n9\n9 6 3 2 5 8 7 4 1\n\nSample Output 2\n\n5", "sample_input": "5\n1 3 5 4 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02988", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a permutation p = {p_1,\\ p_2,\\ ...,\\ p_n} of {1,\\ 2,\\ ...,\\ n}.\n\nPrint the number of elements p_i (1 < i < n) that satisfy the following condition:\n\np_i is the second smallest number among the three numbers p_{i - 1}, p_i, and p_{i + 1}.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq n \\leq 20\n\np is a permutation of {1,\\ 2,\\ ...,\\ n}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\np_1 p_2 ... p_n\n\nOutput\n\nPrint the number of elements p_i (1 < i < n) that satisfy the condition.\n\nSample Input 1\n\n5\n1 3 5 4 2\n\nSample Output 1\n\n2\n\np_2 = 3 is the second smallest number among p_1 = 1, p_2 = 3, and p_3 = 5. Also, p_4 = 4 is the second smallest number among p_3 = 5, p_4 = 4, and p_5 = 2. These two elements satisfy the condition.\n\nSample Input 2\n\n9\n9 6 3 2 5 8 7 4 1\n\nSample Output 2\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 299, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s861181373", "group_id": "codeNet:p02990", "input_text": "let n, k = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet memo = Array.make_matrix 3000 3000 @@ -1\nlet rec comb n k =\n  if memo.(n).(k) > -1 then memo.(n).(k)\n  else\n    (memo.(n).(k) <- if n < k then 0 else if n = k then 1 else if k = 0 then 1\n      else (comb (n - 1) (k - 1) + comb (n - 1) k) mod 1_000_000_007;\n    memo.(n).(k))\nlet _ =\n  for i = 1 to k do\n    Printf.printf \"%d\\n\" @@\n      if n - k = i - 1 then 1\n      else if n - k < i - 1 then 0\n      else comb (k - 1) (i - 1) * comb (n - k + 1) i mod 1_000_000_007 done", "language": "OCaml", "metadata": {"date": 1561865196, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s861181373.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s861181373", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3\n6\n1\n", "input_to_evaluate": "let n, k = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet memo = Array.make_matrix 3000 3000 @@ -1\nlet rec comb n k =\n  if memo.(n).(k) > -1 then memo.(n).(k)\n  else\n    (memo.(n).(k) <- if n < k then 0 else if n = k then 1 else if k = 0 then 1\n      else (comb (n - 1) (k - 1) + comb (n - 1) k) mod 1_000_000_007;\n    memo.(n).(k))\nlet _ =\n  for i = 1 to k do\n    Printf.printf \"%d\\n\" @@\n      if n - k = i - 1 then 1\n      else if n - k < i - 1 then 0\n      else comb (k - 1) (i - 1) * comb (n - k + 1) i mod 1_000_000_007 done", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 92, "memory_kb": 73592}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s862988895", "group_id": "codeNet:p02991", "input_text": "module S = Set.Make (struct type t = int let compare = compare end)\n\nlet () =\n    let main () =\n        let n, m = Scanf.sscanf (read_line ()) \"%d %d\" (fun n m -> n, m) in\n        let uv = Array.init m (fun _ -> Scanf.sscanf (read_line ()) \"%d %d\" (fun u v -> u, v)) in\n        let s, t = Scanf.sscanf (read_line ()) \"%d %d\" (fun s t -> s, t) in\n        let u = Array.make (n + 1) S.empty in\n        Array.iter (fun (uu, vv) -> u.(uu) <- S.add vv u.(uu)) uv;\n        let v = Array.make (n + 1) S.empty in\n        for i = 1 to n do\n            let set = S.fold (fun k s2 -> S.union u.(k) s2) u.(i) S.empty in\n            v.(i) <-  S.fold (fun k s2 -> S.union u.(k) s2) set   S.empty\n        done;\n        let visited = Array.make (n + 1) (-1) in\n        visited.(s) <- 0;\n        let rec loop step frontier =\n            if S.cardinal frontier = 0 then (-1) else\n                let frontier =\n                    S.fold (fun e next_frontier ->\n                        S.fold (fun f next_frontier ->\n                            if visited.(f) >= 0 then next_frontier else (\n                                visited.(f) <- step;\n                                S.add f next_frontier\n                            )\n                        ) v.(e) next_frontier\n                    ) frontier S.empty\n                in\n                if visited.(t) >= 0 then visited.(t) else loop (step + 1) frontier\n        in\n        let result = loop 1 (S.singleton s) in\n        Printf.printf \"%d\\n\" result\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1561960001, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s862988895.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s862988895", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "module S = Set.Make (struct type t = int let compare = compare end)\n\nlet () =\n    let main () =\n        let n, m = Scanf.sscanf (read_line ()) \"%d %d\" (fun n m -> n, m) in\n        let uv = Array.init m (fun _ -> Scanf.sscanf (read_line ()) \"%d %d\" (fun u v -> u, v)) in\n        let s, t = Scanf.sscanf (read_line ()) \"%d %d\" (fun s t -> s, t) in\n        let u = Array.make (n + 1) S.empty in\n        Array.iter (fun (uu, vv) -> u.(uu) <- S.add vv u.(uu)) uv;\n        let v = Array.make (n + 1) S.empty in\n        for i = 1 to n do\n            let set = S.fold (fun k s2 -> S.union u.(k) s2) u.(i) S.empty in\n            v.(i) <-  S.fold (fun k s2 -> S.union u.(k) s2) set   S.empty\n        done;\n        let visited = Array.make (n + 1) (-1) in\n        visited.(s) <- 0;\n        let rec loop step frontier =\n            if S.cardinal frontier = 0 then (-1) else\n                let frontier =\n                    S.fold (fun e next_frontier ->\n                        S.fold (fun f next_frontier ->\n                            if visited.(f) >= 0 then next_frontier else (\n                                visited.(f) <- step;\n                                S.add f next_frontier\n                            )\n                        ) v.(e) next_frontier\n                    ) frontier S.empty\n                in\n                if visited.(t) >= 0 then visited.(t) else loop (step + 1) frontier\n        in\n        let result = loop 1 (S.singleton s) in\n        Printf.printf \"%d\\n\" result\n    in\n    main ()", "problem_context": "Score : 500 points\n\nProblem Statement\n\nKen loves ken-ken-pa (Japanese version of hopscotch). Today, he will play it on a directed graph G.\nG consists of N vertices numbered 1 to N, and M edges. The i-th edge points from Vertex u_i to Vertex v_i.\n\nFirst, Ken stands on Vertex S. He wants to reach Vertex T by repeating ken-ken-pa. In one ken-ken-pa, he does the following exactly three times: follow an edge pointing from the vertex on which he is standing.\n\nDetermine if he can reach Vertex T by repeating ken-ken-pa. If the answer is yes, find the minimum number of ken-ken-pa needed to reach Vertex T. Note that visiting Vertex T in the middle of a ken-ken-pa does not count as reaching Vertex T by repeating ken-ken-pa.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq \\min(10^5, N (N-1))\n\n1 \\leq u_i, v_i \\leq N(1 \\leq i \\leq M)\n\nu_i \\neq v_i (1 \\leq i \\leq M)\n\nIf i \\neq j, (u_i, v_i) \\neq (u_j, v_j).\n\n1 \\leq S, T \\leq N\n\nS \\neq T\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nu_1 v_1\n:\nu_M v_M\nS T\n\nOutput\n\nIf Ken cannot reach Vertex T from Vertex S by repeating ken-ken-pa, print -1.\nIf he can, print the minimum number of ken-ken-pa needed to reach vertex T.\n\nSample Input 1\n\n4 4\n1 2\n2 3\n3 4\n4 1\n1 3\n\nSample Output 1\n\n2\n\nKen can reach Vertex 3 from Vertex 1 in two ken-ken-pa, as follows: 1 \\rightarrow 2 \\rightarrow 3 \\rightarrow 4 in the first ken-ken-pa, then 4 \\rightarrow 1 \\rightarrow 2 \\rightarrow 3 in the second ken-ken-pa. This is the minimum number of ken-ken-pa needed.\n\nSample Input 2\n\n3 3\n1 2\n2 3\n3 1\n1 2\n\nSample Output 2\n\n-1\n\nAny number of ken-ken-pa will bring Ken back to Vertex 1, so he cannot reach Vertex 2, though he can pass through it in the middle of a ken-ken-pa.\n\nSample Input 3\n\n2 0\n1 2\n\nSample Output 3\n\n-1\n\nVertex S and Vertex T may be disconnected.\n\nSample Input 4\n\n6 8\n1 2\n2 3\n3 4\n4 5\n5 1\n1 4\n1 5\n4 6\n1 6\n\nSample Output 4\n\n2", "sample_input": "4 4\n1 2\n2 3\n3 4\n4 1\n1 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02991", "source_text": "Score : 500 points\n\nProblem Statement\n\nKen loves ken-ken-pa (Japanese version of hopscotch). Today, he will play it on a directed graph G.\nG consists of N vertices numbered 1 to N, and M edges. The i-th edge points from Vertex u_i to Vertex v_i.\n\nFirst, Ken stands on Vertex S. He wants to reach Vertex T by repeating ken-ken-pa. In one ken-ken-pa, he does the following exactly three times: follow an edge pointing from the vertex on which he is standing.\n\nDetermine if he can reach Vertex T by repeating ken-ken-pa. If the answer is yes, find the minimum number of ken-ken-pa needed to reach Vertex T. Note that visiting Vertex T in the middle of a ken-ken-pa does not count as reaching Vertex T by repeating ken-ken-pa.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq \\min(10^5, N (N-1))\n\n1 \\leq u_i, v_i \\leq N(1 \\leq i \\leq M)\n\nu_i \\neq v_i (1 \\leq i \\leq M)\n\nIf i \\neq j, (u_i, v_i) \\neq (u_j, v_j).\n\n1 \\leq S, T \\leq N\n\nS \\neq T\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nu_1 v_1\n:\nu_M v_M\nS T\n\nOutput\n\nIf Ken cannot reach Vertex T from Vertex S by repeating ken-ken-pa, print -1.\nIf he can, print the minimum number of ken-ken-pa needed to reach vertex T.\n\nSample Input 1\n\n4 4\n1 2\n2 3\n3 4\n4 1\n1 3\n\nSample Output 1\n\n2\n\nKen can reach Vertex 3 from Vertex 1 in two ken-ken-pa, as follows: 1 \\rightarrow 2 \\rightarrow 3 \\rightarrow 4 in the first ken-ken-pa, then 4 \\rightarrow 1 \\rightarrow 2 \\rightarrow 3 in the second ken-ken-pa. This is the minimum number of ken-ken-pa needed.\n\nSample Input 2\n\n3 3\n1 2\n2 3\n3 1\n1 2\n\nSample Output 2\n\n-1\n\nAny number of ken-ken-pa will bring Ken back to Vertex 1, so he cannot reach Vertex 2, though he can pass through it in the middle of a ken-ken-pa.\n\nSample Input 3\n\n2 0\n1 2\n\nSample Output 3\n\n-1\n\nVertex S and Vertex T may be disconnected.\n\nSample Input 4\n\n6 8\n1 2\n2 3\n3 4\n4 5\n5 1\n1 4\n1 5\n4 6\n1 6\n\nSample Output 4\n\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1509, "cpu_time_ms": 2107, "memory_kb": 207480}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s522416979", "group_id": "codeNet:p02991", "input_text": "module DirectedGraph\n  (* 道の表現 *)\n  (Path : sig\n    type t\n    (* 辺の名前 *)\n    type edge\n    (* 長さ0の道 *)\n    val nil : t\n    (* 道の後ろに辺を付け足した道 *)\n    val snoc : t -> edge -> t\n  end) :\nsig\n  (* BFSにより，重みのないグラフの最短経路を求める *)\n  val bfs :\n    (* 頂点数（Hashtblを用いるので目安程度） *)\n    int ->\n    (* 辺の名前が付いた隣接リスト *)\n    ('v -> ('v * Path.edge) list) ->\n    (* 始点 *)\n    'v ->\n    (* 最短経路を返す関数 辿り着けなければNoneを返す） *)\n    ('v -> Path.t option)\nend = struct\n  let rec bfs_aux es d frontier t =\n    try Some (Hashtbl.find d t) with\n    | Not_found ->\n        match !frontier with\n        | [] -> None\n        | _ :: _ ->\n            frontier := List.fold_right (fun u ->\n              List.fold_right (fun (v, e) frontier ->\n                if Hashtbl.mem d v\n                then frontier\n                else (Hashtbl.add d v (Path.snoc (Hashtbl.find d u) e); v :: frontier))\n              (es u)) !frontier [];\n            bfs_aux es d frontier t\n\n  (*\n   * 終点に辿り着いた時点で探索を切り上げるが，\n   * 戻り値の関数を覚えておくと，途中まで探索した結果が再利用される\n   * （#trace bfs_aux すると分かりやすい）\n   *)\n  let bfs n es s =\n    let d = Hashtbl.create n in\n    Hashtbl.add d s Path.nil;\n    let frontier = ref [s] in\n    bfs_aux es d frontier\nend\n    \nmodule G = DirectedGraph (struct\n  type t = int\n  type edge = unit\n  let nil = 0\n  let snoc t _ = t + 1\nend)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let es = Array.make n [] in\n  for i = 0 to m - 1 do\n    Scanf.scanf \"%d %d\\n\" @@ fun u v ->\n      es.(u - 1) <- v - 1 :: es.(u - 1)\n  done;\n  Scanf.scanf \"%d %d\\n\" @@ fun s t ->\n  let dp = G.bfs (3 * n) (fun (v, m) ->\n    List.map (fun u -> ((u, (m + 1) mod 3), ())) es.(v)) (s - 1, 0) in\n  match dp (t - 1, 0) with\n  | None -> print_endline \"-1\"\n  | Some d -> Printf.printf \"%d\\n\" @@ d / 3\n", "language": "OCaml", "metadata": {"date": 1561859628, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s522416979.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s522416979", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "module DirectedGraph\n  (* 道の表現 *)\n  (Path : sig\n    type t\n    (* 辺の名前 *)\n    type edge\n    (* 長さ0の道 *)\n    val nil : t\n    (* 道の後ろに辺を付け足した道 *)\n    val snoc : t -> edge -> t\n  end) :\nsig\n  (* BFSにより，重みのないグラフの最短経路を求める *)\n  val bfs :\n    (* 頂点数（Hashtblを用いるので目安程度） *)\n    int ->\n    (* 辺の名前が付いた隣接リスト *)\n    ('v -> ('v * Path.edge) list) ->\n    (* 始点 *)\n    'v ->\n    (* 最短経路を返す関数 辿り着けなければNoneを返す） *)\n    ('v -> Path.t option)\nend = struct\n  let rec bfs_aux es d frontier t =\n    try Some (Hashtbl.find d t) with\n    | Not_found ->\n        match !frontier with\n        | [] -> None\n        | _ :: _ ->\n            frontier := List.fold_right (fun u ->\n              List.fold_right (fun (v, e) frontier ->\n                if Hashtbl.mem d v\n                then frontier\n                else (Hashtbl.add d v (Path.snoc (Hashtbl.find d u) e); v :: frontier))\n              (es u)) !frontier [];\n            bfs_aux es d frontier t\n\n  (*\n   * 終点に辿り着いた時点で探索を切り上げるが，\n   * 戻り値の関数を覚えておくと，途中まで探索した結果が再利用される\n   * （#trace bfs_aux すると分かりやすい）\n   *)\n  let bfs n es s =\n    let d = Hashtbl.create n in\n    Hashtbl.add d s Path.nil;\n    let frontier = ref [s] in\n    bfs_aux es d frontier\nend\n    \nmodule G = DirectedGraph (struct\n  type t = int\n  type edge = unit\n  let nil = 0\n  let snoc t _ = t + 1\nend)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let es = Array.make n [] in\n  for i = 0 to m - 1 do\n    Scanf.scanf \"%d %d\\n\" @@ fun u v ->\n      es.(u - 1) <- v - 1 :: es.(u - 1)\n  done;\n  Scanf.scanf \"%d %d\\n\" @@ fun s t ->\n  let dp = G.bfs (3 * n) (fun (v, m) ->\n    List.map (fun u -> ((u, (m + 1) mod 3), ())) es.(v)) (s - 1, 0) in\n  match dp (t - 1, 0) with\n  | None -> print_endline \"-1\"\n  | Some d -> Printf.printf \"%d\\n\" @@ d / 3\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nKen loves ken-ken-pa (Japanese version of hopscotch). Today, he will play it on a directed graph G.\nG consists of N vertices numbered 1 to N, and M edges. The i-th edge points from Vertex u_i to Vertex v_i.\n\nFirst, Ken stands on Vertex S. He wants to reach Vertex T by repeating ken-ken-pa. In one ken-ken-pa, he does the following exactly three times: follow an edge pointing from the vertex on which he is standing.\n\nDetermine if he can reach Vertex T by repeating ken-ken-pa. If the answer is yes, find the minimum number of ken-ken-pa needed to reach Vertex T. Note that visiting Vertex T in the middle of a ken-ken-pa does not count as reaching Vertex T by repeating ken-ken-pa.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq \\min(10^5, N (N-1))\n\n1 \\leq u_i, v_i \\leq N(1 \\leq i \\leq M)\n\nu_i \\neq v_i (1 \\leq i \\leq M)\n\nIf i \\neq j, (u_i, v_i) \\neq (u_j, v_j).\n\n1 \\leq S, T \\leq N\n\nS \\neq T\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nu_1 v_1\n:\nu_M v_M\nS T\n\nOutput\n\nIf Ken cannot reach Vertex T from Vertex S by repeating ken-ken-pa, print -1.\nIf he can, print the minimum number of ken-ken-pa needed to reach vertex T.\n\nSample Input 1\n\n4 4\n1 2\n2 3\n3 4\n4 1\n1 3\n\nSample Output 1\n\n2\n\nKen can reach Vertex 3 from Vertex 1 in two ken-ken-pa, as follows: 1 \\rightarrow 2 \\rightarrow 3 \\rightarrow 4 in the first ken-ken-pa, then 4 \\rightarrow 1 \\rightarrow 2 \\rightarrow 3 in the second ken-ken-pa. This is the minimum number of ken-ken-pa needed.\n\nSample Input 2\n\n3 3\n1 2\n2 3\n3 1\n1 2\n\nSample Output 2\n\n-1\n\nAny number of ken-ken-pa will bring Ken back to Vertex 1, so he cannot reach Vertex 2, though he can pass through it in the middle of a ken-ken-pa.\n\nSample Input 3\n\n2 0\n1 2\n\nSample Output 3\n\n-1\n\nVertex S and Vertex T may be disconnected.\n\nSample Input 4\n\n6 8\n1 2\n2 3\n3 4\n4 5\n5 1\n1 4\n1 5\n4 6\n1 6\n\nSample Output 4\n\n2", "sample_input": "4 4\n1 2\n2 3\n3 4\n4 1\n1 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02991", "source_text": "Score : 500 points\n\nProblem Statement\n\nKen loves ken-ken-pa (Japanese version of hopscotch). Today, he will play it on a directed graph G.\nG consists of N vertices numbered 1 to N, and M edges. The i-th edge points from Vertex u_i to Vertex v_i.\n\nFirst, Ken stands on Vertex S. He wants to reach Vertex T by repeating ken-ken-pa. In one ken-ken-pa, he does the following exactly three times: follow an edge pointing from the vertex on which he is standing.\n\nDetermine if he can reach Vertex T by repeating ken-ken-pa. If the answer is yes, find the minimum number of ken-ken-pa needed to reach Vertex T. Note that visiting Vertex T in the middle of a ken-ken-pa does not count as reaching Vertex T by repeating ken-ken-pa.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq \\min(10^5, N (N-1))\n\n1 \\leq u_i, v_i \\leq N(1 \\leq i \\leq M)\n\nu_i \\neq v_i (1 \\leq i \\leq M)\n\nIf i \\neq j, (u_i, v_i) \\neq (u_j, v_j).\n\n1 \\leq S, T \\leq N\n\nS \\neq T\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nu_1 v_1\n:\nu_M v_M\nS T\n\nOutput\n\nIf Ken cannot reach Vertex T from Vertex S by repeating ken-ken-pa, print -1.\nIf he can, print the minimum number of ken-ken-pa needed to reach vertex T.\n\nSample Input 1\n\n4 4\n1 2\n2 3\n3 4\n4 1\n1 3\n\nSample Output 1\n\n2\n\nKen can reach Vertex 3 from Vertex 1 in two ken-ken-pa, as follows: 1 \\rightarrow 2 \\rightarrow 3 \\rightarrow 4 in the first ken-ken-pa, then 4 \\rightarrow 1 \\rightarrow 2 \\rightarrow 3 in the second ken-ken-pa. This is the minimum number of ken-ken-pa needed.\n\nSample Input 2\n\n3 3\n1 2\n2 3\n3 1\n1 2\n\nSample Output 2\n\n-1\n\nAny number of ken-ken-pa will bring Ken back to Vertex 1, so he cannot reach Vertex 2, though he can pass through it in the middle of a ken-ken-pa.\n\nSample Input 3\n\n2 0\n1 2\n\nSample Output 3\n\n-1\n\nVertex S and Vertex T may be disconnected.\n\nSample Input 4\n\n6 8\n1 2\n2 3\n3 4\n4 5\n5 1\n1 4\n1 5\n4 6\n1 6\n\nSample Output 4\n\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2049, "cpu_time_ms": 169, "memory_kb": 29952}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s911346853", "group_id": "codeNet:p02993", "input_text": "let () = Scanf.scanf \"%s\" @@ fun s -> \n  let cond = (s.[0] = s.[1]) || (s.[1] = s.[2]) || (s.[2] = s.[3]) in\n  let ans = if cond then \"Bad\" else \"Good\" in\n  Printf.printf \"%s\\n\" ans", "language": "OCaml", "metadata": {"date": 1597417575, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s911346853.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s911346853", "user_id": "u052332717"}, "prompt_components": {"gold_output": "Bad\n", "input_to_evaluate": "let () = Scanf.scanf \"%s\" @@ fun s -> \n  let cond = (s.[0] = s.[1]) || (s.[1] = s.[2]) || (s.[2] = s.[3]) in\n  let ans = if cond then \"Bad\" else \"Good\" in\n  Printf.printf \"%s\\n\" ans", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThe door of Snuke's laboratory is locked with a security code.\n\nThe security code is a 4-digit number. We say the security code is hard to enter when it contains two consecutive digits that are the same.\n\nYou are given the current security code S. If S is hard to enter, print Bad; otherwise, print Good.\n\nConstraints\n\nS is a 4-character string consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is hard to enter, print Bad; otherwise, print Good.\n\nSample Input 1\n\n3776\n\nSample Output 1\n\nBad\n\nThe second and third digits are the same, so 3776 is hard to enter.\n\nSample Input 2\n\n8080\n\nSample Output 2\n\nGood\n\nThere are no two consecutive digits that are the same, so 8080 is not hard to enter.\n\nSample Input 3\n\n1333\n\nSample Output 3\n\nBad\n\nSample Input 4\n\n0024\n\nSample Output 4\n\nBad", "sample_input": "3776\n"}, "reference_outputs": ["Bad\n"], "source_document_id": "p02993", "source_text": "Score : 100 points\n\nProblem Statement\n\nThe door of Snuke's laboratory is locked with a security code.\n\nThe security code is a 4-digit number. We say the security code is hard to enter when it contains two consecutive digits that are the same.\n\nYou are given the current security code S. If S is hard to enter, print Bad; otherwise, print Good.\n\nConstraints\n\nS is a 4-character string consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is hard to enter, print Bad; otherwise, print Good.\n\nSample Input 1\n\n3776\n\nSample Output 1\n\nBad\n\nThe second and third digits are the same, so 3776 is hard to enter.\n\nSample Input 2\n\n8080\n\nSample Output 2\n\nGood\n\nThere are no two consecutive digits that are the same, so 8080 is not hard to enter.\n\nSample Input 3\n\n1333\n\nSample Output 3\n\nBad\n\nSample Input 4\n\n0024\n\nSample Output 4\n\nBad", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 181, "cpu_time_ms": 9, "memory_kb": 3696}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s499436878", "group_id": "codeNet:p02993", "input_text": "let n = read_int ()\nlet a, b, c, d = n / 1000, n / 100 - (n / 1000) * 10, n mod 100 - n mod 10, n mod 10\nlet () = print_endline (if a = b || b = c || c = d then \"Bad\" else \"Good\")", "language": "OCaml", "metadata": {"date": 1588260378, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s499436878.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s499436878", "user_id": "u307426615"}, "prompt_components": {"gold_output": "Bad\n", "input_to_evaluate": "let n = read_int ()\nlet a, b, c, d = n / 1000, n / 100 - (n / 1000) * 10, n mod 100 - n mod 10, n mod 10\nlet () = print_endline (if a = b || b = c || c = d then \"Bad\" else \"Good\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThe door of Snuke's laboratory is locked with a security code.\n\nThe security code is a 4-digit number. We say the security code is hard to enter when it contains two consecutive digits that are the same.\n\nYou are given the current security code S. If S is hard to enter, print Bad; otherwise, print Good.\n\nConstraints\n\nS is a 4-character string consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is hard to enter, print Bad; otherwise, print Good.\n\nSample Input 1\n\n3776\n\nSample Output 1\n\nBad\n\nThe second and third digits are the same, so 3776 is hard to enter.\n\nSample Input 2\n\n8080\n\nSample Output 2\n\nGood\n\nThere are no two consecutive digits that are the same, so 8080 is not hard to enter.\n\nSample Input 3\n\n1333\n\nSample Output 3\n\nBad\n\nSample Input 4\n\n0024\n\nSample Output 4\n\nBad", "sample_input": "3776\n"}, "reference_outputs": ["Bad\n"], "source_document_id": "p02993", "source_text": "Score : 100 points\n\nProblem Statement\n\nThe door of Snuke's laboratory is locked with a security code.\n\nThe security code is a 4-digit number. We say the security code is hard to enter when it contains two consecutive digits that are the same.\n\nYou are given the current security code S. If S is hard to enter, print Bad; otherwise, print Good.\n\nConstraints\n\nS is a 4-character string consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is hard to enter, print Bad; otherwise, print Good.\n\nSample Input 1\n\n3776\n\nSample Output 1\n\nBad\n\nThe second and third digits are the same, so 3776 is hard to enter.\n\nSample Input 2\n\n8080\n\nSample Output 2\n\nGood\n\nThere are no two consecutive digits that are the same, so 8080 is not hard to enter.\n\nSample Input 3\n\n1333\n\nSample Output 3\n\nBad\n\nSample Input 4\n\n0024\n\nSample Output 4\n\nBad", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 179, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s381154261", "group_id": "codeNet:p02993", "input_text": "let s = read_line ()\nlet _ = print_endline @@ if s.[0] = s.[1] || s.[1] = s.[2] || s.[2] = s.[3] then \"Bad\" else \"Good\"", "language": "OCaml", "metadata": {"date": 1564306414, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s381154261.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s381154261", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Bad\n", "input_to_evaluate": "let s = read_line ()\nlet _ = print_endline @@ if s.[0] = s.[1] || s.[1] = s.[2] || s.[2] = s.[3] then \"Bad\" else \"Good\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThe door of Snuke's laboratory is locked with a security code.\n\nThe security code is a 4-digit number. We say the security code is hard to enter when it contains two consecutive digits that are the same.\n\nYou are given the current security code S. If S is hard to enter, print Bad; otherwise, print Good.\n\nConstraints\n\nS is a 4-character string consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is hard to enter, print Bad; otherwise, print Good.\n\nSample Input 1\n\n3776\n\nSample Output 1\n\nBad\n\nThe second and third digits are the same, so 3776 is hard to enter.\n\nSample Input 2\n\n8080\n\nSample Output 2\n\nGood\n\nThere are no two consecutive digits that are the same, so 8080 is not hard to enter.\n\nSample Input 3\n\n1333\n\nSample Output 3\n\nBad\n\nSample Input 4\n\n0024\n\nSample Output 4\n\nBad", "sample_input": "3776\n"}, "reference_outputs": ["Bad\n"], "source_document_id": "p02993", "source_text": "Score : 100 points\n\nProblem Statement\n\nThe door of Snuke's laboratory is locked with a security code.\n\nThe security code is a 4-digit number. We say the security code is hard to enter when it contains two consecutive digits that are the same.\n\nYou are given the current security code S. If S is hard to enter, print Bad; otherwise, print Good.\n\nConstraints\n\nS is a 4-character string consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is hard to enter, print Bad; otherwise, print Good.\n\nSample Input 1\n\n3776\n\nSample Output 1\n\nBad\n\nThe second and third digits are the same, so 3776 is hard to enter.\n\nSample Input 2\n\n8080\n\nSample Output 2\n\nGood\n\nThere are no two consecutive digits that are the same, so 8080 is not hard to enter.\n\nSample Input 3\n\n1333\n\nSample Output 3\n\nBad\n\nSample Input 4\n\n0024\n\nSample Output 4\n\nBad", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 119, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s012988546", "group_id": "codeNet:p02993", "input_text": "let inp : unit -> string = fun () -> \n  input_line stdin\nlet () =\n  let s = inp () in\n  let rec loop s n pred =\n    if n = 0 then true\n    else\n      let a = s.[n - 1] in\n      if a = pred then false\n      else loop s (n - 1) a\n  in\n  if loop s 4 'a' then\n    print_endline \"Good\"\n  else\n    print_endline \"Bad\"\n", "language": "OCaml", "metadata": {"date": 1561252409, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s012988546.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s012988546", "user_id": "u977566741"}, "prompt_components": {"gold_output": "Bad\n", "input_to_evaluate": "let inp : unit -> string = fun () -> \n  input_line stdin\nlet () =\n  let s = inp () in\n  let rec loop s n pred =\n    if n = 0 then true\n    else\n      let a = s.[n - 1] in\n      if a = pred then false\n      else loop s (n - 1) a\n  in\n  if loop s 4 'a' then\n    print_endline \"Good\"\n  else\n    print_endline \"Bad\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThe door of Snuke's laboratory is locked with a security code.\n\nThe security code is a 4-digit number. We say the security code is hard to enter when it contains two consecutive digits that are the same.\n\nYou are given the current security code S. If S is hard to enter, print Bad; otherwise, print Good.\n\nConstraints\n\nS is a 4-character string consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is hard to enter, print Bad; otherwise, print Good.\n\nSample Input 1\n\n3776\n\nSample Output 1\n\nBad\n\nThe second and third digits are the same, so 3776 is hard to enter.\n\nSample Input 2\n\n8080\n\nSample Output 2\n\nGood\n\nThere are no two consecutive digits that are the same, so 8080 is not hard to enter.\n\nSample Input 3\n\n1333\n\nSample Output 3\n\nBad\n\nSample Input 4\n\n0024\n\nSample Output 4\n\nBad", "sample_input": "3776\n"}, "reference_outputs": ["Bad\n"], "source_document_id": "p02993", "source_text": "Score : 100 points\n\nProblem Statement\n\nThe door of Snuke's laboratory is locked with a security code.\n\nThe security code is a 4-digit number. We say the security code is hard to enter when it contains two consecutive digits that are the same.\n\nYou are given the current security code S. If S is hard to enter, print Bad; otherwise, print Good.\n\nConstraints\n\nS is a 4-character string consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is hard to enter, print Bad; otherwise, print Good.\n\nSample Input 1\n\n3776\n\nSample Output 1\n\nBad\n\nThe second and third digits are the same, so 3776 is hard to enter.\n\nSample Input 2\n\n8080\n\nSample Output 2\n\nGood\n\nThere are no two consecutive digits that are the same, so 8080 is not hard to enter.\n\nSample Input 3\n\n1333\n\nSample Output 3\n\nBad\n\nSample Input 4\n\n0024\n\nSample Output 4\n\nBad", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 312, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s322141274", "group_id": "codeNet:p02994", "input_text": "(* unihernandez22\n * https://atcoder.jp/contests/abc131/tasks/abc131_b\n * implementation\n * *)\n\nlet rec solution n l i cum eat =\n    if i > n then cum-eat\n    else\n        let curr = i+l-1 in\n        if abs curr < abs eat then\n            solution n l (i+1) (cum+curr) curr\n        else\n            solution n l (i+1) (cum+curr) eat;;\n\nPrintf.printf \"%d\\n\" @@\nScanf.scanf \"%d %d\\n\" @@ fun n l ->\n    solution n l 1 0 300;;\n\n", "language": "OCaml", "metadata": {"date": 1594221232, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s322141274.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s322141274", "user_id": "u878654696"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "(* unihernandez22\n * https://atcoder.jp/contests/abc131/tasks/abc131_b\n * implementation\n * *)\n\nlet rec solution n l i cum eat =\n    if i > n then cum-eat\n    else\n        let curr = i+l-1 in\n        if abs curr < abs eat then\n            solution n l (i+1) (cum+curr) curr\n        else\n            solution n l (i+1) (cum+curr) eat;;\n\nPrintf.printf \"%d\\n\" @@\nScanf.scanf \"%d %d\\n\" @@ fun n l ->\n    solution n l 1 0 300;;\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.\n\nYou can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used.\n\nYou planned to make an apple pie using all of the apples, but being hungry tempts you to eat one of them, which can no longer be used to make the apple pie.\n\nYou want to make an apple pie that is as similar as possible to the one that you planned to make. Thus, you will choose the apple to eat so that the flavor of the apple pie made of the remaining N-1 apples will have the smallest possible absolute difference from the flavor of the apple pie made of all the N apples.\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you choose the apple to eat as above.\n\nWe can prove that this value is uniquely determined.\n\nConstraints\n\n2 \\leq N \\leq 200\n\n-100 \\leq L \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN L\n\nOutput\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you optimally choose the apple to eat.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n18\n\nThe flavors of Apple 1, 2, 3, 4, and 5 are 2, 3, 4, 5, and 6, respectively. The optimal choice is to eat Apple 1, so the answer is 3+4+5+6=18.\n\nSample Input 2\n\n3 -1\n\nSample Output 2\n\n0\n\nThe flavors of Apple 1, 2, and 3 are -1, 0, and 1, respectively. The optimal choice is to eat Apple 2, so the answer is (-1)+1=0.\n\nSample Input 3\n\n30 -50\n\nSample Output 3\n\n-1044", "sample_input": "5 2\n"}, "reference_outputs": ["18\n"], "source_document_id": "p02994", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.\n\nYou can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used.\n\nYou planned to make an apple pie using all of the apples, but being hungry tempts you to eat one of them, which can no longer be used to make the apple pie.\n\nYou want to make an apple pie that is as similar as possible to the one that you planned to make. Thus, you will choose the apple to eat so that the flavor of the apple pie made of the remaining N-1 apples will have the smallest possible absolute difference from the flavor of the apple pie made of all the N apples.\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you choose the apple to eat as above.\n\nWe can prove that this value is uniquely determined.\n\nConstraints\n\n2 \\leq N \\leq 200\n\n-100 \\leq L \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN L\n\nOutput\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you optimally choose the apple to eat.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n18\n\nThe flavors of Apple 1, 2, 3, 4, and 5 are 2, 3, 4, 5, and 6, respectively. The optimal choice is to eat Apple 1, so the answer is 3+4+5+6=18.\n\nSample Input 2\n\n3 -1\n\nSample Output 2\n\n0\n\nThe flavors of Apple 1, 2, and 3 are -1, 0, and 1, respectively. The optimal choice is to eat Apple 2, so the answer is (-1)+1=0.\n\nSample Input 3\n\n30 -50\n\nSample Output 3\n\n-1044", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 424, "cpu_time_ms": 9, "memory_kb": 3804}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s603323399", "group_id": "codeNet:p02994", "input_text": "open List\nlet i_inp_list : unit -> int list = fun () ->\n  let inp_split = Str.split (Str.regexp \" \") (input_line stdin) in\n  map (fun x -> int_of_string x) (inp_split)\nlet () =\n  let [n; l] = i_inp_list () in\n  let last = n + l - 1 in\n  let ans = \n    if last < 0 then\n      (n - 1) * (l + last - 1) / 2\n    else if l < 0 && last > 0 then\n      n * (l + last) / 2\n    else\n      (n - 1) * (l + 1 + last)\n  in\n  print_int ans;\n  print_newline ()", "language": "OCaml", "metadata": {"date": 1561253412, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s603323399.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s603323399", "user_id": "u977566741"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "open List\nlet i_inp_list : unit -> int list = fun () ->\n  let inp_split = Str.split (Str.regexp \" \") (input_line stdin) in\n  map (fun x -> int_of_string x) (inp_split)\nlet () =\n  let [n; l] = i_inp_list () in\n  let last = n + l - 1 in\n  let ans = \n    if last < 0 then\n      (n - 1) * (l + last - 1) / 2\n    else if l < 0 && last > 0 then\n      n * (l + last) / 2\n    else\n      (n - 1) * (l + 1 + last)\n  in\n  print_int ans;\n  print_newline ()", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.\n\nYou can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used.\n\nYou planned to make an apple pie using all of the apples, but being hungry tempts you to eat one of them, which can no longer be used to make the apple pie.\n\nYou want to make an apple pie that is as similar as possible to the one that you planned to make. Thus, you will choose the apple to eat so that the flavor of the apple pie made of the remaining N-1 apples will have the smallest possible absolute difference from the flavor of the apple pie made of all the N apples.\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you choose the apple to eat as above.\n\nWe can prove that this value is uniquely determined.\n\nConstraints\n\n2 \\leq N \\leq 200\n\n-100 \\leq L \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN L\n\nOutput\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you optimally choose the apple to eat.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n18\n\nThe flavors of Apple 1, 2, 3, 4, and 5 are 2, 3, 4, 5, and 6, respectively. The optimal choice is to eat Apple 1, so the answer is 3+4+5+6=18.\n\nSample Input 2\n\n3 -1\n\nSample Output 2\n\n0\n\nThe flavors of Apple 1, 2, and 3 are -1, 0, and 1, respectively. The optimal choice is to eat Apple 2, so the answer is (-1)+1=0.\n\nSample Input 3\n\n30 -50\n\nSample Output 3\n\n-1044", "sample_input": "5 2\n"}, "reference_outputs": ["18\n"], "source_document_id": "p02994", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.\n\nYou can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used.\n\nYou planned to make an apple pie using all of the apples, but being hungry tempts you to eat one of them, which can no longer be used to make the apple pie.\n\nYou want to make an apple pie that is as similar as possible to the one that you planned to make. Thus, you will choose the apple to eat so that the flavor of the apple pie made of the remaining N-1 apples will have the smallest possible absolute difference from the flavor of the apple pie made of all the N apples.\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you choose the apple to eat as above.\n\nWe can prove that this value is uniquely determined.\n\nConstraints\n\n2 \\leq N \\leq 200\n\n-100 \\leq L \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN L\n\nOutput\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you optimally choose the apple to eat.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n18\n\nThe flavors of Apple 1, 2, 3, 4, and 5 are 2, 3, 4, 5, and 6, respectively. The optimal choice is to eat Apple 1, so the answer is 3+4+5+6=18.\n\nSample Input 2\n\n3 -1\n\nSample Output 2\n\n0\n\nThe flavors of Apple 1, 2, and 3 are -1, 0, and 1, respectively. The optimal choice is to eat Apple 2, so the answer is (-1)+1=0.\n\nSample Input 3\n\n30 -50\n\nSample Output 3\n\n-1044", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 444, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s640753831", "group_id": "codeNet:p02995", "input_text": "let a, b, c, d = Scanf.scanf \" %d %d %d %d\" @@ fun a b c d -> a, b, c, d\nlet rec gcd a b = if b = 0 then a else gcd b (a mod b)\nlet rec lcm a b = a / gcd a b * b\nlet f x = x / c + x / d - x / lcm c d\nlet _ = b - a + 1 - (f b - f (a - 1)) |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1561290568, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p02995.html", "problem_id": "p02995", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02995/input.txt", "sample_output_relpath": "derived/input_output/data/p02995/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02995/OCaml/s640753831.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s640753831", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let a, b, c, d = Scanf.scanf \" %d %d %d %d\" @@ fun a b c d -> a, b, c, d\nlet rec gcd a b = if b = 0 then a else gcd b (a mod b)\nlet rec lcm a b = a / gcd a b * b\nlet f x = x / c + x / d - x / lcm c d\nlet _ = b - a + 1 - (f b - f (a - 1)) |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given four integers A, B, C, and D. Find the number of integers between A and B (inclusive) that can be evenly divided by neither C nor D.\n\nConstraints\n\n1\\leq A\\leq B\\leq 10^{18}\n\n1\\leq C,D\\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint the number of integers between A and B (inclusive) that can be evenly divided by neither C nor D.\n\nSample Input 1\n\n4 9 2 3\n\nSample Output 1\n\n2\n\n5 and 7 satisfy the condition.\n\nSample Input 2\n\n10 40 6 8\n\nSample Output 2\n\n23\n\nSample Input 3\n\n314159265358979323 846264338327950288 419716939 937510582\n\nSample Output 3\n\n532105071133627368", "sample_input": "4 9 2 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02995", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given four integers A, B, C, and D. Find the number of integers between A and B (inclusive) that can be evenly divided by neither C nor D.\n\nConstraints\n\n1\\leq A\\leq B\\leq 10^{18}\n\n1\\leq C,D\\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint the number of integers between A and B (inclusive) that can be evenly divided by neither C nor D.\n\nSample Input 1\n\n4 9 2 3\n\nSample Output 1\n\n2\n\n5 and 7 satisfy the condition.\n\nSample Input 2\n\n10 40 6 8\n\nSample Output 2\n\n23\n\nSample Input 3\n\n314159265358979323 846264338327950288 419716939 937510582\n\nSample Output 3\n\n532105071133627368", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 261, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s827933704", "group_id": "codeNet:p02996", "input_text": "let split c s = (\n    let res = ref [] in\n    let i = ref 0 in\n    let n = String.length s in\n    while !i < n do\n      let j = !i in\n      while !i < n && s.[!i] <> c do i := !i + 1 done;\n      res := String.sub s j (!i - j) :: !res;\n      i := !i + 1;\n    done;\n    List.rev !res\n  );;\n\nlet rec range a b = if a > b then [] else a :: range (a + 1) b;;\nlet read_ints () = read_line () |> split ' ' |> List.map int_of_string;;\n\nlet n = read_int ();;\nlet ab = Array.make n (0, 0);;\nfor i = 0 to n - 1 do\n  let [x; y] = read_ints () in\n  ab.(i) <- (x, y);\ndone;;\nArray.sort (fun (a, b) (c, d) -> compare b d) ab;;\n\nlet curr = ref 0;;\nlet all = ref true;;\nfor i = 0 to n - 1 do\n  curr := !curr + fst ab.(i);\n  all := !all && (!curr <= snd ab.(i));\ndone;;\n\nif !all then\n  print_endline \"Yes\"\nelse\n  print_endline \"No\";;\n    \n", "language": "OCaml", "metadata": {"date": 1561374773, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s827933704.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s827933704", "user_id": "u006493569"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let split c s = (\n    let res = ref [] in\n    let i = ref 0 in\n    let n = String.length s in\n    while !i < n do\n      let j = !i in\n      while !i < n && s.[!i] <> c do i := !i + 1 done;\n      res := String.sub s j (!i - j) :: !res;\n      i := !i + 1;\n    done;\n    List.rev !res\n  );;\n\nlet rec range a b = if a > b then [] else a :: range (a + 1) b;;\nlet read_ints () = read_line () |> split ' ' |> List.map int_of_string;;\n\nlet n = read_int ();;\nlet ab = Array.make n (0, 0);;\nfor i = 0 to n - 1 do\n  let [x; y] = read_ints () in\n  ab.(i) <- (x, y);\ndone;;\nArray.sort (fun (a, b) (c, d) -> compare b d) ab;;\n\nlet curr = ref 0;;\nlet all = ref true;;\nfor i = 0 to n - 1 do\n  curr := !curr + fst ab.(i);\n  all := !all && (!curr <= snd ab.(i));\ndone;;\n\nif !all then\n  print_endline \"Yes\"\nelse\n  print_endline \"No\";;\n    \n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nKizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.\n\nLet the current time be time 0. Kizahashi has N jobs numbered 1 to N.\n\nIt takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.\n\nKizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.\n\nCan Kizahashi complete all the jobs in time? If he can, print Yes; if he cannot, print No.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i, B_i \\leq 10^9 (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n.\n.\n.\nA_N B_N\n\nOutput\n\nIf Kizahashi can complete all the jobs in time, print Yes; if he cannot, print No.\n\nSample Input 1\n\n5\n2 4\n1 9\n1 8\n4 9\n3 12\n\nSample Output 1\n\nYes\n\nHe can complete all the jobs in time by, for example, doing them in the following order:\n\nDo Job 2 from time 0 to 1.\n\nDo Job 1 from time 1 to 3.\n\nDo Job 4 from time 3 to 7.\n\nDo Job 3 from time 7 to 8.\n\nDo Job 5 from time 8 to 11.\n\nNote that it is fine to complete Job 3 exactly at the deadline, time 8.\n\nSample Input 2\n\n3\n334 1000\n334 1000\n334 1000\n\nSample Output 2\n\nNo\n\nHe cannot complete all the jobs in time, no matter what order he does them in.\n\nSample Input 3\n\n30\n384 8895\n1725 9791\n170 1024\n4 11105\n2 6\n578 1815\n702 3352\n143 5141\n1420 6980\n24 1602\n849 999\n76 7586\n85 5570\n444 4991\n719 11090\n470 10708\n1137 4547\n455 9003\n110 9901\n15 8578\n368 3692\n104 1286\n3 4\n366 12143\n7 6649\n610 2374\n152 7324\n4 7042\n292 11386\n334 5720\n\nSample Output 3\n\nYes", "sample_input": "5\n2 4\n1 9\n1 8\n4 9\n3 12\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02996", "source_text": "Score: 400 points\n\nProblem Statement\n\nKizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.\n\nLet the current time be time 0. Kizahashi has N jobs numbered 1 to N.\n\nIt takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.\n\nKizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.\n\nCan Kizahashi complete all the jobs in time? If he can, print Yes; if he cannot, print No.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i, B_i \\leq 10^9 (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n.\n.\n.\nA_N B_N\n\nOutput\n\nIf Kizahashi can complete all the jobs in time, print Yes; if he cannot, print No.\n\nSample Input 1\n\n5\n2 4\n1 9\n1 8\n4 9\n3 12\n\nSample Output 1\n\nYes\n\nHe can complete all the jobs in time by, for example, doing them in the following order:\n\nDo Job 2 from time 0 to 1.\n\nDo Job 1 from time 1 to 3.\n\nDo Job 4 from time 3 to 7.\n\nDo Job 3 from time 7 to 8.\n\nDo Job 5 from time 8 to 11.\n\nNote that it is fine to complete Job 3 exactly at the deadline, time 8.\n\nSample Input 2\n\n3\n334 1000\n334 1000\n334 1000\n\nSample Output 2\n\nNo\n\nHe cannot complete all the jobs in time, no matter what order he does them in.\n\nSample Input 3\n\n30\n384 8895\n1725 9791\n170 1024\n4 11105\n2 6\n578 1815\n702 3352\n143 5141\n1420 6980\n24 1602\n849 999\n76 7586\n85 5570\n444 4991\n719 11090\n470 10708\n1137 4547\n455 9003\n110 9901\n15 8578\n368 3692\n104 1286\n3 4\n366 12143\n7 6649\n610 2374\n152 7324\n4 7042\n292 11386\n334 5720\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 821, "cpu_time_ms": 196, "memory_kb": 9600}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s228750129", "group_id": "codeNet:p02996", "input_text": "open List\nlet i_inp : unit -> int = fun () ->\n  int_of_string (input_line stdin)\n\nlet i_inp_list : unit -> int list = fun () ->\n  let inp_split = Str.split (Str.regexp \" \") (input_line stdin) in\n  map (fun x -> int_of_string x) (inp_split)\n\n(* inp_loop i_inp_list 10  のように使う *)\nlet rec inp_loop : (unit -> 'a) -> int -> 'a list = fun inp_fun n ->\n  if n = 0 then []\n  else\n    let x = inp_fun () in\n    x :: inp_loop inp_fun (n - 1)\n\nlet () =\n  let n = i_inp () in\n  let list =\n    inp_loop\n      (fun () ->\n        let [a; b] = i_inp_list ()\n        in (a, b))\n      n in\n  let list = fast_sort\n               (fun (a1, b1) (a1, b1) -> if (b1, a1) > (b1, a1) then 1 else if (a1, b1) = (a1, b1) then 0 else -1)\n               list in\n  let rec loop t list =\n    match list with\n      [] -> true\n    | (a, b) :: rest ->\n       if t + a > b then false\n       else loop (t + a) rest\n  in\n  if loop 0 list then\n    print_endline \"Yes\"\n  else\n    print_endline \"No\"\n", "language": "OCaml", "metadata": {"date": 1561234409, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s228750129.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s228750129", "user_id": "u977566741"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open List\nlet i_inp : unit -> int = fun () ->\n  int_of_string (input_line stdin)\n\nlet i_inp_list : unit -> int list = fun () ->\n  let inp_split = Str.split (Str.regexp \" \") (input_line stdin) in\n  map (fun x -> int_of_string x) (inp_split)\n\n(* inp_loop i_inp_list 10  のように使う *)\nlet rec inp_loop : (unit -> 'a) -> int -> 'a list = fun inp_fun n ->\n  if n = 0 then []\n  else\n    let x = inp_fun () in\n    x :: inp_loop inp_fun (n - 1)\n\nlet () =\n  let n = i_inp () in\n  let list =\n    inp_loop\n      (fun () ->\n        let [a; b] = i_inp_list ()\n        in (a, b))\n      n in\n  let list = fast_sort\n               (fun (a1, b1) (a1, b1) -> if (b1, a1) > (b1, a1) then 1 else if (a1, b1) = (a1, b1) then 0 else -1)\n               list in\n  let rec loop t list =\n    match list with\n      [] -> true\n    | (a, b) :: rest ->\n       if t + a > b then false\n       else loop (t + a) rest\n  in\n  if loop 0 list then\n    print_endline \"Yes\"\n  else\n    print_endline \"No\"\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nKizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.\n\nLet the current time be time 0. Kizahashi has N jobs numbered 1 to N.\n\nIt takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.\n\nKizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.\n\nCan Kizahashi complete all the jobs in time? If he can, print Yes; if he cannot, print No.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i, B_i \\leq 10^9 (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n.\n.\n.\nA_N B_N\n\nOutput\n\nIf Kizahashi can complete all the jobs in time, print Yes; if he cannot, print No.\n\nSample Input 1\n\n5\n2 4\n1 9\n1 8\n4 9\n3 12\n\nSample Output 1\n\nYes\n\nHe can complete all the jobs in time by, for example, doing them in the following order:\n\nDo Job 2 from time 0 to 1.\n\nDo Job 1 from time 1 to 3.\n\nDo Job 4 from time 3 to 7.\n\nDo Job 3 from time 7 to 8.\n\nDo Job 5 from time 8 to 11.\n\nNote that it is fine to complete Job 3 exactly at the deadline, time 8.\n\nSample Input 2\n\n3\n334 1000\n334 1000\n334 1000\n\nSample Output 2\n\nNo\n\nHe cannot complete all the jobs in time, no matter what order he does them in.\n\nSample Input 3\n\n30\n384 8895\n1725 9791\n170 1024\n4 11105\n2 6\n578 1815\n702 3352\n143 5141\n1420 6980\n24 1602\n849 999\n76 7586\n85 5570\n444 4991\n719 11090\n470 10708\n1137 4547\n455 9003\n110 9901\n15 8578\n368 3692\n104 1286\n3 4\n366 12143\n7 6649\n610 2374\n152 7324\n4 7042\n292 11386\n334 5720\n\nSample Output 3\n\nYes", "sample_input": "5\n2 4\n1 9\n1 8\n4 9\n3 12\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02996", "source_text": "Score: 400 points\n\nProblem Statement\n\nKizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.\n\nLet the current time be time 0. Kizahashi has N jobs numbered 1 to N.\n\nIt takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.\n\nKizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.\n\nCan Kizahashi complete all the jobs in time? If he can, print Yes; if he cannot, print No.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i, B_i \\leq 10^9 (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n.\n.\n.\nA_N B_N\n\nOutput\n\nIf Kizahashi can complete all the jobs in time, print Yes; if he cannot, print No.\n\nSample Input 1\n\n5\n2 4\n1 9\n1 8\n4 9\n3 12\n\nSample Output 1\n\nYes\n\nHe can complete all the jobs in time by, for example, doing them in the following order:\n\nDo Job 2 from time 0 to 1.\n\nDo Job 1 from time 1 to 3.\n\nDo Job 4 from time 3 to 7.\n\nDo Job 3 from time 7 to 8.\n\nDo Job 5 from time 8 to 11.\n\nNote that it is fine to complete Job 3 exactly at the deadline, time 8.\n\nSample Input 2\n\n3\n334 1000\n334 1000\n334 1000\n\nSample Output 2\n\nNo\n\nHe cannot complete all the jobs in time, no matter what order he does them in.\n\nSample Input 3\n\n30\n384 8895\n1725 9791\n170 1024\n4 11105\n2 6\n578 1815\n702 3352\n143 5141\n1420 6980\n24 1602\n849 999\n76 7586\n85 5570\n444 4991\n719 11090\n470 10708\n1137 4547\n455 9003\n110 9901\n15 8578\n368 3692\n104 1286\n3 4\n366 12143\n7 6649\n610 2374\n152 7324\n4 7042\n292 11386\n334 5720\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 613, "memory_kb": 31168}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s757043704", "group_id": "codeNet:p02996", "input_text": "let () =\n    let main () =\n        let n = Scanf.sscanf (read_line ()) \"%d\" (fun n -> n) in\n        let ab = Array.init n (fun _ -> Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> b, a)) in\n        Array.sort compare ab;\n        let a = Array.init n (fun i -> snd ab.(i)) in\n        let b = Array.init n (fun i -> fst ab.(i)) in\n        let c = Array.make n 0 in\n        let rec loop time i =\n            if i < n then (\n                let time = time + a.(i) in\n                c.(i) <- time;\n                loop time (i + 1)\n            )\n        in\n        loop 0 0;\n        let rec loop i =\n            if i = n then \"Yes\" else if c.(i) > b.(i) then \"No\" else loop (i + 1)\n        in\n        print_endline (loop 0)\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1561232223, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s757043704.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s757043704", "user_id": "u342443598"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n    let main () =\n        let n = Scanf.sscanf (read_line ()) \"%d\" (fun n -> n) in\n        let ab = Array.init n (fun _ -> Scanf.sscanf (read_line ()) \"%d %d\" (fun a b -> b, a)) in\n        Array.sort compare ab;\n        let a = Array.init n (fun i -> snd ab.(i)) in\n        let b = Array.init n (fun i -> fst ab.(i)) in\n        let c = Array.make n 0 in\n        let rec loop time i =\n            if i < n then (\n                let time = time + a.(i) in\n                c.(i) <- time;\n                loop time (i + 1)\n            )\n        in\n        loop 0 0;\n        let rec loop i =\n            if i = n then \"Yes\" else if c.(i) > b.(i) then \"No\" else loop (i + 1)\n        in\n        print_endline (loop 0)\n    in\n    main ()", "problem_context": "Score: 400 points\n\nProblem Statement\n\nKizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.\n\nLet the current time be time 0. Kizahashi has N jobs numbered 1 to N.\n\nIt takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.\n\nKizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.\n\nCan Kizahashi complete all the jobs in time? If he can, print Yes; if he cannot, print No.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i, B_i \\leq 10^9 (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n.\n.\n.\nA_N B_N\n\nOutput\n\nIf Kizahashi can complete all the jobs in time, print Yes; if he cannot, print No.\n\nSample Input 1\n\n5\n2 4\n1 9\n1 8\n4 9\n3 12\n\nSample Output 1\n\nYes\n\nHe can complete all the jobs in time by, for example, doing them in the following order:\n\nDo Job 2 from time 0 to 1.\n\nDo Job 1 from time 1 to 3.\n\nDo Job 4 from time 3 to 7.\n\nDo Job 3 from time 7 to 8.\n\nDo Job 5 from time 8 to 11.\n\nNote that it is fine to complete Job 3 exactly at the deadline, time 8.\n\nSample Input 2\n\n3\n334 1000\n334 1000\n334 1000\n\nSample Output 2\n\nNo\n\nHe cannot complete all the jobs in time, no matter what order he does them in.\n\nSample Input 3\n\n30\n384 8895\n1725 9791\n170 1024\n4 11105\n2 6\n578 1815\n702 3352\n143 5141\n1420 6980\n24 1602\n849 999\n76 7586\n85 5570\n444 4991\n719 11090\n470 10708\n1137 4547\n455 9003\n110 9901\n15 8578\n368 3692\n104 1286\n3 4\n366 12143\n7 6649\n610 2374\n152 7324\n4 7042\n292 11386\n334 5720\n\nSample Output 3\n\nYes", "sample_input": "5\n2 4\n1 9\n1 8\n4 9\n3 12\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02996", "source_text": "Score: 400 points\n\nProblem Statement\n\nKizahashi, who was appointed as the administrator of ABC at National Problem Workshop in the Kingdom of AtCoder, got too excited and took on too many jobs.\n\nLet the current time be time 0. Kizahashi has N jobs numbered 1 to N.\n\nIt takes A_i units of time for Kizahashi to complete Job i. The deadline for Job i is time B_i, and he must complete the job before or at this time.\n\nKizahashi cannot work on two or more jobs simultaneously, but when he completes a job, he can start working on another immediately.\n\nCan Kizahashi complete all the jobs in time? If he can, print Yes; if he cannot, print No.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i, B_i \\leq 10^9 (1 \\leq i \\leq N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n.\n.\n.\nA_N B_N\n\nOutput\n\nIf Kizahashi can complete all the jobs in time, print Yes; if he cannot, print No.\n\nSample Input 1\n\n5\n2 4\n1 9\n1 8\n4 9\n3 12\n\nSample Output 1\n\nYes\n\nHe can complete all the jobs in time by, for example, doing them in the following order:\n\nDo Job 2 from time 0 to 1.\n\nDo Job 1 from time 1 to 3.\n\nDo Job 4 from time 3 to 7.\n\nDo Job 3 from time 7 to 8.\n\nDo Job 5 from time 8 to 11.\n\nNote that it is fine to complete Job 3 exactly at the deadline, time 8.\n\nSample Input 2\n\n3\n334 1000\n334 1000\n334 1000\n\nSample Output 2\n\nNo\n\nHe cannot complete all the jobs in time, no matter what order he does them in.\n\nSample Input 3\n\n30\n384 8895\n1725 9791\n170 1024\n4 11105\n2 6\n578 1815\n702 3352\n143 5141\n1420 6980\n24 1602\n849 999\n76 7586\n85 5570\n444 4991\n719 11090\n470 10708\n1137 4547\n455 9003\n110 9901\n15 8578\n368 3692\n104 1286\n3 4\n366 12143\n7 6649\n610 2374\n152 7324\n4 7042\n292 11386\n334 5720\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 739, "cpu_time_ms": 366, "memory_kb": 16132}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s443211612", "group_id": "codeNet:p02998", "input_text": "let scan_int () = Scanf.scanf \" %d\" (fun x -> x)\nlet print_int n = Printf.printf \"%d\\n\" n\n\nmodule Union_find :\n  sig\n    type t\n    val init  : int -> t\n    val get   : t -> int -> int\n    val find  : t -> int -> int\n    val size  : t -> int -> int\n    val unite : t -> int -> int -> unit\n    val same  : t -> int -> int -> bool\n  end =\n  struct\n    type t = int array\n    let init n = Array.make (n+1) (-1)\n    let get data x = data.(x)\n    let rec find data x =\n      if data.(x) < 0 then x\n      else let _ = data.(x) <- find data data.(x) in data.(x)\n    let size data x = - data.(find data x)\n    let unite data x y =\n      let x = find data x and y = find data y in\n      if x <> y then\n        if data.(x) < data.(y) then\n          let _ = data.(x) <- data.(x) + data.(y) in\n          data.(y) <- x\n        else\n          let _ = data.(y) <- data.(x) + data.(y) in\n          data.(x) <- y\n    let same data x y =\n      let x = find data x and y = find data y in (x == y)\n  end\n\nlet () =\n  let n = scan_int() in\n  let max_n = 100000 in\n  let v = Array.make (max_n+1) [] in\n  let uf = Union_find.init max_n in\n  let _ =\n    for i = 1 to n do\n      let a = scan_int() and b = scan_int() in\n      v.(a) <- b :: v.(a)\n    done in\n  let _ =\n    for i = 1 to max_n do\n      if List.length v.(i) > 1 then\n        let f x = Union_find.unite uf (List.hd v.(i)) x in\n        List.iter f v.(i)\n    done in\n  let rec calc arr i ret =\n    let ret =\n      if List.length v.(i) > 0 then ret + Union_find.size uf (List.hd v.(i))\n      else ret in\n    if i == max_n then ret\n    else calc arr (i+1) ret in\n  print_int (calc v 0 (-n))", "language": "OCaml", "metadata": {"date": 1565330542, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s443211612.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s443211612", "user_id": "u521364030"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let scan_int () = Scanf.scanf \" %d\" (fun x -> x)\nlet print_int n = Printf.printf \"%d\\n\" n\n\nmodule Union_find :\n  sig\n    type t\n    val init  : int -> t\n    val get   : t -> int -> int\n    val find  : t -> int -> int\n    val size  : t -> int -> int\n    val unite : t -> int -> int -> unit\n    val same  : t -> int -> int -> bool\n  end =\n  struct\n    type t = int array\n    let init n = Array.make (n+1) (-1)\n    let get data x = data.(x)\n    let rec find data x =\n      if data.(x) < 0 then x\n      else let _ = data.(x) <- find data data.(x) in data.(x)\n    let size data x = - data.(find data x)\n    let unite data x y =\n      let x = find data x and y = find data y in\n      if x <> y then\n        if data.(x) < data.(y) then\n          let _ = data.(x) <- data.(x) + data.(y) in\n          data.(y) <- x\n        else\n          let _ = data.(y) <- data.(x) + data.(y) in\n          data.(x) <- y\n    let same data x y =\n      let x = find data x and y = find data y in (x == y)\n  end\n\nlet () =\n  let n = scan_int() in\n  let max_n = 100000 in\n  let v = Array.make (max_n+1) [] in\n  let uf = Union_find.init max_n in\n  let _ =\n    for i = 1 to n do\n      let a = scan_int() and b = scan_int() in\n      v.(a) <- b :: v.(a)\n    done in\n  let _ =\n    for i = 1 to max_n do\n      if List.length v.(i) > 1 then\n        let f x = Union_find.unite uf (List.hd v.(i)) x in\n        List.iter f v.(i)\n    done in\n  let rec calc arr i ret =\n    let ret =\n      if List.length v.(i) > 0 then ret + Union_find.size uf (List.hd v.(i))\n      else ret in\n    if i == max_n then ret\n    else calc arr (i+1) ret in\n  print_int (calc v 0 (-n))", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere are N dots in a two-dimensional plane. The coordinates of the i-th dot are (x_i, y_i).\n\nWe will repeat the following operation as long as possible:\n\nChoose four integers a, b, c, d (a \\neq c, b \\neq d) such that there are dots at exactly three of the positions (a, b), (a, d), (c, b) and (c, d), and add a dot at the remaining position.\n\nWe can prove that we can only do this operation a finite number of times. Find the maximum number of times we can do the operation.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq x_i, y_i \\leq 10^5\n\nIf i \\neq j, x_i \\neq x_j or y_i \\neq y_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the maximum number of times we can do the operation.\n\nSample Input 1\n\n3\n1 1\n5 1\n5 5\n\nSample Output 1\n\n1\n\nBy choosing a = 1, b = 1, c = 5, d = 5, we can add a dot at (1, 5). We cannot do the operation any more, so the maximum number of operations is 1.\n\nSample Input 2\n\n2\n10 10\n20 20\n\nSample Output 2\n\n0\n\nThere are only two dots, so we cannot do the operation at all.\n\nSample Input 3\n\n9\n1 1\n2 1\n3 1\n4 1\n5 1\n1 2\n1 3\n1 4\n1 5\n\nSample Output 3\n\n16\n\nWe can do the operation for all choices of the form a = 1, b = 1, c = i, d = j (2 \\leq i,j \\leq 5), and no more. Thus, the maximum number of operations is 16.", "sample_input": "3\n1 1\n5 1\n5 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02998", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere are N dots in a two-dimensional plane. The coordinates of the i-th dot are (x_i, y_i).\n\nWe will repeat the following operation as long as possible:\n\nChoose four integers a, b, c, d (a \\neq c, b \\neq d) such that there are dots at exactly three of the positions (a, b), (a, d), (c, b) and (c, d), and add a dot at the remaining position.\n\nWe can prove that we can only do this operation a finite number of times. Find the maximum number of times we can do the operation.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq x_i, y_i \\leq 10^5\n\nIf i \\neq j, x_i \\neq x_j or y_i \\neq y_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the maximum number of times we can do the operation.\n\nSample Input 1\n\n3\n1 1\n5 1\n5 5\n\nSample Output 1\n\n1\n\nBy choosing a = 1, b = 1, c = 5, d = 5, we can add a dot at (1, 5). We cannot do the operation any more, so the maximum number of operations is 1.\n\nSample Input 2\n\n2\n10 10\n20 20\n\nSample Output 2\n\n0\n\nThere are only two dots, so we cannot do the operation at all.\n\nSample Input 3\n\n9\n1 1\n2 1\n3 1\n4 1\n5 1\n1 2\n1 3\n1 4\n1 5\n\nSample Output 3\n\n16\n\nWe can do the operation for all choices of the form a = 1, b = 1, c = i, d = j (2 \\leq i,j \\leq 5), and no more. Thus, the maximum number of operations is 16.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1622, "cpu_time_ms": 72, "memory_kb": 6912}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s860002119", "group_id": "codeNet:p02998", "input_text": "module M = Map.Make (struct type t = int let compare = compare end)\nmodule S = Set.Make (struct type t = int let compare = compare end)\n\nlet () =\n    let main () =\n        let n = Scanf.sscanf (read_line ()) \"%d\" (fun n -> n) in\n        let xy = Array.init n (fun _ -> Scanf.sscanf (read_line ()) \"%d %d\" (fun x y -> x, y)) in\n        let xmap = Array.fold_left (fun map (x, y) ->\n            M.add x (S.add y (try M.find x map with _ -> S.empty)) map) M.empty xy in\n        let ymap = Array.fold_left (fun map (x, y) ->\n            M.add y (S.add x (try M.find y map with _ -> S.empty)) map) M.empty xy in\n        let cx = Array.make 100002 true in\n        let cy = Array.make 100002 true in\n        let rec dfs_x px set ax ay =\n            cx.(px) <- false;\n            S.fold (fun py ((ax, ay) as acc) ->\n                if cy.(py) then dfs_y py (M.find py ymap) ax ay else acc) set (ax + 1, ay)\n        and dfs_y py set ax ay =\n            cy.(py) <- false;\n            S.fold (fun px ((ax, ay) as acc) ->\n                if cx.(px) then dfs_x px (M.find px xmap) ax ay else acc) set (ax, ay + 1)\n        in\n        let acc = M.fold (fun x set acc ->\n            if cx.(x) && S.cardinal set > 0 then let sx, sy = dfs_x x set 0 0 in acc + sx * sy else acc) xmap 0 in\n        let acc = M.fold (fun y set acc ->\n            if cy.(y) && S.cardinal set > 0 then let sx, sy = dfs_y y set 0 0 in acc + sx * sy else acc) ymap acc in\n        Printf.printf \"%d\\n\" (acc - n)\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1561418744, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s860002119.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s860002119", "user_id": "u342443598"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "module M = Map.Make (struct type t = int let compare = compare end)\nmodule S = Set.Make (struct type t = int let compare = compare end)\n\nlet () =\n    let main () =\n        let n = Scanf.sscanf (read_line ()) \"%d\" (fun n -> n) in\n        let xy = Array.init n (fun _ -> Scanf.sscanf (read_line ()) \"%d %d\" (fun x y -> x, y)) in\n        let xmap = Array.fold_left (fun map (x, y) ->\n            M.add x (S.add y (try M.find x map with _ -> S.empty)) map) M.empty xy in\n        let ymap = Array.fold_left (fun map (x, y) ->\n            M.add y (S.add x (try M.find y map with _ -> S.empty)) map) M.empty xy in\n        let cx = Array.make 100002 true in\n        let cy = Array.make 100002 true in\n        let rec dfs_x px set ax ay =\n            cx.(px) <- false;\n            S.fold (fun py ((ax, ay) as acc) ->\n                if cy.(py) then dfs_y py (M.find py ymap) ax ay else acc) set (ax + 1, ay)\n        and dfs_y py set ax ay =\n            cy.(py) <- false;\n            S.fold (fun px ((ax, ay) as acc) ->\n                if cx.(px) then dfs_x px (M.find px xmap) ax ay else acc) set (ax, ay + 1)\n        in\n        let acc = M.fold (fun x set acc ->\n            if cx.(x) && S.cardinal set > 0 then let sx, sy = dfs_x x set 0 0 in acc + sx * sy else acc) xmap 0 in\n        let acc = M.fold (fun y set acc ->\n            if cy.(y) && S.cardinal set > 0 then let sx, sy = dfs_y y set 0 0 in acc + sx * sy else acc) ymap acc in\n        Printf.printf \"%d\\n\" (acc - n)\n    in\n    main ()", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1487, "cpu_time_ms": 409, "memory_kb": 37628}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s661660037", "group_id": "codeNet:p02998", "input_text": "let n = read_int ();;\n\ntype unionfind = { size : int array; parent : int array };;\nlet init_unionfind n = {size = Array.make n 1; parent = Array.init n (fun i -> i)};;\nlet rec find uf x = (\n    if uf.parent.(x) = x then\n      x\n    else (\n      let y = find uf (uf.parent.(x)) in\n      uf.parent.(x) <- y;\n      y\n    )\n  );;\nlet unite uf x y = (\n    let x = find uf x in\n    let y = find uf y in\n    if x <> y then (\n      let x, y = if uf.size.(x) > uf.size.(y) then x, y else y, x in\n      uf.size.(x) <- uf.size.(x) + uf.size.(y);\n      uf.parent.(y) <- x;\n    );\n  );;\n\nlet uf = init_unionfind 200000;;\n\nfor i = 0 to n - 1 do\n  let x, y = Scanf.scanf \" %d %d\" (fun x y -> x - 1, y - 1 + 100000) in\n  unite uf x y\ndone\n\nlet row = Array.make 200000 0;;\nlet col = Array.make 200000 0;;\n\nfor i = 0 to 99999 do\n  let j = find uf i in\n  row.(j) <- row.(j) + 1;\ndone;;\n\nfor i = 100000 to 199999 do\n  let j = find uf i in\n  col.(j) <- col.(j) + 1;\ndone;;\n\nlet ans = ref (-n);;\nfor i = 0 to 199999 do\n  ans := !ans + row.(i) * col.(i);\ndone;;\n\nPrintf.printf \"%d\\n\" !ans;;\n", "language": "OCaml", "metadata": {"date": 1561377624, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s661660037.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s661660037", "user_id": "u006493569"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let n = read_int ();;\n\ntype unionfind = { size : int array; parent : int array };;\nlet init_unionfind n = {size = Array.make n 1; parent = Array.init n (fun i -> i)};;\nlet rec find uf x = (\n    if uf.parent.(x) = x then\n      x\n    else (\n      let y = find uf (uf.parent.(x)) in\n      uf.parent.(x) <- y;\n      y\n    )\n  );;\nlet unite uf x y = (\n    let x = find uf x in\n    let y = find uf y in\n    if x <> y then (\n      let x, y = if uf.size.(x) > uf.size.(y) then x, y else y, x in\n      uf.size.(x) <- uf.size.(x) + uf.size.(y);\n      uf.parent.(y) <- x;\n    );\n  );;\n\nlet uf = init_unionfind 200000;;\n\nfor i = 0 to n - 1 do\n  let x, y = Scanf.scanf \" %d %d\" (fun x y -> x - 1, y - 1 + 100000) in\n  unite uf x y\ndone\n\nlet row = Array.make 200000 0;;\nlet col = Array.make 200000 0;;\n\nfor i = 0 to 99999 do\n  let j = find uf i in\n  row.(j) <- row.(j) + 1;\ndone;;\n\nfor i = 100000 to 199999 do\n  let j = find uf i in\n  col.(j) <- col.(j) + 1;\ndone;;\n\nlet ans = ref (-n);;\nfor i = 0 to 199999 do\n  ans := !ans + row.(i) * col.(i);\ndone;;\n\nPrintf.printf \"%d\\n\" !ans;;\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere are N dots in a two-dimensional plane. The coordinates of the i-th dot are (x_i, y_i).\n\nWe will repeat the following operation as long as possible:\n\nChoose four integers a, b, c, d (a \\neq c, b \\neq d) such that there are dots at exactly three of the positions (a, b), (a, d), (c, b) and (c, d), and add a dot at the remaining position.\n\nWe can prove that we can only do this operation a finite number of times. Find the maximum number of times we can do the operation.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq x_i, y_i \\leq 10^5\n\nIf i \\neq j, x_i \\neq x_j or y_i \\neq y_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the maximum number of times we can do the operation.\n\nSample Input 1\n\n3\n1 1\n5 1\n5 5\n\nSample Output 1\n\n1\n\nBy choosing a = 1, b = 1, c = 5, d = 5, we can add a dot at (1, 5). We cannot do the operation any more, so the maximum number of operations is 1.\n\nSample Input 2\n\n2\n10 10\n20 20\n\nSample Output 2\n\n0\n\nThere are only two dots, so we cannot do the operation at all.\n\nSample Input 3\n\n9\n1 1\n2 1\n3 1\n4 1\n5 1\n1 2\n1 3\n1 4\n1 5\n\nSample Output 3\n\n16\n\nWe can do the operation for all choices of the form a = 1, b = 1, c = i, d = j (2 \\leq i,j \\leq 5), and no more. Thus, the maximum number of operations is 16.", "sample_input": "3\n1 1\n5 1\n5 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02998", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere are N dots in a two-dimensional plane. The coordinates of the i-th dot are (x_i, y_i).\n\nWe will repeat the following operation as long as possible:\n\nChoose four integers a, b, c, d (a \\neq c, b \\neq d) such that there are dots at exactly three of the positions (a, b), (a, d), (c, b) and (c, d), and add a dot at the remaining position.\n\nWe can prove that we can only do this operation a finite number of times. Find the maximum number of times we can do the operation.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq x_i, y_i \\leq 10^5\n\nIf i \\neq j, x_i \\neq x_j or y_i \\neq y_j.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the maximum number of times we can do the operation.\n\nSample Input 1\n\n3\n1 1\n5 1\n5 5\n\nSample Output 1\n\n1\n\nBy choosing a = 1, b = 1, c = 5, d = 5, we can add a dot at (1, 5). We cannot do the operation any more, so the maximum number of operations is 1.\n\nSample Input 2\n\n2\n10 10\n20 20\n\nSample Output 2\n\n0\n\nThere are only two dots, so we cannot do the operation at all.\n\nSample Input 3\n\n9\n1 1\n2 1\n3 1\n4 1\n5 1\n1 2\n1 3\n1 4\n1 5\n\nSample Output 3\n\n16\n\nWe can do the operation for all choices of the form a = 1, b = 1, c = i, d = j (2 \\leq i,j \\leq 5), and no more. Thus, the maximum number of operations is 16.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1068, "cpu_time_ms": 58, "memory_kb": 10240}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s094975503", "group_id": "codeNet:p02999", "input_text": "open Printf\nopen Scanf\n\nlet solve x a = if x >= a then 10 else 0\n\nlet () =\n  scanf \"%d %d \" solve |> printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1582558792, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s094975503.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s094975503", "user_id": "u388783188"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve x a = if x >= a then 10 else 0\n\nlet () =\n  scanf \"%d %d \" solve |> printf \"%d\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nX and A are integers between 0 and 9 (inclusive).\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nConstraints\n\n0 \\leq X, A \\leq 9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A\n\nOutput\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nSample Input 1\n\n3 5\n\nSample Output 1\n\n0\n\n3 is less than 5, so we should print 0.\n\nSample Input 2\n\n7 5\n\nSample Output 2\n\n10\n\n7 is not less than 5, so we should print 10.\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n10\n\n6 is not less than 6, so we should print 10.", "sample_input": "3 5\n"}, "reference_outputs": ["0\n"], "source_document_id": "p02999", "source_text": "Score : 100 points\n\nProblem Statement\n\nX and A are integers between 0 and 9 (inclusive).\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nConstraints\n\n0 \\leq X, A \\leq 9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A\n\nOutput\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nSample Input 1\n\n3 5\n\nSample Output 1\n\n0\n\n3 is less than 5, so we should print 0.\n\nSample Input 2\n\n7 5\n\nSample Output 2\n\n10\n\n7 is not less than 5, so we should print 10.\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n10\n\n6 is not less than 6, so we should print 10.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 115, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s455832385", "group_id": "codeNet:p02999", "input_text": "let () = Scanf.scanf \"%d %d\" @@ fun x a -> Printf.printf \"%d\" @@ if x < a then 0 else 10\n", "language": "OCaml", "metadata": {"date": 1560711696, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s455832385.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s455832385", "user_id": "u604818425"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\" @@ fun x a -> Printf.printf \"%d\" @@ if x < a then 0 else 10\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nX and A are integers between 0 and 9 (inclusive).\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nConstraints\n\n0 \\leq X, A \\leq 9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A\n\nOutput\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nSample Input 1\n\n3 5\n\nSample Output 1\n\n0\n\n3 is less than 5, so we should print 0.\n\nSample Input 2\n\n7 5\n\nSample Output 2\n\n10\n\n7 is not less than 5, so we should print 10.\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n10\n\n6 is not less than 6, so we should print 10.", "sample_input": "3 5\n"}, "reference_outputs": ["0\n"], "source_document_id": "p02999", "source_text": "Score : 100 points\n\nProblem Statement\n\nX and A are integers between 0 and 9 (inclusive).\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nConstraints\n\n0 \\leq X, A \\leq 9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A\n\nOutput\n\nIf X is less than A, print 0; if X is not less than A, print 10.\n\nSample Input 1\n\n3 5\n\nSample Output 1\n\n0\n\n3 is less than 5, so we should print 0.\n\nSample Input 2\n\n7 5\n\nSample Output 2\n\n10\n\n7 is not less than 5, so we should print 10.\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n10\n\n6 is not less than 6, so we should print 10.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 89, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s705023764", "group_id": "codeNet:p03000", "input_text": "let n, x = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet ls = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet d = ref 0\nlet ans = ref 0\nlet _ =\n  for i = 0 to n - 1 do\n    if !d <= x then incr ans;\n    d := !d + ls.(i)\n  done;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1560712058, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s705023764.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s705023764", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let n, x = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet ls = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet d = ref 0\nlet ans = ref 0\nlet _ =\n  for i = 0 to n - 1 do\n    if !d <= x then incr ans;\n    d := !d + ls.(i)\n  done;\n  Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \\leq i \\leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.\n\nHow many times will the ball make a bounce where the coordinate is at most X?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 100\n\n1 \\leq X \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nL_1 L_2 ... L_{N-1} L_N\n\nOutput\n\nPrint the number of times the ball will make a bounce where the coordinate is at most X.\n\nSample Input 1\n\n3 6\n3 4 5\n\nSample Output 1\n\n2\n\nThe ball will make a bounce at the coordinates 0, 3, 7 and 12, among which two are less than or equal to 6.\n\nSample Input 2\n\n4 9\n3 3 3 3\n\nSample Output 2\n\n4\n\nThe ball will make a bounce at the coordinates 0, 3, 6, 9 and 12, among which four are less than or equal to 9.", "sample_input": "3 6\n3 4 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03000", "source_text": "Score : 200 points\n\nProblem Statement\n\nA ball will bounce along a number line, making N + 1 bounces. It will make the first bounce at coordinate D_1 = 0, and the i-th bounce (2 \\leq i \\leq N+1) at coordinate D_i = D_{i-1} + L_{i-1}.\n\nHow many times will the ball make a bounce where the coordinate is at most X?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 100\n\n1 \\leq X \\leq 10000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nL_1 L_2 ... L_{N-1} L_N\n\nOutput\n\nPrint the number of times the ball will make a bounce where the coordinate is at most X.\n\nSample Input 1\n\n3 6\n3 4 5\n\nSample Output 1\n\n2\n\nThe ball will make a bounce at the coordinates 0, 3, 7 and 12, among which two are less than or equal to 6.\n\nSample Input 2\n\n4 9\n3 3 3 3\n\nSample Output 2\n\n4\n\nThe ball will make a bounce at the coordinates 0, 3, 6, 9 and 12, among which four are less than or equal to 9.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 260, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s102619655", "group_id": "codeNet:p03001", "input_text": "let w, h, x, y = Scanf.scanf \" %d %d %d %d\" @@ fun a b c d -> a, b, c, d\nlet _ =\n  if x * 2 = w || y * 2 = h || x = 0 || y = 0 || h * x = w * y then\n    (Printf.printf \"%.12f \" @@ float w *. float h /. 2.;\n    print_endline @@ if x * 2 = w && y * 2 = h then \"1\" else \"0\")\n  else\n    Printf.printf \"%.12f 0\\n\" @@ float @@ max (min x (w - x) * h) (min y (h - y) * w)", "language": "OCaml", "metadata": {"date": 1560714790, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s102619655.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s102619655", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3.000000 0\n", "input_to_evaluate": "let w, h, x, y = Scanf.scanf \" %d %d %d %d\" @@ fun a b c d -> a, b, c, d\nlet _ =\n  if x * 2 = w || y * 2 = h || x = 0 || y = 0 || h * x = w * y then\n    (Printf.printf \"%.12f \" @@ float w *. float h /. 2.;\n    print_endline @@ if x * 2 = w && y * 2 = h then \"1\" else \"0\")\n  else\n    Printf.printf \"%.12f 0\\n\" @@ float @@ max (min x (w - x) * h) (min y (h - y) * w)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H).\nYou are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the part whose area is not larger than that of the other. Additionally, determine if there are multiple ways to cut the rectangle and achieve that maximum.\n\nConstraints\n\n1 \\leq W,H \\leq 10^9\n\n0\\leq x\\leq W\n\n0\\leq y\\leq H\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nW H x y\n\nOutput\n\nPrint the maximum possible area of the part whose area is not larger than that of the other, followed by 1 if there are multiple ways to cut the rectangle and achieve that maximum, and 0 otherwise.\n\nThe area printed will be judged correct when its absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n2 3 1 2\n\nSample Output 1\n\n3.000000 0\n\nThe line x=1 gives the optimal cut, and no other line does.\n\nSample Input 2\n\n2 2 1 1\n\nSample Output 2\n\n2.000000 1", "sample_input": "2 3 1 2\n"}, "reference_outputs": ["3.000000 0\n"], "source_document_id": "p03001", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a rectangle in a coordinate plane. The coordinates of the four vertices are (0,0), (W,0), (W,H), and (0,H).\nYou are given a point (x,y) which is within the rectangle or on its border. We will draw a straight line passing through (x,y) to cut the rectangle into two parts. Find the maximum possible area of the part whose area is not larger than that of the other. Additionally, determine if there are multiple ways to cut the rectangle and achieve that maximum.\n\nConstraints\n\n1 \\leq W,H \\leq 10^9\n\n0\\leq x\\leq W\n\n0\\leq y\\leq H\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nW H x y\n\nOutput\n\nPrint the maximum possible area of the part whose area is not larger than that of the other, followed by 1 if there are multiple ways to cut the rectangle and achieve that maximum, and 0 otherwise.\n\nThe area printed will be judged correct when its absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n2 3 1 2\n\nSample Output 1\n\n3.000000 0\n\nThe line x=1 gives the optimal cut, and no other line does.\n\nSample Input 2\n\n2 2 1 1\n\nSample Output 2\n\n2.000000 1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 364, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s248086419", "group_id": "codeNet:p03003", "input_text": "let m = 1000000007\nlet ( +^ ) x y = (x + y) mod m\nlet ( -^ ) x y = x +^ (m - y)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let ss = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun s -> s in\n  let ts = Array.init m @@ fun _ -> Scanf.scanf \"%d \" @@ fun t -> t in\n  let dp = Array.make_matrix (n + 1) (m + 1) 1 in\n  for i = 0 to n - 1 do\n    for j = 0 to m - 1 do\n      dp.(i + 1).(j + 1) <-\n        dp.(i).(j + 1) +^ dp.(i + 1).(j)\n        -^ if ss.(i) = ts.(j) then 0 else dp.(i).(j)\n    done\n  done;\n  Printf.printf \"%d\\n\" dp.(n).(m)\n", "language": "OCaml", "metadata": {"date": 1561084400, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s248086419.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s248086419", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let m = 1000000007\nlet ( +^ ) x y = (x + y) mod m\nlet ( -^ ) x y = x +^ (m - y)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let ss = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun s -> s in\n  let ts = Array.init m @@ fun _ -> Scanf.scanf \"%d \" @@ fun t -> t in\n  let dp = Array.make_matrix (n + 1) (m + 1) 1 in\n  for i = 0 to n - 1 do\n    for j = 0 to m - 1 do\n      dp.(i + 1).(j + 1) <-\n        dp.(i).(j + 1) +^ dp.(i + 1).(j)\n        -^ if ss.(i) = ts.(j) then 0 else dp.(i).(j)\n    done\n  done;\n  Printf.printf \"%d\\n\" dp.(n).(m)\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 541, "cpu_time_ms": 88, "memory_kb": 33404}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s381835067", "group_id": "codeNet:p03005", "input_text": "let n, k = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet _ = Printf.printf \"%d\\n\" @@ if k = 1 then 0 else n - k", "language": "OCaml", "metadata": {"date": 1560696403, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s381835067.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s381835067", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let n, k = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet _ = Printf.printf \"%d\\n\" @@ if k = 1 then 0 else n - k", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s032118917", "group_id": "codeNet:p03007", "input_text": "(* O(n) *)\nlet n = Scanf.scanf \" %d\" @@ (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet ps = Array.make_matrix 2 n 0\nlet pc = Array.make 2 0\nlet ms = [|[|max_int; min_int|]; [|max_int; min_int|]|]\nlet mis = Array.make_matrix 2 2 0\nlet ds = Array.make_matrix 2 n false\nlet xys = ref []\nlet f i a =\n  let j = if a < 0 then 1 else 0 in\n  ps.(j).(pc.(j)) <- a; pc.(j) <- pc.(j) + 1;\n  if a < ms.(j).(0) then (ms.(j).(0) <- a; mis.(j).(0) <- i);\n  if a >= ms.(j).(1) then (ms.(j).(1) <- a; mis.(j).(1) <- i)\nlet show_result () =\n  Printf.printf \"%d\\n\" ps.(0).(0);\n  List.rev !xys |> List.iter (fun (x, y) -> Printf.printf \"%d %d\\n\" x y)\nlet g () =\n  for i = 2 to pc.(0) - 1 do\n    let x, y = ps.(0).(1), ps.(0).(i) in\n    xys := (x, y) :: !xys;\n    ps.(0).(1) <- x - y\n  done;\n  let x, y = ps.(0).(0), ps.(0).(1) in\n  xys := (x, y) :: !xys;\n  show_result ()\nlet _ =\n  Array.iteri f a_s;\n  let i, j, k, l = if pc.(0) = 0 then 0, 1, 1, 0 else if pc.(1) = 0 then 1, 0, 0, 1 else -1, -1, -1, -1 in\n  if i <> -1 then\n    (if pc.(j) = 2 then\n      let x, y = max ps.(j).(0) ps.(j).(1), min ps.(j).(0) ps.(j).(1) in\n      Printf.printf \"%d\\n%d %d\\n\" (x - y) x y; exit 0\n    else ();\n    let x, y = ps.(j).(mis.(j).(k)), ps.(j).(mis.(j).(l)) in\n    if x = y && i = 1 then (g (); exit 0);\n    xys := (x, y) :: !xys;\n    ds.(j).(mis.(j).(k)) <- true;\n    ds.(j).(mis.(j).(l)) <- true;\n    ps.(i).(0) <- x - y;\n    pc.(i) <- 1)\n  else ();\n  let h (i0, j0) =\n    for i = i0 to pc.(1 - j0) - 1 do\n      if not ds.(1 - j0).(i) then\n        let x, y = ps.(j0).(0), ps.(1 - j0).(i) in\n        xys := (x, y) :: !xys;\n        ps.(j0).(0) <- x - y;\n        ds.(1 - j0).(i) <- true;\n    done in\n  List.iter h [1, 1; 0, 0]; show_result ()", "language": "OCaml", "metadata": {"date": 1560687182, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s032118917.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s032118917", "user_id": "u732304692"}, "prompt_components": {"gold_output": "4\n-1 1\n2 -2\n", "input_to_evaluate": "(* O(n) *)\nlet n = Scanf.scanf \" %d\" @@ (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet ps = Array.make_matrix 2 n 0\nlet pc = Array.make 2 0\nlet ms = [|[|max_int; min_int|]; [|max_int; min_int|]|]\nlet mis = Array.make_matrix 2 2 0\nlet ds = Array.make_matrix 2 n false\nlet xys = ref []\nlet f i a =\n  let j = if a < 0 then 1 else 0 in\n  ps.(j).(pc.(j)) <- a; pc.(j) <- pc.(j) + 1;\n  if a < ms.(j).(0) then (ms.(j).(0) <- a; mis.(j).(0) <- i);\n  if a >= ms.(j).(1) then (ms.(j).(1) <- a; mis.(j).(1) <- i)\nlet show_result () =\n  Printf.printf \"%d\\n\" ps.(0).(0);\n  List.rev !xys |> List.iter (fun (x, y) -> Printf.printf \"%d %d\\n\" x y)\nlet g () =\n  for i = 2 to pc.(0) - 1 do\n    let x, y = ps.(0).(1), ps.(0).(i) in\n    xys := (x, y) :: !xys;\n    ps.(0).(1) <- x - y\n  done;\n  let x, y = ps.(0).(0), ps.(0).(1) in\n  xys := (x, y) :: !xys;\n  show_result ()\nlet _ =\n  Array.iteri f a_s;\n  let i, j, k, l = if pc.(0) = 0 then 0, 1, 1, 0 else if pc.(1) = 0 then 1, 0, 0, 1 else -1, -1, -1, -1 in\n  if i <> -1 then\n    (if pc.(j) = 2 then\n      let x, y = max ps.(j).(0) ps.(j).(1), min ps.(j).(0) ps.(j).(1) in\n      Printf.printf \"%d\\n%d %d\\n\" (x - y) x y; exit 0\n    else ();\n    let x, y = ps.(j).(mis.(j).(k)), ps.(j).(mis.(j).(l)) in\n    if x = y && i = 1 then (g (); exit 0);\n    xys := (x, y) :: !xys;\n    ds.(j).(mis.(j).(k)) <- true;\n    ds.(j).(mis.(j).(l)) <- true;\n    ps.(i).(0) <- x - y;\n    pc.(i) <- 1)\n  else ();\n  let h (i0, j0) =\n    for i = i0 to pc.(1 - j0) - 1 do\n      if not ds.(1 - j0).(i) then\n        let x, y = ps.(j0).(0), ps.(1 - j0).(i) in\n        xys := (x, y) :: !xys;\n        ps.(j0).(0) <- x - y;\n        ds.(1 - j0).(i) <- true;\n    done in\n  List.iter h [1, 1; 0, 0]; show_result ()", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1736, "cpu_time_ms": 90, "memory_kb": 16128}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s875322534", "group_id": "codeNet:p03011", "input_text": "let p, q, r = Scanf.scanf \"%d %d %d\\n\" @@ fun a b c -> a, b, c\nlet ans = min (min (p + q) (q + r)) (p + r)\nlet () = print_int ans", "language": "OCaml", "metadata": {"date": 1588260049, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s875322534.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s875322534", "user_id": "u307426615"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let p, q, r = Scanf.scanf \"%d %d %d\\n\" @@ fun a b c -> a, b, c\nlet ans = min (min (p + q) (q + r)) (p + r)\nlet () = print_int ans", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are three airports A, B and C, and flights between each pair of airports in both directions.\n\nA one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.\n\nConsider a route where we start at one of the airports, fly to another airport and then fly to the other airport.\n\nWhat is the minimum possible sum of the flight times?\n\nConstraints\n\n1 \\leq P,Q,R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nP Q R\n\nOutput\n\nPrint the minimum possible sum of the flight times.\n\nSample Input 1\n\n1 3 4\n\nSample Output 1\n\n4\n\nThe sum of the flight times in the route A \\rightarrow B \\rightarrow C: 1 + 3 = 4 hours\n\nThe sum of the flight times in the route A \\rightarrow C \\rightarrow C: 4 + 3 = 7 hours\n\nThe sum of the flight times in the route B \\rightarrow A \\rightarrow C: 1 + 4 = 5 hours\n\nThe sum of the flight times in the route B \\rightarrow C \\rightarrow A: 3 + 4 = 7 hours\n\nThe sum of the flight times in the route C \\rightarrow A \\rightarrow B: 4 + 1 = 5 hours\n\nThe sum of the flight times in the route C \\rightarrow B \\rightarrow A: 3 + 1 = 4 hours\n\nThe minimum of these is 4 hours.\n\nSample Input 2\n\n3 2 3\n\nSample Output 2\n\n5", "sample_input": "1 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03011", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are three airports A, B and C, and flights between each pair of airports in both directions.\n\nA one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.\n\nConsider a route where we start at one of the airports, fly to another airport and then fly to the other airport.\n\nWhat is the minimum possible sum of the flight times?\n\nConstraints\n\n1 \\leq P,Q,R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nP Q R\n\nOutput\n\nPrint the minimum possible sum of the flight times.\n\nSample Input 1\n\n1 3 4\n\nSample Output 1\n\n4\n\nThe sum of the flight times in the route A \\rightarrow B \\rightarrow C: 1 + 3 = 4 hours\n\nThe sum of the flight times in the route A \\rightarrow C \\rightarrow C: 4 + 3 = 7 hours\n\nThe sum of the flight times in the route B \\rightarrow A \\rightarrow C: 1 + 4 = 5 hours\n\nThe sum of the flight times in the route B \\rightarrow C \\rightarrow A: 3 + 4 = 7 hours\n\nThe sum of the flight times in the route C \\rightarrow A \\rightarrow B: 4 + 1 = 5 hours\n\nThe sum of the flight times in the route C \\rightarrow B \\rightarrow A: 3 + 1 = 4 hours\n\nThe minimum of these is 4 hours.\n\nSample Input 2\n\n3 2 3\n\nSample Output 2\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 129, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s088011422", "group_id": "codeNet:p03011", "input_text": "module A = Array\nmodule C = Char\nmodule I = Int64\nmodule L = List\nmodule Q = Queue\n\nlet pf = Printf.printf\n\nlet read_int () = Scanf.scanf \"%d \" (fun x -> x)\nlet read_float () = Scanf.scanf \"%f \" (fun x -> x)\nlet read_string () = Scanf.scanf \"%s \" (fun x -> x)\nlet read_array read n = A.init n (fun _ -> read ())\n\nlet range s t = A.init (t - s) @@ (+) s\nlet foreach fold_f init s t map_f =\n  range s t |> A.map map_f |> A.fold_left fold_f init\n\nmodule S = struct\n  include String\n  let of_array a = String.init (A.length a) (A.get a)\n  let to_array s = A.init (String.length s) (String.get s)\nend;;\n\nlet () =\n  let p = read_int () in\n  let q = read_int () in\n  let r = read_int () in\n  let res = L.fold_left min max_int [p + q; q + r; r + p] in\n  Printf.printf \"%d\\n\" res\n", "language": "OCaml", "metadata": {"date": 1560648291, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s088011422.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s088011422", "user_id": "u415839823"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "module A = Array\nmodule C = Char\nmodule I = Int64\nmodule L = List\nmodule Q = Queue\n\nlet pf = Printf.printf\n\nlet read_int () = Scanf.scanf \"%d \" (fun x -> x)\nlet read_float () = Scanf.scanf \"%f \" (fun x -> x)\nlet read_string () = Scanf.scanf \"%s \" (fun x -> x)\nlet read_array read n = A.init n (fun _ -> read ())\n\nlet range s t = A.init (t - s) @@ (+) s\nlet foreach fold_f init s t map_f =\n  range s t |> A.map map_f |> A.fold_left fold_f init\n\nmodule S = struct\n  include String\n  let of_array a = String.init (A.length a) (A.get a)\n  let to_array s = A.init (String.length s) (String.get s)\nend;;\n\nlet () =\n  let p = read_int () in\n  let q = read_int () in\n  let r = read_int () in\n  let res = L.fold_left min max_int [p + q; q + r; r + p] in\n  Printf.printf \"%d\\n\" res\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are three airports A, B and C, and flights between each pair of airports in both directions.\n\nA one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.\n\nConsider a route where we start at one of the airports, fly to another airport and then fly to the other airport.\n\nWhat is the minimum possible sum of the flight times?\n\nConstraints\n\n1 \\leq P,Q,R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nP Q R\n\nOutput\n\nPrint the minimum possible sum of the flight times.\n\nSample Input 1\n\n1 3 4\n\nSample Output 1\n\n4\n\nThe sum of the flight times in the route A \\rightarrow B \\rightarrow C: 1 + 3 = 4 hours\n\nThe sum of the flight times in the route A \\rightarrow C \\rightarrow C: 4 + 3 = 7 hours\n\nThe sum of the flight times in the route B \\rightarrow A \\rightarrow C: 1 + 4 = 5 hours\n\nThe sum of the flight times in the route B \\rightarrow C \\rightarrow A: 3 + 4 = 7 hours\n\nThe sum of the flight times in the route C \\rightarrow A \\rightarrow B: 4 + 1 = 5 hours\n\nThe sum of the flight times in the route C \\rightarrow B \\rightarrow A: 3 + 1 = 4 hours\n\nThe minimum of these is 4 hours.\n\nSample Input 2\n\n3 2 3\n\nSample Output 2\n\n5", "sample_input": "1 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03011", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are three airports A, B and C, and flights between each pair of airports in both directions.\n\nA one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.\n\nConsider a route where we start at one of the airports, fly to another airport and then fly to the other airport.\n\nWhat is the minimum possible sum of the flight times?\n\nConstraints\n\n1 \\leq P,Q,R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nP Q R\n\nOutput\n\nPrint the minimum possible sum of the flight times.\n\nSample Input 1\n\n1 3 4\n\nSample Output 1\n\n4\n\nThe sum of the flight times in the route A \\rightarrow B \\rightarrow C: 1 + 3 = 4 hours\n\nThe sum of the flight times in the route A \\rightarrow C \\rightarrow C: 4 + 3 = 7 hours\n\nThe sum of the flight times in the route B \\rightarrow A \\rightarrow C: 1 + 4 = 5 hours\n\nThe sum of the flight times in the route B \\rightarrow C \\rightarrow A: 3 + 4 = 7 hours\n\nThe sum of the flight times in the route C \\rightarrow A \\rightarrow B: 4 + 1 = 5 hours\n\nThe sum of the flight times in the route C \\rightarrow B \\rightarrow A: 3 + 1 = 4 hours\n\nThe minimum of these is 4 hours.\n\nSample Input 2\n\n3 2 3\n\nSample Output 2\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 771, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s604211614", "group_id": "codeNet:p03013", "input_text": "open List \n(* 1行読み込みする関数 *)\n(* i_inp : 1行読み込んで整数に変換, f_inp, s_inpもある *)\nlet inp : unit -> string = fun () -> \n\tinput_line stdin\nlet s_inp = inp\nlet i_inp : unit -> int = fun () ->\n\tint_of_string (inp ())\nlet f_inp : unit -> float = fun () ->\n\tfloat_of_string (inp ())\n \n(* 1行読み込んで、空白で分割する関数 *)\nlet inp_list : unit -> string list = fun () ->\n\tStr.split (Str.regexp \" \") (inp ())\nlet s_inp_list : unit -> string list = inp_list\nlet i_inp_list : unit -> int list = fun () ->\n\tmap (fun x -> int_of_string x) (inp_list ())\nlet f_inp_list : unit -> float list = fun () ->\n  map (fun x -> float_of_string x) (inp_list ())\n\n(* n行読み込む関数 *)\nlet rec inp_loop : (unit -> 'a) -> int -> 'a list = fun inp_fun n ->\n  if n = 0 then []\n  else\n    let x = inp_fun () in\n    x :: inp_loop inp_fun (n - 1)\n\n      \n(* 関数本体 *)\nlet () =\n  let [n; m] = i_inp_list () in\n  let brokens = Array.make (n + 1) false in\n  let rec inp_loop m =\n    if m = 0 then ()\n    else\n      let x = i_inp () in\n      (brokens.(x) <- true;\n       inp_loop (m - 1)) in\n  let () = inp_loop m in\n  let memo = Array.make (n + 1) None in\n  let rec loop a =\n    match memo.(a) with\n      None ->\n       if brokens.(a) then 0\n       else\n         if a + 2 <= n then\n           let x = (loop (a + 1) + loop (a + 2)) mod 1000000007 in\n           memo.(a) <- Some x;\n           x\n         else if a + 1 <= n then\n           let x = (loop (a + 1)) mod 1000000007 in\n           memo.(a) <- Some x;\n          x\n         else\n           (memo.(a) <- Some 1;\n            1)\n    | Some x -> x\n  in\n  print_int (loop 0);\n  print_newline ()\n", "language": "OCaml", "metadata": {"date": 1560615541, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s604211614.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s604211614", "user_id": "u977566741"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "open List \n(* 1行読み込みする関数 *)\n(* i_inp : 1行読み込んで整数に変換, f_inp, s_inpもある *)\nlet inp : unit -> string = fun () -> \n\tinput_line stdin\nlet s_inp = inp\nlet i_inp : unit -> int = fun () ->\n\tint_of_string (inp ())\nlet f_inp : unit -> float = fun () ->\n\tfloat_of_string (inp ())\n \n(* 1行読み込んで、空白で分割する関数 *)\nlet inp_list : unit -> string list = fun () ->\n\tStr.split (Str.regexp \" \") (inp ())\nlet s_inp_list : unit -> string list = inp_list\nlet i_inp_list : unit -> int list = fun () ->\n\tmap (fun x -> int_of_string x) (inp_list ())\nlet f_inp_list : unit -> float list = fun () ->\n  map (fun x -> float_of_string x) (inp_list ())\n\n(* n行読み込む関数 *)\nlet rec inp_loop : (unit -> 'a) -> int -> 'a list = fun inp_fun n ->\n  if n = 0 then []\n  else\n    let x = inp_fun () in\n    x :: inp_loop inp_fun (n - 1)\n\n      \n(* 関数本体 *)\nlet () =\n  let [n; m] = i_inp_list () in\n  let brokens = Array.make (n + 1) false in\n  let rec inp_loop m =\n    if m = 0 then ()\n    else\n      let x = i_inp () in\n      (brokens.(x) <- true;\n       inp_loop (m - 1)) in\n  let () = inp_loop m in\n  let memo = Array.make (n + 1) None in\n  let rec loop a =\n    match memo.(a) with\n      None ->\n       if brokens.(a) then 0\n       else\n         if a + 2 <= n then\n           let x = (loop (a + 1) + loop (a + 2)) mod 1000000007 in\n           memo.(a) <- Some x;\n           x\n         else if a + 1 <= n then\n           let x = (loop (a + 1)) mod 1000000007 in\n           memo.(a) <- Some x;\n          x\n         else\n           (memo.(a) <- Some 1;\n            1)\n    | Some x -> x\n  in\n  print_int (loop 0);\n  print_newline ()\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1680, "cpu_time_ms": 12, "memory_kb": 7936}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s989605406", "group_id": "codeNet:p03014", "input_text": "let rec fold_for a b v f = if a >= b then v else fold_for (a+1) b (f a v) f\nlet () =\n  Scanf.scanf \"%d %d\" @@ fun h w ->\n  let s = Array.init h (fun _ -> Scanf.scanf \" %s\" (fun x -> x)) in\n  let f x y = s.(x).[y] in\n\n  let t = Array.make_matrix h w (-3) in\n  let g x y v = t.(x).(y) <- t.(x).(y) + v in\n\n  let rec loop n f g h w =\n    if n <= 0 then ()\n    else begin\n      for i = 0 to h-1 do\n        ignore @@ fold_for 1 w (if f i 0 = '.' then 1 else 0) @@ fun j v ->\n        let v' = if f i j = '.' then v+1 else 0 in\n        g i j v'; v'\n      done;\n      loop (n-1) (fun x y -> f (h-1-y) x) (fun x y -> g (h-1-y) x) w h\n    end\n  in\n  loop 4 f g h w;\n\n  Array.fold_left (Array.fold_left max) 0 t\n  |> Printf.printf \"%d\\n\"\n\n", "language": "OCaml", "metadata": {"date": 1560137420, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s989605406.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s989605406", "user_id": "u798181098"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "let rec fold_for a b v f = if a >= b then v else fold_for (a+1) b (f a v) f\nlet () =\n  Scanf.scanf \"%d %d\" @@ fun h w ->\n  let s = Array.init h (fun _ -> Scanf.scanf \" %s\" (fun x -> x)) in\n  let f x y = s.(x).[y] in\n\n  let t = Array.make_matrix h w (-3) in\n  let g x y v = t.(x).(y) <- t.(x).(y) + v in\n\n  let rec loop n f g h w =\n    if n <= 0 then ()\n    else begin\n      for i = 0 to h-1 do\n        ignore @@ fold_for 1 w (if f i 0 = '.' then 1 else 0) @@ fun j v ->\n        let v' = if f i j = '.' then v+1 else 0 in\n        g i j v'; v'\n      done;\n      loop (n-1) (fun x y -> f (h-1-y) x) (fun x y -> g (h-1-y) x) w h\n    end\n  in\n  loop 4 f g h w;\n\n  Array.fold_left (Array.fold_left max) 0 t\n  |> Printf.printf \"%d\\n\"\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares.\n\nSnuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it.\nThe lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and right.\nIn each direction, the beam will continue traveling until it hits a square occupied by an obstacle or it hits the border of the grid. It will light all the squares on the way, including the square on which the lamp is placed, but not the square occupied by an obstacle.\n\nSnuke wants to maximize the number of squares lighted by the lamp.\n\nYou are given H strings S_i (1 \\leq i \\leq H), each of length W. If the j-th character (1 \\leq j \\leq W) of S_i is #, there is an obstacle on the square at the i-th row from the top and the j-th column from the left; if that character is ., there is no obstacle on that square.\n\nFind the maximum possible number of squares lighted by the lamp.\n\nConstraints\n\n1 \\leq H \\leq 2,000\n\n1 \\leq W \\leq 2,000\n\nS_i is a string of length W consisting of # and ..\n\n. occurs at least once in one of the strings S_i (1 \\leq i \\leq H).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the maximum possible number of squares lighted by the lamp.\n\nSample Input 1\n\n4 6\n#..#..\n.....#\n....#.\n#.#...\n\nSample Output 1\n\n8\n\nIf Snuke places the lamp on the square at the second row from the top and the second column from the left, it will light the following squares: the first through fifth squares from the left in the second row, and the first through fourth squares from the top in the second column, for a total of eight squares.\n\nSample Input 2\n\n8 8\n..#...#.\n....#...\n##......\n..###..#\n...#..#.\n##....#.\n#...#...\n###.#..#\n\nSample Output 2\n\n13", "sample_input": "4 6\n#..#..\n.....#\n....#.\n#.#...\n"}, "reference_outputs": ["8\n"], "source_document_id": "p03014", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere is a grid with H horizontal rows and W vertical columns, and there are obstacles on some of the squares.\n\nSnuke is going to choose one of the squares not occupied by an obstacle and place a lamp on it.\nThe lamp placed on the square will emit straight beams of light in four cardinal directions: up, down, left, and right.\nIn each direction, the beam will continue traveling until it hits a square occupied by an obstacle or it hits the border of the grid. It will light all the squares on the way, including the square on which the lamp is placed, but not the square occupied by an obstacle.\n\nSnuke wants to maximize the number of squares lighted by the lamp.\n\nYou are given H strings S_i (1 \\leq i \\leq H), each of length W. If the j-th character (1 \\leq j \\leq W) of S_i is #, there is an obstacle on the square at the i-th row from the top and the j-th column from the left; if that character is ., there is no obstacle on that square.\n\nFind the maximum possible number of squares lighted by the lamp.\n\nConstraints\n\n1 \\leq H \\leq 2,000\n\n1 \\leq W \\leq 2,000\n\nS_i is a string of length W consisting of # and ..\n\n. occurs at least once in one of the strings S_i (1 \\leq i \\leq H).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\n:\nS_H\n\nOutput\n\nPrint the maximum possible number of squares lighted by the lamp.\n\nSample Input 1\n\n4 6\n#..#..\n.....#\n....#.\n#.#...\n\nSample Output 1\n\n8\n\nIf Snuke places the lamp on the square at the second row from the top and the second column from the left, it will light the following squares: the first through fifth squares from the left in the second row, and the first through fourth squares from the top in the second column, for a total of eight squares.\n\nSample Input 2\n\n8 8\n..#...#.\n....#...\n##......\n..###..#\n...#..#.\n##....#.\n#...#...\n###.#..#\n\nSample Output 2\n\n13", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 728, "cpu_time_ms": 829, "memory_kb": 38908}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s122498747", "group_id": "codeNet:p03017", "input_text": "Scanf.scanf \" %d %d %d %d %d\" @@ fun n a b c d ->\n  let a, b, c, d = a - 1, b - 1, c - 1, d - 1 in\n  let s = Scanf.scanf \" %s\" @@ fun s -> s in\n  let l, l_end, r, r_end = if a < b then a, c, b, d else b, d, a, c in\n  let dp = Array.make n false in\n  dp.(r) <- true;\n  dp.(r + 1) <- s.[r + 1] <> '#';\n  for i = r + 2 to n - 1 do\n    dp.(i) <- s.[i] <> '#' && (dp.(i - 1) || dp.(i - 2))\n  done;\n  if not dp.(r_end) then (print_endline \"No\"; exit 0);\n  let dp = Array.make n false in\n  dp.(l) <- true;\n  dp.(l + 1) <- s.[l + 1] <> '#';\n  for i = l + 2 to n - 1 do\n    dp.(i) <- s.[i] <> '#' && (dp.(i - 1) || dp.(i - 2))\n  done;\n  if not dp.(l_end) then (print_endline \"No\"; exit 0);\n  let b = Bytes.of_string s in\n  for i = 0 to n - 1 do\n    if Bytes.get b i = '.' then Bytes.set b i '_';\n  done;\n  let s = Bytes.to_string b in\n  print_endline @@\n    if s.[r_end - 1] = '#' || (r_end + 1 < n && s.[r_end + 1] = '#') then\n      try\n        let i = Str.search_forward (Str.regexp \"___\") s r in\n        if i < r_end then \"Yes\" else \"No\" with\n      | _ -> \"No\"\n    else \"Yes\"", "language": "OCaml", "metadata": {"date": 1559530098, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s122498747.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s122498747", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "Scanf.scanf \" %d %d %d %d %d\" @@ fun n a b c d ->\n  let a, b, c, d = a - 1, b - 1, c - 1, d - 1 in\n  let s = Scanf.scanf \" %s\" @@ fun s -> s in\n  let l, l_end, r, r_end = if a < b then a, c, b, d else b, d, a, c in\n  let dp = Array.make n false in\n  dp.(r) <- true;\n  dp.(r + 1) <- s.[r + 1] <> '#';\n  for i = r + 2 to n - 1 do\n    dp.(i) <- s.[i] <> '#' && (dp.(i - 1) || dp.(i - 2))\n  done;\n  if not dp.(r_end) then (print_endline \"No\"; exit 0);\n  let dp = Array.make n false in\n  dp.(l) <- true;\n  dp.(l + 1) <- s.[l + 1] <> '#';\n  for i = l + 2 to n - 1 do\n    dp.(i) <- s.[i] <> '#' && (dp.(i - 1) || dp.(i - 2))\n  done;\n  if not dp.(l_end) then (print_endline \"No\"; exit 0);\n  let b = Bytes.of_string s in\n  for i = 0 to n - 1 do\n    if Bytes.get b i = '.' then Bytes.set b i '_';\n  done;\n  let s = Bytes.to_string b in\n  print_endline @@\n    if s.[r_end - 1] = '#' || (r_end + 1 < n && s.[r_end + 1] = '#') then\n      try\n        let i = Str.search_forward (Str.regexp \"___\") s r in\n        if i < r_end then \"Yes\" else \"No\" with\n      | _ -> \"No\"\n    else \"Yes\"", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N squares arranged in a row, numbered 1, 2, ..., N from left to right.\nYou are given a string S of length N consisting of . and #. If the i-th character of S is #, Square i contains a rock; if the i-th character of S is ., Square i is empty.\n\nIn the beginning, Snuke stands on Square A, and Fnuke stands on Square B.\n\nYou can repeat the following operation any number of times:\n\nChoose Snuke or Fnuke, and make him jump one or two squares to the right. The destination must be one of the squares, and it must not contain a rock or the other person.\n\nYou want to repeat this operation so that Snuke will stand on Square C and Fnuke will stand on Square D.\n\nDetermine whether this is possible.\n\nConstraints\n\n4 \\leq N \\leq 200\\ 000\n\nS is a string of length N consisting of . and #.\n\n1 \\leq A, B, C, D \\leq N\n\nSquare A, B, C and D do not contain a rock.\n\nA, B, C and D are all different.\n\nA < B\n\nA < C\n\nB < D\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C D\nS\n\nOutput\n\nPrint Yes if the objective is achievable, and No if it is not.\n\nSample Input 1\n\n7 1 3 6 7\n.#..#..\n\nSample Output 1\n\nYes\n\nThe objective is achievable by, for example, moving the two persons as follows. (A and B represent Snuke and Fnuke, respectively.)\n\nA#B.#..\n\nA#.B#..\n\n.#AB#..\n\n.#A.#B.\n\n.#.A#B.\n\n.#.A#.B\n\n.#..#AB\n\nSample Input 2\n\n7 1 3 7 6\n.#..#..\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n15 1 3 15 13\n...#.#...#.#...\n\nSample Output 3\n\nYes", "sample_input": "7 1 3 6 7\n.#..#..\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03017", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N squares arranged in a row, numbered 1, 2, ..., N from left to right.\nYou are given a string S of length N consisting of . and #. If the i-th character of S is #, Square i contains a rock; if the i-th character of S is ., Square i is empty.\n\nIn the beginning, Snuke stands on Square A, and Fnuke stands on Square B.\n\nYou can repeat the following operation any number of times:\n\nChoose Snuke or Fnuke, and make him jump one or two squares to the right. The destination must be one of the squares, and it must not contain a rock or the other person.\n\nYou want to repeat this operation so that Snuke will stand on Square C and Fnuke will stand on Square D.\n\nDetermine whether this is possible.\n\nConstraints\n\n4 \\leq N \\leq 200\\ 000\n\nS is a string of length N consisting of . and #.\n\n1 \\leq A, B, C, D \\leq N\n\nSquare A, B, C and D do not contain a rock.\n\nA, B, C and D are all different.\n\nA < B\n\nA < C\n\nB < D\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C D\nS\n\nOutput\n\nPrint Yes if the objective is achievable, and No if it is not.\n\nSample Input 1\n\n7 1 3 6 7\n.#..#..\n\nSample Output 1\n\nYes\n\nThe objective is achievable by, for example, moving the two persons as follows. (A and B represent Snuke and Fnuke, respectively.)\n\nA#B.#..\n\nA#.B#..\n\n.#AB#..\n\n.#A.#B.\n\n.#.A#B.\n\n.#.A#.B\n\n.#..#AB\n\nSample Input 2\n\n7 1 3 7 6\n.#..#..\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n15 1 3 15 13\n...#.#...#.#...\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1069, "cpu_time_ms": 10, "memory_kb": 4736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s263557933", "group_id": "codeNet:p03017", "input_text": "let () =\n    let main () =\n        let n, a, b, c, d = Scanf.sscanf (read_line ()) \"%d %d %d %d %d\" (fun n a b c d -> n, a, b, c, d) in\n        let s = read_line () in\n        let reachable a b =\n            let rec loop i prev =\n                if i = b then true else\n                    if s.[i - 1] = '.' then loop (i + 1) false else\n                        if prev then false else loop (i + 1) true\n            in\n            loop a false\n        in\n        let three_space a b c d =\n            let rec loop i =\n                if i + 2 > c then 0 else\n                    if s.[i - 1] = '.' && s.[i] = '.' && s.[i + 1] = '.' then i else\n                        loop (i + 1)\n            in\n            let r = loop (b - 1) in\n            if r = 0 || r + 1 > d then false else\n                reachable b (r + 1) && reachable (r + 1) d &&\n                reachable a r && reachable (r + 2) c\n        in\n        let flag =\n            if c < d then reachable a c && reachable b d else\n                three_space a b c d\n        in\n        Printf.printf \"%s\\n\" (if flag then \"Yes\" else \"No\")\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1559529611, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s263557933.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s263557933", "user_id": "u342443598"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n    let main () =\n        let n, a, b, c, d = Scanf.sscanf (read_line ()) \"%d %d %d %d %d\" (fun n a b c d -> n, a, b, c, d) in\n        let s = read_line () in\n        let reachable a b =\n            let rec loop i prev =\n                if i = b then true else\n                    if s.[i - 1] = '.' then loop (i + 1) false else\n                        if prev then false else loop (i + 1) true\n            in\n            loop a false\n        in\n        let three_space a b c d =\n            let rec loop i =\n                if i + 2 > c then 0 else\n                    if s.[i - 1] = '.' && s.[i] = '.' && s.[i + 1] = '.' then i else\n                        loop (i + 1)\n            in\n            let r = loop (b - 1) in\n            if r = 0 || r + 1 > d then false else\n                reachable b (r + 1) && reachable (r + 1) d &&\n                reachable a r && reachable (r + 2) c\n        in\n        let flag =\n            if c < d then reachable a c && reachable b d else\n                three_space a b c d\n        in\n        Printf.printf \"%s\\n\" (if flag then \"Yes\" else \"No\")\n    in\n    main ()", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N squares arranged in a row, numbered 1, 2, ..., N from left to right.\nYou are given a string S of length N consisting of . and #. If the i-th character of S is #, Square i contains a rock; if the i-th character of S is ., Square i is empty.\n\nIn the beginning, Snuke stands on Square A, and Fnuke stands on Square B.\n\nYou can repeat the following operation any number of times:\n\nChoose Snuke or Fnuke, and make him jump one or two squares to the right. The destination must be one of the squares, and it must not contain a rock or the other person.\n\nYou want to repeat this operation so that Snuke will stand on Square C and Fnuke will stand on Square D.\n\nDetermine whether this is possible.\n\nConstraints\n\n4 \\leq N \\leq 200\\ 000\n\nS is a string of length N consisting of . and #.\n\n1 \\leq A, B, C, D \\leq N\n\nSquare A, B, C and D do not contain a rock.\n\nA, B, C and D are all different.\n\nA < B\n\nA < C\n\nB < D\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C D\nS\n\nOutput\n\nPrint Yes if the objective is achievable, and No if it is not.\n\nSample Input 1\n\n7 1 3 6 7\n.#..#..\n\nSample Output 1\n\nYes\n\nThe objective is achievable by, for example, moving the two persons as follows. (A and B represent Snuke and Fnuke, respectively.)\n\nA#B.#..\n\nA#.B#..\n\n.#AB#..\n\n.#A.#B.\n\n.#.A#B.\n\n.#.A#.B\n\n.#..#AB\n\nSample Input 2\n\n7 1 3 7 6\n.#..#..\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n15 1 3 15 13\n...#.#...#.#...\n\nSample Output 3\n\nYes", "sample_input": "7 1 3 6 7\n.#..#..\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03017", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N squares arranged in a row, numbered 1, 2, ..., N from left to right.\nYou are given a string S of length N consisting of . and #. If the i-th character of S is #, Square i contains a rock; if the i-th character of S is ., Square i is empty.\n\nIn the beginning, Snuke stands on Square A, and Fnuke stands on Square B.\n\nYou can repeat the following operation any number of times:\n\nChoose Snuke or Fnuke, and make him jump one or two squares to the right. The destination must be one of the squares, and it must not contain a rock or the other person.\n\nYou want to repeat this operation so that Snuke will stand on Square C and Fnuke will stand on Square D.\n\nDetermine whether this is possible.\n\nConstraints\n\n4 \\leq N \\leq 200\\ 000\n\nS is a string of length N consisting of . and #.\n\n1 \\leq A, B, C, D \\leq N\n\nSquare A, B, C and D do not contain a rock.\n\nA, B, C and D are all different.\n\nA < B\n\nA < C\n\nB < D\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B C D\nS\n\nOutput\n\nPrint Yes if the objective is achievable, and No if it is not.\n\nSample Input 1\n\n7 1 3 6 7\n.#..#..\n\nSample Output 1\n\nYes\n\nThe objective is achievable by, for example, moving the two persons as follows. (A and B represent Snuke and Fnuke, respectively.)\n\nA#B.#..\n\nA#.B#..\n\n.#AB#..\n\n.#A.#B.\n\n.#.A#B.\n\n.#.A#.B\n\n.#..#AB\n\nSample Input 2\n\n7 1 3 7 6\n.#..#..\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n15 1 3 15 13\n...#.#...#.#...\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1114, "cpu_time_ms": 3, "memory_kb": 2688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s485355885", "group_id": "codeNet:p03023", "input_text": "Printf.printf \"%d\\n\" (Scanf.scanf \"%d\" (fun n -> 180*(n-2)))\n", "language": "OCaml", "metadata": {"date": 1559455679, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s485355885.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s485355885", "user_id": "u798181098"}, "prompt_components": {"gold_output": "180\n", "input_to_evaluate": "Printf.printf \"%d\\n\" (Scanf.scanf \"%d\" (fun n -> 180*(n-2)))\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 61, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s058122420", "group_id": "codeNet:p03024", "input_text": "let f x s = let n = ref 0 in String.iter (fun c -> if c = x then incr n) s; !n\nlet _ = print_endline @@ if f 'x' @@ read_line () < 8 then \"YES\" else \"NO\"", "language": "OCaml", "metadata": {"date": 1562491250, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s058122420.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s058122420", "user_id": "u732304692"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let f x s = let n = ref 0 in String.iter (fun c -> if c = x then incr n) s; !n\nlet _ = print_endline @@ if f 'x' @@ read_line () < 8 then \"YES\" else \"NO\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is competing in a sumo tournament.\nThe tournament lasts for 15 days, during which he performs in one match per day.\nIf he wins 8 or more matches, he can also participate in the next tournament.\n\nThe matches for the first k days have finished.\nYou are given the results of Takahashi's matches as a string S consisting of o and x.\nIf the i-th character in S is o, it means that Takahashi won the match on the i-th day; if that character is x, it means that Takahashi lost the match on the i-th day.\n\nPrint YES if there is a possibility that Takahashi can participate in the next tournament, and print NO if there is no such possibility.\n\nConstraints\n\n1 \\leq k \\leq 15\n\nS is a string of length k consisting of o and x.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint YES if there is a possibility that Takahashi can participate in the next tournament, and print NO otherwise.\n\nSample Input 1\n\noxoxoxoxoxoxox\n\nSample Output 1\n\nYES\n\nTakahashi has 7 wins and 7 losses before the last match. If he wins that match, he will have 8 wins.\n\nSample Input 2\n\nxxxxxxxx\n\nSample Output 2\n\nNO", "sample_input": "oxoxoxoxoxoxox\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03024", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is competing in a sumo tournament.\nThe tournament lasts for 15 days, during which he performs in one match per day.\nIf he wins 8 or more matches, he can also participate in the next tournament.\n\nThe matches for the first k days have finished.\nYou are given the results of Takahashi's matches as a string S consisting of o and x.\nIf the i-th character in S is o, it means that Takahashi won the match on the i-th day; if that character is x, it means that Takahashi lost the match on the i-th day.\n\nPrint YES if there is a possibility that Takahashi can participate in the next tournament, and print NO if there is no such possibility.\n\nConstraints\n\n1 \\leq k \\leq 15\n\nS is a string of length k consisting of o and x.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint YES if there is a possibility that Takahashi can participate in the next tournament, and print NO otherwise.\n\nSample Input 1\n\noxoxoxoxoxoxox\n\nSample Output 1\n\nYES\n\nTakahashi has 7 wins and 7 losses before the last match. If he wins that match, he will have 8 wins.\n\nSample Input 2\n\nxxxxxxxx\n\nSample Output 2\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 153, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s038758006", "group_id": "codeNet:p03031", "input_text": "Scanf.scanf \"%d %d\" @@ fun n m ->\n  let sss = Array.init m @@ fun _ ->\n    let k = Scanf.scanf \" %d\" @@ (+) 0 in\n    Array.init k @@ fun _ -> Scanf.scanf \" %d\" @@ fun s -> s - 1 in\n  let ps = Array.init m @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0 in\n  let array_count f = Array.fold_left (fun n x -> if f x then n + 1 else n) 0 in\n  let array_for_all f xs = Array.length xs = array_count f xs in\n  let flags = Array.make n false in\n  let is_on i =\n    let ss = sss.(i) in\n    let c = ref 0 in\n    for j = 0 to Array.length ss - 1 do\n      if flags.(ss.(j)) then incr c\n    done;\n    !c mod 2 = ps.(i) in\n    (* let c = array_count ((=) true) flags in c mod 2 = ps.(i) in *)\n  let judge () = array_for_all is_on @@ Array.init m @@ (+) 0 in\n  let ans = ref 0 in\n  let rec find i =\n    (* Array.iter (fun x -> print_string @@ if x then \"true \" else \"false \") flags;\n    print_newline (); *)\n    (* Printf.printf \"%d %d\\n\" i n; *)\n    if i >= n then\n      (if judge () then incr ans)\n    else\n      (flags.(i) <- true;\n      find (i + 1);\n      flags.(i) <- false;\n      find (i + 1)) in\n  find 0;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1558924756, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s038758006.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s038758006", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" @@ fun n m ->\n  let sss = Array.init m @@ fun _ ->\n    let k = Scanf.scanf \" %d\" @@ (+) 0 in\n    Array.init k @@ fun _ -> Scanf.scanf \" %d\" @@ fun s -> s - 1 in\n  let ps = Array.init m @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0 in\n  let array_count f = Array.fold_left (fun n x -> if f x then n + 1 else n) 0 in\n  let array_for_all f xs = Array.length xs = array_count f xs in\n  let flags = Array.make n false in\n  let is_on i =\n    let ss = sss.(i) in\n    let c = ref 0 in\n    for j = 0 to Array.length ss - 1 do\n      if flags.(ss.(j)) then incr c\n    done;\n    !c mod 2 = ps.(i) in\n    (* let c = array_count ((=) true) flags in c mod 2 = ps.(i) in *)\n  let judge () = array_for_all is_on @@ Array.init m @@ (+) 0 in\n  let ans = ref 0 in\n  let rec find i =\n    (* Array.iter (fun x -> print_string @@ if x then \"true \" else \"false \") flags;\n    print_newline (); *)\n    (* Printf.printf \"%d %d\\n\" i n; *)\n    if i >= n then\n      (if judge () then incr ans)\n    else\n      (flags.(i) <- true;\n      find (i + 1);\n      flags.(i) <- false;\n      find (i + 1)) in\n  find 0;\n  Printf.printf \"%d\\n\" !ans", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1118, "cpu_time_ms": 2, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s152440525", "group_id": "codeNet:p03032", "input_text": "module S = Set.Make (struct type t = int * int let compare = compare end)\n\nlet () =\n    let split s =\n        let rec loop i cur flag acc =\n            if i = String.length s then ( if flag then cur :: acc else acc) else (\n                match flag, s.[i] with\n                | true,  ' ' -> loop (i + 1) \"\" false (cur :: acc)\n                | false, ' ' -> loop (i + 1) \"\" false acc\n                | true,  v   -> loop (i + 1) (Printf.sprintf \"%s%c\" cur v) true acc\n                | false, v   -> loop (i + 1) (Printf.sprintf \"%s%c\" cur v) true acc\n            )\n        in\n        List.map int_of_string (List.rev (loop 0 \"\" false []))\n    in\n    let main () =\n        let n, k = Scanf.sscanf (read_line ()) \"%d %d\" (fun n k -> n, k) in\n        let v = Array.of_list (split (read_line ())) in\n        let calc l r k =\n            let rec loop i acc =\n                if i = l then acc else loop (i + 1) (v.(i) :: acc)\n            in\n            let acc = loop 0 [] in\n            let rec loop i acc =\n                if i = r then acc else loop (i - 1) (v.(i) :: acc)\n            in\n            let acc = loop (n - 1) acc in\n            let l = List.sort compare acc in\n            let rec drop i list =\n                if i = 0 then list else\n                    match list with\n                    | [] -> []\n                    | hd :: tl -> if hd < 0 then drop (i - 1) tl else tl\n            in\n            List.fold_left (+) 0 (drop k l)\n        in\n        let rec loop k mx sets =\n            if k = 0 then mx else\n                let mx, next =\n                    S.fold (fun (l, r) (mx, next) ->\n                        let mx = max mx (calc l r k) in\n                        let next = if l <= r then S.add (l+1, r) next else next in\n                        let next = if l <  r then S.add (l, r-1) next else next in\n                        mx, next) sets (mx, S.empty)\n                in\n                loop (k - 1) mx next\n        in\n        let init = S.add (0, n - 1) S.empty in\n        let ans = loop k 0 init in\n        Printf.printf \"%d\\n\" ans\n    in\n    main ()", "language": "OCaml", "metadata": {"date": 1558923090, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s152440525.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s152440525", "user_id": "u342443598"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "module S = Set.Make (struct type t = int * int let compare = compare end)\n\nlet () =\n    let split s =\n        let rec loop i cur flag acc =\n            if i = String.length s then ( if flag then cur :: acc else acc) else (\n                match flag, s.[i] with\n                | true,  ' ' -> loop (i + 1) \"\" false (cur :: acc)\n                | false, ' ' -> loop (i + 1) \"\" false acc\n                | true,  v   -> loop (i + 1) (Printf.sprintf \"%s%c\" cur v) true acc\n                | false, v   -> loop (i + 1) (Printf.sprintf \"%s%c\" cur v) true acc\n            )\n        in\n        List.map int_of_string (List.rev (loop 0 \"\" false []))\n    in\n    let main () =\n        let n, k = Scanf.sscanf (read_line ()) \"%d %d\" (fun n k -> n, k) in\n        let v = Array.of_list (split (read_line ())) in\n        let calc l r k =\n            let rec loop i acc =\n                if i = l then acc else loop (i + 1) (v.(i) :: acc)\n            in\n            let acc = loop 0 [] in\n            let rec loop i acc =\n                if i = r then acc else loop (i - 1) (v.(i) :: acc)\n            in\n            let acc = loop (n - 1) acc in\n            let l = List.sort compare acc in\n            let rec drop i list =\n                if i = 0 then list else\n                    match list with\n                    | [] -> []\n                    | hd :: tl -> if hd < 0 then drop (i - 1) tl else tl\n            in\n            List.fold_left (+) 0 (drop k l)\n        in\n        let rec loop k mx sets =\n            if k = 0 then mx else\n                let mx, next =\n                    S.fold (fun (l, r) (mx, next) ->\n                        let mx = max mx (calc l r k) in\n                        let next = if l <= r then S.add (l+1, r) next else next in\n                        let next = if l <  r then S.add (l, r-1) next else next in\n                        mx, next) sets (mx, S.empty)\n                in\n                loop (k - 1) mx next\n        in\n        let init = S.add (0, n - 1) S.empty in\n        let ans = loop k 0 init in\n        Printf.printf \"%d\\n\" ans\n    in\n    main ()", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2087, "cpu_time_ms": 6, "memory_kb": 2560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s350123207", "group_id": "codeNet:p03035", "input_text": "let () = Scanf.scanf \"%d %d\" @@ fun a b ->\n  let ans =\n    if a >= 13 then b\n    else if a >= 6 then b / 2\n    else 0\n  in\n  Printf.printf \"%d\\n\" ans", "language": "OCaml", "metadata": {"date": 1597848759, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s350123207.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s350123207", "user_id": "u052332717"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\" @@ fun a b ->\n  let ans =\n    if a >= 13 then b\n    else if a >= 6 then b / 2\n    else 0\n  in\n  Printf.printf \"%d\\n\" ans", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "sample_input": "30 100\n"}, "reference_outputs": ["100\n"], "source_document_id": "p03035", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 149, "cpu_time_ms": 10, "memory_kb": 3812}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s316209238", "group_id": "codeNet:p03035", "input_text": "let () = Scanf.scanf \"%d %d\" @@ fun a b ->\n  Printf.printf \"%d\\n\" @@\n  if a <= 5 then 0 else if a <= 12 then b / 2 else b", "language": "OCaml", "metadata": {"date": 1558832555, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s316209238.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s316209238", "user_id": "u504158101"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\" @@ fun a b ->\n  Printf.printf \"%d\\n\" @@\n  if a <= 5 then 0 else if a <= 12 then b / 2 else b", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "sample_input": "30 100\n"}, "reference_outputs": ["100\n"], "source_document_id": "p03035", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 121, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s350475053", "group_id": "codeNet:p03036", "input_text": "let () = Scanf.scanf \"%d %d %d\" @@ fun r d x2000 ->\n  let xs = Array.make 11 0 in\n  xs.(0) <- x2000;\n  for i = 1 to 10 do\n    xs.(i) <- r * xs.(i - 1) - d;\n    Printf.printf \"%d\\n\" xs.(i)\n  done", "language": "OCaml", "metadata": {"date": 1597849452, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s350475053.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s350475053", "user_id": "u052332717"}, "prompt_components": {"gold_output": "30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" @@ fun r d x2000 ->\n  let xs = Array.make 11 0 in\n  xs.(0) <- x2000;\n  for i = 1 to 10 do\n    xs.(i) <- r * xs.(i - 1) - d;\n    Printf.printf \"%d\\n\" xs.(i)\n  done", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThe development of algae in a pond is as follows.\n\nLet the total weight of the algae at the beginning of the year i be x_i gram. For i≥2000, the following formula holds:\n\nx_{i+1} = rx_i - D\n\nYou are given r, D and x_{2000}. Calculate x_{2001}, ..., x_{2010} and print them in order.\n\nConstraints\n\n2 ≤ r ≤ 5\n\n1 ≤ D ≤ 100\n\nD < x_{2000} ≤ 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr D x_{2000}\n\nOutput\n\nPrint 10 lines. The i-th line (1 ≤ i ≤ 10) should contain x_{2000+i} as an integer.\n\nSample Input 1\n\n2 10 20\n\nSample Output 1\n\n30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n\nFor example, x_{2001} = rx_{2000} - D = 2 \\times 20 - 10 = 30 and x_{2002} = rx_{2001} - D = 2 \\times 30 - 10 = 50.\n\nSample Input 2\n\n4 40 60\n\nSample Output 2\n\n200\n760\n3000\n11960\n47800\n191160\n764600\n3058360\n12233400\n48933560", "sample_input": "2 10 20\n"}, "reference_outputs": ["30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n"], "source_document_id": "p03036", "source_text": "Score : 200 points\n\nProblem Statement\n\nThe development of algae in a pond is as follows.\n\nLet the total weight of the algae at the beginning of the year i be x_i gram. For i≥2000, the following formula holds:\n\nx_{i+1} = rx_i - D\n\nYou are given r, D and x_{2000}. Calculate x_{2001}, ..., x_{2010} and print them in order.\n\nConstraints\n\n2 ≤ r ≤ 5\n\n1 ≤ D ≤ 100\n\nD < x_{2000} ≤ 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr D x_{2000}\n\nOutput\n\nPrint 10 lines. The i-th line (1 ≤ i ≤ 10) should contain x_{2000+i} as an integer.\n\nSample Input 1\n\n2 10 20\n\nSample Output 1\n\n30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n\nFor example, x_{2001} = rx_{2000} - D = 2 \\times 20 - 10 = 30 and x_{2002} = rx_{2001} - D = 2 \\times 30 - 10 = 50.\n\nSample Input 2\n\n4 40 60\n\nSample Output 2\n\n200\n760\n3000\n11960\n47800\n191160\n764600\n3058360\n12233400\n48933560", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 194, "cpu_time_ms": 6, "memory_kb": 3792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s814349715", "group_id": "codeNet:p03036", "input_text": "let () = Scanf.scanf \"%d %d %d\" (fun r d x -> (\n  let xi = ref x in\n  for i = 1 to 10 do\n    xi := r * !xi - d;\n    print_endline(string_of_int !xi);\n  done\n))", "language": "OCaml", "metadata": {"date": 1587427986, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s814349715.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s814349715", "user_id": "u541055501"}, "prompt_components": {"gold_output": "30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" (fun r d x -> (\n  let xi = ref x in\n  for i = 1 to 10 do\n    xi := r * !xi - d;\n    print_endline(string_of_int !xi);\n  done\n))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThe development of algae in a pond is as follows.\n\nLet the total weight of the algae at the beginning of the year i be x_i gram. For i≥2000, the following formula holds:\n\nx_{i+1} = rx_i - D\n\nYou are given r, D and x_{2000}. Calculate x_{2001}, ..., x_{2010} and print them in order.\n\nConstraints\n\n2 ≤ r ≤ 5\n\n1 ≤ D ≤ 100\n\nD < x_{2000} ≤ 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr D x_{2000}\n\nOutput\n\nPrint 10 lines. The i-th line (1 ≤ i ≤ 10) should contain x_{2000+i} as an integer.\n\nSample Input 1\n\n2 10 20\n\nSample Output 1\n\n30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n\nFor example, x_{2001} = rx_{2000} - D = 2 \\times 20 - 10 = 30 and x_{2002} = rx_{2001} - D = 2 \\times 30 - 10 = 50.\n\nSample Input 2\n\n4 40 60\n\nSample Output 2\n\n200\n760\n3000\n11960\n47800\n191160\n764600\n3058360\n12233400\n48933560", "sample_input": "2 10 20\n"}, "reference_outputs": ["30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n"], "source_document_id": "p03036", "source_text": "Score : 200 points\n\nProblem Statement\n\nThe development of algae in a pond is as follows.\n\nLet the total weight of the algae at the beginning of the year i be x_i gram. For i≥2000, the following formula holds:\n\nx_{i+1} = rx_i - D\n\nYou are given r, D and x_{2000}. Calculate x_{2001}, ..., x_{2010} and print them in order.\n\nConstraints\n\n2 ≤ r ≤ 5\n\n1 ≤ D ≤ 100\n\nD < x_{2000} ≤ 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr D x_{2000}\n\nOutput\n\nPrint 10 lines. The i-th line (1 ≤ i ≤ 10) should contain x_{2000+i} as an integer.\n\nSample Input 1\n\n2 10 20\n\nSample Output 1\n\n30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n\nFor example, x_{2001} = rx_{2000} - D = 2 \\times 20 - 10 = 30 and x_{2002} = rx_{2001} - D = 2 \\times 30 - 10 = 50.\n\nSample Input 2\n\n4 40 60\n\nSample Output 2\n\n200\n760\n3000\n11960\n47800\n191160\n764600\n3058360\n12233400\n48933560", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 159, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s869576819", "group_id": "codeNet:p03037", "input_text": "(*\nocamlfind ocamlopt -package batteries -linkpkg main.ml -o a.out\n*)\nopen Batteries\n\nlet n, m = Scanf.sscanf (read_line ()) \"%d %d\" ( fun n m -> n, m)\n\nlet slst = List.init m (\n        fun _ -> \n                Scanf.sscanf (read_line ()) \"%d %d\" (\n                        fun l r -> \n                                (l, r)\n                )\n) |> List.map (fun (l, r) -> Set.of_list (List.range l `To r))\n\nlet rec f lst =\n        match lst with\n                  [] -> Set.of_list []\n                | first :: [] -> \n                        first\n                | first :: rest -> \n                        Set.intersect first (f rest)\n\nlet () =\n        f slst\n        |> Set.cardinal\n        |> Printf.printf \"%d\\n\"\n\n", "language": "OCaml", "metadata": {"date": 1590456335, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s869576819.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s869576819", "user_id": "u280335093"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(*\nocamlfind ocamlopt -package batteries -linkpkg main.ml -o a.out\n*)\nopen Batteries\n\nlet n, m = Scanf.sscanf (read_line ()) \"%d %d\" ( fun n m -> n, m)\n\nlet slst = List.init m (\n        fun _ -> \n                Scanf.sscanf (read_line ()) \"%d %d\" (\n                        fun l r -> \n                                (l, r)\n                )\n) |> List.map (fun (l, r) -> Set.of_list (List.range l `To r))\n\nlet rec f lst =\n        match lst with\n                  [] -> Set.of_list []\n                | first :: [] -> \n                        first\n                | first :: rest -> \n                        Set.intersect first (f rest)\n\nlet () =\n        f slst\n        |> Set.cardinal\n        |> Printf.printf \"%d\\n\"\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N ID cards, and there are M gates.\n\nWe can pass the i-th gate if we have one of the following ID cards: the L_i-th, (L_i+1)-th, ..., and R_i-th ID cards.\n\nHow many of the ID cards allow us to pass all the gates alone?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nL_1 R_1\nL_2 R_2\n\\vdots\nL_M R_M\n\nOutput\n\nPrint the number of ID cards that allow us to pass all the gates alone.\n\nSample Input 1\n\n4 2\n1 3\n2 4\n\nSample Output 1\n\n2\n\nTwo ID cards allow us to pass all the gates alone, as follows:\n\nThe first ID card does not allow us to pass the second gate.\n\nThe second ID card allows us to pass all the gates.\n\nThe third ID card allows us to pass all the gates.\n\nThe fourth ID card does not allow us to pass the first gate.\n\nSample Input 2\n\n10 3\n3 6\n5 7\n6 9\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100000 1\n1 100000\n\nSample Output 3\n\n100000", "sample_input": "4 2\n1 3\n2 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03037", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N ID cards, and there are M gates.\n\nWe can pass the i-th gate if we have one of the following ID cards: the L_i-th, (L_i+1)-th, ..., and R_i-th ID cards.\n\nHow many of the ID cards allow us to pass all the gates alone?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nL_1 R_1\nL_2 R_2\n\\vdots\nL_M R_M\n\nOutput\n\nPrint the number of ID cards that allow us to pass all the gates alone.\n\nSample Input 1\n\n4 2\n1 3\n2 4\n\nSample Output 1\n\n2\n\nTwo ID cards allow us to pass all the gates alone, as follows:\n\nThe first ID card does not allow us to pass the second gate.\n\nThe second ID card allows us to pass all the gates.\n\nThe third ID card allows us to pass all the gates.\n\nThe fourth ID card does not allow us to pass the first gate.\n\nSample Input 2\n\n10 3\n3 6\n5 7\n6 9\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100000 1\n1 100000\n\nSample Output 3\n\n100000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 720, "cpu_time_ms": 2112, "memory_kb": 250868}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s688029129", "group_id": "codeNet:p03040", "input_text": "module IntMap = Map.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet add a s =\n  IntMap.add a (1 + try IntMap.find a s with Not_found -> 0) s\n\nlet remove a s =\n  match IntMap.find a s with\n  | exception Not_found -> s\n  | 1 -> IntMap.remove a s\n  | n -> IntMap.add a (n - 1) s\n\nlet _ =\n  Array.fold_left (fun (odd, acc, (q, q')) ->\n    let (m, _) = IntMap.max_binding q in\n    function\n    | None ->\n        Printf.printf \"%d %d\\n\" m acc;\n        (odd, acc, (q, q'))\n    | Some (a, b) ->\n        not odd,\n        ( acc + b +\n          if odd then\n            abs (m - a)\n          else\n            let (m', _) = IntMap.min_binding q' in\n            if a <= m then\n              m - a\n            else if m' <= a then\n              a - m'\n            else 0 ),\n        if a < m then\n          let q = add a q in\n          if not odd\n          then (q, q')\n          else (remove (fst (IntMap.max_binding q)) q, add (fst (IntMap.max_binding q)) q')\n        else\n          let q' = add a q' in\n          if odd\n          then (q, q')\n          else (add (fst (IntMap.min_binding q')) q), remove (fst (IntMap.min_binding q')) q')\n  (false, 0, (IntMap.singleton min_int 1, IntMap.singleton max_int 1)) @@\n  Scanf.scanf \"%d \" @@ fun q ->\n    Array.init q @@ fun _ ->\n      Scanf.scanf \"%d \" @@ function\n        | 2 -> None\n        | 1 -> Scanf.scanf \"%d %d \" @@ fun a b -> Some (a, b)\n", "language": "OCaml", "metadata": {"date": 1569289038, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s688029129.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s688029129", "user_id": "u504158101"}, "prompt_components": {"gold_output": "4 2\n1 -3\n", "input_to_evaluate": "module IntMap = Map.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet add a s =\n  IntMap.add a (1 + try IntMap.find a s with Not_found -> 0) s\n\nlet remove a s =\n  match IntMap.find a s with\n  | exception Not_found -> s\n  | 1 -> IntMap.remove a s\n  | n -> IntMap.add a (n - 1) s\n\nlet _ =\n  Array.fold_left (fun (odd, acc, (q, q')) ->\n    let (m, _) = IntMap.max_binding q in\n    function\n    | None ->\n        Printf.printf \"%d %d\\n\" m acc;\n        (odd, acc, (q, q'))\n    | Some (a, b) ->\n        not odd,\n        ( acc + b +\n          if odd then\n            abs (m - a)\n          else\n            let (m', _) = IntMap.min_binding q' in\n            if a <= m then\n              m - a\n            else if m' <= a then\n              a - m'\n            else 0 ),\n        if a < m then\n          let q = add a q in\n          if not odd\n          then (q, q')\n          else (remove (fst (IntMap.max_binding q)) q, add (fst (IntMap.max_binding q)) q')\n        else\n          let q' = add a q' in\n          if odd\n          then (q, q')\n          else (add (fst (IntMap.min_binding q')) q), remove (fst (IntMap.min_binding q')) q')\n  (false, 0, (IntMap.singleton min_int 1, IntMap.singleton max_int 1)) @@\n  Scanf.scanf \"%d \" @@ fun q ->\n    Array.init q @@ fun _ ->\n      Scanf.scanf \"%d \" @@ function\n        | 2 -> None\n        | 1 -> Scanf.scanf \"%d %d \" @@ fun a b -> Some (a, b)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere is a function f(x), which is initially a constant function f(x) = 0.\n\nWe will ask you to process Q queries in order. There are two kinds of queries, update queries and evaluation queries, as follows:\n\nAn update query 1 a b: Given two integers a and b, let g(x) = f(x) + |x - a| + b and replace f(x) with g(x).\n\nAn evaluation query 2: Print x that minimizes f(x), and the minimum value of f(x). If there are multiple such values of x, choose the minimum such value.\n\nWe can show that the values to be output in an evaluation query are always integers, so we ask you to print those values as integers without decimal points.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n-10^9 \\leq a, b \\leq 10^9\n\nThe first query is an update query.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nQuery_1\n:\nQuery_Q\n\nSee Sample Input 1 for an example.\n\nOutput\n\nFor each evaluation query, print a line containing the response, in the order in which the queries are given.\n\nThe response to each evaluation query should be the minimum value of x that minimizes f(x), and the minimum value of f(x), in this order, with space in between.\n\nSample Input 1\n\n4\n1 4 2\n2\n1 1 -8\n2\n\nSample Output 1\n\n4 2\n1 -3\n\nIn the first evaluation query, f(x) = |x - 4| + 2, which attains the minimum value of 2 at x = 4.\n\nIn the second evaluation query, f(x) = |x - 1| + |x - 4| - 6, which attains the minimum value of -3 when 1 \\leq x \\leq 4. Among the multiple values of x that minimize f(x), we ask you to print the minimum, that is, 1.\n\nSample Input 2\n\n4\n1 -1000000000 1000000000\n1 -1000000000 1000000000\n1 -1000000000 1000000000\n2\n\nSample Output 2\n\n-1000000000 3000000000", "sample_input": "4\n1 4 2\n2\n1 1 -8\n2\n"}, "reference_outputs": ["4 2\n1 -3\n"], "source_document_id": "p03040", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere is a function f(x), which is initially a constant function f(x) = 0.\n\nWe will ask you to process Q queries in order. There are two kinds of queries, update queries and evaluation queries, as follows:\n\nAn update query 1 a b: Given two integers a and b, let g(x) = f(x) + |x - a| + b and replace f(x) with g(x).\n\nAn evaluation query 2: Print x that minimizes f(x), and the minimum value of f(x). If there are multiple such values of x, choose the minimum such value.\n\nWe can show that the values to be output in an evaluation query are always integers, so we ask you to print those values as integers without decimal points.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n-10^9 \\leq a, b \\leq 10^9\n\nThe first query is an update query.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nQuery_1\n:\nQuery_Q\n\nSee Sample Input 1 for an example.\n\nOutput\n\nFor each evaluation query, print a line containing the response, in the order in which the queries are given.\n\nThe response to each evaluation query should be the minimum value of x that minimizes f(x), and the minimum value of f(x), in this order, with space in between.\n\nSample Input 1\n\n4\n1 4 2\n2\n1 1 -8\n2\n\nSample Output 1\n\n4 2\n1 -3\n\nIn the first evaluation query, f(x) = |x - 4| + 2, which attains the minimum value of 2 at x = 4.\n\nIn the second evaluation query, f(x) = |x - 1| + |x - 4| - 6, which attains the minimum value of -3 when 1 \\leq x \\leq 4. Among the multiple values of x that minimize f(x), we ask you to print the minimum, that is, 1.\n\nSample Input 2\n\n4\n1 -1000000000 1000000000\n1 -1000000000 1000000000\n1 -1000000000 1000000000\n2\n\nSample Output 2\n\n-1000000000 3000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1392, "cpu_time_ms": 381, "memory_kb": 23936}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s328703967", "group_id": "codeNet:p03040", "input_text": "module IntMap = Map.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet add a s =\n  IntMap.add a (1 + try IntMap.find a s with Not_found -> 0) s\n\nlet remove a s =\n  match IntMap.find a s with\n  | exception Not_found -> s\n  | 1 -> IntMap.remove a s\n  | n -> IntMap.add a (n - 1) s\n\nlet _ = Scanf.scanf \"%d\\n1 %d %d\\n\" @@ fun q a b ->\n  Array.fold_left (fun (acc, (n, n', q, q', sum, sum')) ->\n    let (m, _) = IntMap.max_binding q in\n    function\n    | None ->\n        Printf.printf \"%d %d\\n\" m\n          (acc + (n * m - sum) + (sum' - n' * m));\n        (acc, (n, n', q, q', sum, sum'))\n    | Some (a, b) ->\n        acc + b,\n        if a <= m then\n          if n = n'\n          then (n + 1, n', add a q, q', sum + a, sum')\n          else if n = n' + 1\n          then (n, n' + 1, add a (remove m q), add m q', sum + a - m, sum' + m)\n          else raise Not_found\n        else\n          if n = n' + 1\n          then (n, n' + 1, q, add a q', sum, sum' + a)\n          else if n = n'\n          then (n + 1, n', add m q, add a (remove m q'), sum + m, sum' + a - m)\n          else raise Not_found)\n  (b, (1, 0, IntMap.singleton a 1, IntMap.empty, a, 0)) @@\n  Array.init (q - 1) @@ fun _ ->\n    Scanf.scanf \"%d \" @@ function\n      | 2 -> None\n      | 1 -> Scanf.scanf \"%d %d \" @@ fun a b -> Some (a, b)\n", "language": "OCaml", "metadata": {"date": 1569285979, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s328703967.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s328703967", "user_id": "u504158101"}, "prompt_components": {"gold_output": "4 2\n1 -3\n", "input_to_evaluate": "module IntMap = Map.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet add a s =\n  IntMap.add a (1 + try IntMap.find a s with Not_found -> 0) s\n\nlet remove a s =\n  match IntMap.find a s with\n  | exception Not_found -> s\n  | 1 -> IntMap.remove a s\n  | n -> IntMap.add a (n - 1) s\n\nlet _ = Scanf.scanf \"%d\\n1 %d %d\\n\" @@ fun q a b ->\n  Array.fold_left (fun (acc, (n, n', q, q', sum, sum')) ->\n    let (m, _) = IntMap.max_binding q in\n    function\n    | None ->\n        Printf.printf \"%d %d\\n\" m\n          (acc + (n * m - sum) + (sum' - n' * m));\n        (acc, (n, n', q, q', sum, sum'))\n    | Some (a, b) ->\n        acc + b,\n        if a <= m then\n          if n = n'\n          then (n + 1, n', add a q, q', sum + a, sum')\n          else if n = n' + 1\n          then (n, n' + 1, add a (remove m q), add m q', sum + a - m, sum' + m)\n          else raise Not_found\n        else\n          if n = n' + 1\n          then (n, n' + 1, q, add a q', sum, sum' + a)\n          else if n = n'\n          then (n + 1, n', add m q, add a (remove m q'), sum + m, sum' + a - m)\n          else raise Not_found)\n  (b, (1, 0, IntMap.singleton a 1, IntMap.empty, a, 0)) @@\n  Array.init (q - 1) @@ fun _ ->\n    Scanf.scanf \"%d \" @@ function\n      | 2 -> None\n      | 1 -> Scanf.scanf \"%d %d \" @@ fun a b -> Some (a, b)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere is a function f(x), which is initially a constant function f(x) = 0.\n\nWe will ask you to process Q queries in order. There are two kinds of queries, update queries and evaluation queries, as follows:\n\nAn update query 1 a b: Given two integers a and b, let g(x) = f(x) + |x - a| + b and replace f(x) with g(x).\n\nAn evaluation query 2: Print x that minimizes f(x), and the minimum value of f(x). If there are multiple such values of x, choose the minimum such value.\n\nWe can show that the values to be output in an evaluation query are always integers, so we ask you to print those values as integers without decimal points.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n-10^9 \\leq a, b \\leq 10^9\n\nThe first query is an update query.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nQuery_1\n:\nQuery_Q\n\nSee Sample Input 1 for an example.\n\nOutput\n\nFor each evaluation query, print a line containing the response, in the order in which the queries are given.\n\nThe response to each evaluation query should be the minimum value of x that minimizes f(x), and the minimum value of f(x), in this order, with space in between.\n\nSample Input 1\n\n4\n1 4 2\n2\n1 1 -8\n2\n\nSample Output 1\n\n4 2\n1 -3\n\nIn the first evaluation query, f(x) = |x - 4| + 2, which attains the minimum value of 2 at x = 4.\n\nIn the second evaluation query, f(x) = |x - 1| + |x - 4| - 6, which attains the minimum value of -3 when 1 \\leq x \\leq 4. Among the multiple values of x that minimize f(x), we ask you to print the minimum, that is, 1.\n\nSample Input 2\n\n4\n1 -1000000000 1000000000\n1 -1000000000 1000000000\n1 -1000000000 1000000000\n2\n\nSample Output 2\n\n-1000000000 3000000000", "sample_input": "4\n1 4 2\n2\n1 1 -8\n2\n"}, "reference_outputs": ["4 2\n1 -3\n"], "source_document_id": "p03040", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere is a function f(x), which is initially a constant function f(x) = 0.\n\nWe will ask you to process Q queries in order. There are two kinds of queries, update queries and evaluation queries, as follows:\n\nAn update query 1 a b: Given two integers a and b, let g(x) = f(x) + |x - a| + b and replace f(x) with g(x).\n\nAn evaluation query 2: Print x that minimizes f(x), and the minimum value of f(x). If there are multiple such values of x, choose the minimum such value.\n\nWe can show that the values to be output in an evaluation query are always integers, so we ask you to print those values as integers without decimal points.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n-10^9 \\leq a, b \\leq 10^9\n\nThe first query is an update query.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nQuery_1\n:\nQuery_Q\n\nSee Sample Input 1 for an example.\n\nOutput\n\nFor each evaluation query, print a line containing the response, in the order in which the queries are given.\n\nThe response to each evaluation query should be the minimum value of x that minimizes f(x), and the minimum value of f(x), in this order, with space in between.\n\nSample Input 1\n\n4\n1 4 2\n2\n1 1 -8\n2\n\nSample Output 1\n\n4 2\n1 -3\n\nIn the first evaluation query, f(x) = |x - 4| + 2, which attains the minimum value of 2 at x = 4.\n\nIn the second evaluation query, f(x) = |x - 1| + |x - 4| - 6, which attains the minimum value of -3 when 1 \\leq x \\leq 4. Among the multiple values of x that minimize f(x), we ask you to print the minimum, that is, 1.\n\nSample Input 2\n\n4\n1 -1000000000 1000000000\n1 -1000000000 1000000000\n1 -1000000000 1000000000\n2\n\nSample Output 2\n\n-1000000000 3000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1305, "cpu_time_ms": 360, "memory_kb": 24192}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s030892049", "group_id": "codeNet:p03040", "input_text": "module MultiSet = struct\n  (* 多重集合 *)\n  module type OrderedType =\n    sig\n      type t\n      val compare: t -> t -> int\n    end\n\n  module type S =\n    sig\n      type elt\n      type t\n      (* 空集合 *)\n      val empty : t\n      (* 要素数 *)\n      val cardinal : t -> int\n      (* 要素xをn個追加 *)\n      val add : elt -> int -> t -> t\n      (* 要素xをn個削除 要素がn個以上存在しない場合は全て削除 *)\n      val remove : elt -> int -> t -> t\n      (* 要素xの数を数える *)\n      val count : elt -> t -> int\n      (* xより小さい要素の数を数える *)\n      val count_lt : elt -> t -> int\n      (* xより大きい要素の数を数える *)\n      val count_gt : elt -> t -> int\n      (* 昇順に見た時のn番目の要素 範囲外ならNot_foundを投げる *)\n      val nth_inc : int -> t -> elt\n      (* 降順に見た時のn番目の要素 範囲外ならNot_foundを投げる *)\n      val nth_dec : int -> t -> elt\n      (* 昇順に見てn要素を取り出す n要素に満たなければ全ての要素を昇順に列挙する *)\n      val take_inc : int -> t -> elt list\n      (* 降順に見てn要素を取り出す n要素に満たなければ全ての要素を降順に列挙する *)\n      val take_dec : int -> t -> elt list\n      (* 全ての要素を昇順に列挙する *)\n      val elements_inc : t -> elt list\n      (* 全ての要素を降順に列挙する *)\n      val elements_dec : t -> elt list\n      (* 昇順に要素を畳み込む *)\n      val fold_inc : ('a -> elt -> 'a) -> 'a -> t -> 'a\n      (* 降順に要素を畳み込む *)\n      val fold_dec : (elt -> 'a -> 'a) -> t -> 'a -> 'a\n      (* 最小の要素 空集合が与えられた場合はNot_foundを投げる *)\n      val min_elt : t -> elt\n      (* 最大の要素 空集合が与えられた場合はNot_foundを投げる *)\n      val max_elt : t -> elt\n    end\n\n  module Make (Ord : OrderedType) : S with type elt = Ord.t =\n    struct\n      type elt = Ord.t\n\n      (* MapからパクったのでAVL木の変種（高さの差を2以下まで許容する） *)\n      type t =\n        | Empty\n        | Node of body\n      and body =\n        { left : t;\n          data : elt;\n          count : int;\n          right : t;\n          height : int;\n          cardinal : int }\n\n      let empty = Empty\n\n      let height = function\n        | Empty -> 0\n        | Node { height } -> height\n\n      let cardinal = function\n        | Empty -> 0\n        | Node { cardinal } -> cardinal\n\n      let create ~left ~data ~count ~right =\n        Node\n          { left; data; count; right;\n            height = 1 + max (height left) (height right);\n            cardinal = count + cardinal left + cardinal right }\n\n      let balance ~left:l ~data:x ~count:d ~right:r =\n        let hl = height l in\n        let hr = height r in\n        if hl > hr + 2 then begin\n          match l with\n          | Empty -> invalid_arg \"MultiSet.balance\" | Node { left = ll; data = lv; count = ld; right = lr } ->\n              if height ll >= height lr then\n                create ll lv ld (create lr x d r)\n              else begin\n                match lr with\n                | Empty -> invalid_arg \"MultiSet.balance\"\n                | Node { left = lrl; data = lrv; count = lrd; right = lrr } ->\n                    create (create ll lv ld lrl) lrv lrd (create lrr x d r)\n              end\n        end else if hr > hl + 2 then begin\n          match r with\n          | Empty -> invalid_arg \"MultiSet.balance\"\n          | Node { left = rl; data = rv; count = rd; right = rr } ->\n              if height rr >= height rl then\n                create (create l x d rl) rv rd rr\n              else begin\n                match rl with\n                | Empty -> invalid_arg \"MultiSet.balance\"\n                | Node { left = rll; data = rlv; count = rld; right = rlr } ->\n                    create (create l x d rll) rlv rld (create rlr rv rd rr)\n              end\n        end else create l x d r\n\n      let rec add x n = function\n        | Empty -> create Empty x n Empty\n        | Node { left; data = y; count; right } ->\n            match Ord.compare x y with\n            | 0 ->\n                create left x (count + n) right\n            | c when c < 0 ->\n                balance (add x n left) y count right\n            | _ ->\n                balance left y count (add x n right)\n\n      (* 最小の要素とその数を返す *)\n      let rec count_min_elt = function\n        | Empty -> raise Not_found\n        | Node { left = Empty; data; count } -> (data, count)\n        | Node { left } -> count_min_elt left\n\n      (* 最小の要素を全て削除する *)\n      let rec clear_min_elt = function\n        | Empty -> invalid_arg \"MultiSet.clear_min_elt\"\n        | Node { left = Empty; right } -> right\n        | Node { left; data; count; right } -> balance (clear_min_elt left) data count right\n\n      let merge t1 t2 =\n        match t1, t2 with\n        | Empty, t\n        | t, Empty -> t\n        | Node _, Node _ ->\n            let (x, c) = count_min_elt t2 in\n            balance t1 x c (clear_min_elt t2)\n\n      let rec remove x n = function\n        | Empty -> Empty\n        | Node { left; data = y; count; right } ->\n            match Ord.compare x y with\n            | 0 ->\n                if count <= n then\n                  merge left right\n                else\n                  create left y (count - n) right\n            | c when c < 0 ->\n                balance (remove x n left) y count right\n            | _ ->\n                balance left y count (remove x n right)\n\n      let rec count x = function\n        | Empty -> 0\n        | Node { left; data = y; count = n; right } ->\n            match Ord.compare x y with\n            | 0 -> n\n            | c when c < 0 ->\n                count x left\n            | _ ->\n                count x right\n\n      let rec count_lt x = function\n        | Empty -> 0\n        | Node { left; data = y; count; right } ->\n            match Ord.compare x y with\n            | 0 ->\n                cardinal left\n            | c when c < 0 ->\n                count_lt x left\n            | _ ->\n                count_lt x right + count + cardinal left\n\n      let rec count_gt x = function\n        | Empty -> 0\n        | Node { left; data = y; count; right } ->\n            match Ord.compare x y with\n            | 0 ->\n                cardinal right\n            | c when 0 < c ->\n                count_gt x right\n            | _ ->\n                count_gt x left + count + cardinal right\n\n      let rec nth_inc n = function\n        | Empty -> raise Not_found\n        | Node { left; data; count; right } ->\n            if n < cardinal left then\n              nth_inc n left\n            else if n < cardinal left + count then\n              data\n            else\n              nth_inc (n - cardinal left - count) right\n\n      let rec nth_dec n = function\n        | Empty -> raise Not_found\n        | Node { left; data; count; right } ->\n            if n < cardinal right then\n              nth_dec n right\n            else if n < cardinal right + count then\n              data\n            else\n              nth_dec (n - cardinal right - count) left\n\n      let rec elements_inc acc = function\n        | Empty -> acc\n        | Node { left; data; count; right } ->\n            elements_inc\n              (Array.fold_left (fun acc x -> x :: acc)\n                (elements_inc acc right)\n                (Array.make count data)) left\n\n      let rec elements_dec acc = function\n        | Empty -> acc\n        | Node { left; data; count; right } ->\n            elements_dec\n              (Array.fold_left (fun acc x -> x :: acc)\n                (elements_dec acc left)\n                (Array.make count data)) right\n\n      let rec take_inc n = function\n        | Empty -> []\n        | Node { left; data; count; right } ->\n            if n < cardinal left then\n              take_inc n left\n            else if n < cardinal left + count then\n              elements_inc (Array.to_list (Array.make (n - cardinal left) data)) left\n            else\n              elements_inc\n                (Array.fold_left (fun acc x -> x :: acc)\n                  (take_inc (n - cardinal left - count) right)\n                  (Array.make count data)) left\n\n      let rec take_dec n = function\n        | Empty -> []\n        | Node { left; data; count; right } ->\n            if n < cardinal right then\n              take_dec n right\n            else if n < cardinal right + count then\n              elements_dec (Array.to_list (Array.make (n - cardinal right) data)) right\n            else\n              elements_dec\n                (Array.fold_left (fun acc x -> x :: acc)\n                  (take_dec (n - cardinal right - count) left)\n                  (Array.make count data)) right\n\n      let elements_inc = elements_inc []\n      let elements_dec = elements_dec []\n\n      let rec fold_inc f acc = function\n        | Empty -> acc\n        | Node { left; data; count; right } ->\n            fold_inc f\n              (Array.fold_left f\n                (fold_inc f acc left)\n                (Array.make count data)) right\n\n      let rec fold_dec f acc = function\n        | Empty -> acc\n        | Node { left; data; count; right } ->\n            fold_dec f\n              (Array.fold_right f\n                (Array.make count data)\n                (fold_dec f acc right)) left\n      let fold_dec f t acc = fold_dec f acc t\n\n      let rec min_elt t = fst (count_min_elt t)\n\n      let rec max_elt = function\n        | Empty -> raise Not_found\n        | Node { data; right = Empty } -> data\n        | Node { right } -> max_elt right\n    end\nend\n\nmodule IntMultiSet = MultiSet.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet _ =\n  Array.fold_left (fun (acc, q) -> function\n    | None ->\n        let n = IntMultiSet.cardinal q in\n        Printf.printf \"%d %d\\n\"\n          (IntMultiSet.nth_inc ((n - 1) / 2) q)\n          (acc +\n            if n mod 2 = 1\n            then 0\n            else IntMultiSet.nth_inc (n / 2) q - IntMultiSet.nth_inc ((n - 1) / 2) q);\n        (acc, q)\n    | Some (a, b) ->\n        (acc + b, IntMultiSet.add a 1 q)) (0, IntMultiSet.empty) @@\n  Scanf.scanf \"%d \" @@ fun q ->\n    Array.init q @@ fun _ ->\n      Scanf.scanf \"%d \" @@ function\n        | 2 -> None\n        | 1 -> Scanf.scanf \"%d %d \" @@ fun a b -> Some (a, b)\n", "language": "OCaml", "metadata": {"date": 1569283184, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s030892049.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s030892049", "user_id": "u504158101"}, "prompt_components": {"gold_output": "4 2\n1 -3\n", "input_to_evaluate": "module MultiSet = struct\n  (* 多重集合 *)\n  module type OrderedType =\n    sig\n      type t\n      val compare: t -> t -> int\n    end\n\n  module type S =\n    sig\n      type elt\n      type t\n      (* 空集合 *)\n      val empty : t\n      (* 要素数 *)\n      val cardinal : t -> int\n      (* 要素xをn個追加 *)\n      val add : elt -> int -> t -> t\n      (* 要素xをn個削除 要素がn個以上存在しない場合は全て削除 *)\n      val remove : elt -> int -> t -> t\n      (* 要素xの数を数える *)\n      val count : elt -> t -> int\n      (* xより小さい要素の数を数える *)\n      val count_lt : elt -> t -> int\n      (* xより大きい要素の数を数える *)\n      val count_gt : elt -> t -> int\n      (* 昇順に見た時のn番目の要素 範囲外ならNot_foundを投げる *)\n      val nth_inc : int -> t -> elt\n      (* 降順に見た時のn番目の要素 範囲外ならNot_foundを投げる *)\n      val nth_dec : int -> t -> elt\n      (* 昇順に見てn要素を取り出す n要素に満たなければ全ての要素を昇順に列挙する *)\n      val take_inc : int -> t -> elt list\n      (* 降順に見てn要素を取り出す n要素に満たなければ全ての要素を降順に列挙する *)\n      val take_dec : int -> t -> elt list\n      (* 全ての要素を昇順に列挙する *)\n      val elements_inc : t -> elt list\n      (* 全ての要素を降順に列挙する *)\n      val elements_dec : t -> elt list\n      (* 昇順に要素を畳み込む *)\n      val fold_inc : ('a -> elt -> 'a) -> 'a -> t -> 'a\n      (* 降順に要素を畳み込む *)\n      val fold_dec : (elt -> 'a -> 'a) -> t -> 'a -> 'a\n      (* 最小の要素 空集合が与えられた場合はNot_foundを投げる *)\n      val min_elt : t -> elt\n      (* 最大の要素 空集合が与えられた場合はNot_foundを投げる *)\n      val max_elt : t -> elt\n    end\n\n  module Make (Ord : OrderedType) : S with type elt = Ord.t =\n    struct\n      type elt = Ord.t\n\n      (* MapからパクったのでAVL木の変種（高さの差を2以下まで許容する） *)\n      type t =\n        | Empty\n        | Node of body\n      and body =\n        { left : t;\n          data : elt;\n          count : int;\n          right : t;\n          height : int;\n          cardinal : int }\n\n      let empty = Empty\n\n      let height = function\n        | Empty -> 0\n        | Node { height } -> height\n\n      let cardinal = function\n        | Empty -> 0\n        | Node { cardinal } -> cardinal\n\n      let create ~left ~data ~count ~right =\n        Node\n          { left; data; count; right;\n            height = 1 + max (height left) (height right);\n            cardinal = count + cardinal left + cardinal right }\n\n      let balance ~left:l ~data:x ~count:d ~right:r =\n        let hl = height l in\n        let hr = height r in\n        if hl > hr + 2 then begin\n          match l with\n          | Empty -> invalid_arg \"MultiSet.balance\" | Node { left = ll; data = lv; count = ld; right = lr } ->\n              if height ll >= height lr then\n                create ll lv ld (create lr x d r)\n              else begin\n                match lr with\n                | Empty -> invalid_arg \"MultiSet.balance\"\n                | Node { left = lrl; data = lrv; count = lrd; right = lrr } ->\n                    create (create ll lv ld lrl) lrv lrd (create lrr x d r)\n              end\n        end else if hr > hl + 2 then begin\n          match r with\n          | Empty -> invalid_arg \"MultiSet.balance\"\n          | Node { left = rl; data = rv; count = rd; right = rr } ->\n              if height rr >= height rl then\n                create (create l x d rl) rv rd rr\n              else begin\n                match rl with\n                | Empty -> invalid_arg \"MultiSet.balance\"\n                | Node { left = rll; data = rlv; count = rld; right = rlr } ->\n                    create (create l x d rll) rlv rld (create rlr rv rd rr)\n              end\n        end else create l x d r\n\n      let rec add x n = function\n        | Empty -> create Empty x n Empty\n        | Node { left; data = y; count; right } ->\n            match Ord.compare x y with\n            | 0 ->\n                create left x (count + n) right\n            | c when c < 0 ->\n                balance (add x n left) y count right\n            | _ ->\n                balance left y count (add x n right)\n\n      (* 最小の要素とその数を返す *)\n      let rec count_min_elt = function\n        | Empty -> raise Not_found\n        | Node { left = Empty; data; count } -> (data, count)\n        | Node { left } -> count_min_elt left\n\n      (* 最小の要素を全て削除する *)\n      let rec clear_min_elt = function\n        | Empty -> invalid_arg \"MultiSet.clear_min_elt\"\n        | Node { left = Empty; right } -> right\n        | Node { left; data; count; right } -> balance (clear_min_elt left) data count right\n\n      let merge t1 t2 =\n        match t1, t2 with\n        | Empty, t\n        | t, Empty -> t\n        | Node _, Node _ ->\n            let (x, c) = count_min_elt t2 in\n            balance t1 x c (clear_min_elt t2)\n\n      let rec remove x n = function\n        | Empty -> Empty\n        | Node { left; data = y; count; right } ->\n            match Ord.compare x y with\n            | 0 ->\n                if count <= n then\n                  merge left right\n                else\n                  create left y (count - n) right\n            | c when c < 0 ->\n                balance (remove x n left) y count right\n            | _ ->\n                balance left y count (remove x n right)\n\n      let rec count x = function\n        | Empty -> 0\n        | Node { left; data = y; count = n; right } ->\n            match Ord.compare x y with\n            | 0 -> n\n            | c when c < 0 ->\n                count x left\n            | _ ->\n                count x right\n\n      let rec count_lt x = function\n        | Empty -> 0\n        | Node { left; data = y; count; right } ->\n            match Ord.compare x y with\n            | 0 ->\n                cardinal left\n            | c when c < 0 ->\n                count_lt x left\n            | _ ->\n                count_lt x right + count + cardinal left\n\n      let rec count_gt x = function\n        | Empty -> 0\n        | Node { left; data = y; count; right } ->\n            match Ord.compare x y with\n            | 0 ->\n                cardinal right\n            | c when 0 < c ->\n                count_gt x right\n            | _ ->\n                count_gt x left + count + cardinal right\n\n      let rec nth_inc n = function\n        | Empty -> raise Not_found\n        | Node { left; data; count; right } ->\n            if n < cardinal left then\n              nth_inc n left\n            else if n < cardinal left + count then\n              data\n            else\n              nth_inc (n - cardinal left - count) right\n\n      let rec nth_dec n = function\n        | Empty -> raise Not_found\n        | Node { left; data; count; right } ->\n            if n < cardinal right then\n              nth_dec n right\n            else if n < cardinal right + count then\n              data\n            else\n              nth_dec (n - cardinal right - count) left\n\n      let rec elements_inc acc = function\n        | Empty -> acc\n        | Node { left; data; count; right } ->\n            elements_inc\n              (Array.fold_left (fun acc x -> x :: acc)\n                (elements_inc acc right)\n                (Array.make count data)) left\n\n      let rec elements_dec acc = function\n        | Empty -> acc\n        | Node { left; data; count; right } ->\n            elements_dec\n              (Array.fold_left (fun acc x -> x :: acc)\n                (elements_dec acc left)\n                (Array.make count data)) right\n\n      let rec take_inc n = function\n        | Empty -> []\n        | Node { left; data; count; right } ->\n            if n < cardinal left then\n              take_inc n left\n            else if n < cardinal left + count then\n              elements_inc (Array.to_list (Array.make (n - cardinal left) data)) left\n            else\n              elements_inc\n                (Array.fold_left (fun acc x -> x :: acc)\n                  (take_inc (n - cardinal left - count) right)\n                  (Array.make count data)) left\n\n      let rec take_dec n = function\n        | Empty -> []\n        | Node { left; data; count; right } ->\n            if n < cardinal right then\n              take_dec n right\n            else if n < cardinal right + count then\n              elements_dec (Array.to_list (Array.make (n - cardinal right) data)) right\n            else\n              elements_dec\n                (Array.fold_left (fun acc x -> x :: acc)\n                  (take_dec (n - cardinal right - count) left)\n                  (Array.make count data)) right\n\n      let elements_inc = elements_inc []\n      let elements_dec = elements_dec []\n\n      let rec fold_inc f acc = function\n        | Empty -> acc\n        | Node { left; data; count; right } ->\n            fold_inc f\n              (Array.fold_left f\n                (fold_inc f acc left)\n                (Array.make count data)) right\n\n      let rec fold_dec f acc = function\n        | Empty -> acc\n        | Node { left; data; count; right } ->\n            fold_dec f\n              (Array.fold_right f\n                (Array.make count data)\n                (fold_dec f acc right)) left\n      let fold_dec f t acc = fold_dec f acc t\n\n      let rec min_elt t = fst (count_min_elt t)\n\n      let rec max_elt = function\n        | Empty -> raise Not_found\n        | Node { data; right = Empty } -> data\n        | Node { right } -> max_elt right\n    end\nend\n\nmodule IntMultiSet = MultiSet.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet _ =\n  Array.fold_left (fun (acc, q) -> function\n    | None ->\n        let n = IntMultiSet.cardinal q in\n        Printf.printf \"%d %d\\n\"\n          (IntMultiSet.nth_inc ((n - 1) / 2) q)\n          (acc +\n            if n mod 2 = 1\n            then 0\n            else IntMultiSet.nth_inc (n / 2) q - IntMultiSet.nth_inc ((n - 1) / 2) q);\n        (acc, q)\n    | Some (a, b) ->\n        (acc + b, IntMultiSet.add a 1 q)) (0, IntMultiSet.empty) @@\n  Scanf.scanf \"%d \" @@ fun q ->\n    Array.init q @@ fun _ ->\n      Scanf.scanf \"%d \" @@ function\n        | 2 -> None\n        | 1 -> Scanf.scanf \"%d %d \" @@ fun a b -> Some (a, b)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere is a function f(x), which is initially a constant function f(x) = 0.\n\nWe will ask you to process Q queries in order. There are two kinds of queries, update queries and evaluation queries, as follows:\n\nAn update query 1 a b: Given two integers a and b, let g(x) = f(x) + |x - a| + b and replace f(x) with g(x).\n\nAn evaluation query 2: Print x that minimizes f(x), and the minimum value of f(x). If there are multiple such values of x, choose the minimum such value.\n\nWe can show that the values to be output in an evaluation query are always integers, so we ask you to print those values as integers without decimal points.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n-10^9 \\leq a, b \\leq 10^9\n\nThe first query is an update query.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nQuery_1\n:\nQuery_Q\n\nSee Sample Input 1 for an example.\n\nOutput\n\nFor each evaluation query, print a line containing the response, in the order in which the queries are given.\n\nThe response to each evaluation query should be the minimum value of x that minimizes f(x), and the minimum value of f(x), in this order, with space in between.\n\nSample Input 1\n\n4\n1 4 2\n2\n1 1 -8\n2\n\nSample Output 1\n\n4 2\n1 -3\n\nIn the first evaluation query, f(x) = |x - 4| + 2, which attains the minimum value of 2 at x = 4.\n\nIn the second evaluation query, f(x) = |x - 1| + |x - 4| - 6, which attains the minimum value of -3 when 1 \\leq x \\leq 4. Among the multiple values of x that minimize f(x), we ask you to print the minimum, that is, 1.\n\nSample Input 2\n\n4\n1 -1000000000 1000000000\n1 -1000000000 1000000000\n1 -1000000000 1000000000\n2\n\nSample Output 2\n\n-1000000000 3000000000", "sample_input": "4\n1 4 2\n2\n1 1 -8\n2\n"}, "reference_outputs": ["4 2\n1 -3\n"], "source_document_id": "p03040", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere is a function f(x), which is initially a constant function f(x) = 0.\n\nWe will ask you to process Q queries in order. There are two kinds of queries, update queries and evaluation queries, as follows:\n\nAn update query 1 a b: Given two integers a and b, let g(x) = f(x) + |x - a| + b and replace f(x) with g(x).\n\nAn evaluation query 2: Print x that minimizes f(x), and the minimum value of f(x). If there are multiple such values of x, choose the minimum such value.\n\nWe can show that the values to be output in an evaluation query are always integers, so we ask you to print those values as integers without decimal points.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq Q \\leq 2 \\times 10^5\n\n-10^9 \\leq a, b \\leq 10^9\n\nThe first query is an update query.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nQuery_1\n:\nQuery_Q\n\nSee Sample Input 1 for an example.\n\nOutput\n\nFor each evaluation query, print a line containing the response, in the order in which the queries are given.\n\nThe response to each evaluation query should be the minimum value of x that minimizes f(x), and the minimum value of f(x), in this order, with space in between.\n\nSample Input 1\n\n4\n1 4 2\n2\n1 1 -8\n2\n\nSample Output 1\n\n4 2\n1 -3\n\nIn the first evaluation query, f(x) = |x - 4| + 2, which attains the minimum value of 2 at x = 4.\n\nIn the second evaluation query, f(x) = |x - 1| + |x - 4| - 6, which attains the minimum value of -3 when 1 \\leq x \\leq 4. Among the multiple values of x that minimize f(x), we ask you to print the minimum, that is, 1.\n\nSample Input 2\n\n4\n1 -1000000000 1000000000\n1 -1000000000 1000000000\n1 -1000000000 1000000000\n2\n\nSample Output 2\n\n-1000000000 3000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 10390, "cpu_time_ms": 380, "memory_kb": 26496}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s838600477", "group_id": "codeNet:p03041", "input_text": "let n, k, s = Scanf.scanf \" %d %d %s\" @@ fun a b c -> a, b - 1, c\nlet _ = print_endline @@ String.mapi (fun i c -> if i = k then Char.lowercase c else c) s", "language": "OCaml", "metadata": {"date": 1568763445, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03041.html", "problem_id": "p03041", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03041/input.txt", "sample_output_relpath": "derived/input_output/data/p03041/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03041/OCaml/s838600477.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s838600477", "user_id": "u732304692"}, "prompt_components": {"gold_output": "aBC\n", "input_to_evaluate": "let n, k, s = Scanf.scanf \" %d %d %s\" @@ fun a b c -> a, b - 1, c\nlet _ = print_endline @@ String.mapi (fun i c -> if i = k then Char.lowercase c else c) s", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of A, B and C, and an integer K which is between 1 and N (inclusive).\nPrint the string S after lowercasing the K-th character in it.\n\nConstraints\n\n1 ≤ N ≤ 50\n\n1 ≤ K ≤ N\n\nS is a string of length N consisting of A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the string S after lowercasing the K-th character in it.\n\nSample Input 1\n\n3 1\nABC\n\nSample Output 1\n\naBC\n\nSample Input 2\n\n4 3\nCABA\n\nSample Output 2\n\nCAbA", "sample_input": "3 1\nABC\n"}, "reference_outputs": ["aBC\n"], "source_document_id": "p03041", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of A, B and C, and an integer K which is between 1 and N (inclusive).\nPrint the string S after lowercasing the K-th character in it.\n\nConstraints\n\n1 ≤ N ≤ 50\n\n1 ≤ K ≤ N\n\nS is a string of length N consisting of A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the string S after lowercasing the K-th character in it.\n\nSample Input 1\n\n3 1\nABC\n\nSample Output 1\n\naBC\n\nSample Input 2\n\n4 3\nCABA\n\nSample Output 2\n\nCAbA", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 155, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s435876624", "group_id": "codeNet:p03042", "input_text": "let () = Scanf.scanf \"%2d%2d\" @@ fun left right ->\n  let yymm = 1 <= right && right <= 12 in\n  let mmyy = 1 <= left && left <= 12 in\n  print_endline @@\n  match (yymm, mmyy) with\n  | (true, true) -> \"AMBIGUOUS\"\n  | (true, false) -> \"YYMM\"\n  | (false, true) -> \"MMYY\"\n  | (false, false) -> \"NA\"", "language": "OCaml", "metadata": {"date": 1597934681, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s435876624.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s435876624", "user_id": "u052332717"}, "prompt_components": {"gold_output": "YYMM\n", "input_to_evaluate": "let () = Scanf.scanf \"%2d%2d\" @@ fun left right ->\n  let yymm = 1 <= right && right <= 12 in\n  let mmyy = 1 <= left && left <= 12 in\n  print_endline @@\n  match (yymm, mmyy) with\n  | (true, true) -> \"AMBIGUOUS\"\n  | (true, false) -> \"YYMM\"\n  | (false, true) -> \"MMYY\"\n  | (false, false) -> \"NA\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have a digit sequence S of length 4. You are wondering which of the following formats S is in:\n\nYYMM format: the last two digits of the year and the two-digit representation of the month (example: 01 for January), concatenated in this order\n\nMMYY format: the two-digit representation of the month and the last two digits of the year, concatenated in this order\n\nIf S is valid in only YYMM format, print YYMM; if S is valid in only MMYY format, print MMYY; if S is valid in both formats, print AMBIGUOUS; if S is valid in neither format, print NA.\n\nConstraints\n\nS is a digit sequence of length 4.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the specified string: YYMM, MMYY, AMBIGUOUS or NA.\n\nSample Input 1\n\n1905\n\nSample Output 1\n\nYYMM\n\nMay XX19 is a valid date, but 19 is not valid as a month. Thus, this string is only valid in YYMM format.\n\nSample Input 2\n\n0112\n\nSample Output 2\n\nAMBIGUOUS\n\nBoth December XX01 and January XX12 are valid dates. Thus, this string is valid in both formats.\n\nSample Input 3\n\n1700\n\nSample Output 3\n\nNA\n\nNeither 0 nor 17 is valid as a month. Thus, this string is valid in neither format.", "sample_input": "1905\n"}, "reference_outputs": ["YYMM\n"], "source_document_id": "p03042", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have a digit sequence S of length 4. You are wondering which of the following formats S is in:\n\nYYMM format: the last two digits of the year and the two-digit representation of the month (example: 01 for January), concatenated in this order\n\nMMYY format: the two-digit representation of the month and the last two digits of the year, concatenated in this order\n\nIf S is valid in only YYMM format, print YYMM; if S is valid in only MMYY format, print MMYY; if S is valid in both formats, print AMBIGUOUS; if S is valid in neither format, print NA.\n\nConstraints\n\nS is a digit sequence of length 4.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the specified string: YYMM, MMYY, AMBIGUOUS or NA.\n\nSample Input 1\n\n1905\n\nSample Output 1\n\nYYMM\n\nMay XX19 is a valid date, but 19 is not valid as a month. Thus, this string is only valid in YYMM format.\n\nSample Input 2\n\n0112\n\nSample Output 2\n\nAMBIGUOUS\n\nBoth December XX01 and January XX12 are valid dates. Thus, this string is valid in both formats.\n\nSample Input 3\n\n1700\n\nSample Output 3\n\nNA\n\nNeither 0 nor 17 is valid as a month. Thus, this string is valid in neither format.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 292, "cpu_time_ms": 8, "memory_kb": 3740}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s051432203", "group_id": "codeNet:p03042", "input_text": "let () =\n  print_endline @@\n  Scanf.scanf \"%2d %2d\" @@ fun a b ->\n  if a <= 12 && b <= 12 then \"AMBIGUOUS\"\n  else if a <= 12 then \"MMYY\"\n  else if b <= 12 then \"YYMM\"\n  else \"NA\"\n", "language": "OCaml", "metadata": {"date": 1558314522, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s051432203.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s051432203", "user_id": "u798181098"}, "prompt_components": {"gold_output": "YYMM\n", "input_to_evaluate": "let () =\n  print_endline @@\n  Scanf.scanf \"%2d %2d\" @@ fun a b ->\n  if a <= 12 && b <= 12 then \"AMBIGUOUS\"\n  else if a <= 12 then \"MMYY\"\n  else if b <= 12 then \"YYMM\"\n  else \"NA\"\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have a digit sequence S of length 4. You are wondering which of the following formats S is in:\n\nYYMM format: the last two digits of the year and the two-digit representation of the month (example: 01 for January), concatenated in this order\n\nMMYY format: the two-digit representation of the month and the last two digits of the year, concatenated in this order\n\nIf S is valid in only YYMM format, print YYMM; if S is valid in only MMYY format, print MMYY; if S is valid in both formats, print AMBIGUOUS; if S is valid in neither format, print NA.\n\nConstraints\n\nS is a digit sequence of length 4.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the specified string: YYMM, MMYY, AMBIGUOUS or NA.\n\nSample Input 1\n\n1905\n\nSample Output 1\n\nYYMM\n\nMay XX19 is a valid date, but 19 is not valid as a month. Thus, this string is only valid in YYMM format.\n\nSample Input 2\n\n0112\n\nSample Output 2\n\nAMBIGUOUS\n\nBoth December XX01 and January XX12 are valid dates. Thus, this string is valid in both formats.\n\nSample Input 3\n\n1700\n\nSample Output 3\n\nNA\n\nNeither 0 nor 17 is valid as a month. Thus, this string is valid in neither format.", "sample_input": "1905\n"}, "reference_outputs": ["YYMM\n"], "source_document_id": "p03042", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have a digit sequence S of length 4. You are wondering which of the following formats S is in:\n\nYYMM format: the last two digits of the year and the two-digit representation of the month (example: 01 for January), concatenated in this order\n\nMMYY format: the two-digit representation of the month and the last two digits of the year, concatenated in this order\n\nIf S is valid in only YYMM format, print YYMM; if S is valid in only MMYY format, print MMYY; if S is valid in both formats, print AMBIGUOUS; if S is valid in neither format, print NA.\n\nConstraints\n\nS is a digit sequence of length 4.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the specified string: YYMM, MMYY, AMBIGUOUS or NA.\n\nSample Input 1\n\n1905\n\nSample Output 1\n\nYYMM\n\nMay XX19 is a valid date, but 19 is not valid as a month. Thus, this string is only valid in YYMM format.\n\nSample Input 2\n\n0112\n\nSample Output 2\n\nAMBIGUOUS\n\nBoth December XX01 and January XX12 are valid dates. Thus, this string is valid in both formats.\n\nSample Input 3\n\n1700\n\nSample Output 3\n\nNA\n\nNeither 0 nor 17 is valid as a month. Thus, this string is valid in neither format.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 179, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s429851856", "group_id": "codeNet:p03043", "input_text": "open Batteries\nlet n, k = Scanf.sscanf (read_line()) \"%d %d\" (fun n k ->n, k)\nlet rec how_many n target =\n  if n >= target then 0 else 1 + how_many (n*2) target\n \nlet rec n_loop i =\n  if i > n then 0. else(\n    ((1. /. 2.) ** (float_of_int @@ how_many i k)) *. (1. /. (float_of_int n)) +. (n_loop @@ i + 1))\n \nlet () = Printf.printf \"%.10f\\n\" @@ n_loop 1", "language": "OCaml", "metadata": {"date": 1587220427, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s429851856.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s429851856", "user_id": "u511870776"}, "prompt_components": {"gold_output": "0.145833333333\n", "input_to_evaluate": "open Batteries\nlet n, k = Scanf.sscanf (read_line()) \"%d %d\" (fun n k ->n, k)\nlet rec how_many n target =\n  if n >= target then 0 else 1 + how_many (n*2) target\n \nlet rec n_loop i =\n  if i > n then 0. else(\n    ((1. /. 2.) ** (float_of_int @@ how_many i k)) *. (1. /. (float_of_int n)) +. (n_loop @@ i + 1))\n \nlet () = Printf.printf \"%.10f\\n\" @@ n_loop 1", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has a fair N-sided die that shows the integers from 1 to N with equal probability and a fair coin. He will play the following game with them:\n\nThrow the die. The current score is the result of the die.\n\nAs long as the score is between 1 and K-1 (inclusive), keep flipping the coin. The score is doubled each time the coin lands heads up, and the score becomes 0 if the coin lands tails up.\n\nThe game ends when the score becomes 0 or becomes K or above. Snuke wins if the score is K or above, and loses if the score is 0.\n\nYou are given N and K. Find the probability that Snuke wins the game.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the probability that Snuke wins the game. The output is considered correct when the absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n3 10\n\nSample Output 1\n\n0.145833333333\n\nIf the die shows 1, Snuke needs to get four consecutive heads from four coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^4 = \\frac{1}{48}.\n\nIf the die shows 2, Snuke needs to get three consecutive heads from three coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^3 = \\frac{1}{24}.\n\nIf the die shows 3, Snuke needs to get two consecutive heads from two coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^2 = \\frac{1}{12}.\n\nThus, the probability that Snuke wins is \\frac{1}{48} + \\frac{1}{24} + \\frac{1}{12} = \\frac{7}{48} \\simeq 0.1458333333.\n\nSample Input 2\n\n100000 5\n\nSample Output 2\n\n0.999973749998", "sample_input": "3 10\n"}, "reference_outputs": ["0.145833333333\n"], "source_document_id": "p03043", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has a fair N-sided die that shows the integers from 1 to N with equal probability and a fair coin. He will play the following game with them:\n\nThrow the die. The current score is the result of the die.\n\nAs long as the score is between 1 and K-1 (inclusive), keep flipping the coin. The score is doubled each time the coin lands heads up, and the score becomes 0 if the coin lands tails up.\n\nThe game ends when the score becomes 0 or becomes K or above. Snuke wins if the score is K or above, and loses if the score is 0.\n\nYou are given N and K. Find the probability that Snuke wins the game.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the probability that Snuke wins the game. The output is considered correct when the absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n3 10\n\nSample Output 1\n\n0.145833333333\n\nIf the die shows 1, Snuke needs to get four consecutive heads from four coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^4 = \\frac{1}{48}.\n\nIf the die shows 2, Snuke needs to get three consecutive heads from three coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^3 = \\frac{1}{24}.\n\nIf the die shows 3, Snuke needs to get two consecutive heads from two coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^2 = \\frac{1}{12}.\n\nThus, the probability that Snuke wins is \\frac{1}{48} + \\frac{1}{24} + \\frac{1}{12} = \\frac{7}{48} \\simeq 0.1458333333.\n\nSample Input 2\n\n100000 5\n\nSample Output 2\n\n0.999973749998", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 354, "cpu_time_ms": 6, "memory_kb": 5760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s676298579", "group_id": "codeNet:p03043", "input_text": "let n, k = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet p = 1. /. float n\nlet log2 n = log n /. log 2.\nlet ans = ref 0.\nlet _ =\n  for i = 1 to n do\n    let j = max 0. @@ ceil @@ log2 @@ float k /. float i in\n    ans := !ans +. p *. 0.5 ** j done;\n  Printf.printf \"%.12f\\n\" !ans", "language": "OCaml", "metadata": {"date": 1561611226, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s676298579.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s676298579", "user_id": "u732304692"}, "prompt_components": {"gold_output": "0.145833333333\n", "input_to_evaluate": "let n, k = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet p = 1. /. float n\nlet log2 n = log n /. log 2.\nlet ans = ref 0.\nlet _ =\n  for i = 1 to n do\n    let j = max 0. @@ ceil @@ log2 @@ float k /. float i in\n    ans := !ans +. p *. 0.5 ** j done;\n  Printf.printf \"%.12f\\n\" !ans", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has a fair N-sided die that shows the integers from 1 to N with equal probability and a fair coin. He will play the following game with them:\n\nThrow the die. The current score is the result of the die.\n\nAs long as the score is between 1 and K-1 (inclusive), keep flipping the coin. The score is doubled each time the coin lands heads up, and the score becomes 0 if the coin lands tails up.\n\nThe game ends when the score becomes 0 or becomes K or above. Snuke wins if the score is K or above, and loses if the score is 0.\n\nYou are given N and K. Find the probability that Snuke wins the game.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the probability that Snuke wins the game. The output is considered correct when the absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n3 10\n\nSample Output 1\n\n0.145833333333\n\nIf the die shows 1, Snuke needs to get four consecutive heads from four coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^4 = \\frac{1}{48}.\n\nIf the die shows 2, Snuke needs to get three consecutive heads from three coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^3 = \\frac{1}{24}.\n\nIf the die shows 3, Snuke needs to get two consecutive heads from two coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^2 = \\frac{1}{12}.\n\nThus, the probability that Snuke wins is \\frac{1}{48} + \\frac{1}{24} + \\frac{1}{12} = \\frac{7}{48} \\simeq 0.1458333333.\n\nSample Input 2\n\n100000 5\n\nSample Output 2\n\n0.999973749998", "sample_input": "3 10\n"}, "reference_outputs": ["0.145833333333\n"], "source_document_id": "p03043", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has a fair N-sided die that shows the integers from 1 to N with equal probability and a fair coin. He will play the following game with them:\n\nThrow the die. The current score is the result of the die.\n\nAs long as the score is between 1 and K-1 (inclusive), keep flipping the coin. The score is doubled each time the coin lands heads up, and the score becomes 0 if the coin lands tails up.\n\nThe game ends when the score becomes 0 or becomes K or above. Snuke wins if the score is K or above, and loses if the score is 0.\n\nYou are given N and K. Find the probability that Snuke wins the game.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the probability that Snuke wins the game. The output is considered correct when the absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n3 10\n\nSample Output 1\n\n0.145833333333\n\nIf the die shows 1, Snuke needs to get four consecutive heads from four coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^4 = \\frac{1}{48}.\n\nIf the die shows 2, Snuke needs to get three consecutive heads from three coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^3 = \\frac{1}{24}.\n\nIf the die shows 3, Snuke needs to get two consecutive heads from two coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^2 = \\frac{1}{12}.\n\nThus, the probability that Snuke wins is \\frac{1}{48} + \\frac{1}{24} + \\frac{1}{12} = \\frac{7}{48} \\simeq 0.1458333333.\n\nSample Input 2\n\n100000 5\n\nSample Output 2\n\n0.999973749998", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 12, "memory_kb": 2560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s735918313", "group_id": "codeNet:p03043", "input_text": "let log2 b = (log10 b) /. (log10 2.)\n\nlet () =\n  let n, k = Scanf.scanf \"%d %d\\n\" (fun n k -> n, k) in\n  let sum = ref 0. in\n  for i = 1 to n do\n    let n, k = float_of_int n, float_of_int k in\n    let i' = float_of_int i in\n    let cnt = let v = log2 (k /. i') in if v < 0. then 0. else v in\n    let cnt = ceil cnt in\n    let p = (0.5 ** cnt) /. n in\n    sum := !sum +. p\n  done;\n  !sum |> print_float\n", "language": "OCaml", "metadata": {"date": 1558316611, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s735918313.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s735918313", "user_id": "u387591304"}, "prompt_components": {"gold_output": "0.145833333333\n", "input_to_evaluate": "let log2 b = (log10 b) /. (log10 2.)\n\nlet () =\n  let n, k = Scanf.scanf \"%d %d\\n\" (fun n k -> n, k) in\n  let sum = ref 0. in\n  for i = 1 to n do\n    let n, k = float_of_int n, float_of_int k in\n    let i' = float_of_int i in\n    let cnt = let v = log2 (k /. i') in if v < 0. then 0. else v in\n    let cnt = ceil cnt in\n    let p = (0.5 ** cnt) /. n in\n    sum := !sum +. p\n  done;\n  !sum |> print_float\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has a fair N-sided die that shows the integers from 1 to N with equal probability and a fair coin. He will play the following game with them:\n\nThrow the die. The current score is the result of the die.\n\nAs long as the score is between 1 and K-1 (inclusive), keep flipping the coin. The score is doubled each time the coin lands heads up, and the score becomes 0 if the coin lands tails up.\n\nThe game ends when the score becomes 0 or becomes K or above. Snuke wins if the score is K or above, and loses if the score is 0.\n\nYou are given N and K. Find the probability that Snuke wins the game.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the probability that Snuke wins the game. The output is considered correct when the absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n3 10\n\nSample Output 1\n\n0.145833333333\n\nIf the die shows 1, Snuke needs to get four consecutive heads from four coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^4 = \\frac{1}{48}.\n\nIf the die shows 2, Snuke needs to get three consecutive heads from three coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^3 = \\frac{1}{24}.\n\nIf the die shows 3, Snuke needs to get two consecutive heads from two coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^2 = \\frac{1}{12}.\n\nThus, the probability that Snuke wins is \\frac{1}{48} + \\frac{1}{24} + \\frac{1}{12} = \\frac{7}{48} \\simeq 0.1458333333.\n\nSample Input 2\n\n100000 5\n\nSample Output 2\n\n0.999973749998", "sample_input": "3 10\n"}, "reference_outputs": ["0.145833333333\n"], "source_document_id": "p03043", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has a fair N-sided die that shows the integers from 1 to N with equal probability and a fair coin. He will play the following game with them:\n\nThrow the die. The current score is the result of the die.\n\nAs long as the score is between 1 and K-1 (inclusive), keep flipping the coin. The score is doubled each time the coin lands heads up, and the score becomes 0 if the coin lands tails up.\n\nThe game ends when the score becomes 0 or becomes K or above. Snuke wins if the score is K or above, and loses if the score is 0.\n\nYou are given N and K. Find the probability that Snuke wins the game.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the probability that Snuke wins the game. The output is considered correct when the absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n3 10\n\nSample Output 1\n\n0.145833333333\n\nIf the die shows 1, Snuke needs to get four consecutive heads from four coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^4 = \\frac{1}{48}.\n\nIf the die shows 2, Snuke needs to get three consecutive heads from three coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^3 = \\frac{1}{24}.\n\nIf the die shows 3, Snuke needs to get two consecutive heads from two coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^2 = \\frac{1}{12}.\n\nThus, the probability that Snuke wins is \\frac{1}{48} + \\frac{1}{24} + \\frac{1}{12} = \\frac{7}{48} \\simeq 0.1458333333.\n\nSample Input 2\n\n100000 5\n\nSample Output 2\n\n0.999973749998", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 403, "cpu_time_ms": 10, "memory_kb": 2560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s137413310", "group_id": "codeNet:p03044", "input_text": "let tap f x = f x; x\n\nlet n = Scanf.sscanf (read_line ()) \"%d\" @@ fun n  -> n\nlet e = Array.init (n - 1) @@ fun _ -> Scanf.sscanf (read_line ()) \"%d %d %d\" @@ fun u v w -> (u, v, w)\n\nlet e = tap\n  (fun tbl -> Array.iter (fun (u, v, w) -> Hashtbl.add tbl (u - 1) ((v - 1), w); Hashtbl.add tbl (v - 1) ((u - 1), w)) e)\n  (Hashtbl.create n)\n\n\nlet f d =\n  let que = Queue.create () in\n  Queue.add (0, 0) que;\n  while not (Queue.is_empty que) do\n    let (i, w) = Queue.pop que in\n    d.(i) <- w;\n    List.iter (fun (a, b) -> if d.(a) = -1 then Queue.add (a, w + b) que) @@ Hashtbl.find_all e i\n  done\n\nlet () =\n  let d = Array.make n (-1) in\n  f d;\n  d |> Array.map (fun i -> string_of_int (i mod 2)) |> Array.iter print_endline", "language": "OCaml", "metadata": {"date": 1589248214, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s137413310.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s137413310", "user_id": "u811309788"}, "prompt_components": {"gold_output": "0\n0\n1\n", "input_to_evaluate": "let tap f x = f x; x\n\nlet n = Scanf.sscanf (read_line ()) \"%d\" @@ fun n  -> n\nlet e = Array.init (n - 1) @@ fun _ -> Scanf.sscanf (read_line ()) \"%d %d %d\" @@ fun u v w -> (u, v, w)\n\nlet e = tap\n  (fun tbl -> Array.iter (fun (u, v, w) -> Hashtbl.add tbl (u - 1) ((v - 1), w); Hashtbl.add tbl (v - 1) ((u - 1), w)) e)\n  (Hashtbl.create n)\n\n\nlet f d =\n  let que = Queue.create () in\n  Queue.add (0, 0) que;\n  while not (Queue.is_empty que) do\n    let (i, w) = Queue.pop que in\n    d.(i) <- w;\n    List.iter (fun (a, b) -> if d.(a) = -1 then Queue.add (a, w + b) que) @@ Hashtbl.find_all e i\n  done\n\nlet () =\n  let d = Array.make n (-1) in\n  f d;\n  d |> Array.map (fun i -> string_of_int (i mod 2)) |> Array.iter print_endline", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 343, "memory_kb": 28800}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s921072943", "group_id": "codeNet:p03044", "input_text": "(* O(n) *)\nScanf.scanf \" %d\" @@ fun n ->\n  let g = Array.make n [] in\n  for _ = 1 to n - 1 do\n    Scanf.scanf \" %d %d %d\" @@ fun u v w ->\n      let u, v = u - 1, v - 1 in\n      g.(u) <- (v, w mod 2) :: g.(u);\n      g.(v) <- (u, w mod 2) :: g.(v);\n  done;\n  let cs = Array.make n 0 in\n  let rec dfs v p c =\n    cs.(v) <- c;\n    let f (v2, w) = if v2 <> p then dfs v2 v @@ c lxor w in List.iter f g.(v) in\n  dfs 0 (-1) 0;\n  cs |> Array.iter @@ Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1559361669, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s921072943.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s921072943", "user_id": "u732304692"}, "prompt_components": {"gold_output": "0\n0\n1\n", "input_to_evaluate": "(* O(n) *)\nScanf.scanf \" %d\" @@ fun n ->\n  let g = Array.make n [] in\n  for _ = 1 to n - 1 do\n    Scanf.scanf \" %d %d %d\" @@ fun u v w ->\n      let u, v = u - 1, v - 1 in\n      g.(u) <- (v, w mod 2) :: g.(u);\n      g.(v) <- (u, w mod 2) :: g.(v);\n  done;\n  let cs = Array.make n 0 in\n  let rec dfs v p c =\n    cs.(v) <- c;\n    let f (v2, w) = if v2 <> p then dfs v2 v @@ c lxor w in List.iter f g.(v) in\n  dfs 0 (-1) 0;\n  cs |> Array.iter @@ Printf.printf \"%d\\n\"", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 143, "memory_kb": 20224}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s683810029", "group_id": "codeNet:p03044", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let es = Array.make n [] in\n  for i = 0 to n - 2 do\n    Scanf.scanf \"%d %d %d\\n\" @@ fun u v w ->\n      es.(u - 1) <- (v - 1, w) :: es.(u - 1);\n      es.(v - 1) <- (u - 1, w) :: es.(v - 1)\n  done;\n  let colours = Array.make n None in\n  let rec visit c v =\n    match colours.(v) with\n    | Some _ -> ()\n    | None ->\n        colours.(v) <- Some c;\n        List.iter (fun (u, w) -> visit (c lxor (w land 1)) u) es.(v) in\n  visit 0 0;\n  Array.iter (function\n    | None -> ()\n    | Some c -> Printf.printf \"%d\\n\" c) colours", "language": "OCaml", "metadata": {"date": 1558315453, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s683810029.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s683810029", "user_id": "u504158101"}, "prompt_components": {"gold_output": "0\n0\n1\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let es = Array.make n [] in\n  for i = 0 to n - 2 do\n    Scanf.scanf \"%d %d %d\\n\" @@ fun u v w ->\n      es.(u - 1) <- (v - 1, w) :: es.(u - 1);\n      es.(v - 1) <- (u - 1, w) :: es.(v - 1)\n  done;\n  let colours = Array.make n None in\n  let rec visit c v =\n    match colours.(v) with\n    | Some _ -> ()\n    | None ->\n        colours.(v) <- Some c;\n        List.iter (fun (u, w) -> visit (c lxor (w land 1)) u) es.(v) in\n  visit 0 0;\n  Array.iter (function\n    | None -> ()\n    | Some c -> Printf.printf \"%d\\n\" c) colours", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 146, "memory_kb": 19456}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s886922451", "group_id": "codeNet:p03045", "input_text": "(* https://atcoder.jp/contests/atc001/tasks/unionfind_a *)\nopen Printf\nopen Scanf\n\nclass unionfind size =\n  object(self)\n    val mutable forest = [|(0,0)|]\n    initializer begin\n      forest <- Array.init size (fun x -> (x,1))\n    end\n    method forest () = begin\n      forest\n    end\n    method print_forest () = begin\n      let _ = Array.iter (fun x -> Printf.printf \"(%d,%d);\" (fst x) (snd x)) forest in\n      print_newline()\n    end\n    method group_count () = begin\n      let count = ref 0 in\n      let _ = Array.iteri (fun i x -> if i = fst x then count := !count + 1) forest in\n      !count\n    end\n    method find i = begin\n      let (index, size) = forest.(i) in\n      if (i = index) then (i, size)\n      else\n        let (nxt_index, nxt_size) = self#find index in\n        forest.(i) <- (nxt_index, nxt_size);\n        (nxt_index, nxt_size)\n    end\n\n    method union i j = begin\n      let (x, x_size) = self#find i in\n      let (y, y_size) = self#find j in\n\n      if (x = y) then ()\n      else\n        let () = forest.(x) <- (y, x_size + y_size) in\n        forest.(y) <- (y, x_size + y_size)\n    end\n  end\n\n(*\nlet t = new unionfind 5;;\nt#union 0 1;;\nt#union 3 4;;\nt#forest();;\nt#find 0;;\n*)\n\nlet (n,m) = sscanf (read_line ()) \"%d %d\" (fun a b -> (a,b))\nlet query = Array.make m (0,0,0);;\nlet () = \nfor i = 0 to m-1 do\n  query.(i) <- sscanf (read_line ()) \"%d %d %d\" (fun x y z-> (x-1,y-1,z))\ndone;;\n\nlet forest = new unionfind n;;\nlet () = Array.iter (fun t -> let (x,y,z) = t in forest#union x y) query;;\nlet () = print_int (forest#group_count ()) in print_newline();;", "language": "OCaml", "metadata": {"date": 1559269181, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03045.html", "problem_id": "p03045", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03045/input.txt", "sample_output_relpath": "derived/input_output/data/p03045/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03045/OCaml/s886922451.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s886922451", "user_id": "u947517859"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(* https://atcoder.jp/contests/atc001/tasks/unionfind_a *)\nopen Printf\nopen Scanf\n\nclass unionfind size =\n  object(self)\n    val mutable forest = [|(0,0)|]\n    initializer begin\n      forest <- Array.init size (fun x -> (x,1))\n    end\n    method forest () = begin\n      forest\n    end\n    method print_forest () = begin\n      let _ = Array.iter (fun x -> Printf.printf \"(%d,%d);\" (fst x) (snd x)) forest in\n      print_newline()\n    end\n    method group_count () = begin\n      let count = ref 0 in\n      let _ = Array.iteri (fun i x -> if i = fst x then count := !count + 1) forest in\n      !count\n    end\n    method find i = begin\n      let (index, size) = forest.(i) in\n      if (i = index) then (i, size)\n      else\n        let (nxt_index, nxt_size) = self#find index in\n        forest.(i) <- (nxt_index, nxt_size);\n        (nxt_index, nxt_size)\n    end\n\n    method union i j = begin\n      let (x, x_size) = self#find i in\n      let (y, y_size) = self#find j in\n\n      if (x = y) then ()\n      else\n        let () = forest.(x) <- (y, x_size + y_size) in\n        forest.(y) <- (y, x_size + y_size)\n    end\n  end\n\n(*\nlet t = new unionfind 5;;\nt#union 0 1;;\nt#union 3 4;;\nt#forest();;\nt#find 0;;\n*)\n\nlet (n,m) = sscanf (read_line ()) \"%d %d\" (fun a b -> (a,b))\nlet query = Array.make m (0,0,0);;\nlet () = \nfor i = 0 to m-1 do\n  query.(i) <- sscanf (read_line ()) \"%d %d %d\" (fun x y z-> (x-1,y-1,z))\ndone;;\n\nlet forest = new unionfind n;;\nlet () = Array.iter (fun t -> let (x,y,z) = t in forest#union x y) query;;\nlet () = print_int (forest#group_count ()) in print_newline();;", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N cards placed face down in a row. On each card, an integer 1 or 2 is written.\n\nLet A_i be the integer written on the i-th card.\n\nYour objective is to guess A_1, A_2, ..., A_N correctly.\n\nYou know the following facts:\n\nFor each i = 1, 2, ..., M, the value A_{X_i} + A_{Y_i} + Z_i is an even number.\n\nYou are a magician and can use the following magic any number of times:\n\nMagic: Choose one card and know the integer A_i written on it. The cost of using this magic is 1.\n\nWhat is the minimum cost required to determine all of A_1, A_2, ..., A_N?\n\nIt is guaranteed that there is no contradiction in given input.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq X_i < Y_i \\leq N\n\n1 \\leq Z_i \\leq 100\n\nThe pairs (X_i, Y_i) are distinct.\n\nThere is no contradiction in input. (That is, there exist integers A_1, A_2, ..., A_N that satisfy the conditions.)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nX_1 Y_1 Z_1\nX_2 Y_2 Z_2\n\\vdots\nX_M Y_M Z_M\n\nOutput\n\nPrint the minimum total cost required to determine all of A_1, A_2, ..., A_N.\n\nSample Input 1\n\n3 1\n1 2 1\n\nSample Output 1\n\n2\n\nYou can determine all of A_1, A_2, A_3 by using the magic for the first and third cards.\n\nSample Input 2\n\n6 5\n1 2 1\n2 3 2\n1 3 3\n4 5 4\n5 6 5\n\nSample Output 2\n\n2\n\nSample Input 3\n\n100000 1\n1 100000 100\n\nSample Output 3\n\n99999", "sample_input": "3 1\n1 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03045", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N cards placed face down in a row. On each card, an integer 1 or 2 is written.\n\nLet A_i be the integer written on the i-th card.\n\nYour objective is to guess A_1, A_2, ..., A_N correctly.\n\nYou know the following facts:\n\nFor each i = 1, 2, ..., M, the value A_{X_i} + A_{Y_i} + Z_i is an even number.\n\nYou are a magician and can use the following magic any number of times:\n\nMagic: Choose one card and know the integer A_i written on it. The cost of using this magic is 1.\n\nWhat is the minimum cost required to determine all of A_1, A_2, ..., A_N?\n\nIt is guaranteed that there is no contradiction in given input.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq X_i < Y_i \\leq N\n\n1 \\leq Z_i \\leq 100\n\nThe pairs (X_i, Y_i) are distinct.\n\nThere is no contradiction in input. (That is, there exist integers A_1, A_2, ..., A_N that satisfy the conditions.)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nX_1 Y_1 Z_1\nX_2 Y_2 Z_2\n\\vdots\nX_M Y_M Z_M\n\nOutput\n\nPrint the minimum total cost required to determine all of A_1, A_2, ..., A_N.\n\nSample Input 1\n\n3 1\n1 2 1\n\nSample Output 1\n\n2\n\nYou can determine all of A_1, A_2, A_3 by using the magic for the first and third cards.\n\nSample Input 2\n\n6 5\n1 2 1\n2 3 2\n1 3 3\n4 5 4\n5 6 5\n\nSample Output 2\n\n2\n\nSample Input 3\n\n100000 1\n1 100000 100\n\nSample Output 3\n\n99999", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1577, "cpu_time_ms": 130, "memory_kb": 15744}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s624895097", "group_id": "codeNet:p03047", "input_text": "let () =\n  let n, k = Scanf.scanf \"%d %d\\n\" (fun n k -> n, k) in\n  let cnt = ref 0 in\n  for i = 0 to n - 1 - (k - 1) do\n    cnt := !cnt + 1\n  done;\n  print_int !cnt\n", "language": "OCaml", "metadata": {"date": 1557623969, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s624895097.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s624895097", "user_id": "u387591304"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () =\n  let n, k = Scanf.scanf \"%d %d\\n\" (fun n k -> n, k) in\n  let cnt = ref 0 in\n  for i = 0 to n - 1 - (k - 1) do\n    cnt := !cnt + 1\n  done;\n  print_int !cnt\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has N integers: 1,2,\\ldots,N.\nHe will choose K of them and give those to Takahashi.\n\nHow many ways are there to choose K consecutive integers?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq K \\leq N \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n2\n\nThere are two ways to choose two consecutive integers: (1,2) and (2,3).\n\nSample Input 2\n\n13 3\n\nSample Output 2\n\n11", "sample_input": "3 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03047", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has N integers: 1,2,\\ldots,N.\nHe will choose K of them and give those to Takahashi.\n\nHow many ways are there to choose K consecutive integers?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq K \\leq N \\leq 50\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n2\n\nThere are two ways to choose two consecutive integers: (1,2) and (2,3).\n\nSample Input 2\n\n13 3\n\nSample Output 2\n\n11", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 165, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s157775776", "group_id": "codeNet:p03048", "input_text": "let r, g, b, n = Scanf.scanf \" %d %d %d %d\" @@ fun a b c d -> a, b, c, d\nlet ans = ref 0\nlet _ =\n  for i = 0 to n do\n    for j = 0 to n do\n      let rest = n - i * r - j * g in\n      if rest >= 0 && rest mod b = 0 then incr ans done done;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1561428256, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s157775776.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s157775776", "user_id": "u732304692"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let r, g, b, n = Scanf.scanf \" %d %d %d %d\" @@ fun a b c d -> a, b, c, d\nlet ans = ref 0\nlet _ =\n  for i = 0 to n do\n    for j = 0 to n do\n      let rest = n - i * r - j * g in\n      if rest >= 0 && rest mod b = 0 then incr ans done done;\n  Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has come to a store that sells boxes containing balls. The store sells the following three kinds of boxes:\n\nRed boxes, each containing R red balls\n\nGreen boxes, each containing G green balls\n\nBlue boxes, each containing B blue balls\n\nSnuke wants to get a total of exactly N balls by buying r red boxes, g green boxes and b blue boxes.\nHow many triples of non-negative integers (r,g,b) achieve this?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq R,G,B,N \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR G B N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 3 4\n\nSample Output 1\n\n4\n\nFour triples achieve the objective, as follows:\n\n(4,0,0)\n\n(2,1,0)\n\n(1,0,1)\n\n(0,2,0)\n\nSample Input 2\n\n13 1 4 3000\n\nSample Output 2\n\n87058", "sample_input": "1 2 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03048", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has come to a store that sells boxes containing balls. The store sells the following three kinds of boxes:\n\nRed boxes, each containing R red balls\n\nGreen boxes, each containing G green balls\n\nBlue boxes, each containing B blue balls\n\nSnuke wants to get a total of exactly N balls by buying r red boxes, g green boxes and b blue boxes.\nHow many triples of non-negative integers (r,g,b) achieve this?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq R,G,B,N \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR G B N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 3 4\n\nSample Output 1\n\n4\n\nFour triples achieve the objective, as follows:\n\n(4,0,0)\n\n(2,1,0)\n\n(1,0,1)\n\n(0,2,0)\n\nSample Input 2\n\n13 1 4 3000\n\nSample Output 2\n\n87058", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 266, "cpu_time_ms": 74, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s029843019", "group_id": "codeNet:p03048", "input_text": "(* O(n^2) *)\nlet solve r g b n =\n  let rec find_g acc g0 m =\n    if g0 * g > m then\n      acc\n    else\n      find_g \n        (acc + if (m - g0 * g) mod b = 0 then 1 else 0)\n        (g0 + 1)\n        m in\n  let rec count acc r0 =\n    if r0 * r > n then\n      acc\n    else\n      count (find_g acc 0 (n - r0 * r)) (r0 + 1)\n  in\n    count 0 0\n\nlet read_ints () = read_line () |> Str.split (Str.regexp \" \") |> List.map int_of_string\n\nlet _ =\n  match read_ints () with\n  | [r; g; b; n] -> solve r g b n |> string_of_int |> print_endline\n  | _ -> assert false", "language": "OCaml", "metadata": {"date": 1557827415, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s029843019.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s029843019", "user_id": "u732304692"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(* O(n^2) *)\nlet solve r g b n =\n  let rec find_g acc g0 m =\n    if g0 * g > m then\n      acc\n    else\n      find_g \n        (acc + if (m - g0 * g) mod b = 0 then 1 else 0)\n        (g0 + 1)\n        m in\n  let rec count acc r0 =\n    if r0 * r > n then\n      acc\n    else\n      count (find_g acc 0 (n - r0 * r)) (r0 + 1)\n  in\n    count 0 0\n\nlet read_ints () = read_line () |> Str.split (Str.regexp \" \") |> List.map int_of_string\n\nlet _ =\n  match read_ints () with\n  | [r; g; b; n] -> solve r g b n |> string_of_int |> print_endline\n  | _ -> assert false", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has come to a store that sells boxes containing balls. The store sells the following three kinds of boxes:\n\nRed boxes, each containing R red balls\n\nGreen boxes, each containing G green balls\n\nBlue boxes, each containing B blue balls\n\nSnuke wants to get a total of exactly N balls by buying r red boxes, g green boxes and b blue boxes.\nHow many triples of non-negative integers (r,g,b) achieve this?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq R,G,B,N \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR G B N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 3 4\n\nSample Output 1\n\n4\n\nFour triples achieve the objective, as follows:\n\n(4,0,0)\n\n(2,1,0)\n\n(1,0,1)\n\n(0,2,0)\n\nSample Input 2\n\n13 1 4 3000\n\nSample Output 2\n\n87058", "sample_input": "1 2 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03048", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has come to a store that sells boxes containing balls. The store sells the following three kinds of boxes:\n\nRed boxes, each containing R red balls\n\nGreen boxes, each containing G green balls\n\nBlue boxes, each containing B blue balls\n\nSnuke wants to get a total of exactly N balls by buying r red boxes, g green boxes and b blue boxes.\nHow many triples of non-negative integers (r,g,b) achieve this?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq R,G,B,N \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR G B N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 3 4\n\nSample Output 1\n\n4\n\nFour triples achieve the objective, as follows:\n\n(4,0,0)\n\n(2,1,0)\n\n(1,0,1)\n\n(0,2,0)\n\nSample Input 2\n\n13 1 4 3000\n\nSample Output 2\n\n87058", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 551, "cpu_time_ms": 66, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s335208799", "group_id": "codeNet:p03049", "input_text": "open Printf open Scanf\nopen Array\n\nlet split2 s t =\n  let ls,lt = String.(length s,length t) in\n  if ls<lt then [s]\n  else if ls=lt then (\n    if s=t then [\"\";\"\"] else [s]\n  ) else (\n    let res = Str.split (Str.regexp_string t) s in\n    let res = if String.sub s 0 lt = t then \"\"::res else res in\n    let res = if String.sub s (ls-lt) lt = t then\n      List.rev @@ \"\"::List.rev res else res in\n    res\n  )\n\nlet count_substr s t =\n  List.length (split2 s t) - 1\n\nlet () = scanf \" %d\" @@ fun n ->\n  let arr = init n (fun _ -> scanf \" %s\" @@ fun s -> s)\n  in\n  let kba,kbx,kxa,kab = ref 0,ref 0,ref 0,ref 0 in\n  iter (fun s ->\n    let bx = s.[0] = 'B' in\n    let xa = s.[String.length s-1] = 'A' in\n    let ba = bx && xa in\n    if ba then incr kba\n    else if bx then incr kbx\n    else if xa then incr kxa;\n    kab := !kab + count_substr s \"AB\"\n  ) arr;\n  let kba,kbx,kxa,kab = !kba,!kbx,!kxa,!kab in\n  print_int @@ kab +\n    if kba >= 1 then (\n      let pair_ba = kba - 1 in\n      let add,kbx =\n        if kbx > 0 then 1,kbx-1 else 0,kbx in\n      let add,kxa =\n        if kxa > 0 then add+1,kxa-1 else add,kxa in\n      pair_ba + add + min kbx kxa\n    ) else\n      min kbx kxa\n\n\n\n", "language": "OCaml", "metadata": {"date": 1557987566, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s335208799.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s335208799", "user_id": "u481480055"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Printf open Scanf\nopen Array\n\nlet split2 s t =\n  let ls,lt = String.(length s,length t) in\n  if ls<lt then [s]\n  else if ls=lt then (\n    if s=t then [\"\";\"\"] else [s]\n  ) else (\n    let res = Str.split (Str.regexp_string t) s in\n    let res = if String.sub s 0 lt = t then \"\"::res else res in\n    let res = if String.sub s (ls-lt) lt = t then\n      List.rev @@ \"\"::List.rev res else res in\n    res\n  )\n\nlet count_substr s t =\n  List.length (split2 s t) - 1\n\nlet () = scanf \" %d\" @@ fun n ->\n  let arr = init n (fun _ -> scanf \" %s\" @@ fun s -> s)\n  in\n  let kba,kbx,kxa,kab = ref 0,ref 0,ref 0,ref 0 in\n  iter (fun s ->\n    let bx = s.[0] = 'B' in\n    let xa = s.[String.length s-1] = 'A' in\n    let ba = bx && xa in\n    if ba then incr kba\n    else if bx then incr kbx\n    else if xa then incr kxa;\n    kab := !kab + count_substr s \"AB\"\n  ) arr;\n  let kba,kbx,kxa,kab = !kba,!kbx,!kxa,!kab in\n  print_int @@ kab +\n    if kba >= 1 then (\n      let pair_ba = kba - 1 in\n      let add,kbx =\n        if kbx > 0 then 1,kbx-1 else 0,kbx in\n      let add,kxa =\n        if kxa > 0 then add+1,kxa-1 else add,kxa in\n      pair_ba + add + min kbx kxa\n    ) else\n      min kbx kxa\n\n\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has N strings. The i-th string is s_i.\n\nLet us concatenate these strings into one string after arranging them in some order.\nFind the maximum possible number of occurrences of AB in the resulting string.\n\nConstraints\n\n1 \\leq N \\leq 10^{4}\n\n2 \\leq |s_i| \\leq 10\n\ns_i consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\n\\vdots\ns_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\nABCA\nXBAZ\nBAD\n\nSample Output 1\n\n2\n\nFor example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.\n\nSample Input 2\n\n9\nBEWPVCRWH\nZZNQYIJX\nBAVREA\nPA\nHJMYITEOX\nBCJHMRMNK\nBP\nQVFABZ\nPRGKSPUNA\n\nSample Output 2\n\n4\n\nSample Input 3\n\n7\nRABYBBE\nJOZ\nBMHQUVA\nBPA\nISU\nMCMABAOBHZ\nSZMEHMA\n\nSample Output 3\n\n4", "sample_input": "3\nABCA\nXBAZ\nBAD\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03049", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has N strings. The i-th string is s_i.\n\nLet us concatenate these strings into one string after arranging them in some order.\nFind the maximum possible number of occurrences of AB in the resulting string.\n\nConstraints\n\n1 \\leq N \\leq 10^{4}\n\n2 \\leq |s_i| \\leq 10\n\ns_i consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\n\\vdots\ns_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\nABCA\nXBAZ\nBAD\n\nSample Output 1\n\n2\n\nFor example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.\n\nSample Input 2\n\n9\nBEWPVCRWH\nZZNQYIJX\nBAVREA\nPA\nHJMYITEOX\nBCJHMRMNK\nBP\nQVFABZ\nPRGKSPUNA\n\nSample Output 2\n\n4\n\nSample Input 3\n\n7\nRABYBBE\nJOZ\nBMHQUVA\nBPA\nISU\nMCMABAOBHZ\nSZMEHMA\n\nSample Output 3\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1178, "cpu_time_ms": 12, "memory_kb": 4864}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s245670002", "group_id": "codeNet:p03049", "input_text": "open Printf open Scanf\nopen Array\n\nlet count_substr s t =\n  let ln = String.length in\n  init (ln s - ln t + 1) (fun i ->\n    if init (ln t) (fun j -> s.[i+j] = t.[j])\n    |> fold_left (&&) true then 1 else 0\n  ) |> fold_left (+) 0\n\nlet () = scanf \" %d\" @@ fun n ->\n  let arr = init n (fun _ -> scanf \" %s\" @@ fun s -> s)\n  in\n  let kba,kbx,kxa,kab = ref 0,ref 0,ref 0,ref 0 in\n  iter (fun s ->\n    let bx = s.[0] = 'B' in\n    let xa = s.[String.length s-1] = 'A' in\n    let ab = bx && xa in\n    if ab then incr kab\n    else if bx then incr kbx\n    else if xa then incr kxa;\n    kab := !kab + count_substr s \"AB\"\n  ) arr;\n  let kba,kbx,kxa,kab = !kba,!kbx,!kxa,!kab in\n  print_int @@ kab +\n    if kba >= 1 then (\n      (* B-A^B-A^...^B-A *)\n      let pair_ba = kba - 1 in\n      (* B-A^B-A^...^B-A ^ B- *)\n      let add,kbx =\n        if kbx > 0 then 1,kbx-1 else 0,kbx in\n      (* -A ^ B-A^B-A^...^B-A*)\n      let add,kxa =\n        if kxa > 0 then add+1,kxa-1 else add,kxa in\n      pair_ba + add + min kbx kxa\n    ) else\n      (* -A^B- ... -A^B- *)\n      min kbx kxa\n\n\n\n", "language": "OCaml", "metadata": {"date": 1557692637, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s245670002.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s245670002", "user_id": "u481480055"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Printf open Scanf\nopen Array\n\nlet count_substr s t =\n  let ln = String.length in\n  init (ln s - ln t + 1) (fun i ->\n    if init (ln t) (fun j -> s.[i+j] = t.[j])\n    |> fold_left (&&) true then 1 else 0\n  ) |> fold_left (+) 0\n\nlet () = scanf \" %d\" @@ fun n ->\n  let arr = init n (fun _ -> scanf \" %s\" @@ fun s -> s)\n  in\n  let kba,kbx,kxa,kab = ref 0,ref 0,ref 0,ref 0 in\n  iter (fun s ->\n    let bx = s.[0] = 'B' in\n    let xa = s.[String.length s-1] = 'A' in\n    let ab = bx && xa in\n    if ab then incr kab\n    else if bx then incr kbx\n    else if xa then incr kxa;\n    kab := !kab + count_substr s \"AB\"\n  ) arr;\n  let kba,kbx,kxa,kab = !kba,!kbx,!kxa,!kab in\n  print_int @@ kab +\n    if kba >= 1 then (\n      (* B-A^B-A^...^B-A *)\n      let pair_ba = kba - 1 in\n      (* B-A^B-A^...^B-A ^ B- *)\n      let add,kbx =\n        if kbx > 0 then 1,kbx-1 else 0,kbx in\n      (* -A ^ B-A^B-A^...^B-A*)\n      let add,kxa =\n        if kxa > 0 then add+1,kxa-1 else add,kxa in\n      pair_ba + add + min kbx kxa\n    ) else\n      (* -A^B- ... -A^B- *)\n      min kbx kxa\n\n\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has N strings. The i-th string is s_i.\n\nLet us concatenate these strings into one string after arranging them in some order.\nFind the maximum possible number of occurrences of AB in the resulting string.\n\nConstraints\n\n1 \\leq N \\leq 10^{4}\n\n2 \\leq |s_i| \\leq 10\n\ns_i consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\n\\vdots\ns_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\nABCA\nXBAZ\nBAD\n\nSample Output 1\n\n2\n\nFor example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.\n\nSample Input 2\n\n9\nBEWPVCRWH\nZZNQYIJX\nBAVREA\nPA\nHJMYITEOX\nBCJHMRMNK\nBP\nQVFABZ\nPRGKSPUNA\n\nSample Output 2\n\n4\n\nSample Input 3\n\n7\nRABYBBE\nJOZ\nBMHQUVA\nBPA\nISU\nMCMABAOBHZ\nSZMEHMA\n\nSample Output 3\n\n4", "sample_input": "3\nABCA\nXBAZ\nBAD\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03049", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has N strings. The i-th string is s_i.\n\nLet us concatenate these strings into one string after arranging them in some order.\nFind the maximum possible number of occurrences of AB in the resulting string.\n\nConstraints\n\n1 \\leq N \\leq 10^{4}\n\n2 \\leq |s_i| \\leq 10\n\ns_i consists of uppercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\n\\vdots\ns_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\nABCA\nXBAZ\nBAD\n\nSample Output 1\n\n2\n\nFor example, if we concatenate ABCA, BAD and XBAZ in this order, the resulting string ABCABADXBAZ has two occurrences of AB.\n\nSample Input 2\n\n9\nBEWPVCRWH\nZZNQYIJX\nBAVREA\nPA\nHJMYITEOX\nBCJHMRMNK\nBP\nQVFABZ\nPRGKSPUNA\n\nSample Output 2\n\n4\n\nSample Input 3\n\n7\nRABYBBE\nJOZ\nBMHQUVA\nBPA\nISU\nMCMABAOBHZ\nSZMEHMA\n\nSample Output 3\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1068, "cpu_time_ms": 8, "memory_kb": 4992}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s013684675", "group_id": "codeNet:p03059", "input_text": "let a, b, t = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet _ = Printf.printf \"%d\\n\" @@ t / a * b", "language": "OCaml", "metadata": {"date": 1565016907, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s013684675.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s013684675", "user_id": "u732304692"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let a, b, t = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet _ = Printf.printf \"%d\\n\" @@ t / a * b", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation.\n\nFind the total number of biscuits produced within T + 0.5 seconds after activation.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, T \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B T\n\nOutput\n\nPrint the total number of biscuits produced within T + 0.5 seconds after activation.\n\nSample Input 1\n\n3 5 7\n\nSample Output 1\n\n10\n\nFive biscuits will be produced three seconds after activation.\n\nAnother five biscuits will be produced six seconds after activation.\n\nThus, a total of ten biscuits will be produced within 7.5 seconds after activation.\n\nSample Input 2\n\n3 2 9\n\nSample Output 2\n\n6\n\nSample Input 3\n\n20 20 19\n\nSample Output 3\n\n0", "sample_input": "3 5 7\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03059", "source_text": "Score : 100 points\n\nProblem Statement\n\nA biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation.\n\nFind the total number of biscuits produced within T + 0.5 seconds after activation.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, T \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B T\n\nOutput\n\nPrint the total number of biscuits produced within T + 0.5 seconds after activation.\n\nSample Input 1\n\n3 5 7\n\nSample Output 1\n\n10\n\nFive biscuits will be produced three seconds after activation.\n\nAnother five biscuits will be produced six seconds after activation.\n\nThus, a total of ten biscuits will be produced within 7.5 seconds after activation.\n\nSample Input 2\n\n3 2 9\n\nSample Output 2\n\n6\n\nSample Input 3\n\n20 20 19\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 103, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s877954045", "group_id": "codeNet:p03059", "input_text": "(* O(1) *)\nlet solve a b t = t / a * b\n\nlet read_ints () = read_line () |> Str.split (Str.regexp \" \") |> List.map int_of_string\n\nlet _ =\n  match read_ints () with\n  | [a; b; c] -> solve a b c |> string_of_int |> print_endline\n  | _ -> ()", "language": "OCaml", "metadata": {"date": 1557088027, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s877954045.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s877954045", "user_id": "u732304692"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "(* O(1) *)\nlet solve a b t = t / a * b\n\nlet read_ints () = read_line () |> Str.split (Str.regexp \" \") |> List.map int_of_string\n\nlet _ =\n  match read_ints () with\n  | [a; b; c] -> solve a b c |> string_of_int |> print_endline\n  | _ -> ()", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation.\n\nFind the total number of biscuits produced within T + 0.5 seconds after activation.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, T \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B T\n\nOutput\n\nPrint the total number of biscuits produced within T + 0.5 seconds after activation.\n\nSample Input 1\n\n3 5 7\n\nSample Output 1\n\n10\n\nFive biscuits will be produced three seconds after activation.\n\nAnother five biscuits will be produced six seconds after activation.\n\nThus, a total of ten biscuits will be produced within 7.5 seconds after activation.\n\nSample Input 2\n\n3 2 9\n\nSample Output 2\n\n6\n\nSample Input 3\n\n20 20 19\n\nSample Output 3\n\n0", "sample_input": "3 5 7\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03059", "source_text": "Score : 100 points\n\nProblem Statement\n\nA biscuit making machine produces B biscuits at the following moments: A seconds, 2A seconds, 3A seconds and each subsequent multiple of A seconds after activation.\n\nFind the total number of biscuits produced within T + 0.5 seconds after activation.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B, T \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B T\n\nOutput\n\nPrint the total number of biscuits produced within T + 0.5 seconds after activation.\n\nSample Input 1\n\n3 5 7\n\nSample Output 1\n\n10\n\nFive biscuits will be produced three seconds after activation.\n\nAnother five biscuits will be produced six seconds after activation.\n\nThus, a total of ten biscuits will be produced within 7.5 seconds after activation.\n\nSample Input 2\n\n3 2 9\n\nSample Output 2\n\n6\n\nSample Input 3\n\n20 20 19\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 237, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s353243943", "group_id": "codeNet:p03062", "input_text": "let s, b, m = Array.fold_left (fun (s, b, m) x -> (s + abs x, b <> (x < 0), min m (abs x))) (0, false, 1000000000) (Array.init (read_int()) (fun _ -> Scanf.scanf \" %d\" (fun i -> i))) in print_int (s + if b then -2 * m else 0)\n", "language": "OCaml", "metadata": {"date": 1598980394, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s353243943.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s353243943", "user_id": "u752907799"}, "prompt_components": {"gold_output": "19\n", "input_to_evaluate": "let s, b, m = Array.fold_left (fun (s, b, m) x -> (s + abs x, b <> (x < 0), min m (abs x))) (0, false, 1000000000) (Array.init (read_int()) (fun _ -> Scanf.scanf \" %d\" (fun i -> i))) in print_int (s + if b then -2 * m else 0)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, arranged in a row in this order.\n\nYou can perform the following operation on this integer sequence any number of times:\n\nOperation: Choose an integer i satisfying 1 \\leq i \\leq N-1. Multiply both A_i and A_{i+1} by -1.\n\nLet B_1, B_2, ..., B_N be the integer sequence after your operations.\n\nFind the maximum possible value of B_1 + B_2 + ... + B_N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value of B_1 + B_2 + ... + B_N.\n\nSample Input 1\n\n3\n-10 5 -4\n\nSample Output 1\n\n19\n\nIf we perform the operation as follows:\n\nChoose 1 as i, which changes the sequence to 10, -5, -4.\n\nChoose 2 as i, which changes the sequence to 10, 5, 4.\n\nwe have B_1 = 10, B_2 = 5, B_3 = 4. The sum here, B_1 + B_2 + B_3 = 10 + 5 + 4 = 19, is the maximum possible result.\n\nSample Input 2\n\n5\n10 -4 -8 -11 3\n\nSample Output 2\n\n30\n\nSample Input 3\n\n11\n-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000 -1000000000 1000000000 -1000000000 1000000000\n\nSample Output 3\n\n10000000000\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "3\n-10 5 -4\n"}, "reference_outputs": ["19\n"], "source_document_id": "p03062", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, arranged in a row in this order.\n\nYou can perform the following operation on this integer sequence any number of times:\n\nOperation: Choose an integer i satisfying 1 \\leq i \\leq N-1. Multiply both A_i and A_{i+1} by -1.\n\nLet B_1, B_2, ..., B_N be the integer sequence after your operations.\n\nFind the maximum possible value of B_1 + B_2 + ... + B_N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value of B_1 + B_2 + ... + B_N.\n\nSample Input 1\n\n3\n-10 5 -4\n\nSample Output 1\n\n19\n\nIf we perform the operation as follows:\n\nChoose 1 as i, which changes the sequence to 10, -5, -4.\n\nChoose 2 as i, which changes the sequence to 10, 5, 4.\n\nwe have B_1 = 10, B_2 = 5, B_3 = 4. The sum here, B_1 + B_2 + B_3 = 10 + 5 + 4 = 19, is the maximum possible result.\n\nSample Input 2\n\n5\n10 -4 -8 -11 3\n\nSample Output 2\n\n30\n\nSample Input 3\n\n11\n-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000 -1000000000 1000000000 -1000000000 1000000000\n\nSample Output 3\n\n10000000000\n\nThe output may not fit into a 32-bit integer type.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 39, "memory_kb": 6660}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s762252481", "group_id": "codeNet:p03062", "input_text": "(* O(n) *)\nlet solve n a_s =\n  let abs_s = List.map abs a_s in\n  let mi = List.fold_left min max_int abs_s in\n  let sum = List.fold_left (+) 0 abs_s in\n  if mi = 0 then\n    sum\n  else\n    let neg_count = List.fold_left (fun acc a -> if a < 0 then acc + 1 else acc) 0 a_s in\n    if neg_count mod 2 = 0 then\n      sum\n    else\n      sum - mi * 2\n\nlet read_ints () = read_line () |> Str.split (Str.regexp \" \") |> List.map int_of_string\nlet _ =\n  let n = read_int () in\n  read_ints () |> solve n |> string_of_int |> print_endline", "language": "OCaml", "metadata": {"date": 1557759167, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s762252481.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s762252481", "user_id": "u732304692"}, "prompt_components": {"gold_output": "19\n", "input_to_evaluate": "(* O(n) *)\nlet solve n a_s =\n  let abs_s = List.map abs a_s in\n  let mi = List.fold_left min max_int abs_s in\n  let sum = List.fold_left (+) 0 abs_s in\n  if mi = 0 then\n    sum\n  else\n    let neg_count = List.fold_left (fun acc a -> if a < 0 then acc + 1 else acc) 0 a_s in\n    if neg_count mod 2 = 0 then\n      sum\n    else\n      sum - mi * 2\n\nlet read_ints () = read_line () |> Str.split (Str.regexp \" \") |> List.map int_of_string\nlet _ =\n  let n = read_int () in\n  read_ints () |> solve n |> string_of_int |> print_endline", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 525, "cpu_time_ms": 57, "memory_kb": 18176}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s337391877", "group_id": "codeNet:p03068", "input_text": "let () =\n  Scanf.scanf \"%d %s %d\" @@ fun n s k ->\n  Array.init n (fun i -> if s.[i] = s.[k-1] then s.[i] else '*')\n  |> Array.iter print_char", "language": "OCaml", "metadata": {"date": 1556435266, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s337391877.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s337391877", "user_id": "u798181098"}, "prompt_components": {"gold_output": "*rr*r\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %s %d\" @@ fun n s k ->\n  Array.init n (fun i -> if s.[i] = s.[k-1] then s.[i] else '*')\n  |> Array.iter print_char", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters, and an integer K.\nPrint the string obtained by replacing every character in S that differs from the K-th character of S, with *.\n\nConstraints\n\n1 \\leq K \\leq N\\leq 10\n\nS is a string of length N consisting of lowercase English letters.\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nK\n\nOutput\n\nPrint the string obtained by replacing every character in S that differs from the K-th character of S, with *.\n\nSample Input 1\n\n5\nerror\n2\n\nSample Output 1\n\n*rr*r\n\nThe second character of S is r. When we replace every character in error that differs from r with *, we get the string *rr*r.\n\nSample Input 2\n\n6\neleven\n5\n\nSample Output 2\n\ne*e*e*\n\nSample Input 3\n\n9\neducation\n7\n\nSample Output 3\n\n******i**", "sample_input": "5\nerror\n2\n"}, "reference_outputs": ["*rr*r\n"], "source_document_id": "p03068", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters, and an integer K.\nPrint the string obtained by replacing every character in S that differs from the K-th character of S, with *.\n\nConstraints\n\n1 \\leq K \\leq N\\leq 10\n\nS is a string of length N consisting of lowercase English letters.\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nK\n\nOutput\n\nPrint the string obtained by replacing every character in S that differs from the K-th character of S, with *.\n\nSample Input 1\n\n5\nerror\n2\n\nSample Output 1\n\n*rr*r\n\nThe second character of S is r. When we replace every character in error that differs from r with *, we get the string *rr*r.\n\nSample Input 2\n\n6\neleven\n5\n\nSample Output 2\n\ne*e*e*\n\nSample Input 3\n\n9\neducation\n7\n\nSample Output 3\n\n******i**", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 141, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s729058241", "group_id": "codeNet:p03068", "input_text": "let solve n = 1\n\nlet _ =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let s = Scanf.scanf \"%s\\n\" (fun s -> s) in\n  let k = Scanf.scanf \"%d\\n\" (fun k -> k) in\n  let c = String.get s k in\n  for i = 0 to n - 1 do\n    let c' = String.get s i in\n    print_char @@ if c = c' then c else '*'\n  done\n", "language": "OCaml", "metadata": {"date": 1555808776, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s729058241.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s729058241", "user_id": "u387591304"}, "prompt_components": {"gold_output": "*rr*r\n", "input_to_evaluate": "let solve n = 1\n\nlet _ =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let s = Scanf.scanf \"%s\\n\" (fun s -> s) in\n  let k = Scanf.scanf \"%d\\n\" (fun k -> k) in\n  let c = String.get s k in\n  for i = 0 to n - 1 do\n    let c' = String.get s i in\n    print_char @@ if c = c' then c else '*'\n  done\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters, and an integer K.\nPrint the string obtained by replacing every character in S that differs from the K-th character of S, with *.\n\nConstraints\n\n1 \\leq K \\leq N\\leq 10\n\nS is a string of length N consisting of lowercase English letters.\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nK\n\nOutput\n\nPrint the string obtained by replacing every character in S that differs from the K-th character of S, with *.\n\nSample Input 1\n\n5\nerror\n2\n\nSample Output 1\n\n*rr*r\n\nThe second character of S is r. When we replace every character in error that differs from r with *, we get the string *rr*r.\n\nSample Input 2\n\n6\neleven\n5\n\nSample Output 2\n\ne*e*e*\n\nSample Input 3\n\n9\neducation\n7\n\nSample Output 3\n\n******i**", "sample_input": "5\nerror\n2\n"}, "reference_outputs": ["*rr*r\n"], "source_document_id": "p03068", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters, and an integer K.\nPrint the string obtained by replacing every character in S that differs from the K-th character of S, with *.\n\nConstraints\n\n1 \\leq K \\leq N\\leq 10\n\nS is a string of length N consisting of lowercase English letters.\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nK\n\nOutput\n\nPrint the string obtained by replacing every character in S that differs from the K-th character of S, with *.\n\nSample Input 1\n\n5\nerror\n2\n\nSample Output 1\n\n*rr*r\n\nThe second character of S is r. When we replace every character in error that differs from r with *, we get the string *rr*r.\n\nSample Input 2\n\n6\neleven\n5\n\nSample Output 2\n\ne*e*e*\n\nSample Input 3\n\n9\neducation\n7\n\nSample Output 3\n\n******i**", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 294, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s804900336", "group_id": "codeNet:p03069", "input_text": "let split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\nlet n = Scanf.sscanf (read_line ()) \"%d\" @@ fun n -> n\nlet s = read_line () |> split_string\nlet () = Printf.printf \"%d\\n\" @@ snd @@ List.fold_left (fun (b, sum) ch -> (b || ch = \"#\", sum + if b && ch = \"#\" then 1 else 0)) (false, 0) s", "language": "OCaml", "metadata": {"date": 1589942769, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s804900336.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s804900336", "user_id": "u811309788"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\nlet n = Scanf.sscanf (read_line ()) \"%d\" @@ fun n -> n\nlet s = read_line () |> split_string\nlet () = Printf.printf \"%d\\n\" @@ snd @@ List.fold_left (fun (b, sum) ch -> (b || ch = \"#\", sum + if b && ch = \"#\" then 1 else 0)) (false, 0) s", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N stones arranged in a row. Every stone is painted white or black.\nA string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is ., and the stone is black if the character is #.\n\nTakahashi wants to change the colors of some stones to black or white so that there will be no white stone immediately to the right of a black stone.\nFind the minimum number of stones that needs to be recolored.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS is a string of length N consisting of . and #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of stones that needs to be recolored.\n\nSample Input 1\n\n3\n#.#\n\nSample Output 1\n\n1\n\nIt is enough to change the color of the first stone to white.\n\nSample Input 2\n\n5\n#.##.\n\nSample Output 2\n\n2\n\nSample Input 3\n\n9\n.........\n\nSample Output 3\n\n0", "sample_input": "3\n#.#\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03069", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N stones arranged in a row. Every stone is painted white or black.\nA string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is ., and the stone is black if the character is #.\n\nTakahashi wants to change the colors of some stones to black or white so that there will be no white stone immediately to the right of a black stone.\nFind the minimum number of stones that needs to be recolored.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS is a string of length N consisting of . and #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of stones that needs to be recolored.\n\nSample Input 1\n\n3\n#.#\n\nSample Output 1\n\n1\n\nIt is enough to change the color of the first stone to white.\n\nSample Input 2\n\n5\n#.##.\n\nSample Output 2\n\n2\n\nSample Input 3\n\n9\n.........\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 299, "cpu_time_ms": 71, "memory_kb": 16256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s918644658", "group_id": "codeNet:p03071", "input_text": "open Scanf\nopen Printf\n\nlet (a,b) = sscanf (read_line ()) \"%d %d\" (fun x y -> (x,y));;\n\nprintf \"%d\\n\" (if a > b then a + max (a-1) b else b + max a (b-1))", "language": "OCaml", "metadata": {"date": 1556376664, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s918644658.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s918644658", "user_id": "u321043950"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet (a,b) = sscanf (read_line ()) \"%d %d\" (fun x y -> (x,y));;\n\nprintf \"%d\\n\" (if a > b then a + max (a-1) b else b + max a (b-1))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are two buttons, one of size A and one of size B.\n\nWhen you press a button of size X, you get X coins and the size of that button decreases by 1.\n\nYou will press a button twice. Here, you can press the same button twice, or press both buttons once.\n\nAt most how many coins can you get?\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq A, B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of coins you can get.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n9\n\nYou can get 5 + 4 = 9 coins by pressing the button of size 5 twice, and this is the maximum result.\n\nSample Input 2\n\n3 4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n12", "sample_input": "5 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03071", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are two buttons, one of size A and one of size B.\n\nWhen you press a button of size X, you get X coins and the size of that button decreases by 1.\n\nYou will press a button twice. Here, you can press the same button twice, or press both buttons once.\n\nAt most how many coins can you get?\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq A, B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the maximum number of coins you can get.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n9\n\nYou can get 5 + 4 = 9 coins by pressing the button of size 5 twice, and this is the maximum result.\n\nSample Input 2\n\n3 4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n6 6\n\nSample Output 3\n\n12", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 154, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s176064372", "group_id": "codeNet:p03072", "input_text": "let _ =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let h_max = ref 0 in\n  let res = ref 0 in\n  for i = 0 to n - 1 do\n    let h = \n      Scanf.scanf (if i <> n - 1 then \"%d \" else \"%d\\n\") (fun h -> h) in\n    if h >= !h_max then (res := !res + 1; h_max := h);\n  done;\n  print_int !res\n", "language": "OCaml", "metadata": {"date": 1555182526, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s176064372.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s176064372", "user_id": "u387591304"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let _ =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let h_max = ref 0 in\n  let res = ref 0 in\n  for i = 0 to n - 1 do\n    let h = \n      Scanf.scanf (if i <> n - 1 then \"%d \" else \"%d\\n\") (fun h -> h) in\n    if h >= !h_max then (res := !res + 1; h_max := h);\n  done;\n  print_int !res\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N mountains ranging from east to west, and an ocean to the west.\n\nAt the top of each mountain, there is an inn. You have decided to choose where to stay from these inns.\n\nThe height of the i-th mountain from the west is H_i.\n\nYou can certainly see the ocean from the inn at the top of the westmost mountain.\n\nFor the inn at the top of the i-th mountain from the west (i = 2, 3, ..., N), you can see the ocean if and only if H_1 \\leq H_i, H_2 \\leq H_i, ..., and H_{i-1} \\leq H_i.\n\nFrom how many of these N inns can you see the ocean?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq H_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the number of inns from which you can see the ocean.\n\nSample Input 1\n\n4\n6 5 6 8\n\nSample Output 1\n\n3\n\nYou can see the ocean from the first, third and fourth inns from the west.\n\nSample Input 2\n\n5\n4 5 3 5 4\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5\n9 5 6 8 4\n\nSample Output 3\n\n1", "sample_input": "4\n6 5 6 8\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03072", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N mountains ranging from east to west, and an ocean to the west.\n\nAt the top of each mountain, there is an inn. You have decided to choose where to stay from these inns.\n\nThe height of the i-th mountain from the west is H_i.\n\nYou can certainly see the ocean from the inn at the top of the westmost mountain.\n\nFor the inn at the top of the i-th mountain from the west (i = 2, 3, ..., N), you can see the ocean if and only if H_1 \\leq H_i, H_2 \\leq H_i, ..., and H_{i-1} \\leq H_i.\n\nFrom how many of these N inns can you see the ocean?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 20\n\n1 \\leq H_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the number of inns from which you can see the ocean.\n\nSample Input 1\n\n4\n6 5 6 8\n\nSample Output 1\n\n3\n\nYou can see the ocean from the first, third and fourth inns from the west.\n\nSample Input 2\n\n5\n4 5 3 5 4\n\nSample Output 2\n\n3\n\nSample Input 3\n\n5\n9 5 6 8 4\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 287, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s504143356", "group_id": "codeNet:p03073", "input_text": "(* O(|s|) *)\nlet s = read_line ()\nlet ans = ref max_int\nlet cs = [|'0'; '1'|]\nlet cnt1, cnt2 = ref 0, ref 0\nlet _ =\n  String.iteri (fun i c -> if c <> cs.(i mod 2) then incr cnt1) s;\n  String.iteri (fun i c -> if c = cs.(i mod 2) then incr cnt2) s;\n  min !cnt1 !cnt2 |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1561204178, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s504143356.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s504143356", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(* O(|s|) *)\nlet s = read_line ()\nlet ans = ref max_int\nlet cs = [|'0'; '1'|]\nlet cnt1, cnt2 = ref 0, ref 0\nlet _ =\n  String.iteri (fun i c -> if c <> cs.(i mod 2) then incr cnt1) s;\n  String.iteri (fun i c -> if c = cs.(i mod 2) then incr cnt2) s;\n  min !cnt1 !cnt2 |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nN tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.\n\nThe i-th tile from the left is painted black if the i-th character of S is 0, and painted white if that character is 1.\n\nYou want to repaint some of the tiles black or white, so that any two adjacent tiles have different colors.\n\nAt least how many tiles need to be repainted to satisfy the condition?\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of tiles that need to be repainted to satisfy the condition.\n\nSample Input 1\n\n000\n\nSample Output 1\n\n1\n\nThe condition can be satisfied by repainting the middle tile white.\n\nSample Input 2\n\n10010010\n\nSample Output 2\n\n3\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "sample_input": "000\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03073", "source_text": "Score : 300 points\n\nProblem Statement\n\nN tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.\n\nThe i-th tile from the left is painted black if the i-th character of S is 0, and painted white if that character is 1.\n\nYou want to repaint some of the tiles black or white, so that any two adjacent tiles have different colors.\n\nAt least how many tiles need to be repainted to satisfy the condition?\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of tiles that need to be repainted to satisfy the condition.\n\nSample Input 1\n\n000\n\nSample Output 1\n\n1\n\nThe condition can be satisfied by repainting the middle tile white.\n\nSample Input 2\n\n10010010\n\nSample Output 2\n\n3\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 290, "cpu_time_ms": 3, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s946715382", "group_id": "codeNet:p03074", "input_text": "type bin = I of int | O of int\n\nlet _ =\n  let n, k = Scanf.scanf \"%d %d\\n\" (fun n k -> n, k) in\n  let prev = ref (I 0) in\n  let res = ref [] in\n  for i = 0 to n - 1 do\n    let d = Scanf.scanf (if i <> n - 1 then \"%1d\" else \"%1d\\n\") (fun d -> d) in\n    if i = 0 then \n      begin\n        prev := if d = 0 then O 1 else I 1;\n      end\n    else\n      begin\n        match !prev, d with\n        | (I i), 1 -> prev := I (i+1)\n        | (O o), 0 -> prev := O (o+1)\n        | (I i), 0 -> (prev := O 1; res := (I i)::!res)\n        | (O o), 1 -> (prev := I 1; res := (O o)::!res)\n        | _ -> failwith \"hoge\"\n      end\n  done;\n  let ct_of = function I i -> i | O o -> o in\n  let input = Array.of_list (!prev::!res) in\n  let l = Array.length input in\n  let res = ref 0 in\n  let i, j, k' = ref 0, ref 0, ref k in\n  let temp = ref 0 in\n  while !i < l do\n(*    Printf.printf \"(i:%d, j:%d, k':%d)\" !i !j !k';*)\n    let d = input.(!j) in\n    let j' = match d with | I _ -> min (!j + 2 * !k') (l - 1) | O _ -> min (!j + 2 * !k' - 1) (l - 1) in\n    for p = !j to j' do\n      temp := !temp + (ct_of input.(p))\n    done;\n    j := j';\n    res := max !res !temp;\n    let i' = match input.(!i) with | I _ -> min (!i+2) (l - 1) | O _ -> min (!i+1) (l - 1) in\n    k' := 1;\n    for p = !i to i' do\n      temp := !temp - (ct_of input.(p))\n    done;\n    i := i';\n    if !i = l - 1 then i := l + 10;\n  done;\n  !res |> print_int\n", "language": "OCaml", "metadata": {"date": 1555237296, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03074.html", "problem_id": "p03074", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03074/input.txt", "sample_output_relpath": "derived/input_output/data/p03074/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03074/OCaml/s946715382.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s946715382", "user_id": "u387591304"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "type bin = I of int | O of int\n\nlet _ =\n  let n, k = Scanf.scanf \"%d %d\\n\" (fun n k -> n, k) in\n  let prev = ref (I 0) in\n  let res = ref [] in\n  for i = 0 to n - 1 do\n    let d = Scanf.scanf (if i <> n - 1 then \"%1d\" else \"%1d\\n\") (fun d -> d) in\n    if i = 0 then \n      begin\n        prev := if d = 0 then O 1 else I 1;\n      end\n    else\n      begin\n        match !prev, d with\n        | (I i), 1 -> prev := I (i+1)\n        | (O o), 0 -> prev := O (o+1)\n        | (I i), 0 -> (prev := O 1; res := (I i)::!res)\n        | (O o), 1 -> (prev := I 1; res := (O o)::!res)\n        | _ -> failwith \"hoge\"\n      end\n  done;\n  let ct_of = function I i -> i | O o -> o in\n  let input = Array.of_list (!prev::!res) in\n  let l = Array.length input in\n  let res = ref 0 in\n  let i, j, k' = ref 0, ref 0, ref k in\n  let temp = ref 0 in\n  while !i < l do\n(*    Printf.printf \"(i:%d, j:%d, k':%d)\" !i !j !k';*)\n    let d = input.(!j) in\n    let j' = match d with | I _ -> min (!j + 2 * !k') (l - 1) | O _ -> min (!j + 2 * !k' - 1) (l - 1) in\n    for p = !j to j' do\n      temp := !temp + (ct_of input.(p))\n    done;\n    j := j';\n    res := max !res !temp;\n    let i' = match input.(!i) with | I _ -> min (!i+2) (l - 1) | O _ -> min (!i+1) (l - 1) in\n    k' := 1;\n    for p = !i to i' do\n      temp := !temp - (ct_of input.(p))\n    done;\n    i := i';\n    if !i = l - 1 then i := l + 10;\n  done;\n  !res |> print_int\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nN people are arranged in a row from left to right.\n\nYou are given a string S of length N consisting of 0 and 1, and a positive integer K.\n\nThe i-th person from the left is standing on feet if the i-th character of S is 0, and standing on hands if that character is 1.\n\nYou will give the following direction at most K times (possibly zero):\n\nDirection: Choose integers l and r satisfying 1 \\leq l \\leq r \\leq N, and flip the l-th, (l+1)-th, ..., and r-th persons. That is, for each i = l, l+1, ..., r, the i-th person from the left now stands on hands if he/she was standing on feet, and stands on feet if he/she was standing on hands.\n\nFind the maximum possible number of consecutive people standing on hands after at most K directions.\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^5.\n\nK is an integer satisfying 1 \\leq K \\leq 10^5.\n\nThe length of the string S is N.\n\nEach character of the string S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the maximum possible number of consecutive people standing on hands after at most K directions.\n\nSample Input 1\n\n5 1\n00010\n\nSample Output 1\n\n4\n\nWe can have four consecutive people standing on hands, which is the maximum result, by giving the following direction:\n\nGive the direction with l = 1, r = 3, which flips the first, second and third persons from the left.\n\nSample Input 2\n\n14 2\n11101010110011\n\nSample Output 2\n\n8\n\nSample Input 3\n\n1 1\n1\n\nSample Output 3\n\n1\n\nNo directions are necessary.", "sample_input": "5 1\n00010\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03074", "source_text": "Score : 400 points\n\nProblem Statement\n\nN people are arranged in a row from left to right.\n\nYou are given a string S of length N consisting of 0 and 1, and a positive integer K.\n\nThe i-th person from the left is standing on feet if the i-th character of S is 0, and standing on hands if that character is 1.\n\nYou will give the following direction at most K times (possibly zero):\n\nDirection: Choose integers l and r satisfying 1 \\leq l \\leq r \\leq N, and flip the l-th, (l+1)-th, ..., and r-th persons. That is, for each i = l, l+1, ..., r, the i-th person from the left now stands on hands if he/she was standing on feet, and stands on feet if he/she was standing on hands.\n\nFind the maximum possible number of consecutive people standing on hands after at most K directions.\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^5.\n\nK is an integer satisfying 1 \\leq K \\leq 10^5.\n\nThe length of the string S is N.\n\nEach character of the string S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the maximum possible number of consecutive people standing on hands after at most K directions.\n\nSample Input 1\n\n5 1\n00010\n\nSample Output 1\n\n4\n\nWe can have four consecutive people standing on hands, which is the maximum result, by giving the following direction:\n\nGive the direction with l = 1, r = 3, which flips the first, second and third persons from the left.\n\nSample Input 2\n\n14 2\n11101010110011\n\nSample Output 2\n\n8\n\nSample Input 3\n\n1 1\n1\n\nSample Output 3\n\n1\n\nNo directions are necessary.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1401, "cpu_time_ms": 34, "memory_kb": 7680}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s361105854", "group_id": "codeNet:p03074", "input_text": "let () =\n  Scanf.scanf \"%d %d %s\" @@ fun n k s ->\n  let s = Array.init n (fun i -> i, s.[i]) in\n  let t = Array.make 101010 0 in\n  let ans, _, _, _, _ =\n    Array.fold_left (fun (ans, cur, cs, ti, p) (i, x) ->\n      match p, x with\n      | '1', '1' -> (max ans (cur+1), cur+1, cs+1, ti, '1')\n      | '0', '0' -> (max ans (cur+1), cur+1, cs+1, ti, '0')\n      | '0', '1' -> begin\n        t.(ti) <- cs;\n        (max ans (cur+1), cur+1, 1, ti+1, '1')\n      end\n      | _ (* 1, 0 *) -> begin\n        if ti < k then\n          (max ans (cur+1), cur+1, cs+1, ti, '0')\n        else\n          (max ans (cur+1-t.(ti-k)), cur+1-t.(ti-k), cs+1, ti, '0')\n      end) (0,0,0,0,'1') s\n  in\n  Printf.printf \"%d\\n\" ans\n", "language": "OCaml", "metadata": {"date": 1555188502, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03074.html", "problem_id": "p03074", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03074/input.txt", "sample_output_relpath": "derived/input_output/data/p03074/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03074/OCaml/s361105854.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s361105854", "user_id": "u798181098"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d %s\" @@ fun n k s ->\n  let s = Array.init n (fun i -> i, s.[i]) in\n  let t = Array.make 101010 0 in\n  let ans, _, _, _, _ =\n    Array.fold_left (fun (ans, cur, cs, ti, p) (i, x) ->\n      match p, x with\n      | '1', '1' -> (max ans (cur+1), cur+1, cs+1, ti, '1')\n      | '0', '0' -> (max ans (cur+1), cur+1, cs+1, ti, '0')\n      | '0', '1' -> begin\n        t.(ti) <- cs;\n        (max ans (cur+1), cur+1, 1, ti+1, '1')\n      end\n      | _ (* 1, 0 *) -> begin\n        if ti < k then\n          (max ans (cur+1), cur+1, cs+1, ti, '0')\n        else\n          (max ans (cur+1-t.(ti-k)), cur+1-t.(ti-k), cs+1, ti, '0')\n      end) (0,0,0,0,'1') s\n  in\n  Printf.printf \"%d\\n\" ans\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nN people are arranged in a row from left to right.\n\nYou are given a string S of length N consisting of 0 and 1, and a positive integer K.\n\nThe i-th person from the left is standing on feet if the i-th character of S is 0, and standing on hands if that character is 1.\n\nYou will give the following direction at most K times (possibly zero):\n\nDirection: Choose integers l and r satisfying 1 \\leq l \\leq r \\leq N, and flip the l-th, (l+1)-th, ..., and r-th persons. That is, for each i = l, l+1, ..., r, the i-th person from the left now stands on hands if he/she was standing on feet, and stands on feet if he/she was standing on hands.\n\nFind the maximum possible number of consecutive people standing on hands after at most K directions.\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^5.\n\nK is an integer satisfying 1 \\leq K \\leq 10^5.\n\nThe length of the string S is N.\n\nEach character of the string S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the maximum possible number of consecutive people standing on hands after at most K directions.\n\nSample Input 1\n\n5 1\n00010\n\nSample Output 1\n\n4\n\nWe can have four consecutive people standing on hands, which is the maximum result, by giving the following direction:\n\nGive the direction with l = 1, r = 3, which flips the first, second and third persons from the left.\n\nSample Input 2\n\n14 2\n11101010110011\n\nSample Output 2\n\n8\n\nSample Input 3\n\n1 1\n1\n\nSample Output 3\n\n1\n\nNo directions are necessary.", "sample_input": "5 1\n00010\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03074", "source_text": "Score : 400 points\n\nProblem Statement\n\nN people are arranged in a row from left to right.\n\nYou are given a string S of length N consisting of 0 and 1, and a positive integer K.\n\nThe i-th person from the left is standing on feet if the i-th character of S is 0, and standing on hands if that character is 1.\n\nYou will give the following direction at most K times (possibly zero):\n\nDirection: Choose integers l and r satisfying 1 \\leq l \\leq r \\leq N, and flip the l-th, (l+1)-th, ..., and r-th persons. That is, for each i = l, l+1, ..., r, the i-th person from the left now stands on hands if he/she was standing on feet, and stands on feet if he/she was standing on hands.\n\nFind the maximum possible number of consecutive people standing on hands after at most K directions.\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^5.\n\nK is an integer satisfying 1 \\leq K \\leq 10^5.\n\nThe length of the string S is N.\n\nEach character of the string S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the maximum possible number of consecutive people standing on hands after at most K directions.\n\nSample Input 1\n\n5 1\n00010\n\nSample Output 1\n\n4\n\nWe can have four consecutive people standing on hands, which is the maximum result, by giving the following direction:\n\nGive the direction with l = 1, r = 3, which flips the first, second and third persons from the left.\n\nSample Input 2\n\n14 2\n11101010110011\n\nSample Output 2\n\n8\n\nSample Input 3\n\n1 1\n1\n\nSample Output 3\n\n1\n\nNo directions are necessary.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 700, "cpu_time_ms": 13, "memory_kb": 8064}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s691810285", "group_id": "codeNet:p03074", "input_text": "let calc s k =\n  if k = 0 then Array.fold_left (fun v (_, x) -> if x = '1' then v+1 else v) 0 s else\n  let t = Array.make 101010 0 in\n  let ans, _, _, _, _ =\n    Array.fold_left (fun (ans, cur, cs, ti, p) (i, x) ->\n      match p, x with\n      | '1', '1' -> (max ans (cur+1), cur+1, cs+1, ti, '1')\n      | '0', '0' -> (max ans (cur+1), cur+1, cs+1, ti, '0')\n      | '0', '1' -> begin\n        t.(ti) <- cs;\n        (max ans (cur+1), cur+1, 1, ti+1, '1')\n      end\n      | _ (* 1, 0 *) -> begin\n        if ti < k then\n          (max ans (cur+1), cur+1, cs+1, ti, '0')\n        else\n          (max ans (cur+1-t.(ti-k)), cur+1-t.(ti-k), cs+1, ti, '0')\n      end) (0,0,0,0,'1') s\n  in\n  ans\nlet () =\n  Scanf.scanf \"%d %d %s\" @@ fun n k s ->\n  let s = Array.init n (fun i -> i, s.[i]) in\n  max (calc s k) (calc (Array.map (fun (i, x) -> i, (if x = '0' then '1' else '0')) s) (k-1))\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1555186024, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03074.html", "problem_id": "p03074", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03074/input.txt", "sample_output_relpath": "derived/input_output/data/p03074/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03074/OCaml/s691810285.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s691810285", "user_id": "u798181098"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let calc s k =\n  if k = 0 then Array.fold_left (fun v (_, x) -> if x = '1' then v+1 else v) 0 s else\n  let t = Array.make 101010 0 in\n  let ans, _, _, _, _ =\n    Array.fold_left (fun (ans, cur, cs, ti, p) (i, x) ->\n      match p, x with\n      | '1', '1' -> (max ans (cur+1), cur+1, cs+1, ti, '1')\n      | '0', '0' -> (max ans (cur+1), cur+1, cs+1, ti, '0')\n      | '0', '1' -> begin\n        t.(ti) <- cs;\n        (max ans (cur+1), cur+1, 1, ti+1, '1')\n      end\n      | _ (* 1, 0 *) -> begin\n        if ti < k then\n          (max ans (cur+1), cur+1, cs+1, ti, '0')\n        else\n          (max ans (cur+1-t.(ti-k)), cur+1-t.(ti-k), cs+1, ti, '0')\n      end) (0,0,0,0,'1') s\n  in\n  ans\nlet () =\n  Scanf.scanf \"%d %d %s\" @@ fun n k s ->\n  let s = Array.init n (fun i -> i, s.[i]) in\n  max (calc s k) (calc (Array.map (fun (i, x) -> i, (if x = '0' then '1' else '0')) s) (k-1))\n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nN people are arranged in a row from left to right.\n\nYou are given a string S of length N consisting of 0 and 1, and a positive integer K.\n\nThe i-th person from the left is standing on feet if the i-th character of S is 0, and standing on hands if that character is 1.\n\nYou will give the following direction at most K times (possibly zero):\n\nDirection: Choose integers l and r satisfying 1 \\leq l \\leq r \\leq N, and flip the l-th, (l+1)-th, ..., and r-th persons. That is, for each i = l, l+1, ..., r, the i-th person from the left now stands on hands if he/she was standing on feet, and stands on feet if he/she was standing on hands.\n\nFind the maximum possible number of consecutive people standing on hands after at most K directions.\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^5.\n\nK is an integer satisfying 1 \\leq K \\leq 10^5.\n\nThe length of the string S is N.\n\nEach character of the string S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the maximum possible number of consecutive people standing on hands after at most K directions.\n\nSample Input 1\n\n5 1\n00010\n\nSample Output 1\n\n4\n\nWe can have four consecutive people standing on hands, which is the maximum result, by giving the following direction:\n\nGive the direction with l = 1, r = 3, which flips the first, second and third persons from the left.\n\nSample Input 2\n\n14 2\n11101010110011\n\nSample Output 2\n\n8\n\nSample Input 3\n\n1 1\n1\n\nSample Output 3\n\n1\n\nNo directions are necessary.", "sample_input": "5 1\n00010\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03074", "source_text": "Score : 400 points\n\nProblem Statement\n\nN people are arranged in a row from left to right.\n\nYou are given a string S of length N consisting of 0 and 1, and a positive integer K.\n\nThe i-th person from the left is standing on feet if the i-th character of S is 0, and standing on hands if that character is 1.\n\nYou will give the following direction at most K times (possibly zero):\n\nDirection: Choose integers l and r satisfying 1 \\leq l \\leq r \\leq N, and flip the l-th, (l+1)-th, ..., and r-th persons. That is, for each i = l, l+1, ..., r, the i-th person from the left now stands on hands if he/she was standing on feet, and stands on feet if he/she was standing on hands.\n\nFind the maximum possible number of consecutive people standing on hands after at most K directions.\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^5.\n\nK is an integer satisfying 1 \\leq K \\leq 10^5.\n\nThe length of the string S is N.\n\nEach character of the string S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the maximum possible number of consecutive people standing on hands after at most K directions.\n\nSample Input 1\n\n5 1\n00010\n\nSample Output 1\n\n4\n\nWe can have four consecutive people standing on hands, which is the maximum result, by giving the following direction:\n\nGive the direction with l = 1, r = 3, which flips the first, second and third persons from the left.\n\nSample Input 2\n\n14 2\n11101010110011\n\nSample Output 2\n\n8\n\nSample Input 3\n\n1 1\n1\n\nSample Output 3\n\n1\n\nNo directions are necessary.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 900, "cpu_time_ms": 24, "memory_kb": 11904}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s866035791", "group_id": "codeNet:p03075", "input_text": "let () = Scanf.scanf \"%d %d %d %d %d %d\" @@ fun a b c d e k ->\n  print_endline @@\n  if e - a <= k then \"Yay!\" else \":(\"\n", "language": "OCaml", "metadata": {"date": 1554586949, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s866035791.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s866035791", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Yay!\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d %d %d %d\" @@ fun a b c d e k ->\n  print_endline @@\n  if e - a <= k then \"Yay!\" else \":(\"\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder city, there are five antennas standing in a straight line. They are called Antenna A, B, C, D and E from west to east, and their coordinates are a, b, c, d and e, respectively.\n\nTwo antennas can communicate directly if the distance between them is k or less, and they cannot if the distance is greater than k.\n\nDetermine if there exists a pair of antennas that cannot communicate directly.\n\nHere, assume that the distance between two antennas at coordinates p and q (p < q) is q - p.\n\nConstraints\n\na, b, c, d, e and k are integers between 0 and 123 (inclusive).\n\na < b < c < d < e\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\nb\nc\nd\ne\nk\n\nOutput\n\nPrint :( if there exists a pair of antennas that cannot communicate directly, and print Yay! if there is no such pair.\n\nSample Input 1\n\n1\n2\n4\n8\n9\n15\n\nSample Output 1\n\nYay!\n\nIn this case, there is no pair of antennas that cannot communicate directly, because:\n\nthe distance between A and B is 2 - 1 = 1\n\nthe distance between A and C is 4 - 1 = 3\n\nthe distance between A and D is 8 - 1 = 7\n\nthe distance between A and E is 9 - 1 = 8\n\nthe distance between B and C is 4 - 2 = 2\n\nthe distance between B and D is 8 - 2 = 6\n\nthe distance between B and E is 9 - 2 = 7\n\nthe distance between C and D is 8 - 4 = 4\n\nthe distance between C and E is 9 - 4 = 5\n\nthe distance between D and E is 9 - 8 = 1\n\nand none of them is greater than 15. Thus, the correct output is Yay!.\n\nSample Input 2\n\n15\n18\n26\n35\n36\n18\n\nSample Output 2\n\n:(\n\nIn this case, the distance between antennas A and D is 35 - 15 = 20 and exceeds 18, so they cannot communicate directly.\nThus, the correct output is :(.", "sample_input": "1\n2\n4\n8\n9\n15\n"}, "reference_outputs": ["Yay!\n"], "source_document_id": "p03075", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder city, there are five antennas standing in a straight line. They are called Antenna A, B, C, D and E from west to east, and their coordinates are a, b, c, d and e, respectively.\n\nTwo antennas can communicate directly if the distance between them is k or less, and they cannot if the distance is greater than k.\n\nDetermine if there exists a pair of antennas that cannot communicate directly.\n\nHere, assume that the distance between two antennas at coordinates p and q (p < q) is q - p.\n\nConstraints\n\na, b, c, d, e and k are integers between 0 and 123 (inclusive).\n\na < b < c < d < e\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\nb\nc\nd\ne\nk\n\nOutput\n\nPrint :( if there exists a pair of antennas that cannot communicate directly, and print Yay! if there is no such pair.\n\nSample Input 1\n\n1\n2\n4\n8\n9\n15\n\nSample Output 1\n\nYay!\n\nIn this case, there is no pair of antennas that cannot communicate directly, because:\n\nthe distance between A and B is 2 - 1 = 1\n\nthe distance between A and C is 4 - 1 = 3\n\nthe distance between A and D is 8 - 1 = 7\n\nthe distance between A and E is 9 - 1 = 8\n\nthe distance between B and C is 4 - 2 = 2\n\nthe distance between B and D is 8 - 2 = 6\n\nthe distance between B and E is 9 - 2 = 7\n\nthe distance between C and D is 8 - 4 = 4\n\nthe distance between C and E is 9 - 4 = 5\n\nthe distance between D and E is 9 - 8 = 1\n\nand none of them is greater than 15. Thus, the correct output is Yay!.\n\nSample Input 2\n\n15\n18\n26\n35\n36\n18\n\nSample Output 2\n\n:(\n\nIn this case, the distance between antennas A and D is 35 - 15 = 20 and exceeds 18, so they cannot communicate directly.\nThus, the correct output is :(.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 120, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s288102455", "group_id": "codeNet:p03076", "input_text": "let () = Printf.printf \"%d\\n\" @@\n  Scanf.scanf \"%d %d %d %d %d\" @@ fun a b c d e ->\n  let h, s = List.fold_left (fun (x, s) y -> max x ((10 - y mod 10) mod 10), s + (y + 9) / 10 * 10) (0, 0) [a;b;c;d;e] in\n  s - h\n", "language": "OCaml", "metadata": {"date": 1554599380, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03076.html", "problem_id": "p03076", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03076/input.txt", "sample_output_relpath": "derived/input_output/data/p03076/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03076/OCaml/s288102455.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s288102455", "user_id": "u798181098"}, "prompt_components": {"gold_output": "215\n", "input_to_evaluate": "let () = Printf.printf \"%d\\n\" @@\n  Scanf.scanf \"%d %d %d %d %d\" @@ fun a b c d e ->\n  let h, s = List.fold_left (fun (x, s) y -> max x ((10 - y mod 10) mod 10), s + (y + 9) / 10 * 10) (0, 0) [a;b;c;d;e] in\n  s - h\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nThe restaurant AtCoder serves the following five dishes:\n\nABC Don (rice bowl): takes A minutes to serve.\n\nARC Curry: takes B minutes to serve.\n\nAGC Pasta: takes C minutes to serve.\n\nAPC Ramen: takes D minutes to serve.\n\nATC Hanbagu (hamburger patty): takes E minutes to serve.\n\nHere, the time to serve a dish is the time between when an order is placed and when the dish is delivered.\n\nThis restaurant has the following rules on orders:\n\nAn order can only be placed at a time that is a multiple of 10 (time 0, 10, 20, ...).\n\nOnly one dish can be ordered at a time.\n\nNo new order can be placed when an order is already placed and the dish is still not delivered, but a new order can be placed at the exact time when the dish is delivered.\n\nE869120 arrives at this restaurant at time 0. He will order all five dishes. Find the earliest possible time for the last dish to be delivered.\n\nHere, he can order the dishes in any order he likes, and he can place an order already at time 0.\n\nConstraints\n\nA, B, C, D and E are integers between 1 and 123 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\nE\n\nOutput\n\nPrint the earliest possible time for the last dish to be delivered, as an integer.\n\nSample Input 1\n\n29\n20\n7\n35\n120\n\nSample Output 1\n\n215\n\nIf we decide to order the dishes in the order ABC Don, ARC Curry, AGC Pasta, ATC Hanbagu, APC Ramen, the earliest possible time for each order is as follows:\n\nOrder ABC Don at time 0, which will be delivered at time 29.\n\nOrder ARC Curry at time 30, which will be delivered at time 50.\n\nOrder AGC Pasta at time 50, which will be delivered at time 57.\n\nOrder ATC Hanbagu at time 60, which will be delivered at time 180.\n\nOrder APC Ramen at time 180, which will be delivered at time 215.\n\nThere is no way to order the dishes in which the last dish will be delivered earlier than this.\n\nSample Input 2\n\n101\n86\n119\n108\n57\n\nSample Output 2\n\n481\n\nIf we decide to order the dishes in the order AGC Pasta, ARC Curry, ATC Hanbagu, APC Ramen, ABC Don, the earliest possible time for each order is as follows:\n\nOrder AGC Pasta at time 0, which will be delivered at time 119.\n\nOrder ARC Curry at time 120, which will be delivered at time 206.\n\nOrder ATC Hanbagu at time 210, which will be delivered at time 267.\n\nOrder APC Ramen at time 270, which will be delivered at time 378.\n\nOrder ABC Don at time 380, which will be delivered at time 481.\n\nThere is no way to order the dishes in which the last dish will be delivered earlier than this.\n\nSample Input 3\n\n123\n123\n123\n123\n123\n\nSample Output 3\n\n643\n\nThis is the largest valid case.", "sample_input": "29\n20\n7\n35\n120\n"}, "reference_outputs": ["215\n"], "source_document_id": "p03076", "source_text": "Score: 200 points\n\nProblem Statement\n\nThe restaurant AtCoder serves the following five dishes:\n\nABC Don (rice bowl): takes A minutes to serve.\n\nARC Curry: takes B minutes to serve.\n\nAGC Pasta: takes C minutes to serve.\n\nAPC Ramen: takes D minutes to serve.\n\nATC Hanbagu (hamburger patty): takes E minutes to serve.\n\nHere, the time to serve a dish is the time between when an order is placed and when the dish is delivered.\n\nThis restaurant has the following rules on orders:\n\nAn order can only be placed at a time that is a multiple of 10 (time 0, 10, 20, ...).\n\nOnly one dish can be ordered at a time.\n\nNo new order can be placed when an order is already placed and the dish is still not delivered, but a new order can be placed at the exact time when the dish is delivered.\n\nE869120 arrives at this restaurant at time 0. He will order all five dishes. Find the earliest possible time for the last dish to be delivered.\n\nHere, he can order the dishes in any order he likes, and he can place an order already at time 0.\n\nConstraints\n\nA, B, C, D and E are integers between 1 and 123 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\nC\nD\nE\n\nOutput\n\nPrint the earliest possible time for the last dish to be delivered, as an integer.\n\nSample Input 1\n\n29\n20\n7\n35\n120\n\nSample Output 1\n\n215\n\nIf we decide to order the dishes in the order ABC Don, ARC Curry, AGC Pasta, ATC Hanbagu, APC Ramen, the earliest possible time for each order is as follows:\n\nOrder ABC Don at time 0, which will be delivered at time 29.\n\nOrder ARC Curry at time 30, which will be delivered at time 50.\n\nOrder AGC Pasta at time 50, which will be delivered at time 57.\n\nOrder ATC Hanbagu at time 60, which will be delivered at time 180.\n\nOrder APC Ramen at time 180, which will be delivered at time 215.\n\nThere is no way to order the dishes in which the last dish will be delivered earlier than this.\n\nSample Input 2\n\n101\n86\n119\n108\n57\n\nSample Output 2\n\n481\n\nIf we decide to order the dishes in the order AGC Pasta, ARC Curry, ATC Hanbagu, APC Ramen, ABC Don, the earliest possible time for each order is as follows:\n\nOrder AGC Pasta at time 0, which will be delivered at time 119.\n\nOrder ARC Curry at time 120, which will be delivered at time 206.\n\nOrder ATC Hanbagu at time 210, which will be delivered at time 267.\n\nOrder APC Ramen at time 270, which will be delivered at time 378.\n\nOrder ABC Don at time 380, which will be delivered at time 481.\n\nThere is no way to order the dishes in which the last dish will be delivered earlier than this.\n\nSample Input 3\n\n123\n123\n123\n123\n123\n\nSample Output 3\n\n643\n\nThis is the largest valid case.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 214, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s797308717", "group_id": "codeNet:p03077", "input_text": "let n = read_int()\nlet a = read_int()\nlet b = read_int()\nlet c = read_int()\nlet d = read_int()\nlet e = read_int()\nlet l = [a; b; c; d; e]\n\nlet f lst n =\n  let l_min = List.fold_right min lst max_int in\n  if n mod l_min = 0 then (n / l_min) + 4\n  else (n / l_min) + 5\n  \nlet () = print_int (f l n)", "language": "OCaml", "metadata": {"date": 1556898623, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03077.html", "problem_id": "p03077", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03077/input.txt", "sample_output_relpath": "derived/input_output/data/p03077/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03077/OCaml/s797308717.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s797308717", "user_id": "u769620184"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "let n = read_int()\nlet a = read_int()\nlet b = read_int()\nlet c = read_int()\nlet d = read_int()\nlet e = read_int()\nlet l = [a; b; c; d; e]\n\nlet f lst n =\n  let l_min = List.fold_right min lst max_int in\n  if n mod l_min = 0 then (n / l_min) + 4\n  else (n / l_min) + 5\n  \nlet () = print_int (f l n)", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn 2028 and after a continuous growth, AtCoder Inc. finally built an empire with six cities (City 1, 2, 3, 4, 5, 6)!\n\nThere are five means of transport in this empire:\n\nTrain: travels from City 1 to 2 in one minute. A train can occupy at most A people.\n\nBus: travels from City 2 to 3 in one minute. A bus can occupy at most B people.\n\nTaxi: travels from City 3 to 4 in one minute. A taxi can occupy at most C people.\n\nAirplane: travels from City 4 to 5 in one minute. An airplane can occupy at most D people.\n\nShip: travels from City 5 to 6 in one minute. A ship can occupy at most E people.\n\nFor each of them, one vehicle leaves the city at each integer time (time 0, 1, 2, ...).\n\nThere is a group of N people at City 1, and they all want to go to City 6.\n\nAt least how long does it take for all of them to reach there?\nYou can ignore the time needed to transfer.\n\nConstraints\n\n1 \\leq N, A, B, C, D, E \\leq 10^{15}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\nB\nC\nD\nE\n\nOutput\n\nPrint the minimum time required for all of the people to reach City 6, in minutes.\n\nSample Input 1\n\n5\n3\n2\n4\n3\n5\n\nSample Output 1\n\n7\n\nOne possible way to travel is as follows.\nFirst, there are N = 5 people at City 1, as shown in the following image:\n\nIn the first minute, three people travels from City 1 to City 2 by train. Note that a train can only occupy at most three people.\n\nIn the second minute, the remaining two people travels from City 1 to City 2 by train, and two of the three people who were already at City 2 travels to City 3 by bus. Note that a bus can only occupy at most two people.\n\nIn the third minute, two people travels from City 2 to City 3 by train, and another two people travels from City 3 to City 4 by taxi.\n\nFrom then on, if they continue traveling without stopping until they reach City 6, all of them can reach there in seven minutes.\n\nThere is no way for them to reach City 6 in 6 minutes or less.\n\nSample Input 2\n\n10\n123\n123\n123\n123\n123\n\nSample Output 2\n\n5\n\nAll kinds of vehicles can occupy N = 10 people at a time.\nThus, if they continue traveling without stopping until they reach City 6, all of them can reach there in five minutes.\n\nSample Input 3\n\n10000000007\n2\n3\n5\n7\n11\n\nSample Output 3\n\n5000000008\n\nNote that the input or output may not fit into a 32-bit integer type.", "sample_input": "5\n3\n2\n4\n3\n5\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03077", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn 2028 and after a continuous growth, AtCoder Inc. finally built an empire with six cities (City 1, 2, 3, 4, 5, 6)!\n\nThere are five means of transport in this empire:\n\nTrain: travels from City 1 to 2 in one minute. A train can occupy at most A people.\n\nBus: travels from City 2 to 3 in one minute. A bus can occupy at most B people.\n\nTaxi: travels from City 3 to 4 in one minute. A taxi can occupy at most C people.\n\nAirplane: travels from City 4 to 5 in one minute. An airplane can occupy at most D people.\n\nShip: travels from City 5 to 6 in one minute. A ship can occupy at most E people.\n\nFor each of them, one vehicle leaves the city at each integer time (time 0, 1, 2, ...).\n\nThere is a group of N people at City 1, and they all want to go to City 6.\n\nAt least how long does it take for all of them to reach there?\nYou can ignore the time needed to transfer.\n\nConstraints\n\n1 \\leq N, A, B, C, D, E \\leq 10^{15}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\nB\nC\nD\nE\n\nOutput\n\nPrint the minimum time required for all of the people to reach City 6, in minutes.\n\nSample Input 1\n\n5\n3\n2\n4\n3\n5\n\nSample Output 1\n\n7\n\nOne possible way to travel is as follows.\nFirst, there are N = 5 people at City 1, as shown in the following image:\n\nIn the first minute, three people travels from City 1 to City 2 by train. Note that a train can only occupy at most three people.\n\nIn the second minute, the remaining two people travels from City 1 to City 2 by train, and two of the three people who were already at City 2 travels to City 3 by bus. Note that a bus can only occupy at most two people.\n\nIn the third minute, two people travels from City 2 to City 3 by train, and another two people travels from City 3 to City 4 by taxi.\n\nFrom then on, if they continue traveling without stopping until they reach City 6, all of them can reach there in seven minutes.\n\nThere is no way for them to reach City 6 in 6 minutes or less.\n\nSample Input 2\n\n10\n123\n123\n123\n123\n123\n\nSample Output 2\n\n5\n\nAll kinds of vehicles can occupy N = 10 people at a time.\nThus, if they continue traveling without stopping until they reach City 6, all of them can reach there in five minutes.\n\nSample Input 3\n\n10000000007\n2\n3\n5\n7\n11\n\nSample Output 3\n\n5000000008\n\nNote that the input or output may not fit into a 32-bit integer type.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 296, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s386773758", "group_id": "codeNet:p03077", "input_text": "let () = Scanf.scanf \"%d %d %d %d %d %d\" @@ fun n a b c d e ->\n  let m = List.fold_left min max_int [ a; b; c; d; e ] in\n  Printf.printf \"%d\\n\" @@ (n + m - 1) / m + 4\n", "language": "OCaml", "metadata": {"date": 1554578227, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03077.html", "problem_id": "p03077", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03077/input.txt", "sample_output_relpath": "derived/input_output/data/p03077/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03077/OCaml/s386773758.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s386773758", "user_id": "u504158101"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d %d %d %d\" @@ fun n a b c d e ->\n  let m = List.fold_left min max_int [ a; b; c; d; e ] in\n  Printf.printf \"%d\\n\" @@ (n + m - 1) / m + 4\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn 2028 and after a continuous growth, AtCoder Inc. finally built an empire with six cities (City 1, 2, 3, 4, 5, 6)!\n\nThere are five means of transport in this empire:\n\nTrain: travels from City 1 to 2 in one minute. A train can occupy at most A people.\n\nBus: travels from City 2 to 3 in one minute. A bus can occupy at most B people.\n\nTaxi: travels from City 3 to 4 in one minute. A taxi can occupy at most C people.\n\nAirplane: travels from City 4 to 5 in one minute. An airplane can occupy at most D people.\n\nShip: travels from City 5 to 6 in one minute. A ship can occupy at most E people.\n\nFor each of them, one vehicle leaves the city at each integer time (time 0, 1, 2, ...).\n\nThere is a group of N people at City 1, and they all want to go to City 6.\n\nAt least how long does it take for all of them to reach there?\nYou can ignore the time needed to transfer.\n\nConstraints\n\n1 \\leq N, A, B, C, D, E \\leq 10^{15}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\nB\nC\nD\nE\n\nOutput\n\nPrint the minimum time required for all of the people to reach City 6, in minutes.\n\nSample Input 1\n\n5\n3\n2\n4\n3\n5\n\nSample Output 1\n\n7\n\nOne possible way to travel is as follows.\nFirst, there are N = 5 people at City 1, as shown in the following image:\n\nIn the first minute, three people travels from City 1 to City 2 by train. Note that a train can only occupy at most three people.\n\nIn the second minute, the remaining two people travels from City 1 to City 2 by train, and two of the three people who were already at City 2 travels to City 3 by bus. Note that a bus can only occupy at most two people.\n\nIn the third minute, two people travels from City 2 to City 3 by train, and another two people travels from City 3 to City 4 by taxi.\n\nFrom then on, if they continue traveling without stopping until they reach City 6, all of them can reach there in seven minutes.\n\nThere is no way for them to reach City 6 in 6 minutes or less.\n\nSample Input 2\n\n10\n123\n123\n123\n123\n123\n\nSample Output 2\n\n5\n\nAll kinds of vehicles can occupy N = 10 people at a time.\nThus, if they continue traveling without stopping until they reach City 6, all of them can reach there in five minutes.\n\nSample Input 3\n\n10000000007\n2\n3\n5\n7\n11\n\nSample Output 3\n\n5000000008\n\nNote that the input or output may not fit into a 32-bit integer type.", "sample_input": "5\n3\n2\n4\n3\n5\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03077", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn 2028 and after a continuous growth, AtCoder Inc. finally built an empire with six cities (City 1, 2, 3, 4, 5, 6)!\n\nThere are five means of transport in this empire:\n\nTrain: travels from City 1 to 2 in one minute. A train can occupy at most A people.\n\nBus: travels from City 2 to 3 in one minute. A bus can occupy at most B people.\n\nTaxi: travels from City 3 to 4 in one minute. A taxi can occupy at most C people.\n\nAirplane: travels from City 4 to 5 in one minute. An airplane can occupy at most D people.\n\nShip: travels from City 5 to 6 in one minute. A ship can occupy at most E people.\n\nFor each of them, one vehicle leaves the city at each integer time (time 0, 1, 2, ...).\n\nThere is a group of N people at City 1, and they all want to go to City 6.\n\nAt least how long does it take for all of them to reach there?\nYou can ignore the time needed to transfer.\n\nConstraints\n\n1 \\leq N, A, B, C, D, E \\leq 10^{15}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\nB\nC\nD\nE\n\nOutput\n\nPrint the minimum time required for all of the people to reach City 6, in minutes.\n\nSample Input 1\n\n5\n3\n2\n4\n3\n5\n\nSample Output 1\n\n7\n\nOne possible way to travel is as follows.\nFirst, there are N = 5 people at City 1, as shown in the following image:\n\nIn the first minute, three people travels from City 1 to City 2 by train. Note that a train can only occupy at most three people.\n\nIn the second minute, the remaining two people travels from City 1 to City 2 by train, and two of the three people who were already at City 2 travels to City 3 by bus. Note that a bus can only occupy at most two people.\n\nIn the third minute, two people travels from City 2 to City 3 by train, and another two people travels from City 3 to City 4 by taxi.\n\nFrom then on, if they continue traveling without stopping until they reach City 6, all of them can reach there in seven minutes.\n\nThere is no way for them to reach City 6 in 6 minutes or less.\n\nSample Input 2\n\n10\n123\n123\n123\n123\n123\n\nSample Output 2\n\n5\n\nAll kinds of vehicles can occupy N = 10 people at a time.\nThus, if they continue traveling without stopping until they reach City 6, all of them can reach there in five minutes.\n\nSample Input 3\n\n10000000007\n2\n3\n5\n7\n11\n\nSample Output 3\n\n5000000008\n\nNote that the input or output may not fit into a 32-bit integer type.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 167, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s050262046", "group_id": "codeNet:p03085", "input_text": "Printf.printf \"%c\\n\" @@ match input_char stdin with\n| 'A' -> 'T'\n| 'T' -> 'A'\n| 'C' -> 'G'\n| 'G' -> 'C'", "language": "OCaml", "metadata": {"date": 1586380444, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s050262046.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s050262046", "user_id": "u342443598"}, "prompt_components": {"gold_output": "T\n", "input_to_evaluate": "Printf.printf \"%c\\n\" @@ match input_char stdin with\n| 'A' -> 'T'\n| 'T' -> 'A'\n| 'C' -> 'G'\n| 'G' -> 'C'", "problem_context": "Score : 100 points\n\nProblem Statement\n\nOn the Planet AtCoder, there are four types of bases: A, C, G and T. A bonds with T, and C bonds with G.\n\nYou are given a letter b as input, which is A, C, G or T. Write a program that prints the letter representing the base that bonds with the base b.\n\nConstraints\n\nb is one of the letters A, C, G and T.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nb\n\nOutput\n\nPrint the letter representing the base that bonds with the base b.\n\nSample Input 1\n\nA\n\nSample Output 1\n\nT\n\nSample Input 2\n\nG\n\nSample Output 2\n\nC", "sample_input": "A\n"}, "reference_outputs": ["T\n"], "source_document_id": "p03085", "source_text": "Score : 100 points\n\nProblem Statement\n\nOn the Planet AtCoder, there are four types of bases: A, C, G and T. A bonds with T, and C bonds with G.\n\nYou are given a letter b as input, which is A, C, G or T. Write a program that prints the letter representing the base that bonds with the base b.\n\nConstraints\n\nb is one of the letters A, C, G and T.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nb\n\nOutput\n\nPrint the letter representing the base that bonds with the base b.\n\nSample Input 1\n\nA\n\nSample Output 1\n\nT\n\nSample Input 2\n\nG\n\nSample Output 2\n\nC", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s835031610", "group_id": "codeNet:p03085", "input_text": "let helix =\n  Scanf.scanf \"%c\" (fun b ->\n  print_endline @@\n  if b == 'A' then \"T\"\n  else if b == 'T' then \"A\"\n  else if b == 'G' then \"C\"\n  else \"G\")\n;;", "language": "OCaml", "metadata": {"date": 1556117100, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s835031610.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s835031610", "user_id": "u245851904"}, "prompt_components": {"gold_output": "T\n", "input_to_evaluate": "let helix =\n  Scanf.scanf \"%c\" (fun b ->\n  print_endline @@\n  if b == 'A' then \"T\"\n  else if b == 'T' then \"A\"\n  else if b == 'G' then \"C\"\n  else \"G\")\n;;", "problem_context": "Score : 100 points\n\nProblem Statement\n\nOn the Planet AtCoder, there are four types of bases: A, C, G and T. A bonds with T, and C bonds with G.\n\nYou are given a letter b as input, which is A, C, G or T. Write a program that prints the letter representing the base that bonds with the base b.\n\nConstraints\n\nb is one of the letters A, C, G and T.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nb\n\nOutput\n\nPrint the letter representing the base that bonds with the base b.\n\nSample Input 1\n\nA\n\nSample Output 1\n\nT\n\nSample Input 2\n\nG\n\nSample Output 2\n\nC", "sample_input": "A\n"}, "reference_outputs": ["T\n"], "source_document_id": "p03085", "source_text": "Score : 100 points\n\nProblem Statement\n\nOn the Planet AtCoder, there are four types of bases: A, C, G and T. A bonds with T, and C bonds with G.\n\nYou are given a letter b as input, which is A, C, G or T. Write a program that prints the letter representing the base that bonds with the base b.\n\nConstraints\n\nb is one of the letters A, C, G and T.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nb\n\nOutput\n\nPrint the letter representing the base that bonds with the base b.\n\nSample Input 1\n\nA\n\nSample Output 1\n\nT\n\nSample Input 2\n\nG\n\nSample Output 2\n\nC", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 153, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s985138293", "group_id": "codeNet:p03086", "input_text": "let () = Scanf.scanf \"%s\" @@ fun s ->\n  let ss = Array.init (String.length s) @@ fun i -> String.get s i in\n  let f = fun (maximum, prev) i -> \n    match (i = 0, ss.(i) = 'A' || ss.(i) = 'T' || ss.(i) = 'C' || ss.(i) = 'G') with\n    | (true, true) -> (1, 1)\n    | (true, false) -> (0, 0)\n    | (false, true) -> (max maximum (prev + 1), prev + 1)\n    | (false, false) -> (max maximum 0, 0) in\n  let fin_pair = List.fold_left f (0, 0) @@ List.init (String.length s) Fun.id in\n  Printf.printf \"%d\\n\" @@ fst fin_pair\n", "language": "OCaml", "metadata": {"date": 1598539073, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s985138293.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s985138293", "user_id": "u052332717"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let () = Scanf.scanf \"%s\" @@ fun s ->\n  let ss = Array.init (String.length s) @@ fun i -> String.get s i in\n  let f = fun (maximum, prev) i -> \n    match (i = 0, ss.(i) = 'A' || ss.(i) = 'T' || ss.(i) = 'C' || ss.(i) = 'G') with\n    | (true, true) -> (1, 1)\n    | (true, false) -> (0, 0)\n    | (false, true) -> (max maximum (prev + 1), prev + 1)\n    | (false, false) -> (max maximum 0, 0) in\n  let fin_pair = List.fold_left f (0, 0) @@ List.init (String.length s) Fun.id in\n  Printf.printf \"%d\\n\" @@ fst fin_pair\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of S.\n\nHere, a ACGT string is a string that contains no characters other than A, C, G and T.\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\nS is a string of length between 1 and 10 (inclusive).\n\nEach character in S is an uppercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest ACGT string that is a substring of S.\n\nSample Input 1\n\nATCODER\n\nSample Output 1\n\n3\n\nAmong the ACGT strings that are substrings of ATCODER, the longest one is ATC.\n\nSample Input 2\n\nHATAGAYA\n\nSample Output 2\n\n5\n\nAmong the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.\n\nSample Input 3\n\nSHINJUKU\n\nSample Output 3\n\n0\n\nAmong the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).", "sample_input": "ATCODER\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03086", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of S.\n\nHere, a ACGT string is a string that contains no characters other than A, C, G and T.\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\nS is a string of length between 1 and 10 (inclusive).\n\nEach character in S is an uppercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest ACGT string that is a substring of S.\n\nSample Input 1\n\nATCODER\n\nSample Output 1\n\n3\n\nAmong the ACGT strings that are substrings of ATCODER, the longest one is ATC.\n\nSample Input 2\n\nHATAGAYA\n\nSample Output 2\n\n5\n\nAmong the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.\n\nSample Input 3\n\nSHINJUKU\n\nSample Output 3\n\n0\n\nAmong the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 513, "cpu_time_ms": 8, "memory_kb": 3804}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s621295285", "group_id": "codeNet:p03086", "input_text": "(*\nocamlfind ocamlopt -package batteries -linkpkg main.ml -o a.out\n*)\nopen Batteries\n\nlet () =\n        Str.split (Str.regexp \"[B|D|E|F|H|I|J|K|L|M|N|O|P|Q|R|S|U|V|W|X|Y|Z]\") (read_line ())\n        |> List.max\n        |> String.length\n        |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1590173911, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s621295285.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s621295285", "user_id": "u280335093"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(*\nocamlfind ocamlopt -package batteries -linkpkg main.ml -o a.out\n*)\nopen Batteries\n\nlet () =\n        Str.split (Str.regexp \"[B|D|E|F|H|I|J|K|L|M|N|O|P|Q|R|S|U|V|W|X|Y|Z]\") (read_line ())\n        |> List.max\n        |> String.length\n        |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of S.\n\nHere, a ACGT string is a string that contains no characters other than A, C, G and T.\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\nS is a string of length between 1 and 10 (inclusive).\n\nEach character in S is an uppercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest ACGT string that is a substring of S.\n\nSample Input 1\n\nATCODER\n\nSample Output 1\n\n3\n\nAmong the ACGT strings that are substrings of ATCODER, the longest one is ATC.\n\nSample Input 2\n\nHATAGAYA\n\nSample Output 2\n\n5\n\nAmong the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.\n\nSample Input 3\n\nSHINJUKU\n\nSample Output 3\n\n0\n\nAmong the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).", "sample_input": "ATCODER\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03086", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of S.\n\nHere, a ACGT string is a string that contains no characters other than A, C, G and T.\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\nS is a string of length between 1 and 10 (inclusive).\n\nEach character in S is an uppercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest ACGT string that is a substring of S.\n\nSample Input 1\n\nATCODER\n\nSample Output 1\n\n3\n\nAmong the ACGT strings that are substrings of ATCODER, the longest one is ATC.\n\nSample Input 2\n\nHATAGAYA\n\nSample Output 2\n\n5\n\nAmong the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.\n\nSample Input 3\n\nSHINJUKU\n\nSample Output 3\n\n0\n\nAmong the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 266, "cpu_time_ms": 2, "memory_kb": 1024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s150414644", "group_id": "codeNet:p03086", "input_text": "(* O(n) *)\nlet rec fold_btw f a i n = if i >= n then a else fold_btw f (f a i) (i + 1) n\nlet fold_int f a n = fold_btw f a 0 n\n\n(* O(|s|) *)\nlet string_to_char_array s = Array.init (String.length s) (fun i -> s.[i])\nlet string_to_chars s = Array.to_list (string_to_char_array s)\n\n(* O(1) *)\nlet is_acgt_char = function\n| 'A' | 'C' | 'G' | 'T' -> true\n| _ -> false\n\n(* O(|s|) *)\nlet is_acgt_string s = List.for_all is_acgt_char (string_to_chars s)\n\n(* O(|s|^3) *)\nlet solve s =\n  let n = String.length s in\n  fold_int\n    (fun acc_i i ->\n      fold_btw\n        (fun acc_j j ->\n          let len = j - i in\n          if is_acgt_string (String.sub s i len) then\n            max acc_j len\n          else\n            acc_j)\n        acc_i\n        (i + 1)\n        (n + 1))\n    0\n    n\n\nlet _ = read_line () |> solve |> string_of_int |> print_endline", "language": "OCaml", "metadata": {"date": 1557743896, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s150414644.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s150414644", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(* O(n) *)\nlet rec fold_btw f a i n = if i >= n then a else fold_btw f (f a i) (i + 1) n\nlet fold_int f a n = fold_btw f a 0 n\n\n(* O(|s|) *)\nlet string_to_char_array s = Array.init (String.length s) (fun i -> s.[i])\nlet string_to_chars s = Array.to_list (string_to_char_array s)\n\n(* O(1) *)\nlet is_acgt_char = function\n| 'A' | 'C' | 'G' | 'T' -> true\n| _ -> false\n\n(* O(|s|) *)\nlet is_acgt_string s = List.for_all is_acgt_char (string_to_chars s)\n\n(* O(|s|^3) *)\nlet solve s =\n  let n = String.length s in\n  fold_int\n    (fun acc_i i ->\n      fold_btw\n        (fun acc_j j ->\n          let len = j - i in\n          if is_acgt_string (String.sub s i len) then\n            max acc_j len\n          else\n            acc_j)\n        acc_i\n        (i + 1)\n        (n + 1))\n    0\n    n\n\nlet _ = read_line () |> solve |> string_of_int |> print_endline", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of S.\n\nHere, a ACGT string is a string that contains no characters other than A, C, G and T.\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\nS is a string of length between 1 and 10 (inclusive).\n\nEach character in S is an uppercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest ACGT string that is a substring of S.\n\nSample Input 1\n\nATCODER\n\nSample Output 1\n\n3\n\nAmong the ACGT strings that are substrings of ATCODER, the longest one is ATC.\n\nSample Input 2\n\nHATAGAYA\n\nSample Output 2\n\n5\n\nAmong the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.\n\nSample Input 3\n\nSHINJUKU\n\nSample Output 3\n\n0\n\nAmong the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).", "sample_input": "ATCODER\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03086", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of S.\n\nHere, a ACGT string is a string that contains no characters other than A, C, G and T.\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\nS is a string of length between 1 and 10 (inclusive).\n\nEach character in S is an uppercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest ACGT string that is a substring of S.\n\nSample Input 1\n\nATCODER\n\nSample Output 1\n\n3\n\nAmong the ACGT strings that are substrings of ATCODER, the longest one is ATC.\n\nSample Input 2\n\nHATAGAYA\n\nSample Output 2\n\n5\n\nAmong the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.\n\nSample Input 3\n\nSHINJUKU\n\nSample Output 3\n\n0\n\nAmong the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 842, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s470618869", "group_id": "codeNet:p03086", "input_text": "open Printf\nopen Scanf\n\nlet (++) = Int64.add\nlet (--) = Int64.sub\nlet ( ** ) = Int64.mul\nlet (//) = Int64.div\nlet (%%) = Int64.rem\nlet landl = Int64.logand\nlet lorl = Int64.logor\nlet lnotl = Int64.lognot\nlet lxorl = Int64.logxor\nlet lsll = Int64.shift_left\nlet lsrl = Int64.shift_right_logical\nlet long = Int64.of_int\nlet succl = Int64.succ\nlet predl = Int64.pred\n\nlet read_int _ = scanf \" %d \" (fun x -> x)\nlet read_long _ = scanf \" %Ld \" (fun x -> x)\nlet read_str _ = scanf \" %s \" (fun x -> x)\nlet read_double _ = scanf \" %f \" (fun x -> x)\n\nlet m = 1_000_000_007L\n\nlet rec gcd a b = if b = 0L then a else gcd b (a %% b)\n\nlet rec mod_pow a = function\n  | 0L -> 1L\n  | b -> (if b %% 2L = 0L then 1L else a) ** mod_pow (a ** a %% m) (b//2L) %% m\n\nlet explode s =\n  let rec exp i l =\n    if i < 0 then l else exp (i - 1) (s.[i] :: l) in\n  exp (String.length s - 1) []\n\nlet rec max_len m accum = function\n  | [] -> max m accum\n  | c :: rest when c = 'A' || c = 'C' || c = 'G' || c = 'T' ->\n    max_len m (accum+1) rest\n  | _ :: rest -> max_len (max m accum) 0 rest\n\nlet () =\n  let s = read_str () in\n  printf \"%d\\n\" (max_len 0 0 @@ explode s)\n", "language": "OCaml", "metadata": {"date": 1557564406, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s470618869.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s470618869", "user_id": "u806601169"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet (++) = Int64.add\nlet (--) = Int64.sub\nlet ( ** ) = Int64.mul\nlet (//) = Int64.div\nlet (%%) = Int64.rem\nlet landl = Int64.logand\nlet lorl = Int64.logor\nlet lnotl = Int64.lognot\nlet lxorl = Int64.logxor\nlet lsll = Int64.shift_left\nlet lsrl = Int64.shift_right_logical\nlet long = Int64.of_int\nlet succl = Int64.succ\nlet predl = Int64.pred\n\nlet read_int _ = scanf \" %d \" (fun x -> x)\nlet read_long _ = scanf \" %Ld \" (fun x -> x)\nlet read_str _ = scanf \" %s \" (fun x -> x)\nlet read_double _ = scanf \" %f \" (fun x -> x)\n\nlet m = 1_000_000_007L\n\nlet rec gcd a b = if b = 0L then a else gcd b (a %% b)\n\nlet rec mod_pow a = function\n  | 0L -> 1L\n  | b -> (if b %% 2L = 0L then 1L else a) ** mod_pow (a ** a %% m) (b//2L) %% m\n\nlet explode s =\n  let rec exp i l =\n    if i < 0 then l else exp (i - 1) (s.[i] :: l) in\n  exp (String.length s - 1) []\n\nlet rec max_len m accum = function\n  | [] -> max m accum\n  | c :: rest when c = 'A' || c = 'C' || c = 'G' || c = 'T' ->\n    max_len m (accum+1) rest\n  | _ :: rest -> max_len (max m accum) 0 rest\n\nlet () =\n  let s = read_str () in\n  printf \"%d\\n\" (max_len 0 0 @@ explode s)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of S.\n\nHere, a ACGT string is a string that contains no characters other than A, C, G and T.\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\nS is a string of length between 1 and 10 (inclusive).\n\nEach character in S is an uppercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest ACGT string that is a substring of S.\n\nSample Input 1\n\nATCODER\n\nSample Output 1\n\n3\n\nAmong the ACGT strings that are substrings of ATCODER, the longest one is ATC.\n\nSample Input 2\n\nHATAGAYA\n\nSample Output 2\n\n5\n\nAmong the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.\n\nSample Input 3\n\nSHINJUKU\n\nSample Output 3\n\n0\n\nAmong the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).", "sample_input": "ATCODER\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03086", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of uppercase English letters. Find the length of the longest ACGT string that is a substring (see Notes) of S.\n\nHere, a ACGT string is a string that contains no characters other than A, C, G and T.\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\nS is a string of length between 1 and 10 (inclusive).\n\nEach character in S is an uppercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest ACGT string that is a substring of S.\n\nSample Input 1\n\nATCODER\n\nSample Output 1\n\n3\n\nAmong the ACGT strings that are substrings of ATCODER, the longest one is ATC.\n\nSample Input 2\n\nHATAGAYA\n\nSample Output 2\n\n5\n\nAmong the ACGT strings that are substrings of HATAGAYA, the longest one is ATAGA.\n\nSample Input 3\n\nSHINJUKU\n\nSample Output 3\n\n0\n\nAmong the ACGT strings that are substrings of SHINJUKU, the longest one is (the empty string).", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1140, "cpu_time_ms": 2, "memory_kb": 4480}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s483649785", "group_id": "codeNet:p03087", "input_text": "let solve s n =\n  let t = Array.make (n + 1) 0 in\n  for i = 0 to n - 1 do\n    t.(i+1) <- if String.get s i = 'A' && (i + 1) < n then \n                 if String.get s (i + 1) = 'C' then t.(i) + 1 else t.(i)\n               else t.(i)\n  done;\n  fun (i, j) -> t.(j-1) - t.(i-1)\n\nlet _ =\n  let n, q = Scanf.scanf \"%d %d\\n\" (fun n q -> n, q) in\n  let s = Scanf.scanf \"%s\\n\" (fun s -> s) in\n  let queries = ref [] in\n  for i = 0 to q - 1 do\n    Scanf.scanf \"%d %d\\n\" (fun l r -> queries := (l, r)::!queries)\n  done;\n  let solver = solve s n in\n  List.fold_left (fun acc query -> (solver query)::acc) [] !queries\n  |> List.iter (fun n -> print_int n; print_endline \"\")", "language": "OCaml", "metadata": {"date": 1553465648, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s483649785.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s483649785", "user_id": "u387591304"}, "prompt_components": {"gold_output": "2\n0\n3\n", "input_to_evaluate": "let solve s n =\n  let t = Array.make (n + 1) 0 in\n  for i = 0 to n - 1 do\n    t.(i+1) <- if String.get s i = 'A' && (i + 1) < n then \n                 if String.get s (i + 1) = 'C' then t.(i) + 1 else t.(i)\n               else t.(i)\n  done;\n  fun (i, j) -> t.(j-1) - t.(i-1)\n\nlet _ =\n  let n, q = Scanf.scanf \"%d %d\\n\" (fun n q -> n, q) in\n  let s = Scanf.scanf \"%s\\n\" (fun s -> s) in\n  let queries = ref [] in\n  for i = 0 to q - 1 do\n    Scanf.scanf \"%d %d\\n\" (fun l r -> queries := (l, r)::!queries)\n  done;\n  let solver = solve s n in\n  List.fold_left (fun acc query -> (solver query)::acc) [] !queries\n  |> List.iter (fun n -> print_int n; print_endline \"\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of A, C, G and T. Answer the following Q queries:\n\nQuery i (1 \\leq i \\leq Q): You will be given integers l_i and r_i (1 \\leq l_i < r_i \\leq N). Consider the substring of S starting at index l_i and ending at index r_i (both inclusive). In this string, how many times does AC occurs as a substring?\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\nS is a string of length N.\n\nEach character in S is A, C, G or T.\n\n1 \\leq l_i < r_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nS\nl_1 r_1\n:\nl_Q r_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the answer to the i-th query.\n\nSample Input 1\n\n8 3\nACACTACG\n3 7\n2 3\n1 8\n\nSample Output 1\n\n2\n0\n3\n\nQuery 1: the substring of S starting at index 3 and ending at index 7 is ACTAC. In this string, AC occurs twice as a substring.\n\nQuery 2: the substring of S starting at index 2 and ending at index 3 is CA. In this string, AC occurs zero times as a substring.\n\nQuery 3: the substring of S starting at index 1 and ending at index 8 is ACACTACG. In this string, AC occurs three times as a substring.", "sample_input": "8 3\nACACTACG\n3 7\n2 3\n1 8\n"}, "reference_outputs": ["2\n0\n3\n"], "source_document_id": "p03087", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of A, C, G and T. Answer the following Q queries:\n\nQuery i (1 \\leq i \\leq Q): You will be given integers l_i and r_i (1 \\leq l_i < r_i \\leq N). Consider the substring of S starting at index l_i and ending at index r_i (both inclusive). In this string, how many times does AC occurs as a substring?\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\nS is a string of length N.\n\nEach character in S is A, C, G or T.\n\n1 \\leq l_i < r_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nS\nl_1 r_1\n:\nl_Q r_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the answer to the i-th query.\n\nSample Input 1\n\n8 3\nACACTACG\n3 7\n2 3\n1 8\n\nSample Output 1\n\n2\n0\n3\n\nQuery 1: the substring of S starting at index 3 and ending at index 7 is ACTAC. In this string, AC occurs twice as a substring.\n\nQuery 2: the substring of S starting at index 2 and ending at index 3 is CA. In this string, AC occurs zero times as a substring.\n\nQuery 3: the substring of S starting at index 1 and ending at index 8 is ACACTACG. In this string, AC occurs three times as a substring.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 661, "cpu_time_ms": 234, "memory_kb": 12800}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s323696256", "group_id": "codeNet:p03087", "input_text": "let solve s n =\n  let t = Array.make n 0 in\n  for i = 0 to n - 2 do\n    t.(i+1) <- if (String.sub s i 2) = \"AC\" then t.(i) + 1 else t.(i)\n  done;\n  t.(n - 1) <- t.(n - 2);\n  fun (i, j) -> t.(j-1) - t.(i-1)\n\nlet _ =\n  let n, q = Scanf.scanf \"%d %d\\n\" (fun n q -> n, q) in\n  let s = Scanf.scanf \"%s\\n\" (fun s -> s) in\n  let queries = ref [] in\n  for i = 0 to q - 1 do\n    Scanf.scanf \"%d %d\\n\" (fun l r -> queries := (l, r)::!queries)\n  done;\n  let solver = solve s n in\n  List.fold_left (fun acc query -> (solver query)::acc) [] !queries\n  |> List.iter (fun n -> print_int n; print_endline \"\")", "language": "OCaml", "metadata": {"date": 1553465192, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s323696256.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s323696256", "user_id": "u387591304"}, "prompt_components": {"gold_output": "2\n0\n3\n", "input_to_evaluate": "let solve s n =\n  let t = Array.make n 0 in\n  for i = 0 to n - 2 do\n    t.(i+1) <- if (String.sub s i 2) = \"AC\" then t.(i) + 1 else t.(i)\n  done;\n  t.(n - 1) <- t.(n - 2);\n  fun (i, j) -> t.(j-1) - t.(i-1)\n\nlet _ =\n  let n, q = Scanf.scanf \"%d %d\\n\" (fun n q -> n, q) in\n  let s = Scanf.scanf \"%s\\n\" (fun s -> s) in\n  let queries = ref [] in\n  for i = 0 to q - 1 do\n    Scanf.scanf \"%d %d\\n\" (fun l r -> queries := (l, r)::!queries)\n  done;\n  let solver = solve s n in\n  List.fold_left (fun acc query -> (solver query)::acc) [] !queries\n  |> List.iter (fun n -> print_int n; print_endline \"\")", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of A, C, G and T. Answer the following Q queries:\n\nQuery i (1 \\leq i \\leq Q): You will be given integers l_i and r_i (1 \\leq l_i < r_i \\leq N). Consider the substring of S starting at index l_i and ending at index r_i (both inclusive). In this string, how many times does AC occurs as a substring?\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\nS is a string of length N.\n\nEach character in S is A, C, G or T.\n\n1 \\leq l_i < r_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nS\nl_1 r_1\n:\nl_Q r_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the answer to the i-th query.\n\nSample Input 1\n\n8 3\nACACTACG\n3 7\n2 3\n1 8\n\nSample Output 1\n\n2\n0\n3\n\nQuery 1: the substring of S starting at index 3 and ending at index 7 is ACTAC. In this string, AC occurs twice as a substring.\n\nQuery 2: the substring of S starting at index 2 and ending at index 3 is CA. In this string, AC occurs zero times as a substring.\n\nQuery 3: the substring of S starting at index 1 and ending at index 8 is ACACTACG. In this string, AC occurs three times as a substring.", "sample_input": "8 3\nACACTACG\n3 7\n2 3\n1 8\n"}, "reference_outputs": ["2\n0\n3\n"], "source_document_id": "p03087", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of A, C, G and T. Answer the following Q queries:\n\nQuery i (1 \\leq i \\leq Q): You will be given integers l_i and r_i (1 \\leq l_i < r_i \\leq N). Consider the substring of S starting at index l_i and ending at index r_i (both inclusive). In this string, how many times does AC occurs as a substring?\n\nNotes\n\nA substring of a string T is a string obtained by removing zero or more characters from the beginning and the end of T.\n\nFor example, the substrings of ATCODER include TCO, AT, CODER, ATCODER and (the empty string), but not AC.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq Q \\leq 10^5\n\nS is a string of length N.\n\nEach character in S is A, C, G or T.\n\n1 \\leq l_i < r_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nS\nl_1 r_1\n:\nl_Q r_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the answer to the i-th query.\n\nSample Input 1\n\n8 3\nACACTACG\n3 7\n2 3\n1 8\n\nSample Output 1\n\n2\n0\n3\n\nQuery 1: the substring of S starting at index 3 and ending at index 7 is ACTAC. In this string, AC occurs twice as a substring.\n\nQuery 2: the substring of S starting at index 2 and ending at index 3 is CA. In this string, AC occurs zero times as a substring.\n\nQuery 3: the substring of S starting at index 1 and ending at index 8 is ACACTACG. In this string, AC occurs three times as a substring.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 592, "cpu_time_ms": 244, "memory_kb": 11392}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s165017579", "group_id": "codeNet:p03089", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let b = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun b -> b)) in\n    let search b =\n        let k = Array.length b in\n        let rec loop i =\n            if i < 0 then None else\n                if b.(i) = i + 1 then Some i else loop (i - 1)\n        in\n        loop (k - 1)\n    in\n    let remove b x =\n        let k = Array.length b in\n        let b2 = Array.make (k - 1) 0 in\n        let rec loop i j =\n            if i = k then b2 else \n                if i = x then loop (i + 1) j else (\n                    b2.(j) <- b.(i);\n                    loop (i + 1) (j + 1)\n                )\n        in\n        loop 0 0\n    in\n    let rec loop b i history =\n        if i = 0 then history else\n            match search b with\n            | Some x -> loop (remove b x) (i - 1) ((x + 1) :: history)\n            | None -> []\n    in\n    let k = loop b n [] in\n    if k = [] then print_endline \"-1\" else\n        List.iter (Printf.printf \"%d\\n\") k\n)", "language": "OCaml", "metadata": {"date": 1595452655, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s165017579.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s165017579", "user_id": "u342443598"}, "prompt_components": {"gold_output": "1\n1\n2\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let b = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun b -> b)) in\n    let search b =\n        let k = Array.length b in\n        let rec loop i =\n            if i < 0 then None else\n                if b.(i) = i + 1 then Some i else loop (i - 1)\n        in\n        loop (k - 1)\n    in\n    let remove b x =\n        let k = Array.length b in\n        let b2 = Array.make (k - 1) 0 in\n        let rec loop i j =\n            if i = k then b2 else \n                if i = x then loop (i + 1) j else (\n                    b2.(j) <- b.(i);\n                    loop (i + 1) (j + 1)\n                )\n        in\n        loop 0 0\n    in\n    let rec loop b i history =\n        if i = 0 then history else\n            match search b with\n            | Some x -> loop (remove b x) (i - 1) ((x + 1) :: history)\n            | None -> []\n    in\n    let k = loop b n [] in\n    if k = [] then print_endline \"-1\" else\n        List.iter (Printf.printf \"%d\\n\") k\n)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has an empty sequence a.\n\nHe will perform N operations on this sequence.\n\nIn the i-th operation, he chooses an integer j satisfying 1 \\leq j \\leq i, and insert j at position j in a (the beginning is position 1).\n\nYou are given a sequence b of length N. Determine if it is possible that a is equal to b after N operations. If it is, show one possible sequence of operations that achieves it.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq b_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nb_1 \\dots b_N\n\nOutput\n\nIf there is no sequence of N operations after which a would be equal to b, print -1.\nIf there is, print N lines. In the i-th line, the integer chosen in the i-th operation should be printed. If there are multiple solutions, any of them is accepted.\n\nSample Input 1\n\n3\n1 2 1\n\nSample Output 1\n\n1\n1\n2\n\nIn this sequence of operations, the sequence a changes as follows:\n\nAfter the first operation: (1)\n\nAfter the second operation: (1,1)\n\nAfter the third operation: (1,2,1)\n\nSample Input 2\n\n2\n2 2\n\nSample Output 2\n\n-1\n\n2 cannot be inserted at the beginning of the sequence, so this is impossible.\n\nSample Input 3\n\n9\n1 1 1 2 2 1 2 3 2\n\nSample Output 3\n\n1\n2\n2\n3\n1\n2\n2\n1\n1", "sample_input": "3\n1 2 1\n"}, "reference_outputs": ["1\n1\n2\n"], "source_document_id": "p03089", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has an empty sequence a.\n\nHe will perform N operations on this sequence.\n\nIn the i-th operation, he chooses an integer j satisfying 1 \\leq j \\leq i, and insert j at position j in a (the beginning is position 1).\n\nYou are given a sequence b of length N. Determine if it is possible that a is equal to b after N operations. If it is, show one possible sequence of operations that achieves it.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq b_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nb_1 \\dots b_N\n\nOutput\n\nIf there is no sequence of N operations after which a would be equal to b, print -1.\nIf there is, print N lines. In the i-th line, the integer chosen in the i-th operation should be printed. If there are multiple solutions, any of them is accepted.\n\nSample Input 1\n\n3\n1 2 1\n\nSample Output 1\n\n1\n1\n2\n\nIn this sequence of operations, the sequence a changes as follows:\n\nAfter the first operation: (1)\n\nAfter the second operation: (1,1)\n\nAfter the third operation: (1,2,1)\n\nSample Input 2\n\n2\n2 2\n\nSample Output 2\n\n-1\n\n2 cannot be inserted at the beginning of the sequence, so this is impossible.\n\nSample Input 3\n\n9\n1 1 1 2 2 1 2 3 2\n\nSample Output 3\n\n1\n2\n2\n3\n1\n2\n2\n1\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 3864}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s489037968", "group_id": "codeNet:p03089", "input_text": "let rec dfs ans left bs s n =\n  if bs = [] && left = [] then Some ans\n  else if s > n then None\n  else\n    begin\n      match bs with\n      | [] -> Some ans\n      | b::bs -> \n         if b < s then None\n         else if b = s then \n           begin\n             match dfs (b::ans)\n                     [] (List.fold_left (fun acc l -> l::acc) bs left)\n                     1 (n - 1) with\n             | None -> dfs ans (b::left) bs (s + 1) n\n             | Some ans -> Some ans\n           end\n         else dfs ans (b::left) bs (s + 1) n\n    end\n\nlet _ =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let bs = Array.make n 0 in\n  for i = 0 to n - 1 do\n    Scanf.scanf (if i <> n - 1 then \"%d \" else \"%d\\n\") (fun b -> bs.(i) <- b)\n  done;\n  dfs [] [] (Array.to_list bs) 1 n \n  |> (function | None -> print_int (-1) \n               | Some ans -> List.iter (fun n -> print_endline @@ string_of_int n) ans)", "language": "OCaml", "metadata": {"date": 1553378980, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s489037968.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s489037968", "user_id": "u387591304"}, "prompt_components": {"gold_output": "1\n1\n2\n", "input_to_evaluate": "let rec dfs ans left bs s n =\n  if bs = [] && left = [] then Some ans\n  else if s > n then None\n  else\n    begin\n      match bs with\n      | [] -> Some ans\n      | b::bs -> \n         if b < s then None\n         else if b = s then \n           begin\n             match dfs (b::ans)\n                     [] (List.fold_left (fun acc l -> l::acc) bs left)\n                     1 (n - 1) with\n             | None -> dfs ans (b::left) bs (s + 1) n\n             | Some ans -> Some ans\n           end\n         else dfs ans (b::left) bs (s + 1) n\n    end\n\nlet _ =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let bs = Array.make n 0 in\n  for i = 0 to n - 1 do\n    Scanf.scanf (if i <> n - 1 then \"%d \" else \"%d\\n\") (fun b -> bs.(i) <- b)\n  done;\n  dfs [] [] (Array.to_list bs) 1 n \n  |> (function | None -> print_int (-1) \n               | Some ans -> List.iter (fun n -> print_endline @@ string_of_int n) ans)", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s196869610", "group_id": "codeNet:p03089", "input_text": "let rec select acc trace = function\n  | [] -> acc\n  | x :: xs -> select ((trace, x, xs) :: acc) (x :: trace) xs\nlet select xs = select [] [] xs\n\nlet rec solve acc = function\n  | [] -> acc\n  | bs ->\n      select bs\n      |> List.rev\n      |> List.mapi (fun i x -> i, x)\n      |> List.rev\n      |> List.find (fun (i, (hd, b, tl)) -> i + 1 = b)\n      |> (fun (_, (hd, b, tl)) -> solve (b :: acc) (List.rev_append hd tl))\nlet solve = solve []\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let bs = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun b -> b in\n  try List.iter (Printf.printf \"%d\\n\") @@ solve @@ Array.to_list bs\n  with Not_found -> print_endline \"-1\"\n\n", "language": "OCaml", "metadata": {"date": 1553376874, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s196869610.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s196869610", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n1\n2\n", "input_to_evaluate": "let rec select acc trace = function\n  | [] -> acc\n  | x :: xs -> select ((trace, x, xs) :: acc) (x :: trace) xs\nlet select xs = select [] [] xs\n\nlet rec solve acc = function\n  | [] -> acc\n  | bs ->\n      select bs\n      |> List.rev\n      |> List.mapi (fun i x -> i, x)\n      |> List.rev\n      |> List.find (fun (i, (hd, b, tl)) -> i + 1 = b)\n      |> (fun (_, (hd, b, tl)) -> solve (b :: acc) (List.rev_append hd tl))\nlet solve = solve []\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let bs = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun b -> b in\n  try List.iter (Printf.printf \"%d\\n\") @@ solve @@ Array.to_list bs\n  with Not_found -> print_endline \"-1\"\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has an empty sequence a.\n\nHe will perform N operations on this sequence.\n\nIn the i-th operation, he chooses an integer j satisfying 1 \\leq j \\leq i, and insert j at position j in a (the beginning is position 1).\n\nYou are given a sequence b of length N. Determine if it is possible that a is equal to b after N operations. If it is, show one possible sequence of operations that achieves it.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq b_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nb_1 \\dots b_N\n\nOutput\n\nIf there is no sequence of N operations after which a would be equal to b, print -1.\nIf there is, print N lines. In the i-th line, the integer chosen in the i-th operation should be printed. If there are multiple solutions, any of them is accepted.\n\nSample Input 1\n\n3\n1 2 1\n\nSample Output 1\n\n1\n1\n2\n\nIn this sequence of operations, the sequence a changes as follows:\n\nAfter the first operation: (1)\n\nAfter the second operation: (1,1)\n\nAfter the third operation: (1,2,1)\n\nSample Input 2\n\n2\n2 2\n\nSample Output 2\n\n-1\n\n2 cannot be inserted at the beginning of the sequence, so this is impossible.\n\nSample Input 3\n\n9\n1 1 1 2 2 1 2 3 2\n\nSample Output 3\n\n1\n2\n2\n3\n1\n2\n2\n1\n1", "sample_input": "3\n1 2 1\n"}, "reference_outputs": ["1\n1\n2\n"], "source_document_id": "p03089", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has an empty sequence a.\n\nHe will perform N operations on this sequence.\n\nIn the i-th operation, he chooses an integer j satisfying 1 \\leq j \\leq i, and insert j at position j in a (the beginning is position 1).\n\nYou are given a sequence b of length N. Determine if it is possible that a is equal to b after N operations. If it is, show one possible sequence of operations that achieves it.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq b_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nb_1 \\dots b_N\n\nOutput\n\nIf there is no sequence of N operations after which a would be equal to b, print -1.\nIf there is, print N lines. In the i-th line, the integer chosen in the i-th operation should be printed. If there are multiple solutions, any of them is accepted.\n\nSample Input 1\n\n3\n1 2 1\n\nSample Output 1\n\n1\n1\n2\n\nIn this sequence of operations, the sequence a changes as follows:\n\nAfter the first operation: (1)\n\nAfter the second operation: (1,1)\n\nAfter the third operation: (1,2,1)\n\nSample Input 2\n\n2\n2 2\n\nSample Output 2\n\n-1\n\n2 cannot be inserted at the beginning of the sequence, so this is impossible.\n\nSample Input 3\n\n9\n1 1 1 2 2 1 2 3 2\n\nSample Output 3\n\n1\n2\n2\n3\n1\n2\n2\n1\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 1408}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s943199140", "group_id": "codeNet:p03095", "input_text": "let n = read_int ()\nlet s = read_line ()\nlet m = 1_000_000_007\nlet cs = Array.make 128 0\nlet _ =\n  String.iter (fun c -> cs.(Char.code c) <- cs.(Char.code c) + 1) s;\n  Array.fold_left (fun ans c -> ans * (c + 1) mod m) 1 cs - 1 |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1561326495, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s943199140.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s943199140", "user_id": "u732304692"}, "prompt_components": {"gold_output": "15\n", "input_to_evaluate": "let n = read_int ()\nlet s = read_line ()\nlet m = 1_000_000_007\nlet cs = Array.make 128 0\nlet _ =\n  String.iter (fun c -> cs.(Char.code c) <- cs.(Char.code c) + 1) s;\n  Array.fold_left (fun ans c -> ans * (c + 1) mod m) 1 cs - 1 |> Printf.printf \"%d\\n\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N.\nAmong its subsequences, count the ones such that all characters are different, modulo 10^9+7. Two subsequences are considered different if their characters come from different positions in the string, even if they are the same as strings.\n\nHere, a subsequence of a string is a concatenation of one or more characters from the string without changing the order.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\nS consists of lowercase English letters.\n\n|S|=N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of the subsequences such that all characters are different, modulo 10^9+7.\n\nSample Input 1\n\n4\nabcd\n\nSample Output 1\n\n15\n\nSince all characters in S itself are different, all its subsequences satisfy the condition.\n\nSample Input 2\n\n3\nbaa\n\nSample Output 2\n\n5\n\nThe answer is five: b, two occurrences of a, two occurrences of ba. Note that we do not count baa, since it contains two as.\n\nSample Input 3\n\n5\nabcab\n\nSample Output 3\n\n17", "sample_input": "4\nabcd\n"}, "reference_outputs": ["15\n"], "source_document_id": "p03095", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N.\nAmong its subsequences, count the ones such that all characters are different, modulo 10^9+7. Two subsequences are considered different if their characters come from different positions in the string, even if they are the same as strings.\n\nHere, a subsequence of a string is a concatenation of one or more characters from the string without changing the order.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\nS consists of lowercase English letters.\n\n|S|=N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of the subsequences such that all characters are different, modulo 10^9+7.\n\nSample Input 1\n\n4\nabcd\n\nSample Output 1\n\n15\n\nSince all characters in S itself are different, all its subsequences satisfy the condition.\n\nSample Input 2\n\n3\nbaa\n\nSample Output 2\n\n5\n\nThe answer is five: b, two occurrences of a, two occurrences of ba. Note that we do not count baa, since it contains two as.\n\nSample Input 3\n\n5\nabcab\n\nSample Output 3\n\n17", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 251, "cpu_time_ms": 1, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s318697024", "group_id": "codeNet:p03102", "input_text": "let () = Scanf.scanf \"%d %d %d\" @@ fun n m c ->\n  let bs = Array.to_list @@ Array.init m @@ fun _ -> Scanf.scanf \" %d\" Fun.id in\n  let ass = Array.to_list @@ Array.init n @@ fun _ ->\n    Array.to_list @@ Array.init m @@ fun _ -> Scanf.scanf \" %d\" Fun.id in\n  let ans = List.length @@\n    List.filter (( < ) 0) @@\n    List.map (List.fold_left2 (fun acc b a -> acc + b * a) c bs) ass in\n  Printf.printf \"%d\\n\" ans", "language": "OCaml", "metadata": {"date": 1598727411, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s318697024.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s318697024", "user_id": "u052332717"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" @@ fun n m c ->\n  let bs = Array.to_list @@ Array.init m @@ fun _ -> Scanf.scanf \" %d\" Fun.id in\n  let ass = Array.to_list @@ Array.init n @@ fun _ ->\n    Array.to_list @@ Array.init m @@ fun _ -> Scanf.scanf \" %d\" Fun.id in\n  let ans = List.length @@\n    List.filter (( < ) 0) @@\n    List.map (List.fold_left2 (fun acc b a -> acc + b * a) c bs) ass in\n  Printf.printf \"%d\\n\" ans", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 411, "cpu_time_ms": 7, "memory_kb": 3972}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s249547168", "group_id": "codeNet:p03102", "input_text": "let n, m, c = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet bs = Array.init m @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet abss = Array.init n @@ fun _ -> Array.init m @@ fun i -> Scanf.scanf \" %d\" @@ fun a -> a * bs.(i)\nlet _ = Array.fold_left (fun ans ab_s -> ans + if Array.fold_left (+) c ab_s > 0 then 1 else 0) 0 abss |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1563572506, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s249547168.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s249547168", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let n, m, c = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet bs = Array.init m @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet abss = Array.init n @@ fun _ -> Array.init m @@ fun i -> Scanf.scanf \" %d\" @@ fun a -> a * bs.(i)\nlet _ = Array.fold_left (fun ans ab_s -> ans + if Array.fold_left (+) c ab_s > 0 then 1 else 0) 0 abss |> Printf.printf \"%d\\n\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}.\n\nAdditionally, you are given integers B_1, B_2, ..., B_M and C.\n\nThe i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0.\n\nAmong the N codes, find the number of codes that correctly solve this problem.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 20\n\n-100 \\leq A_{ij} \\leq 100\n\n-100 \\leq B_i \\leq 100\n\n-100 \\leq C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M C\nB_1 B_2 ... B_M\nA_{11} A_{12} ... A_{1M}\nA_{21} A_{22} ... A_{2M}\n\\vdots\nA_{N1} A_{N2} ... A_{NM}\n\nOutput\n\nPrint the number of codes among the given N codes that correctly solve this problem.\n\nSample Input 1\n\n2 3 -10\n1 2 3\n3 2 1\n1 2 2\n\nSample Output 1\n\n1\n\nOnly the second code correctly solves this problem, as follows:\n\nSince 3 \\times 1 + 2 \\times 2 + 1 \\times 3 + (-10) = 0 \\leq 0, the first code does not solve this problem.\n\n1 \\times 1 + 2 \\times 2 + 2 \\times 3 + (-10) = 1 > 0, the second code solves this problem.\n\nSample Input 2\n\n5 2 -4\n-2 5\n100 41\n100 40\n-3 0\n-6 -2\n18 -13\n\nSample Output 2\n\n2\n\nSample Input 3\n\n3 3 0\n100 -100 0\n0 100 100\n100 100 100\n-100 100 100\n\nSample Output 3\n\n0\n\nAll of them are Wrong Answer. Except yours.", "sample_input": "2 3 -10\n1 2 3\n3 2 1\n1 2 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03102", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}.\n\nAdditionally, you are given integers B_1, B_2, ..., B_M and C.\n\nThe i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0.\n\nAmong the N codes, find the number of codes that correctly solve this problem.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 20\n\n-100 \\leq A_{ij} \\leq 100\n\n-100 \\leq B_i \\leq 100\n\n-100 \\leq C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M C\nB_1 B_2 ... B_M\nA_{11} A_{12} ... A_{1M}\nA_{21} A_{22} ... A_{2M}\n\\vdots\nA_{N1} A_{N2} ... A_{NM}\n\nOutput\n\nPrint the number of codes among the given N codes that correctly solve this problem.\n\nSample Input 1\n\n2 3 -10\n1 2 3\n3 2 1\n1 2 2\n\nSample Output 1\n\n1\n\nOnly the second code correctly solves this problem, as follows:\n\nSince 3 \\times 1 + 2 \\times 2 + 1 \\times 3 + (-10) = 0 \\leq 0, the first code does not solve this problem.\n\n1 \\times 1 + 2 \\times 2 + 2 \\times 3 + (-10) = 1 > 0, the second code solves this problem.\n\nSample Input 2\n\n5 2 -4\n-2 5\n100 41\n100 40\n-3 0\n-6 -2\n18 -13\n\nSample Output 2\n\n2\n\nSample Input 3\n\n3 3 0\n100 -100 0\n0 100 100\n100 100 100\n-100 100 100\n\nSample Output 3\n\n0\n\nAll of them are Wrong Answer. Except yours.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s002329465", "group_id": "codeNet:p03106", "input_text": "(* O(min {a, b}) *)\nlet solve a b k =\n  let rec find acc n =\n    if acc >= k then\n      n + 1\n    else\n      find (if a mod n = 0 && b mod n = 0 then acc + 1 else acc) (n - 1)\n  in\n    find 0 (min a b)\n\nlet _ = Scanf.scanf \"%d %d %d\" (fun a b k -> solve a b k) |> string_of_int |> print_endline", "language": "OCaml", "metadata": {"date": 1557838622, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s002329465.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s002329465", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(* O(min {a, b}) *)\nlet solve a b k =\n  let rec find acc n =\n    if acc >= k then\n      n + 1\n    else\n      find (if a mod n = 0 && b mod n = 0 then acc + 1 else acc) (n - 1)\n  in\n    find 0 (min a b)\n\nlet _ = Scanf.scanf \"%d %d %d\" (fun a b k -> solve a b k) |> string_of_int |> print_endline", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 1\n\nSample Output 3\n\n1", "sample_input": "8 12 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03106", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 1\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 294, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s612262725", "group_id": "codeNet:p03108", "input_text": "(* 素集合データ構造 *)\nmodule UnionFind : sig\n  type t\n\n  (* 1要素だけを含む集合を作る *)\n  val make : unit -> t\n  (* 与えられた集合同士が同一かどうか判定する *)\n  val equal : t -> t -> bool\n  (* 与えられた集合同士を合併する *)\n  val unite : t -> t -> unit\n  (* 与えられた集合に属する要素の数を求める *)\n  val cardinal : t -> int\nend = struct\n  (* type t = node ref\n     and node = Either int t\n     みたいなのがやりたくて，OCamlの実行時表現はintとそれ以外を区別できるので\n     省メモリのためにこうしている *)\n  type t = Obj.t ref\n\n  let make () = ref (Obj.repr 1)\n\n  let rec find uf =\n    if Obj.is_int !uf\n    then uf\n    else begin\n      let root = find (Obj.magic !uf) in\n      uf := Obj.repr root; root\n    end\n\n  let equal uf uf' = find uf == find uf'\n\n  let unite uf uf' =\n    let root = find uf in\n    let root' = find uf' in\n    if root != root' then begin\n      let card : int = Obj.magic !root in\n      let card' : int = Obj.magic !root' in\n      let root, root' =\n        if card <= card'\n        then root, root'\n        else root', root in\n      root := Obj.repr (card + card');\n      root' := Obj.repr root\n    end\n\n  let cardinal uf = Obj.magic @@ ( ! ) @@ find uf\nend\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let abs = Array.init m @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun a b -> a - 1, b - 1 in\n  let uf = Array.init n @@ fun _ -> UnionFind.make () in\n  let ans = Array.make (m + 1) (n * (n - 1) / 2) in\n  for i = m - 1 downto 0 do\n    let (a, b) = abs.(i) in\n    ans.(i) <- ans.(i + 1) -\n      if UnionFind.equal uf.(a) uf.(b)\n      then 0\n      else begin\n        let n = UnionFind.cardinal uf.(a) in\n        let m = UnionFind.cardinal uf.(b) in\n        UnionFind.unite uf.(a) uf.(b); n * m\n      end\n  done;\n  for i = 1 to m do\n    Printf.printf \"%d\\n\" ans.(i)\n  done\n\n", "language": "OCaml", "metadata": {"date": 1589728818, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s612262725.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s612262725", "user_id": "u504158101"}, "prompt_components": {"gold_output": "0\n0\n4\n5\n6\n", "input_to_evaluate": "(* 素集合データ構造 *)\nmodule UnionFind : sig\n  type t\n\n  (* 1要素だけを含む集合を作る *)\n  val make : unit -> t\n  (* 与えられた集合同士が同一かどうか判定する *)\n  val equal : t -> t -> bool\n  (* 与えられた集合同士を合併する *)\n  val unite : t -> t -> unit\n  (* 与えられた集合に属する要素の数を求める *)\n  val cardinal : t -> int\nend = struct\n  (* type t = node ref\n     and node = Either int t\n     みたいなのがやりたくて，OCamlの実行時表現はintとそれ以外を区別できるので\n     省メモリのためにこうしている *)\n  type t = Obj.t ref\n\n  let make () = ref (Obj.repr 1)\n\n  let rec find uf =\n    if Obj.is_int !uf\n    then uf\n    else begin\n      let root = find (Obj.magic !uf) in\n      uf := Obj.repr root; root\n    end\n\n  let equal uf uf' = find uf == find uf'\n\n  let unite uf uf' =\n    let root = find uf in\n    let root' = find uf' in\n    if root != root' then begin\n      let card : int = Obj.magic !root in\n      let card' : int = Obj.magic !root' in\n      let root, root' =\n        if card <= card'\n        then root, root'\n        else root', root in\n      root := Obj.repr (card + card');\n      root' := Obj.repr root\n    end\n\n  let cardinal uf = Obj.magic @@ ( ! ) @@ find uf\nend\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let abs = Array.init m @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun a b -> a - 1, b - 1 in\n  let uf = Array.init n @@ fun _ -> UnionFind.make () in\n  let ans = Array.make (m + 1) (n * (n - 1) / 2) in\n  for i = m - 1 downto 0 do\n    let (a, b) = abs.(i) in\n    ans.(i) <- ans.(i + 1) -\n      if UnionFind.equal uf.(a) uf.(b)\n      then 0\n      else begin\n        let n = UnionFind.cardinal uf.(a) in\n        let m = UnionFind.cardinal uf.(b) in\n        UnionFind.unite uf.(a) uf.(b); n * m\n      end\n  done;\n  for i = 1 to m do\n    Printf.printf \"%d\\n\" ans.(i)\n  done\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N islands and M bridges.\n\nThe i-th bridge connects the A_i-th and B_i-th islands bidirectionally.\n\nInitially, we can travel between any two islands using some of these bridges.\n\nHowever, the results of a survey show that these bridges will all collapse because of aging, in the order from the first bridge to the M-th bridge.\n\nLet the inconvenience be the number of pairs of islands (a, b) (a < b) such that we are no longer able to travel between the a-th and b-th islands using some of the bridges remaining.\n\nFor each i (1 \\leq i \\leq M), find the inconvenience just after the i-th bridge collapses.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i < B_i \\leq N\n\nAll pairs (A_i, B_i) are distinct.\n\nThe inconvenience is initially 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_M B_M\n\nOutput\n\nIn the order i = 1, 2, ..., M, print the inconvenience just after the i-th bridge collapses.\nNote that the answer may not fit into a 32-bit integer type.\n\nSample Input 1\n\n4 5\n1 2\n3 4\n1 3\n2 3\n1 4\n\nSample Output 1\n\n0\n0\n4\n5\n6\n\nFor example, when the first to third bridges have collapsed, the inconvenience is 4 since we can no longer travel between the pairs (1, 2), (1, 3), (2, 4) and (3, 4).\n\nSample Input 2\n\n6 5\n2 3\n1 2\n5 6\n3 4\n4 5\n\nSample Output 2\n\n8\n9\n12\n14\n15\n\nSample Input 3\n\n2 1\n1 2\n\nSample Output 3\n\n1", "sample_input": "4 5\n1 2\n3 4\n1 3\n2 3\n1 4\n"}, "reference_outputs": ["0\n0\n4\n5\n6\n"], "source_document_id": "p03108", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N islands and M bridges.\n\nThe i-th bridge connects the A_i-th and B_i-th islands bidirectionally.\n\nInitially, we can travel between any two islands using some of these bridges.\n\nHowever, the results of a survey show that these bridges will all collapse because of aging, in the order from the first bridge to the M-th bridge.\n\nLet the inconvenience be the number of pairs of islands (a, b) (a < b) such that we are no longer able to travel between the a-th and b-th islands using some of the bridges remaining.\n\nFor each i (1 \\leq i \\leq M), find the inconvenience just after the i-th bridge collapses.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i < B_i \\leq N\n\nAll pairs (A_i, B_i) are distinct.\n\nThe inconvenience is initially 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_M B_M\n\nOutput\n\nIn the order i = 1, 2, ..., M, print the inconvenience just after the i-th bridge collapses.\nNote that the answer may not fit into a 32-bit integer type.\n\nSample Input 1\n\n4 5\n1 2\n3 4\n1 3\n2 3\n1 4\n\nSample Output 1\n\n0\n0\n4\n5\n6\n\nFor example, when the first to third bridges have collapsed, the inconvenience is 4 since we can no longer travel between the pairs (1, 2), (1, 3), (2, 4) and (3, 4).\n\nSample Input 2\n\n6 5\n2 3\n1 2\n5 6\n3 4\n4 5\n\nSample Output 2\n\n8\n9\n12\n14\n15\n\nSample Input 3\n\n2 1\n1 2\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1916, "cpu_time_ms": 95, "memory_kb": 10880}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s761625861", "group_id": "codeNet:p03108", "input_text": "module UnionFind : sig\n  type t\n  val make : int -> t\n  val find : t -> int -> int\n  val size : t -> int -> int\n  val unite : t -> int -> int -> unit\n  val is_same : t -> int -> int -> bool\nend = struct\n  type t = { rank: int array; parent: int array; size: int array }\n\n  let make n = \n    { rank = Array.make n 0; \n      parent = Array.init n (fun i -> i);\n      size = Array.make n 1 }\n\n  let rec find uf i = \n    if uf.parent.(i) = i then i\n    else begin\n      let j = find uf uf.parent.(i) in \n      uf.parent.(i) <- j; j\n    end\n  \n  let size uf i = uf.size.(find uf i)\n\n  let unite uf i j =\n    let x = find uf i in\n    let y = find uf j in\n    if x = y then ()\n    else if uf.rank.(x) < uf.rank.(y) then begin\n      uf.parent.(x) <- y;\n      uf.size.(y) <- uf.size.(y) + uf.size.(x)\n    end\n    else begin\n      uf.parent.(y) <- x;\n      uf.size.(x) <- uf.size.(x) + uf.size.(y);\n      if uf.rank.(x) = uf.rank.(y) then uf.rank.(x) <- uf.rank.(y) + 1\n    end\n\n  let is_same uf i j = find uf i = find uf j\nend\n\nlet (n, m) = Scanf.sscanf (read_line ()) \"%d %d\" @@ fun n m -> (n, m)\nlet ab = Array.init m @@ fun _ -> Scanf.sscanf (read_line ()) \"%d %d\" @@ fun a b -> (a - 1, b - 1)\n\nlet () =\n  let ans = Array.make (m + 1) 0 in\n  let uf = UnionFind.make n in\n  ans.(m) <- (n * (n - 1)) / 2;\n  for i = m - 1 downto 0 do\n    let (a, b) = ab.(i) in\n    if UnionFind.is_same uf a b then\n      ans.(i) <- ans.(i + 1)\n    else begin\n      ans.(i) <- ans.(i + 1) - (UnionFind.size uf a) * (UnionFind.size uf b);\n      UnionFind.unite uf a b;\n    end\n  done;\n  for i = 1 to m do\n    Printf.printf \"%d\\n\" ans.(i)\n  done", "language": "OCaml", "metadata": {"date": 1589486746, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s761625861.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s761625861", "user_id": "u811309788"}, "prompt_components": {"gold_output": "0\n0\n4\n5\n6\n", "input_to_evaluate": "module UnionFind : sig\n  type t\n  val make : int -> t\n  val find : t -> int -> int\n  val size : t -> int -> int\n  val unite : t -> int -> int -> unit\n  val is_same : t -> int -> int -> bool\nend = struct\n  type t = { rank: int array; parent: int array; size: int array }\n\n  let make n = \n    { rank = Array.make n 0; \n      parent = Array.init n (fun i -> i);\n      size = Array.make n 1 }\n\n  let rec find uf i = \n    if uf.parent.(i) = i then i\n    else begin\n      let j = find uf uf.parent.(i) in \n      uf.parent.(i) <- j; j\n    end\n  \n  let size uf i = uf.size.(find uf i)\n\n  let unite uf i j =\n    let x = find uf i in\n    let y = find uf j in\n    if x = y then ()\n    else if uf.rank.(x) < uf.rank.(y) then begin\n      uf.parent.(x) <- y;\n      uf.size.(y) <- uf.size.(y) + uf.size.(x)\n    end\n    else begin\n      uf.parent.(y) <- x;\n      uf.size.(x) <- uf.size.(x) + uf.size.(y);\n      if uf.rank.(x) = uf.rank.(y) then uf.rank.(x) <- uf.rank.(y) + 1\n    end\n\n  let is_same uf i j = find uf i = find uf j\nend\n\nlet (n, m) = Scanf.sscanf (read_line ()) \"%d %d\" @@ fun n m -> (n, m)\nlet ab = Array.init m @@ fun _ -> Scanf.sscanf (read_line ()) \"%d %d\" @@ fun a b -> (a - 1, b - 1)\n\nlet () =\n  let ans = Array.make (m + 1) 0 in\n  let uf = UnionFind.make n in\n  ans.(m) <- (n * (n - 1)) / 2;\n  for i = m - 1 downto 0 do\n    let (a, b) = ab.(i) in\n    if UnionFind.is_same uf a b then\n      ans.(i) <- ans.(i + 1)\n    else begin\n      ans.(i) <- ans.(i + 1) - (UnionFind.size uf a) * (UnionFind.size uf b);\n      UnionFind.unite uf a b;\n    end\n  done;\n  for i = 1 to m do\n    Printf.printf \"%d\\n\" ans.(i)\n  done", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1616, "cpu_time_ms": 99, "memory_kb": 11136}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s664863744", "group_id": "codeNet:p03108", "input_text": "(* O(m α(n)) *)\nlet n, m = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet ab_s = Array.init m @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> a - 1, b - 1\nlet ab_s = Array.init m (fun i -> ab_s.(m - 1 - i))\nlet ps = Array.make n @@ -1\nlet rec find x =\n  if ps.(x) < 0 then x\n  else let y = find ps.(x) in ps.(x) <- y; y\nlet unite x y =\n  let x = find x in\n  let y = find y in\n  if x = y then false\n  else\n    (if ps.(x) < ps.(y) then (ps.(x) <- ps.(x) + ps.(y); ps.(y) <- x)\n    else (ps.(y) <- ps.(y) + ps.(x); ps.(x) <- y);\n    true)\nlet size x = -ps.(find x)\nlet _ =\n  let f acc (a, b) =\n    let x, y = size a, size b in\n    (List.hd acc - if unite a b then x * y else 0) :: acc in\n  Array.sub ab_s 0 @@ m - 1 |> Array.fold_left f [n * (n - 1) / 2] |> List.iter @@ fun v -> Printf.printf \"%d\\n\" v", "language": "OCaml", "metadata": {"date": 1560783753, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s664863744.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s664863744", "user_id": "u732304692"}, "prompt_components": {"gold_output": "0\n0\n4\n5\n6\n", "input_to_evaluate": "(* O(m α(n)) *)\nlet n, m = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet ab_s = Array.init m @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> a - 1, b - 1\nlet ab_s = Array.init m (fun i -> ab_s.(m - 1 - i))\nlet ps = Array.make n @@ -1\nlet rec find x =\n  if ps.(x) < 0 then x\n  else let y = find ps.(x) in ps.(x) <- y; y\nlet unite x y =\n  let x = find x in\n  let y = find y in\n  if x = y then false\n  else\n    (if ps.(x) < ps.(y) then (ps.(x) <- ps.(x) + ps.(y); ps.(y) <- x)\n    else (ps.(y) <- ps.(y) + ps.(x); ps.(x) <- y);\n    true)\nlet size x = -ps.(find x)\nlet _ =\n  let f acc (a, b) =\n    let x, y = size a, size b in\n    (List.hd acc - if unite a b then x * y else 0) :: acc in\n  Array.sub ab_s 0 @@ m - 1 |> Array.fold_left f [n * (n - 1) / 2] |> List.iter @@ fun v -> Printf.printf \"%d\\n\" v", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 796, "cpu_time_ms": 87, "memory_kb": 12288}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s465897993", "group_id": "codeNet:p03108", "input_text": "(********* Myutil ************)\nlet rec range a b = if a >= b then [] else a::(range (a+1) b)\n\nlet rec qsort ls =\n  if ls = [] then []\n  else\n    let p, tl = (List.hd ls), (List.tl ls) in\n    let left = List.filter ((>=) p) tl in\n    let right = List.filter ((<) p) tl in\n    (qsort left) @ p::(qsort right)\n\nlet (>>=) x f =\n  match x with\n  | None -> None\n  | Some x -> f x\n\n(* TODO: グラフ理論関連の自作ライブラリを実装する\n   e.g. 強連結成分分解, graphの行列表現, graphの連結リスト表現, etc...\n *)\n\n\nmodule MyIO = struct\n  let rec str_of_list acc str_of =function\n    | [] -> acc\n    | x::[] -> (str_of x) ^ \"; \" ^ acc\n    | x::xs -> str_of_list ((str_of x) ^ \"; \" ^ acc) str_of xs\n\n  let str_of_list str_of ls = \"[\" ^ (str_of_list \"\" str_of (List.rev ls)) ^ \"]\"\n\n  let str_of_pair str_of (a, b) = \"(\" ^ (str_of a) ^ \", \" ^ (str_of b) ^ \")\"\n\n  let read_n_integers_fast n delim =\n    let rec inner ct acc =\n    if ct >= n then acc\n    else\n      let i = if ct = n-1 then Scanf.scanf \"%d\" (fun d -> d)\n              else Scanf.scanf (\"%d\" ^^ delim) (fun d -> d) in\n      inner (ct + 1) (i::acc)\n  in inner 0 []\n\n  let read_n_integers n delim = List.rev @@ read_n_integers_fast n delim\n\n  let read_bits () =\n    let rec inner acc =\n      try\n        let acc' = (Scanf.scanf \"%1d\" (fun i -> i::acc)) in\n        inner acc'\n      with e -> acc\n    in List.rev @@ inner []\nend\n\n(* O(log n) version of UnionFind *)\nmodule UnionFindInt : sig\n  type t_\n  type t = t_ array\n  val create   : int list -> t\n  val root_of  : t -> int -> int\n  val unite    : t -> int -> int -> unit\n  val is_same  : t -> int -> int -> bool\n  val grp_of   : t -> int -> int list\n  val len_of   : t -> int -> int\nend = struct\n  type t_ = {parent : int option; t : int; length: int}\n  type t = t_ array\n  let create ilist = \n    let a = Array.make (List.length ilist) {parent = None; t = 0; length = 1} in\n    let rec inner ct = function\n      | [] -> a\n      | l::ls -> a.(ct) <- {a.(ct) with t = l}; inner (ct + 1) ls\n    in inner 0 ilist\n  let root_of t i = \n    let rec inner acc i = \n      match t.(i).parent with\n      | None -> List.iter (fun j -> t.(j) <- {t.(j) with parent = Some i; length = t.(i).length}) acc; i\n      | Some i' -> inner (i::acc) i'\n    in inner [] i\n  let is_same t i1 i2 = \n    if i1 = i2 then true else let r1, r2 = root_of t i1, root_of t i2 in r1 = r2\n  let unite t i1 i2 =\n    if is_same t i1 i2 then () else \n      let r1, r2 = root_of t i1, root_of t i2 in \n      let l' = t.(r1).length + t.(r2).length in\n      t.(r2) <- { t.(r2) with parent = Some r1; length = l'};\n      t.(r1) <- { t.(r1) with length = l'}\n  let grp_of t i = Array.to_list t |> List.filter (fun j -> is_same t i j.t) |> List.map (fun j -> j.t)\n  let len_of t i = t.(i).length\nend\n(********* Myutil ************)\n\nlet calc uf islands a b =\n  let la, lb = UnionFindInt.len_of uf (UnionFindInt.root_of uf a), \n               UnionFindInt.len_of uf (UnionFindInt.root_of uf b) in\n  la * lb\n\nlet _ =\n  let n, m = Scanf.scanf \"%d %d\\n\" (fun n m -> (n, m)) in\n  let answer = Array.make (m + 1) (n * (n - 1) / 2) in\n  let bridge = Array.make m (0, 0) in\n  for i=0 to m - 1 do Scanf.scanf \"%d %d\\n\" (fun a b -> bridge.(i) <- (a-1, b-1)) done;\n  let islands = range 0 n in\n  let uf = UnionFindInt.create islands in\n  let buf = ref 0 in\n  for i = m - 1 downto 0 do\n    let a, b = bridge.(i) in\n    (if UnionFindInt.is_same uf a b then ()\n     else \n       begin\n         buf := !buf + (calc uf islands a b);\n         UnionFindInt.unite uf a b;\n       end);\n    answer.(i) <- answer.(i) - !buf\n  done;\n  for i = 1 to m do Printf.printf \"%d\\n\" answer.(i) done\n", "language": "OCaml", "metadata": {"date": 1552160667, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s465897993.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s465897993", "user_id": "u387591304"}, "prompt_components": {"gold_output": "0\n0\n4\n5\n6\n", "input_to_evaluate": "(********* Myutil ************)\nlet rec range a b = if a >= b then [] else a::(range (a+1) b)\n\nlet rec qsort ls =\n  if ls = [] then []\n  else\n    let p, tl = (List.hd ls), (List.tl ls) in\n    let left = List.filter ((>=) p) tl in\n    let right = List.filter ((<) p) tl in\n    (qsort left) @ p::(qsort right)\n\nlet (>>=) x f =\n  match x with\n  | None -> None\n  | Some x -> f x\n\n(* TODO: グラフ理論関連の自作ライブラリを実装する\n   e.g. 強連結成分分解, graphの行列表現, graphの連結リスト表現, etc...\n *)\n\n\nmodule MyIO = struct\n  let rec str_of_list acc str_of =function\n    | [] -> acc\n    | x::[] -> (str_of x) ^ \"; \" ^ acc\n    | x::xs -> str_of_list ((str_of x) ^ \"; \" ^ acc) str_of xs\n\n  let str_of_list str_of ls = \"[\" ^ (str_of_list \"\" str_of (List.rev ls)) ^ \"]\"\n\n  let str_of_pair str_of (a, b) = \"(\" ^ (str_of a) ^ \", \" ^ (str_of b) ^ \")\"\n\n  let read_n_integers_fast n delim =\n    let rec inner ct acc =\n    if ct >= n then acc\n    else\n      let i = if ct = n-1 then Scanf.scanf \"%d\" (fun d -> d)\n              else Scanf.scanf (\"%d\" ^^ delim) (fun d -> d) in\n      inner (ct + 1) (i::acc)\n  in inner 0 []\n\n  let read_n_integers n delim = List.rev @@ read_n_integers_fast n delim\n\n  let read_bits () =\n    let rec inner acc =\n      try\n        let acc' = (Scanf.scanf \"%1d\" (fun i -> i::acc)) in\n        inner acc'\n      with e -> acc\n    in List.rev @@ inner []\nend\n\n(* O(log n) version of UnionFind *)\nmodule UnionFindInt : sig\n  type t_\n  type t = t_ array\n  val create   : int list -> t\n  val root_of  : t -> int -> int\n  val unite    : t -> int -> int -> unit\n  val is_same  : t -> int -> int -> bool\n  val grp_of   : t -> int -> int list\n  val len_of   : t -> int -> int\nend = struct\n  type t_ = {parent : int option; t : int; length: int}\n  type t = t_ array\n  let create ilist = \n    let a = Array.make (List.length ilist) {parent = None; t = 0; length = 1} in\n    let rec inner ct = function\n      | [] -> a\n      | l::ls -> a.(ct) <- {a.(ct) with t = l}; inner (ct + 1) ls\n    in inner 0 ilist\n  let root_of t i = \n    let rec inner acc i = \n      match t.(i).parent with\n      | None -> List.iter (fun j -> t.(j) <- {t.(j) with parent = Some i; length = t.(i).length}) acc; i\n      | Some i' -> inner (i::acc) i'\n    in inner [] i\n  let is_same t i1 i2 = \n    if i1 = i2 then true else let r1, r2 = root_of t i1, root_of t i2 in r1 = r2\n  let unite t i1 i2 =\n    if is_same t i1 i2 then () else \n      let r1, r2 = root_of t i1, root_of t i2 in \n      let l' = t.(r1).length + t.(r2).length in\n      t.(r2) <- { t.(r2) with parent = Some r1; length = l'};\n      t.(r1) <- { t.(r1) with length = l'}\n  let grp_of t i = Array.to_list t |> List.filter (fun j -> is_same t i j.t) |> List.map (fun j -> j.t)\n  let len_of t i = t.(i).length\nend\n(********* Myutil ************)\n\nlet calc uf islands a b =\n  let la, lb = UnionFindInt.len_of uf (UnionFindInt.root_of uf a), \n               UnionFindInt.len_of uf (UnionFindInt.root_of uf b) in\n  la * lb\n\nlet _ =\n  let n, m = Scanf.scanf \"%d %d\\n\" (fun n m -> (n, m)) in\n  let answer = Array.make (m + 1) (n * (n - 1) / 2) in\n  let bridge = Array.make m (0, 0) in\n  for i=0 to m - 1 do Scanf.scanf \"%d %d\\n\" (fun a b -> bridge.(i) <- (a-1, b-1)) done;\n  let islands = range 0 n in\n  let uf = UnionFindInt.create islands in\n  let buf = ref 0 in\n  for i = m - 1 downto 0 do\n    let a, b = bridge.(i) in\n    (if UnionFindInt.is_same uf a b then ()\n     else \n       begin\n         buf := !buf + (calc uf islands a b);\n         UnionFindInt.unite uf a b;\n       end);\n    answer.(i) <- answer.(i) - !buf\n  done;\n  for i = 1 to m do Printf.printf \"%d\\n\" answer.(i) done\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N islands and M bridges.\n\nThe i-th bridge connects the A_i-th and B_i-th islands bidirectionally.\n\nInitially, we can travel between any two islands using some of these bridges.\n\nHowever, the results of a survey show that these bridges will all collapse because of aging, in the order from the first bridge to the M-th bridge.\n\nLet the inconvenience be the number of pairs of islands (a, b) (a < b) such that we are no longer able to travel between the a-th and b-th islands using some of the bridges remaining.\n\nFor each i (1 \\leq i \\leq M), find the inconvenience just after the i-th bridge collapses.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i < B_i \\leq N\n\nAll pairs (A_i, B_i) are distinct.\n\nThe inconvenience is initially 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_M B_M\n\nOutput\n\nIn the order i = 1, 2, ..., M, print the inconvenience just after the i-th bridge collapses.\nNote that the answer may not fit into a 32-bit integer type.\n\nSample Input 1\n\n4 5\n1 2\n3 4\n1 3\n2 3\n1 4\n\nSample Output 1\n\n0\n0\n4\n5\n6\n\nFor example, when the first to third bridges have collapsed, the inconvenience is 4 since we can no longer travel between the pairs (1, 2), (1, 3), (2, 4) and (3, 4).\n\nSample Input 2\n\n6 5\n2 3\n1 2\n5 6\n3 4\n4 5\n\nSample Output 2\n\n8\n9\n12\n14\n15\n\nSample Input 3\n\n2 1\n1 2\n\nSample Output 3\n\n1", "sample_input": "4 5\n1 2\n3 4\n1 3\n2 3\n1 4\n"}, "reference_outputs": ["0\n0\n4\n5\n6\n"], "source_document_id": "p03108", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N islands and M bridges.\n\nThe i-th bridge connects the A_i-th and B_i-th islands bidirectionally.\n\nInitially, we can travel between any two islands using some of these bridges.\n\nHowever, the results of a survey show that these bridges will all collapse because of aging, in the order from the first bridge to the M-th bridge.\n\nLet the inconvenience be the number of pairs of islands (a, b) (a < b) such that we are no longer able to travel between the a-th and b-th islands using some of the bridges remaining.\n\nFor each i (1 \\leq i \\leq M), find the inconvenience just after the i-th bridge collapses.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i < B_i \\leq N\n\nAll pairs (A_i, B_i) are distinct.\n\nThe inconvenience is initially 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_M B_M\n\nOutput\n\nIn the order i = 1, 2, ..., M, print the inconvenience just after the i-th bridge collapses.\nNote that the answer may not fit into a 32-bit integer type.\n\nSample Input 1\n\n4 5\n1 2\n3 4\n1 3\n2 3\n1 4\n\nSample Output 1\n\n0\n0\n4\n5\n6\n\nFor example, when the first to third bridges have collapsed, the inconvenience is 4 since we can no longer travel between the pairs (1, 2), (1, 3), (2, 4) and (3, 4).\n\nSample Input 2\n\n6 5\n2 3\n1 2\n5 6\n3 4\n4 5\n\nSample Output 2\n\n8\n9\n12\n14\n15\n\nSample Input 3\n\n2 1\n1 2\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3663, "cpu_time_ms": 160, "memory_kb": 26496}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s720548045", "group_id": "codeNet:p03108", "input_text": "(********* Myutil ************)\nlet rec range a b = if a >= b then [] else a::(range (a+1) b)\n\nlet rec qsort ls =\n  if ls = [] then []\n  else\n    let p, tl = (List.hd ls), (List.tl ls) in\n    let left = List.filter ((>=) p) tl in\n    let right = List.filter ((<) p) tl in\n    (qsort left) @ p::(qsort right)\n\nlet (>>=) x f =\n  match x with\n  | None -> None\n  | Some x -> f x\n\n(* TODO: グラフ理論関連の自作ライブラリを実装する\n   e.g. 強連結成分分解, graphの行列表現, graphの連結リスト表現, etc...\n *)\n\n\nmodule MyIO = struct\n  let rec str_of_list acc str_of =function\n    | [] -> acc\n    | x::[] -> (str_of x) ^ \"; \" ^ acc\n    | x::xs -> str_of_list ((str_of x) ^ \"; \" ^ acc) str_of xs\n\n  let str_of_list str_of ls = \"[\" ^ (str_of_list \"\" str_of (List.rev ls)) ^ \"]\"\n\n  let str_of_pair str_of (a, b) = \"(\" ^ (str_of a) ^ \", \" ^ (str_of b) ^ \")\"\n\n  let read_n_integers_fast n delim =\n    let rec inner ct acc =\n    if ct >= n then acc\n    else\n      let i = if ct = n-1 then Scanf.scanf \"%d\" (fun d -> d)\n              else Scanf.scanf (\"%d\" ^^ delim) (fun d -> d) in\n      inner (ct + 1) (i::acc)\n  in inner 0 []\n\n  let read_n_integers n delim = List.rev @@ read_n_integers_fast n delim\n\n  let read_bits () =\n    let rec inner acc =\n      try\n        let acc' = (Scanf.scanf \"%1d\" (fun i -> i::acc)) in\n        inner acc'\n      with e -> acc\n    in List.rev @@ inner []\nend\n\n(* O(log n) version of UnionFind *)\nmodule UnionFindInt : sig\n  type t_\n  type t = t_ array\n  val create   : int list -> t\n  val root_of  : t -> int -> int\n  val unite    : t -> int -> int -> unit\n  val is_same  : t -> int -> int -> bool\n  val grp_of   : t -> int -> int list\nend = struct\n  type t_ = {parent : int option; t : int}\n  type t = t_ array\n  let create ilist = \n    let a = Array.make (List.length ilist) {parent = None; t = 0} in\n    let rec inner ct = function\n      | [] -> a\n      | l::ls -> a.(ct) <- {a.(ct) with t = l}; inner (ct + 1) ls\n    in inner 0 ilist\n  let root_of t i = \n    let rec inner acc i = \n      match t.(i).parent with\n      | None -> List.iter (fun j -> t.(j) <- {t.(j) with parent = Some i}) acc; i\n      | Some i' -> inner (i::acc) i'\n    in inner [] i\n  let is_same t i1 i2 = \n    if i1 = i2 then true else let r1, r2 = root_of t i1, root_of t i2 in r1 = r2\n  let unite t i1 i2 =\n    if is_same t i1 i2 then () else let r1, r2 = root_of t i1, root_of t i2 in t.(r2) <- { t.(r2) with parent = Some r1}\n  let grp_of t i = Array.to_list t |> List.filter (fun j -> is_same t i j.t) |> List.map (fun j -> j.t)\nend\n(********* Myutil ************)\n\nlet count uf islands a b =\n  List.fold_left (fun (sizea, sizeb) l -> \n      if UnionFindInt.is_same uf a l then (sizea + 1, sizeb)\n      else if UnionFindInt.is_same uf b l then (sizea, sizeb + 1)\n      else (sizea, sizeb)\n    ) (0, 0) islands\n\nlet solve n edges =\n  let islands = range 0 n in\n  let uf = UnionFindInt.create islands in\n  List.map (fun (a, b) ->\n      if UnionFindInt.is_same uf a b then 0\n      else \n        let la, lb = count uf islands a b in\n        UnionFindInt.unite uf a b; la * lb\n    ) edges\n\nlet _ =\n  let n, m = Scanf.scanf \"%d %d\\n\" (fun n m -> (n, m)) in\n  let edges = ref [] in\n  for i=1 to m do\n    Scanf.scanf \"%d %d\\n\" (fun a b -> edges := ((a-1, b-1)::!edges));\n  done;\n  let anslist = solve n !edges |> List.rev in\n  ignore @@\n    List.fold_left (fun acc l -> Printf.printf \"%d\\n\" (acc + l); (acc + l)) 0 anslist\n", "language": "OCaml", "metadata": {"date": 1552155912, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s720548045.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s720548045", "user_id": "u387591304"}, "prompt_components": {"gold_output": "0\n0\n4\n5\n6\n", "input_to_evaluate": "(********* Myutil ************)\nlet rec range a b = if a >= b then [] else a::(range (a+1) b)\n\nlet rec qsort ls =\n  if ls = [] then []\n  else\n    let p, tl = (List.hd ls), (List.tl ls) in\n    let left = List.filter ((>=) p) tl in\n    let right = List.filter ((<) p) tl in\n    (qsort left) @ p::(qsort right)\n\nlet (>>=) x f =\n  match x with\n  | None -> None\n  | Some x -> f x\n\n(* TODO: グラフ理論関連の自作ライブラリを実装する\n   e.g. 強連結成分分解, graphの行列表現, graphの連結リスト表現, etc...\n *)\n\n\nmodule MyIO = struct\n  let rec str_of_list acc str_of =function\n    | [] -> acc\n    | x::[] -> (str_of x) ^ \"; \" ^ acc\n    | x::xs -> str_of_list ((str_of x) ^ \"; \" ^ acc) str_of xs\n\n  let str_of_list str_of ls = \"[\" ^ (str_of_list \"\" str_of (List.rev ls)) ^ \"]\"\n\n  let str_of_pair str_of (a, b) = \"(\" ^ (str_of a) ^ \", \" ^ (str_of b) ^ \")\"\n\n  let read_n_integers_fast n delim =\n    let rec inner ct acc =\n    if ct >= n then acc\n    else\n      let i = if ct = n-1 then Scanf.scanf \"%d\" (fun d -> d)\n              else Scanf.scanf (\"%d\" ^^ delim) (fun d -> d) in\n      inner (ct + 1) (i::acc)\n  in inner 0 []\n\n  let read_n_integers n delim = List.rev @@ read_n_integers_fast n delim\n\n  let read_bits () =\n    let rec inner acc =\n      try\n        let acc' = (Scanf.scanf \"%1d\" (fun i -> i::acc)) in\n        inner acc'\n      with e -> acc\n    in List.rev @@ inner []\nend\n\n(* O(log n) version of UnionFind *)\nmodule UnionFindInt : sig\n  type t_\n  type t = t_ array\n  val create   : int list -> t\n  val root_of  : t -> int -> int\n  val unite    : t -> int -> int -> unit\n  val is_same  : t -> int -> int -> bool\n  val grp_of   : t -> int -> int list\nend = struct\n  type t_ = {parent : int option; t : int}\n  type t = t_ array\n  let create ilist = \n    let a = Array.make (List.length ilist) {parent = None; t = 0} in\n    let rec inner ct = function\n      | [] -> a\n      | l::ls -> a.(ct) <- {a.(ct) with t = l}; inner (ct + 1) ls\n    in inner 0 ilist\n  let root_of t i = \n    let rec inner acc i = \n      match t.(i).parent with\n      | None -> List.iter (fun j -> t.(j) <- {t.(j) with parent = Some i}) acc; i\n      | Some i' -> inner (i::acc) i'\n    in inner [] i\n  let is_same t i1 i2 = \n    if i1 = i2 then true else let r1, r2 = root_of t i1, root_of t i2 in r1 = r2\n  let unite t i1 i2 =\n    if is_same t i1 i2 then () else let r1, r2 = root_of t i1, root_of t i2 in t.(r2) <- { t.(r2) with parent = Some r1}\n  let grp_of t i = Array.to_list t |> List.filter (fun j -> is_same t i j.t) |> List.map (fun j -> j.t)\nend\n(********* Myutil ************)\n\nlet count uf islands a b =\n  List.fold_left (fun (sizea, sizeb) l -> \n      if UnionFindInt.is_same uf a l then (sizea + 1, sizeb)\n      else if UnionFindInt.is_same uf b l then (sizea, sizeb + 1)\n      else (sizea, sizeb)\n    ) (0, 0) islands\n\nlet solve n edges =\n  let islands = range 0 n in\n  let uf = UnionFindInt.create islands in\n  List.map (fun (a, b) ->\n      if UnionFindInt.is_same uf a b then 0\n      else \n        let la, lb = count uf islands a b in\n        UnionFindInt.unite uf a b; la * lb\n    ) edges\n\nlet _ =\n  let n, m = Scanf.scanf \"%d %d\\n\" (fun n m -> (n, m)) in\n  let edges = ref [] in\n  for i=1 to m do\n    Scanf.scanf \"%d %d\\n\" (fun a b -> edges := ((a-1, b-1)::!edges));\n  done;\n  let anslist = solve n !edges |> List.rev in\n  ignore @@\n    List.fold_left (fun acc l -> Printf.printf \"%d\\n\" (acc + l); (acc + l)) 0 anslist\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N islands and M bridges.\n\nThe i-th bridge connects the A_i-th and B_i-th islands bidirectionally.\n\nInitially, we can travel between any two islands using some of these bridges.\n\nHowever, the results of a survey show that these bridges will all collapse because of aging, in the order from the first bridge to the M-th bridge.\n\nLet the inconvenience be the number of pairs of islands (a, b) (a < b) such that we are no longer able to travel between the a-th and b-th islands using some of the bridges remaining.\n\nFor each i (1 \\leq i \\leq M), find the inconvenience just after the i-th bridge collapses.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i < B_i \\leq N\n\nAll pairs (A_i, B_i) are distinct.\n\nThe inconvenience is initially 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_M B_M\n\nOutput\n\nIn the order i = 1, 2, ..., M, print the inconvenience just after the i-th bridge collapses.\nNote that the answer may not fit into a 32-bit integer type.\n\nSample Input 1\n\n4 5\n1 2\n3 4\n1 3\n2 3\n1 4\n\nSample Output 1\n\n0\n0\n4\n5\n6\n\nFor example, when the first to third bridges have collapsed, the inconvenience is 4 since we can no longer travel between the pairs (1, 2), (1, 3), (2, 4) and (3, 4).\n\nSample Input 2\n\n6 5\n2 3\n1 2\n5 6\n3 4\n4 5\n\nSample Output 2\n\n8\n9\n12\n14\n15\n\nSample Input 3\n\n2 1\n1 2\n\nSample Output 3\n\n1", "sample_input": "4 5\n1 2\n3 4\n1 3\n2 3\n1 4\n"}, "reference_outputs": ["0\n0\n4\n5\n6\n"], "source_document_id": "p03108", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N islands and M bridges.\n\nThe i-th bridge connects the A_i-th and B_i-th islands bidirectionally.\n\nInitially, we can travel between any two islands using some of these bridges.\n\nHowever, the results of a survey show that these bridges will all collapse because of aging, in the order from the first bridge to the M-th bridge.\n\nLet the inconvenience be the number of pairs of islands (a, b) (a < b) such that we are no longer able to travel between the a-th and b-th islands using some of the bridges remaining.\n\nFor each i (1 \\leq i \\leq M), find the inconvenience just after the i-th bridge collapses.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i < B_i \\leq N\n\nAll pairs (A_i, B_i) are distinct.\n\nThe inconvenience is initially 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_M B_M\n\nOutput\n\nIn the order i = 1, 2, ..., M, print the inconvenience just after the i-th bridge collapses.\nNote that the answer may not fit into a 32-bit integer type.\n\nSample Input 1\n\n4 5\n1 2\n3 4\n1 3\n2 3\n1 4\n\nSample Output 1\n\n0\n0\n4\n5\n6\n\nFor example, when the first to third bridges have collapsed, the inconvenience is 4 since we can no longer travel between the pairs (1, 2), (1, 3), (2, 4) and (3, 4).\n\nSample Input 2\n\n6 5\n2 3\n1 2\n5 6\n3 4\n4 5\n\nSample Output 2\n\n8\n9\n12\n14\n15\n\nSample Input 3\n\n2 1\n1 2\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3446, "cpu_time_ms": 2104, "memory_kb": 19860}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s634702353", "group_id": "codeNet:p03108", "input_text": "let rec find x uf =\n  if uf.(x) < 0 then x else \n  let x' = find uf.(x) uf in\n  uf.(x) <- x'; x'\nlet unite x y uf =\n  let x, y = find x uf,find y uf in\n  if x <> y then\n    if uf.(x) < uf.(y) then ((\n      uf.(x) <- uf.(x) + uf.(y);\n      uf.(y) <- x\n    )) else ((\n      uf.(y) <- uf.(x) + uf.(y);\n      uf.(x) <- y\n    ))\nlet () =\n  Scanf.scanf \"%d %d\" @@ fun n m ->\n  let es = Array.init m (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x-1, y-1)) in\n  let uf = Array.make n (-1) in\n  Array.fold_right (fun (x, y) (v, stk) -> \n    let x, y = find x uf, find y uf in\n    if x = y then (v, v::stk)\n    else ((\n      let xc, yc = uf.(x), uf.(y) in\n      unite x y uf;\n      (v - xc * yc, v::stk)\n    ))) es (n*(n-1)/2, [])\n  |> snd |> List.iter (Printf.printf \"%d\\n\")\n    \n", "language": "OCaml", "metadata": {"date": 1551645776, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s634702353.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s634702353", "user_id": "u798181098"}, "prompt_components": {"gold_output": "0\n0\n4\n5\n6\n", "input_to_evaluate": "let rec find x uf =\n  if uf.(x) < 0 then x else \n  let x' = find uf.(x) uf in\n  uf.(x) <- x'; x'\nlet unite x y uf =\n  let x, y = find x uf,find y uf in\n  if x <> y then\n    if uf.(x) < uf.(y) then ((\n      uf.(x) <- uf.(x) + uf.(y);\n      uf.(y) <- x\n    )) else ((\n      uf.(y) <- uf.(x) + uf.(y);\n      uf.(x) <- y\n    ))\nlet () =\n  Scanf.scanf \"%d %d\" @@ fun n m ->\n  let es = Array.init m (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x-1, y-1)) in\n  let uf = Array.make n (-1) in\n  Array.fold_right (fun (x, y) (v, stk) -> \n    let x, y = find x uf, find y uf in\n    if x = y then (v, v::stk)\n    else ((\n      let xc, yc = uf.(x), uf.(y) in\n      unite x y uf;\n      (v - xc * yc, v::stk)\n    ))) es (n*(n-1)/2, [])\n  |> snd |> List.iter (Printf.printf \"%d\\n\")\n    \n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N islands and M bridges.\n\nThe i-th bridge connects the A_i-th and B_i-th islands bidirectionally.\n\nInitially, we can travel between any two islands using some of these bridges.\n\nHowever, the results of a survey show that these bridges will all collapse because of aging, in the order from the first bridge to the M-th bridge.\n\nLet the inconvenience be the number of pairs of islands (a, b) (a < b) such that we are no longer able to travel between the a-th and b-th islands using some of the bridges remaining.\n\nFor each i (1 \\leq i \\leq M), find the inconvenience just after the i-th bridge collapses.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i < B_i \\leq N\n\nAll pairs (A_i, B_i) are distinct.\n\nThe inconvenience is initially 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_M B_M\n\nOutput\n\nIn the order i = 1, 2, ..., M, print the inconvenience just after the i-th bridge collapses.\nNote that the answer may not fit into a 32-bit integer type.\n\nSample Input 1\n\n4 5\n1 2\n3 4\n1 3\n2 3\n1 4\n\nSample Output 1\n\n0\n0\n4\n5\n6\n\nFor example, when the first to third bridges have collapsed, the inconvenience is 4 since we can no longer travel between the pairs (1, 2), (1, 3), (2, 4) and (3, 4).\n\nSample Input 2\n\n6 5\n2 3\n1 2\n5 6\n3 4\n4 5\n\nSample Output 2\n\n8\n9\n12\n14\n15\n\nSample Input 3\n\n2 1\n1 2\n\nSample Output 3\n\n1", "sample_input": "4 5\n1 2\n3 4\n1 3\n2 3\n1 4\n"}, "reference_outputs": ["0\n0\n4\n5\n6\n"], "source_document_id": "p03108", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N islands and M bridges.\n\nThe i-th bridge connects the A_i-th and B_i-th islands bidirectionally.\n\nInitially, we can travel between any two islands using some of these bridges.\n\nHowever, the results of a survey show that these bridges will all collapse because of aging, in the order from the first bridge to the M-th bridge.\n\nLet the inconvenience be the number of pairs of islands (a, b) (a < b) such that we are no longer able to travel between the a-th and b-th islands using some of the bridges remaining.\n\nFor each i (1 \\leq i \\leq M), find the inconvenience just after the i-th bridge collapses.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i < B_i \\leq N\n\nAll pairs (A_i, B_i) are distinct.\n\nThe inconvenience is initially 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\nA_2 B_2\n\\vdots\nA_M B_M\n\nOutput\n\nIn the order i = 1, 2, ..., M, print the inconvenience just after the i-th bridge collapses.\nNote that the answer may not fit into a 32-bit integer type.\n\nSample Input 1\n\n4 5\n1 2\n3 4\n1 3\n2 3\n1 4\n\nSample Output 1\n\n0\n0\n4\n5\n6\n\nFor example, when the first to third bridges have collapsed, the inconvenience is 4 since we can no longer travel between the pairs (1, 2), (1, 3), (2, 4) and (3, 4).\n\nSample Input 2\n\n6 5\n2 3\n1 2\n5 6\n3 4\n4 5\n\nSample Output 2\n\n8\n9\n12\n14\n15\n\nSample Input 3\n\n2 1\n1 2\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 769, "cpu_time_ms": 84, "memory_kb": 10624}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s996904099", "group_id": "codeNet:p03109", "input_text": "let _ = Scanf.scanf \" %s\" @@ fun s ->\n    print_endline @@ if String.sub s 5 2 < \"05\" then \"Heisei\" else \"TBD\"", "language": "OCaml", "metadata": {"date": 1558105046, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s996904099.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s996904099", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Heisei\n", "input_to_evaluate": "let _ = Scanf.scanf \" %s\" @@ fun s ->\n    print_endline @@ if String.sub s 5 2 < \"05\" then \"Heisei\" else \"TBD\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S as input. This represents a valid date in the year 2019 in the yyyy/mm/dd format. (For example, April 30, 2019 is represented as 2019/04/30.)\n\nWrite a program that prints Heisei if the date represented by S is not later than April 30, 2019, and prints TBD otherwise.\n\nConstraints\n\nS is a string that represents a valid date in the year 2019 in the yyyy/mm/dd format.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Heisei if the date represented by S is not later than April 30, 2019, and print TBD otherwise.\n\nSample Input 1\n\n2019/04/30\n\nSample Output 1\n\nHeisei\n\nSample Input 2\n\n2019/11/01\n\nSample Output 2\n\nTBD", "sample_input": "2019/04/30\n"}, "reference_outputs": ["Heisei\n"], "source_document_id": "p03109", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S as input. This represents a valid date in the year 2019 in the yyyy/mm/dd format. (For example, April 30, 2019 is represented as 2019/04/30.)\n\nWrite a program that prints Heisei if the date represented by S is not later than April 30, 2019, and prints TBD otherwise.\n\nConstraints\n\nS is a string that represents a valid date in the year 2019 in the yyyy/mm/dd format.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Heisei if the date represented by S is not later than April 30, 2019, and print TBD otherwise.\n\nSample Input 1\n\n2019/04/30\n\nSample Output 1\n\nHeisei\n\nSample Input 2\n\n2019/11/01\n\nSample Output 2\n\nTBD", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 110, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s487388516", "group_id": "codeNet:p03109", "input_text": "let () = Scanf.scanf \"%d/%d/%d\" @@ fun y m d ->\n    print_endline @@\n        if y > 2019 || m > 4\n        then \"TBD\"\n        else \"Heisei\"", "language": "OCaml", "metadata": {"date": 1551038590, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s487388516.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s487388516", "user_id": "u604818425"}, "prompt_components": {"gold_output": "Heisei\n", "input_to_evaluate": "let () = Scanf.scanf \"%d/%d/%d\" @@ fun y m d ->\n    print_endline @@\n        if y > 2019 || m > 4\n        then \"TBD\"\n        else \"Heisei\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S as input. This represents a valid date in the year 2019 in the yyyy/mm/dd format. (For example, April 30, 2019 is represented as 2019/04/30.)\n\nWrite a program that prints Heisei if the date represented by S is not later than April 30, 2019, and prints TBD otherwise.\n\nConstraints\n\nS is a string that represents a valid date in the year 2019 in the yyyy/mm/dd format.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Heisei if the date represented by S is not later than April 30, 2019, and print TBD otherwise.\n\nSample Input 1\n\n2019/04/30\n\nSample Output 1\n\nHeisei\n\nSample Input 2\n\n2019/11/01\n\nSample Output 2\n\nTBD", "sample_input": "2019/04/30\n"}, "reference_outputs": ["Heisei\n"], "source_document_id": "p03109", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S as input. This represents a valid date in the year 2019 in the yyyy/mm/dd format. (For example, April 30, 2019 is represented as 2019/04/30.)\n\nWrite a program that prints Heisei if the date represented by S is not later than April 30, 2019, and prints TBD otherwise.\n\nConstraints\n\nS is a string that represents a valid date in the year 2019 in the yyyy/mm/dd format.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Heisei if the date represented by S is not later than April 30, 2019, and print TBD otherwise.\n\nSample Input 1\n\n2019/04/30\n\nSample Output 1\n\nHeisei\n\nSample Input 2\n\n2019/11/01\n\nSample Output 2\n\nTBD", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 138, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s091332689", "group_id": "codeNet:p03111", "input_text": "Scanf.scanf \"%d %d %d %d\" (fun n a b c ->\n    let l = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun l -> l)) in\n\n    let arr = Array.make 4 0 in\n\n    let calc_cost cost arr =\n        let enl k q =\n            if k = 0 then 100000 else abs (k - q)\n        in\n        cost + (enl arr.(0) a) + (enl arr.(1) b) + (enl arr.(2) c)\n    in\n\n    let rec loop i c cost min_cost =\n        if i = n then min min_cost (calc_cost cost arr) else\n            if c = 4 then min_cost else (\n                arr.(c) <- arr.(c) + l.(i);\n                let newcost = if c = 3 || arr.(c) = l.(i) then cost else cost + 10 in\n                let mi = loop (i + 1) 0 newcost min_cost in\n                arr.(c) <- arr.(c) - l.(i);\n                loop i (c + 1) cost mi\n            )\n    in\n    loop 0 0 0 max_int |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1591735467, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s091332689.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s091332689", "user_id": "u342443598"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d %d\" (fun n a b c ->\n    let l = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun l -> l)) in\n\n    let arr = Array.make 4 0 in\n\n    let calc_cost cost arr =\n        let enl k q =\n            if k = 0 then 100000 else abs (k - q)\n        in\n        cost + (enl arr.(0) a) + (enl arr.(1) b) + (enl arr.(2) c)\n    in\n\n    let rec loop i c cost min_cost =\n        if i = n then min min_cost (calc_cost cost arr) else\n            if c = 4 then min_cost else (\n                arr.(c) <- arr.(c) + l.(i);\n                let newcost = if c = 3 || arr.(c) = l.(i) then cost else cost + 10 in\n                let mi = loop (i + 1) 0 newcost min_cost in\n                arr.(c) <- arr.(c) - l.(i);\n                loop i (c + 1) cost mi\n            )\n    in\n    loop 0 0 0 max_int |> Printf.printf \"%d\\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 815, "cpu_time_ms": 3, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s784813050", "group_id": "codeNet:p03111", "input_text": "open Scanf\nopen Printf\n\nlet (n,a,b,c) = sscanf (read_line ()) \"%d %d %d %d\" (fun n a b c -> (n,a,b,c))\nlet list = \nlet rec input_list n l =\nmatch n with \n  0 -> l\n| x -> input_list (x-1) (sscanf (read_line ()) \"%d\" (fun x -> x):: l)\nin input_list n [];;\n\nlet ans = ref 3000;;\n\nlet rec loop a_in b_in c_in mp l =\nmatch l with\n  [] -> \n  if (a_in * b_in * c_in = 0) then 3000\n  else \n  let tmp = abs(a - a_in) + abs(b - b_in) + abs(c - c_in) + mp - 30 in\n  let _ = ans := min !ans tmp in\n  (*let _ = printf \"%d %d %d\\n\" a_in b_in c_in in\n  let _ = printf \"tmp = %d\\n\" tmp in*)\n  tmp\n  | x::rest -> \n  let a_use = loop (a_in + x) b_in c_in (mp+10) rest in\n  let b_use = loop a_in (b_in + x) c_in (mp+10) rest in\n  let c_use = loop a_in b_in (c_in + x) (mp+10) rest in\n  loop a_in b_in c_in mp rest;;\n\nlet _ = loop 0 0 0 0 list in printf (\"%d\\n\") !ans;;\n", "language": "OCaml", "metadata": {"date": 1563458132, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s784813050.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s784813050", "user_id": "u947517859"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet (n,a,b,c) = sscanf (read_line ()) \"%d %d %d %d\" (fun n a b c -> (n,a,b,c))\nlet list = \nlet rec input_list n l =\nmatch n with \n  0 -> l\n| x -> input_list (x-1) (sscanf (read_line ()) \"%d\" (fun x -> x):: l)\nin input_list n [];;\n\nlet ans = ref 3000;;\n\nlet rec loop a_in b_in c_in mp l =\nmatch l with\n  [] -> \n  if (a_in * b_in * c_in = 0) then 3000\n  else \n  let tmp = abs(a - a_in) + abs(b - b_in) + abs(c - c_in) + mp - 30 in\n  let _ = ans := min !ans tmp in\n  (*let _ = printf \"%d %d %d\\n\" a_in b_in c_in in\n  let _ = printf \"tmp = %d\\n\" tmp in*)\n  tmp\n  | x::rest -> \n  let a_use = loop (a_in + x) b_in c_in (mp+10) rest in\n  let b_use = loop a_in (b_in + x) c_in (mp+10) rest in\n  let c_use = loop a_in b_in (c_in + x) (mp+10) rest in\n  loop a_in b_in c_in mp rest;;\n\nlet _ = loop 0 0 0 0 list in printf (\"%d\\n\") !ans;;\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 850, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s994658320", "group_id": "codeNet:p03112", "input_text": "(*\n * forall l r (p : forall n, l < n <= r -> bool),\n *   ( exists m,\n *     l < m <= r /\\ forall n H, p n H = true <-> m <= n ) ->\n *   { m |\n *     l < m <= r /\\ forall n H, p n H = true <-> m <= n }\n *)\nlet rec lower_bound l r p =\n  if r <= 1 + l\n  then r\n  else let m = (l + r) / 2 in\n       if p m\n       then lower_bound l m p\n       else lower_bound m r p\n\n(*\n * forall l r (p : forall n, l <= n < r -> bool),\n *   ( exists m,\n *     l <= m < r /\\ forall n H, p n H = true <-> n <= m ) ->\n *   { m |\n *     l <= m < r /\\ forall n H, p n H = true <-> n <= m }\n *)\nlet rec upper_bound l r p =\n  if r <= 1 + l\n  then l\n  else let m = (l + r) / 2 in\n       if p m\n       then upper_bound m r p\n       else upper_bound l m p\n\nlet () = Scanf.scanf \"%d %d %d\\n\" @@ fun a b q ->\n  let ss = Array.make (a + 2) 0 in\n  let ts = Array.make (b + 2) 0 in\n  ss.(0) <- -123456789012345;\n  ss.(a + 1) <- 123456789012345;\n  for i = 1 to a do\n    Scanf.scanf \"%d\\n\" @@ Array.set ss i\n  done;\n  ts.(0) <- -123456789012345;\n  ts.(b + 1) <- 123456789012345;\n  for i = 1 to b do\n    Scanf.scanf \"%d\\n\" @@ Array.set ts i\n  done;\n  for i = 1 to q do\n    Scanf.scanf \"%d\\n\" @@ fun x ->\n      let ls = upper_bound 0 (a + 2) @@ fun i -> ss.(i) <= x in\n      let rs = lower_bound (-1) (a + 1) @@ fun i -> x <= ss.(i) in\n      let lt = upper_bound 0 (b + 2) @@ fun i -> ts.(i) <= x in\n      let rt = lower_bound (-1) (b + 1) @@ fun i -> x <= ts.(i) in\n      Printf.printf \"%d\\n\" @@ List.fold_left min max_int\n      [ x - min ss.(ls) ts.(lt);\n        max ss.(rs) ts.(rt) - x;\n        2 * min ss.(rs) ts.(rt) - x - max ts.(lt) ss.(ls);\n        x - 2 * max ts.(lt) ss.(ls) + min ss.(rs) ts.(rt) ]\n  done", "language": "OCaml", "metadata": {"date": 1551045966, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s994658320.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s994658320", "user_id": "u504158101"}, "prompt_components": {"gold_output": "350\n1400\n301\n399\n", "input_to_evaluate": "(*\n * forall l r (p : forall n, l < n <= r -> bool),\n *   ( exists m,\n *     l < m <= r /\\ forall n H, p n H = true <-> m <= n ) ->\n *   { m |\n *     l < m <= r /\\ forall n H, p n H = true <-> m <= n }\n *)\nlet rec lower_bound l r p =\n  if r <= 1 + l\n  then r\n  else let m = (l + r) / 2 in\n       if p m\n       then lower_bound l m p\n       else lower_bound m r p\n\n(*\n * forall l r (p : forall n, l <= n < r -> bool),\n *   ( exists m,\n *     l <= m < r /\\ forall n H, p n H = true <-> n <= m ) ->\n *   { m |\n *     l <= m < r /\\ forall n H, p n H = true <-> n <= m }\n *)\nlet rec upper_bound l r p =\n  if r <= 1 + l\n  then l\n  else let m = (l + r) / 2 in\n       if p m\n       then upper_bound m r p\n       else upper_bound l m p\n\nlet () = Scanf.scanf \"%d %d %d\\n\" @@ fun a b q ->\n  let ss = Array.make (a + 2) 0 in\n  let ts = Array.make (b + 2) 0 in\n  ss.(0) <- -123456789012345;\n  ss.(a + 1) <- 123456789012345;\n  for i = 1 to a do\n    Scanf.scanf \"%d\\n\" @@ Array.set ss i\n  done;\n  ts.(0) <- -123456789012345;\n  ts.(b + 1) <- 123456789012345;\n  for i = 1 to b do\n    Scanf.scanf \"%d\\n\" @@ Array.set ts i\n  done;\n  for i = 1 to q do\n    Scanf.scanf \"%d\\n\" @@ fun x ->\n      let ls = upper_bound 0 (a + 2) @@ fun i -> ss.(i) <= x in\n      let rs = lower_bound (-1) (a + 1) @@ fun i -> x <= ss.(i) in\n      let lt = upper_bound 0 (b + 2) @@ fun i -> ts.(i) <= x in\n      let rt = lower_bound (-1) (b + 1) @@ fun i -> x <= ts.(i) in\n      Printf.printf \"%d\\n\" @@ List.fold_left min max_int\n      [ x - min ss.(ls) ts.(lt);\n        max ss.(rs) ts.(rt) - x;\n        2 * min ss.(rs) ts.(rt) - x - max ts.(lt) ss.(ls);\n        x - 2 * max ts.(lt) ss.(ls) + min ss.(rs) ts.(rt) ]\n  done", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1677, "cpu_time_ms": 208, "memory_kb": 6272}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s968666727", "group_id": "codeNet:p03125", "input_text": "let () = Scanf.scanf \"%d %d\" @@ fun a b ->\n  Printf.printf \"%d\\n\" @@ if b mod a = 0 then a + b else b - a\n", "language": "OCaml", "metadata": {"date": 1550405394, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s968666727.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s968666727", "user_id": "u504158101"}, "prompt_components": {"gold_output": "16\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\" @@ fun a b ->\n  Printf.printf \"%d\\n\" @@ if b mod a = 0 then a + b else b - a\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nIf A is a divisor of B, print A + B; otherwise, print B - A.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf A is a divisor of B, print A + B; otherwise, print B - A.\n\nSample Input 1\n\n4 12\n\nSample Output 1\n\n16\n\nAs 4 is a divisor of 12, 4 + 12 = 16 should be printed.\n\nSample Input 2\n\n8 20\n\nSample Output 2\n\n12\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n2\n\n1 is a divisor of 1.", "sample_input": "4 12\n"}, "reference_outputs": ["16\n"], "source_document_id": "p03125", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nIf A is a divisor of B, print A + B; otherwise, print B - A.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 20\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf A is a divisor of B, print A + B; otherwise, print B - A.\n\nSample Input 1\n\n4 12\n\nSample Output 1\n\n16\n\nAs 4 is a divisor of 12, 4 + 12 = 16 should be printed.\n\nSample Input 2\n\n8 20\n\nSample Output 2\n\n12\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n2\n\n1 is a divisor of 1.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 106, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s345798814", "group_id": "codeNet:p03127", "input_text": "open Printf\nopen Scanf\n\nlet read_int _ = scanf \" %d \" (fun x -> x)\n\nlet rec gcd a b = if b = 0 then a else gcd b (a mod b)\n\nlet () =\n  let n = read_int () in\n  let x::xs = Array.init n read_int |> Array.to_list in\n  let res = List.fold_left (fun a v -> gcd a v) x xs in\n  printf \"%d\\n\" res\n", "language": "OCaml", "metadata": {"date": 1559870883, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s345798814.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s345798814", "user_id": "u806601169"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet read_int _ = scanf \" %d \" (fun x -> x)\n\nlet rec gcd a b = if b = 0 then a else gcd b (a mod b)\n\nlet () =\n  let n = read_int () in\n  let x::xs = Array.init n read_int |> Array.to_list in\n  let res = List.fold_left (fun a v -> gcd a v) x xs in\n  printf \"%d\\n\" res\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N monsters, numbered 1, 2, ..., N.\n\nInitially, the health of Monster i is A_i.\n\nBelow, a monster with at least 1 health is called alive.\n\nUntil there is only one alive monster, the following is repeated:\n\nA random alive monster attacks another random alive monster.\n\nAs a result, the health of the monster attacked is reduced by the amount equal to the current health of the monster attacking.\n\nFind the minimum possible final health of the last monster alive.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible final health of the last monster alive.\n\nSample Input 1\n\n4\n2 10 8 40\n\nSample Output 1\n\n2\n\nWhen only the first monster keeps on attacking, the final health of the last monster will be 2, which is minimum.\n\nSample Input 2\n\n4\n5 13 8 1000000000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n3\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n1000000000", "sample_input": "4\n2 10 8 40\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03127", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N monsters, numbered 1, 2, ..., N.\n\nInitially, the health of Monster i is A_i.\n\nBelow, a monster with at least 1 health is called alive.\n\nUntil there is only one alive monster, the following is repeated:\n\nA random alive monster attacks another random alive monster.\n\nAs a result, the health of the monster attacked is reduced by the amount equal to the current health of the monster attacking.\n\nFind the minimum possible final health of the last monster alive.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible final health of the last monster alive.\n\nSample Input 1\n\n4\n2 10 8 40\n\nSample Output 1\n\n2\n\nWhen only the first monster keeps on attacking, the final health of the last monster will be 2, which is minimum.\n\nSample Input 2\n\n4\n5 13 8 1000000000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n3\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n1000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 290, "cpu_time_ms": 38, "memory_kb": 6272}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s615794422", "group_id": "codeNet:p03127", "input_text": "let rec gcd n m =\n  if m = 0 then n\n  else gcd m (n mod m)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  Printf.printf \"%d\\n\" @@ Array.fold_left gcd 0 as_\n", "language": "OCaml", "metadata": {"date": 1550370243, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s615794422.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s615794422", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let rec gcd n m =\n  if m = 0 then n\n  else gcd m (n mod m)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  Printf.printf \"%d\\n\" @@ Array.fold_left gcd 0 as_\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N monsters, numbered 1, 2, ..., N.\n\nInitially, the health of Monster i is A_i.\n\nBelow, a monster with at least 1 health is called alive.\n\nUntil there is only one alive monster, the following is repeated:\n\nA random alive monster attacks another random alive monster.\n\nAs a result, the health of the monster attacked is reduced by the amount equal to the current health of the monster attacking.\n\nFind the minimum possible final health of the last monster alive.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible final health of the last monster alive.\n\nSample Input 1\n\n4\n2 10 8 40\n\nSample Output 1\n\n2\n\nWhen only the first monster keeps on attacking, the final health of the last monster will be 2, which is minimum.\n\nSample Input 2\n\n4\n5 13 8 1000000000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n3\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n1000000000", "sample_input": "4\n2 10 8 40\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03127", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N monsters, numbered 1, 2, ..., N.\n\nInitially, the health of Monster i is A_i.\n\nBelow, a monster with at least 1 health is called alive.\n\nUntil there is only one alive monster, the following is repeated:\n\nA random alive monster attacks another random alive monster.\n\nAs a result, the health of the monster attacked is reduced by the amount equal to the current health of the monster attacking.\n\nFind the minimum possible final health of the last monster alive.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible final health of the last monster alive.\n\nSample Input 1\n\n4\n2 10 8 40\n\nSample Output 1\n\n2\n\nWhen only the first monster keeps on attacking, the final health of the last monster will be 2, which is minimum.\n\nSample Input 2\n\n4\n5 13 8 1000000000\n\nSample Output 2\n\n1\n\nSample Input 3\n\n3\n1000000000 1000000000 1000000000\n\nSample Output 3\n\n1000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 224, "cpu_time_ms": 34, "memory_kb": 4736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s507392929", "group_id": "codeNet:p03128", "input_text": "let rec seq a b = if a > b then [] else a :: seq (a+1) b\nlet (>>=) x f = List.map f x |> List.concat\n\nlet len = 50\nlet costs = [|0;2;5;5;4;5;6;3;7;6|]\n\nlet cmp xs ys =\n  let lx = List.fold_left (fun s (x, i) -> s+i) 0 xs in\n  let ly = List.fold_left (fun s (y, i) -> s+i) 0 ys in\n  if lx <> ly then lx - ly\n  else\n  let rec f xs ys =\n    match xs, ys with\n    | [], [] -> 0\n    | _::_, [] -> -1\n    | [], _::_ -> 1\n    | ((x,i)::xs), ((y,j)::ys) ->\n        if x <> y then x - y\n        else if i <> j then i - j\n        else f xs ys\n  in f xs ys\n\nlet () =\n  Scanf.scanf \"%d %d\" @@ fun n m ->\n  let a = Array.init m (fun _ ->\n    Scanf.scanf \" %d\" (fun x -> (costs.(x), -x, x)))\n  |> Array.to_list\n  |> List.sort compare\n  in\n  let ca, _, va = List.hd a in\n  let la = max 0 (n - len) / ca in\n  let ma = la * ca in\n\n  let rec f th = function\n    | [] -> if th = 0 then [[]] else []\n    | (c, _, x) :: xs ->\n        seq 0 (th / c) >>= fun i ->\n          List.map (fun y -> (x, i) :: y) (f (th - i * c) xs)\n  in\n\n  let be =\n    f (n - ma) a |> List.fold_left (fun ans xs ->\n      let xs = List.sort (fun x y -> compare y x) xs in\n      if cmp ans xs >= 0 then ans else xs) []\n  in\n  ((va, la) :: be) |> List.sort (fun x y -> compare y x)\n  |> List.iter (fun (x, i) -> for n = 1 to i do Printf.printf \"%d\" x done);\n  print_newline ()\n", "language": "OCaml", "metadata": {"date": 1550373017, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s507392929.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s507392929", "user_id": "u798181098"}, "prompt_components": {"gold_output": "777773\n", "input_to_evaluate": "let rec seq a b = if a > b then [] else a :: seq (a+1) b\nlet (>>=) x f = List.map f x |> List.concat\n\nlet len = 50\nlet costs = [|0;2;5;5;4;5;6;3;7;6|]\n\nlet cmp xs ys =\n  let lx = List.fold_left (fun s (x, i) -> s+i) 0 xs in\n  let ly = List.fold_left (fun s (y, i) -> s+i) 0 ys in\n  if lx <> ly then lx - ly\n  else\n  let rec f xs ys =\n    match xs, ys with\n    | [], [] -> 0\n    | _::_, [] -> -1\n    | [], _::_ -> 1\n    | ((x,i)::xs), ((y,j)::ys) ->\n        if x <> y then x - y\n        else if i <> j then i - j\n        else f xs ys\n  in f xs ys\n\nlet () =\n  Scanf.scanf \"%d %d\" @@ fun n m ->\n  let a = Array.init m (fun _ ->\n    Scanf.scanf \" %d\" (fun x -> (costs.(x), -x, x)))\n  |> Array.to_list\n  |> List.sort compare\n  in\n  let ca, _, va = List.hd a in\n  let la = max 0 (n - len) / ca in\n  let ma = la * ca in\n\n  let rec f th = function\n    | [] -> if th = 0 then [[]] else []\n    | (c, _, x) :: xs ->\n        seq 0 (th / c) >>= fun i ->\n          List.map (fun y -> (x, i) :: y) (f (th - i * c) xs)\n  in\n\n  let be =\n    f (n - ma) a |> List.fold_left (fun ans xs ->\n      let xs = List.sort (fun x y -> compare y x) xs in\n      if cmp ans xs >= 0 then ans else xs) []\n  in\n  ((va, la) :: be) |> List.sort (fun x y -> compare y x)\n  |> List.iter (fun (x, i) -> for n = 1 to i do Printf.printf \"%d\" x done);\n  print_newline ()\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFind the largest integer that can be formed with exactly N matchsticks, under the following conditions:\n\nEvery digit in the integer must be one of the digits A_1, A_2, ..., A_M (1 \\leq A_i \\leq 9).\n\nThe number of matchsticks used to form digits 1, 2, 3, 4, 5, 6, 7, 8, 9 should be 2, 5, 5, 4, 5, 6, 3, 7, 6, respectively.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^4\n\n1 \\leq M \\leq 9\n\n1 \\leq A_i \\leq 9\n\nA_i are all different.\n\nThere exists an integer that can be formed by exactly N matchsticks under the conditions.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the largest integer that can be formed with exactly N matchsticks under the conditions in the problem statement.\n\nSample Input 1\n\n20 4\n3 7 8 4\n\nSample Output 1\n\n777773\n\nThe integer 777773 can be formed with 3 + 3 + 3 + 3 + 3 + 5 = 20 matchsticks, and this is the largest integer that can be formed by 20 matchsticks under the conditions.\n\nSample Input 2\n\n101 9\n9 8 7 6 5 4 3 2 1\n\nSample Output 2\n\n71111111111111111111111111111111111111111111111111\n\nThe output may not fit into a 64-bit integer type.\n\nSample Input 3\n\n15 3\n5 4 6\n\nSample Output 3\n\n654", "sample_input": "20 4\n3 7 8 4\n"}, "reference_outputs": ["777773\n"], "source_document_id": "p03128", "source_text": "Score : 400 points\n\nProblem Statement\n\nFind the largest integer that can be formed with exactly N matchsticks, under the following conditions:\n\nEvery digit in the integer must be one of the digits A_1, A_2, ..., A_M (1 \\leq A_i \\leq 9).\n\nThe number of matchsticks used to form digits 1, 2, 3, 4, 5, 6, 7, 8, 9 should be 2, 5, 5, 4, 5, 6, 3, 7, 6, respectively.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^4\n\n1 \\leq M \\leq 9\n\n1 \\leq A_i \\leq 9\n\nA_i are all different.\n\nThere exists an integer that can be formed by exactly N matchsticks under the conditions.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the largest integer that can be formed with exactly N matchsticks under the conditions in the problem statement.\n\nSample Input 1\n\n20 4\n3 7 8 4\n\nSample Output 1\n\n777773\n\nThe integer 777773 can be formed with 3 + 3 + 3 + 3 + 3 + 5 = 20 matchsticks, and this is the largest integer that can be formed by 20 matchsticks under the conditions.\n\nSample Input 2\n\n101 9\n9 8 7 6 5 4 3 2 1\n\nSample Output 2\n\n71111111111111111111111111111111111111111111111111\n\nThe output may not fit into a 64-bit integer type.\n\nSample Input 3\n\n15 3\n5 4 6\n\nSample Output 3\n\n654", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1329, "cpu_time_ms": 59, "memory_kb": 13696}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s743531243", "group_id": "codeNet:p03130", "input_text": "let () =\n    let input = Array.init 3 (fun _ -> Scanf.scanf \"%d %d\\n\" (fun a b -> (a, b))) in\n    let junc = Array.init 5 (fun _ -> 0) in\n    Array.iter (fun (j1, j2) -> junc.(j1) <- junc.(j1) + 1; junc.(j2) <- junc.(j2) + 1) input;\n    print_endline @@ if Array.fold_left (fun acc j -> acc || j > 2) false junc\n        then \"NO\"\n        else \"YES\"", "language": "OCaml", "metadata": {"date": 1549765064, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s743531243.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s743531243", "user_id": "u604818425"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let () =\n    let input = Array.init 3 (fun _ -> Scanf.scanf \"%d %d\\n\" (fun a b -> (a, b))) in\n    let junc = Array.init 5 (fun _ -> 0) in\n    Array.iter (fun (j1, j2) -> junc.(j1) <- junc.(j1) + 1; junc.(j2) <- junc.(j2) + 1) input;\n    print_endline @@ if Array.fold_left (fun acc j -> acc || j > 2) false junc\n        then \"NO\"\n        else \"YES\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are four towns, numbered 1,2,3 and 4.\nAlso, there are three roads. The i-th road connects different towns a_i and b_i bidirectionally.\nNo two roads connect the same pair of towns. Other than these roads, there is no way to travel between these towns, but any town can be reached from any other town using these roads.\n\nDetermine if we can visit all the towns by traversing each of the roads exactly once.\n\nConstraints\n\n1 \\leq a_i,b_i \\leq 4(1\\leq i\\leq 3)\n\na_i and b_i are different. (1\\leq i\\leq 3)\n\nNo two roads connect the same pair of towns.\n\nAny town can be reached from any other town using the roads.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na_1 b_1\na_2 b_2\na_3 b_3\n\nOutput\n\nIf we can visit all the towns by traversing each of the roads exactly once, print YES; otherwise, print NO.\n\nSample Input 1\n\n4 2\n1 3\n2 3\n\nSample Output 1\n\nYES\n\nWe can visit all the towns in the order 1,3,2,4.\n\nSample Input 2\n\n3 2\n2 4\n1 2\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n2 1\n3 2\n4 3\n\nSample Output 3\n\nYES", "sample_input": "4 2\n1 3\n2 3\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03130", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are four towns, numbered 1,2,3 and 4.\nAlso, there are three roads. The i-th road connects different towns a_i and b_i bidirectionally.\nNo two roads connect the same pair of towns. Other than these roads, there is no way to travel between these towns, but any town can be reached from any other town using these roads.\n\nDetermine if we can visit all the towns by traversing each of the roads exactly once.\n\nConstraints\n\n1 \\leq a_i,b_i \\leq 4(1\\leq i\\leq 3)\n\na_i and b_i are different. (1\\leq i\\leq 3)\n\nNo two roads connect the same pair of towns.\n\nAny town can be reached from any other town using the roads.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na_1 b_1\na_2 b_2\na_3 b_3\n\nOutput\n\nIf we can visit all the towns by traversing each of the roads exactly once, print YES; otherwise, print NO.\n\nSample Input 1\n\n4 2\n1 3\n2 3\n\nSample Output 1\n\nYES\n\nWe can visit all the towns in the order 1,3,2,4.\n\nSample Input 2\n\n3 2\n2 4\n1 2\n\nSample Output 2\n\nNO\n\nSample Input 3\n\n2 1\n3 2\n4 3\n\nSample Output 3\n\nYES", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 348, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s778735229", "group_id": "codeNet:p03131", "input_text": "Scanf.scanf \" %d %d %d\" @@ fun k a b ->\n  print_int @@\n    if b-a<=2 then k+1\n    else\n      let q = max 0 ((k-a+1)/2) in\n      (b-a-2)*q + k + 1", "language": "OCaml", "metadata": {"date": 1549811902, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s778735229.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s778735229", "user_id": "u481480055"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "Scanf.scanf \" %d %d %d\" @@ fun k a b ->\n  print_int @@\n    if b-a<=2 then k+1\n    else\n      let q = max 0 ((k-a+1)/2) in\n      (b-a-2)*q + k + 1", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s889350420", "group_id": "codeNet:p03132", "input_text": "open Scanf\nopen Printf\nopen Array\n\nlet max_i64,(++),i64 = Int64.(max_int,add,of_int)\n\nlet () = scanf \" %d\" @@ fun l ->\n  let a = init l (fun _ -> scanf \" %d\" @@ fun v -> v) in\n  let dp = make_matrix (l+1) 5 max_i64 in\n  let f typ v = i64 @@\n    match typ with\n    | 0 | 4 -> (* zero *)\n      v\n    | 1 | 3 -> (* even >= 2 *)\n      if v=0 then 2\n      else if v mod 2 = 0 then 0 else 1\n    | 2 | _ -> (* odd *)\n      if v mod 2 = 1 then 0 else 1\n  in\n  let update i j v =\n    dp.(i).(j) <- min dp.(i).(j) v\n  in\n  for k=0 to 4 do\n    dp.(0).(k) <- 0L;\n  done;\n  for i=1 to l do\n    for k=0 to 4 do\n      for j=k to 4 do\n        update i j @@ dp.(i-1).(k) ++ f j a.(i-1)\n      done\n    done\n  done;\n  (* iter (fun b ->\n    iter (printf \"%2Ld \") b;\n    print_newline ()\n  ) dp; *)\n  printf \"%Ld\" @@ fold_left min max_i64 dp.(l)\n\n\n", "language": "OCaml", "metadata": {"date": 1550201786, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03132.html", "problem_id": "p03132", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03132/input.txt", "sample_output_relpath": "derived/input_output/data/p03132/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03132/OCaml/s889350420.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s889350420", "user_id": "u481480055"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Scanf\nopen Printf\nopen Array\n\nlet max_i64,(++),i64 = Int64.(max_int,add,of_int)\n\nlet () = scanf \" %d\" @@ fun l ->\n  let a = init l (fun _ -> scanf \" %d\" @@ fun v -> v) in\n  let dp = make_matrix (l+1) 5 max_i64 in\n  let f typ v = i64 @@\n    match typ with\n    | 0 | 4 -> (* zero *)\n      v\n    | 1 | 3 -> (* even >= 2 *)\n      if v=0 then 2\n      else if v mod 2 = 0 then 0 else 1\n    | 2 | _ -> (* odd *)\n      if v mod 2 = 1 then 0 else 1\n  in\n  let update i j v =\n    dp.(i).(j) <- min dp.(i).(j) v\n  in\n  for k=0 to 4 do\n    dp.(0).(k) <- 0L;\n  done;\n  for i=1 to l do\n    for k=0 to 4 do\n      for j=k to 4 do\n        update i j @@ dp.(i-1).(k) ++ f j a.(i-1)\n      done\n    done\n  done;\n  (* iter (fun b ->\n    iter (printf \"%2Ld \") b;\n    print_newline ()\n  ) dp; *)\n  printf \"%Ld\" @@ fold_left min max_i64 dp.(l)\n\n\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke stands on a number line. He has L ears, and he will walk along the line continuously under the following conditions:\n\nHe never visits a point with coordinate less than 0, or a point with coordinate greater than L.\n\nHe starts walking at a point with integer coordinate, and also finishes walking at a point with integer coordinate.\n\nHe only changes direction at a point with integer coordinate.\n\nEach time when Snuke passes a point with coordinate i-0.5, where i is an integer, he put a stone in his i-th ear.\n\nAfter Snuke finishes walking, Ringo will repeat the following operations in some order so that, for each i, Snuke's i-th ear contains A_i stones:\n\nPut a stone in one of Snuke's ears.\n\nRemove a stone from one of Snuke's ears.\n\nFind the minimum number of operations required when Ringo can freely decide how Snuke walks.\n\nConstraints\n\n1 \\leq L \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9(1\\leq i\\leq L)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL\nA_1\n:\nA_L\n\nOutput\n\nPrint the minimum number of operations required when Ringo can freely decide how Snuke walks.\n\nSample Input 1\n\n4\n1\n0\n2\n3\n\nSample Output 1\n\n1\n\nAssume that Snuke walks as follows:\n\nHe starts walking at coordinate 3 and finishes walking at coordinate 4, visiting coordinates 3,4,3,2,3,4 in this order.\n\nThen, Snuke's four ears will contain 0,0,2,3 stones, respectively.\nRingo can satisfy the requirement by putting one stone in the first ear.\n\nSample Input 2\n\n8\n2\n0\n0\n2\n1\n3\n4\n1\n\nSample Output 2\n\n3\n\nSample Input 3\n\n7\n314159265\n358979323\n846264338\n327950288\n419716939\n937510582\n0\n\nSample Output 3\n\n1", "sample_input": "4\n1\n0\n2\n3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03132", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke stands on a number line. He has L ears, and he will walk along the line continuously under the following conditions:\n\nHe never visits a point with coordinate less than 0, or a point with coordinate greater than L.\n\nHe starts walking at a point with integer coordinate, and also finishes walking at a point with integer coordinate.\n\nHe only changes direction at a point with integer coordinate.\n\nEach time when Snuke passes a point with coordinate i-0.5, where i is an integer, he put a stone in his i-th ear.\n\nAfter Snuke finishes walking, Ringo will repeat the following operations in some order so that, for each i, Snuke's i-th ear contains A_i stones:\n\nPut a stone in one of Snuke's ears.\n\nRemove a stone from one of Snuke's ears.\n\nFind the minimum number of operations required when Ringo can freely decide how Snuke walks.\n\nConstraints\n\n1 \\leq L \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9(1\\leq i\\leq L)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL\nA_1\n:\nA_L\n\nOutput\n\nPrint the minimum number of operations required when Ringo can freely decide how Snuke walks.\n\nSample Input 1\n\n4\n1\n0\n2\n3\n\nSample Output 1\n\n1\n\nAssume that Snuke walks as follows:\n\nHe starts walking at coordinate 3 and finishes walking at coordinate 4, visiting coordinates 3,4,3,2,3,4 in this order.\n\nThen, Snuke's four ears will contain 0,0,2,3 stones, respectively.\nRingo can satisfy the requirement by putting one stone in the first ear.\n\nSample Input 2\n\n8\n2\n0\n0\n2\n1\n3\n4\n1\n\nSample Output 2\n\n3\n\nSample Input 3\n\n7\n314159265\n358979323\n846264338\n327950288\n419716939\n937510582\n0\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 827, "cpu_time_ms": 271, "memory_kb": 41024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s107053735", "group_id": "codeNet:p03132", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun l ->\n  let as_ = Array.init l @@ fun _ -> Scanf.scanf \"%d\\n\" @@ fun a -> a in\n  let dp1, dp2, dp3, dp4, dp5 =\n    Array.fold_left (fun (dp1, dp2, dp3, dp4, dp5) a ->\n      a + dp1,\n      (if a < 2 then 2 - a else a mod 2) + min dp1 dp2,\n      (if a < 1 then 1 else (a + 1) mod 2) + min dp1 (min dp2 dp3),\n      (if a < 2 then 2 - a else a mod 2) + min dp1 (min dp2 (min dp3 dp4)),\n      a + min dp1 (min dp2 (min dp3 (min dp4 dp5))))\n    (0, 0, 0, 0, 0) as_ in\n  Printf.printf \"%d\\n\" @@ min dp1 (min dp2 (min dp3 (min dp4 dp5)))\n", "language": "OCaml", "metadata": {"date": 1549832216, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03132.html", "problem_id": "p03132", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03132/input.txt", "sample_output_relpath": "derived/input_output/data/p03132/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03132/OCaml/s107053735.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s107053735", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun l ->\n  let as_ = Array.init l @@ fun _ -> Scanf.scanf \"%d\\n\" @@ fun a -> a in\n  let dp1, dp2, dp3, dp4, dp5 =\n    Array.fold_left (fun (dp1, dp2, dp3, dp4, dp5) a ->\n      a + dp1,\n      (if a < 2 then 2 - a else a mod 2) + min dp1 dp2,\n      (if a < 1 then 1 else (a + 1) mod 2) + min dp1 (min dp2 dp3),\n      (if a < 2 then 2 - a else a mod 2) + min dp1 (min dp2 (min dp3 dp4)),\n      a + min dp1 (min dp2 (min dp3 (min dp4 dp5))))\n    (0, 0, 0, 0, 0) as_ in\n  Printf.printf \"%d\\n\" @@ min dp1 (min dp2 (min dp3 (min dp4 dp5)))\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke stands on a number line. He has L ears, and he will walk along the line continuously under the following conditions:\n\nHe never visits a point with coordinate less than 0, or a point with coordinate greater than L.\n\nHe starts walking at a point with integer coordinate, and also finishes walking at a point with integer coordinate.\n\nHe only changes direction at a point with integer coordinate.\n\nEach time when Snuke passes a point with coordinate i-0.5, where i is an integer, he put a stone in his i-th ear.\n\nAfter Snuke finishes walking, Ringo will repeat the following operations in some order so that, for each i, Snuke's i-th ear contains A_i stones:\n\nPut a stone in one of Snuke's ears.\n\nRemove a stone from one of Snuke's ears.\n\nFind the minimum number of operations required when Ringo can freely decide how Snuke walks.\n\nConstraints\n\n1 \\leq L \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9(1\\leq i\\leq L)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL\nA_1\n:\nA_L\n\nOutput\n\nPrint the minimum number of operations required when Ringo can freely decide how Snuke walks.\n\nSample Input 1\n\n4\n1\n0\n2\n3\n\nSample Output 1\n\n1\n\nAssume that Snuke walks as follows:\n\nHe starts walking at coordinate 3 and finishes walking at coordinate 4, visiting coordinates 3,4,3,2,3,4 in this order.\n\nThen, Snuke's four ears will contain 0,0,2,3 stones, respectively.\nRingo can satisfy the requirement by putting one stone in the first ear.\n\nSample Input 2\n\n8\n2\n0\n0\n2\n1\n3\n4\n1\n\nSample Output 2\n\n3\n\nSample Input 3\n\n7\n314159265\n358979323\n846264338\n327950288\n419716939\n937510582\n0\n\nSample Output 3\n\n1", "sample_input": "4\n1\n0\n2\n3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03132", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke stands on a number line. He has L ears, and he will walk along the line continuously under the following conditions:\n\nHe never visits a point with coordinate less than 0, or a point with coordinate greater than L.\n\nHe starts walking at a point with integer coordinate, and also finishes walking at a point with integer coordinate.\n\nHe only changes direction at a point with integer coordinate.\n\nEach time when Snuke passes a point with coordinate i-0.5, where i is an integer, he put a stone in his i-th ear.\n\nAfter Snuke finishes walking, Ringo will repeat the following operations in some order so that, for each i, Snuke's i-th ear contains A_i stones:\n\nPut a stone in one of Snuke's ears.\n\nRemove a stone from one of Snuke's ears.\n\nFind the minimum number of operations required when Ringo can freely decide how Snuke walks.\n\nConstraints\n\n1 \\leq L \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9(1\\leq i\\leq L)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL\nA_1\n:\nA_L\n\nOutput\n\nPrint the minimum number of operations required when Ringo can freely decide how Snuke walks.\n\nSample Input 1\n\n4\n1\n0\n2\n3\n\nSample Output 1\n\n1\n\nAssume that Snuke walks as follows:\n\nHe starts walking at coordinate 3 and finishes walking at coordinate 4, visiting coordinates 3,4,3,2,3,4 in this order.\n\nThen, Snuke's four ears will contain 0,0,2,3 stones, respectively.\nRingo can satisfy the requirement by putting one stone in the first ear.\n\nSample Input 2\n\n8\n2\n0\n0\n2\n1\n3\n4\n1\n\nSample Output 2\n\n3\n\nSample Input 3\n\n7\n314159265\n358979323\n846264338\n327950288\n419716939\n937510582\n0\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 82, "memory_kb": 7168}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s808200315", "group_id": "codeNet:p03132", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun l ->\n  let as_ = Array.init l @@ fun _ -> Scanf.scanf \"%d\\n\" @@ fun a -> a in\n  let ans, dp1, dp2, dp3 =\n    Array.fold_left (fun (ans, dp1, dp2, dp3) a ->\n      (max ans @@ max dp1 @@ max dp2 dp3),\n      (max 0 @@ (if a < 2 then a - 2 else a - a mod 2) + dp1),\n      (max 0 @@ (if a < 1 then a - 1 else a - (a + 1) mod 2) + max dp1 dp2),\n      (max 0 @@ (if a < 2 then a - 2 else a - a mod 2) + max dp2 dp3))\n    (min_int, 0, 0, 0) as_ in\n  Printf.printf \"%d\\n\" @@\n  Array.fold_right ( + ) as_ @@ ( ~- ) @@ max ans @@ max dp1 @@ max dp2 dp3\n", "language": "OCaml", "metadata": {"date": 1549831468, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03132.html", "problem_id": "p03132", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03132/input.txt", "sample_output_relpath": "derived/input_output/data/p03132/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03132/OCaml/s808200315.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s808200315", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun l ->\n  let as_ = Array.init l @@ fun _ -> Scanf.scanf \"%d\\n\" @@ fun a -> a in\n  let ans, dp1, dp2, dp3 =\n    Array.fold_left (fun (ans, dp1, dp2, dp3) a ->\n      (max ans @@ max dp1 @@ max dp2 dp3),\n      (max 0 @@ (if a < 2 then a - 2 else a - a mod 2) + dp1),\n      (max 0 @@ (if a < 1 then a - 1 else a - (a + 1) mod 2) + max dp1 dp2),\n      (max 0 @@ (if a < 2 then a - 2 else a - a mod 2) + max dp2 dp3))\n    (min_int, 0, 0, 0) as_ in\n  Printf.printf \"%d\\n\" @@\n  Array.fold_right ( + ) as_ @@ ( ~- ) @@ max ans @@ max dp1 @@ max dp2 dp3\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke stands on a number line. He has L ears, and he will walk along the line continuously under the following conditions:\n\nHe never visits a point with coordinate less than 0, or a point with coordinate greater than L.\n\nHe starts walking at a point with integer coordinate, and also finishes walking at a point with integer coordinate.\n\nHe only changes direction at a point with integer coordinate.\n\nEach time when Snuke passes a point with coordinate i-0.5, where i is an integer, he put a stone in his i-th ear.\n\nAfter Snuke finishes walking, Ringo will repeat the following operations in some order so that, for each i, Snuke's i-th ear contains A_i stones:\n\nPut a stone in one of Snuke's ears.\n\nRemove a stone from one of Snuke's ears.\n\nFind the minimum number of operations required when Ringo can freely decide how Snuke walks.\n\nConstraints\n\n1 \\leq L \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9(1\\leq i\\leq L)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL\nA_1\n:\nA_L\n\nOutput\n\nPrint the minimum number of operations required when Ringo can freely decide how Snuke walks.\n\nSample Input 1\n\n4\n1\n0\n2\n3\n\nSample Output 1\n\n1\n\nAssume that Snuke walks as follows:\n\nHe starts walking at coordinate 3 and finishes walking at coordinate 4, visiting coordinates 3,4,3,2,3,4 in this order.\n\nThen, Snuke's four ears will contain 0,0,2,3 stones, respectively.\nRingo can satisfy the requirement by putting one stone in the first ear.\n\nSample Input 2\n\n8\n2\n0\n0\n2\n1\n3\n4\n1\n\nSample Output 2\n\n3\n\nSample Input 3\n\n7\n314159265\n358979323\n846264338\n327950288\n419716939\n937510582\n0\n\nSample Output 3\n\n1", "sample_input": "4\n1\n0\n2\n3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03132", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke stands on a number line. He has L ears, and he will walk along the line continuously under the following conditions:\n\nHe never visits a point with coordinate less than 0, or a point with coordinate greater than L.\n\nHe starts walking at a point with integer coordinate, and also finishes walking at a point with integer coordinate.\n\nHe only changes direction at a point with integer coordinate.\n\nEach time when Snuke passes a point with coordinate i-0.5, where i is an integer, he put a stone in his i-th ear.\n\nAfter Snuke finishes walking, Ringo will repeat the following operations in some order so that, for each i, Snuke's i-th ear contains A_i stones:\n\nPut a stone in one of Snuke's ears.\n\nRemove a stone from one of Snuke's ears.\n\nFind the minimum number of operations required when Ringo can freely decide how Snuke walks.\n\nConstraints\n\n1 \\leq L \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9(1\\leq i\\leq L)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL\nA_1\n:\nA_L\n\nOutput\n\nPrint the minimum number of operations required when Ringo can freely decide how Snuke walks.\n\nSample Input 1\n\n4\n1\n0\n2\n3\n\nSample Output 1\n\n1\n\nAssume that Snuke walks as follows:\n\nHe starts walking at coordinate 3 and finishes walking at coordinate 4, visiting coordinates 3,4,3,2,3,4 in this order.\n\nThen, Snuke's four ears will contain 0,0,2,3 stones, respectively.\nRingo can satisfy the requirement by putting one stone in the first ear.\n\nSample Input 2\n\n8\n2\n0\n0\n2\n1\n3\n4\n1\n\nSample Output 2\n\n3\n\nSample Input 3\n\n7\n314159265\n358979323\n846264338\n327950288\n419716939\n937510582\n0\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 577, "cpu_time_ms": 79, "memory_kb": 6144}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s967362642", "group_id": "codeNet:p03132", "input_text": "let () =\n  Scanf.scanf \"%d\" @@ fun l ->\n  let a = Array.init (l+1) @@ fun i ->\n    if i = 0 then 0\n    else Scanf.scanf \" %d\" ((+) 0)\n  in\n\n  let dp = Array.init (l+1) (fun _ -> Array.make (l+1) 0) in\n\n  for i = 1 to l do\n    dp.(0).(i) <- dp.(0).(i-1) + a.(i);\n  done;\n\n  for i = 1 to l do\n    dp.(1).(i) <- min dp.(0).(i) @@\n      dp.(1).(i-1) + if a.(i) = 0 then 2 else a.(i) mod 2;\n  done;\n\n  for i = 1 to l do\n    dp.(2).(i) <- min dp.(1).(i) @@\n      dp.(2).(i-1) + (a.(i) + 1) mod 2;\n  done;\n\n  for i = 1 to l do\n    dp.(3).(i) <- min dp.(2).(i) @@\n      dp.(3).(i-1) + if a.(i) = 0 then 2 else a.(i) mod 2;\n  done;\n\n  for i = 1 to l do\n    dp.(4).(i) <- min dp.(3).(i) @@ dp.(4).(i-1) + a.(i);\n  done;\n\n  Printf.printf \"%d\\n\" dp.(4).(l)", "language": "OCaml", "metadata": {"date": 1549790344, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03132.html", "problem_id": "p03132", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03132/input.txt", "sample_output_relpath": "derived/input_output/data/p03132/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03132/OCaml/s967362642.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s967362642", "user_id": "u798181098"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d\" @@ fun l ->\n  let a = Array.init (l+1) @@ fun i ->\n    if i = 0 then 0\n    else Scanf.scanf \" %d\" ((+) 0)\n  in\n\n  let dp = Array.init (l+1) (fun _ -> Array.make (l+1) 0) in\n\n  for i = 1 to l do\n    dp.(0).(i) <- dp.(0).(i-1) + a.(i);\n  done;\n\n  for i = 1 to l do\n    dp.(1).(i) <- min dp.(0).(i) @@\n      dp.(1).(i-1) + if a.(i) = 0 then 2 else a.(i) mod 2;\n  done;\n\n  for i = 1 to l do\n    dp.(2).(i) <- min dp.(1).(i) @@\n      dp.(2).(i-1) + (a.(i) + 1) mod 2;\n  done;\n\n  for i = 1 to l do\n    dp.(3).(i) <- min dp.(2).(i) @@\n      dp.(3).(i-1) + if a.(i) = 0 then 2 else a.(i) mod 2;\n  done;\n\n  for i = 1 to l do\n    dp.(4).(i) <- min dp.(3).(i) @@ dp.(4).(i-1) + a.(i);\n  done;\n\n  Printf.printf \"%d\\n\" dp.(4).(l)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke stands on a number line. He has L ears, and he will walk along the line continuously under the following conditions:\n\nHe never visits a point with coordinate less than 0, or a point with coordinate greater than L.\n\nHe starts walking at a point with integer coordinate, and also finishes walking at a point with integer coordinate.\n\nHe only changes direction at a point with integer coordinate.\n\nEach time when Snuke passes a point with coordinate i-0.5, where i is an integer, he put a stone in his i-th ear.\n\nAfter Snuke finishes walking, Ringo will repeat the following operations in some order so that, for each i, Snuke's i-th ear contains A_i stones:\n\nPut a stone in one of Snuke's ears.\n\nRemove a stone from one of Snuke's ears.\n\nFind the minimum number of operations required when Ringo can freely decide how Snuke walks.\n\nConstraints\n\n1 \\leq L \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9(1\\leq i\\leq L)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL\nA_1\n:\nA_L\n\nOutput\n\nPrint the minimum number of operations required when Ringo can freely decide how Snuke walks.\n\nSample Input 1\n\n4\n1\n0\n2\n3\n\nSample Output 1\n\n1\n\nAssume that Snuke walks as follows:\n\nHe starts walking at coordinate 3 and finishes walking at coordinate 4, visiting coordinates 3,4,3,2,3,4 in this order.\n\nThen, Snuke's four ears will contain 0,0,2,3 stones, respectively.\nRingo can satisfy the requirement by putting one stone in the first ear.\n\nSample Input 2\n\n8\n2\n0\n0\n2\n1\n3\n4\n1\n\nSample Output 2\n\n3\n\nSample Input 3\n\n7\n314159265\n358979323\n846264338\n327950288\n419716939\n937510582\n0\n\nSample Output 3\n\n1", "sample_input": "4\n1\n0\n2\n3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03132", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke stands on a number line. He has L ears, and he will walk along the line continuously under the following conditions:\n\nHe never visits a point with coordinate less than 0, or a point with coordinate greater than L.\n\nHe starts walking at a point with integer coordinate, and also finishes walking at a point with integer coordinate.\n\nHe only changes direction at a point with integer coordinate.\n\nEach time when Snuke passes a point with coordinate i-0.5, where i is an integer, he put a stone in his i-th ear.\n\nAfter Snuke finishes walking, Ringo will repeat the following operations in some order so that, for each i, Snuke's i-th ear contains A_i stones:\n\nPut a stone in one of Snuke's ears.\n\nRemove a stone from one of Snuke's ears.\n\nFind the minimum number of operations required when Ringo can freely decide how Snuke walks.\n\nConstraints\n\n1 \\leq L \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9(1\\leq i\\leq L)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL\nA_1\n:\nA_L\n\nOutput\n\nPrint the minimum number of operations required when Ringo can freely decide how Snuke walks.\n\nSample Input 1\n\n4\n1\n0\n2\n3\n\nSample Output 1\n\n1\n\nAssume that Snuke walks as follows:\n\nHe starts walking at coordinate 3 and finishes walking at coordinate 4, visiting coordinates 3,4,3,2,3,4 in this order.\n\nThen, Snuke's four ears will contain 0,0,2,3 stones, respectively.\nRingo can satisfy the requirement by putting one stone in the first ear.\n\nSample Input 2\n\n8\n2\n0\n0\n2\n1\n3\n4\n1\n\nSample Output 2\n\n3\n\nSample Input 3\n\n7\n314159265\n358979323\n846264338\n327950288\n419716939\n937510582\n0\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 744, "cpu_time_ms": 2163, "memory_kb": 2061816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s353531459", "group_id": "codeNet:p03136", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let l = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun l -> l)) in\n    Array.sort compare l;\n    let sum = Array.fold_left (+) 0 l - l.(n - 1) in\n    print_endline @@ if sum > l.(n - 1) then \"Yes\" else \"No\"\n)", "language": "OCaml", "metadata": {"date": 1584754317, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s353531459.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s353531459", "user_id": "u342443598"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let l = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun l -> l)) in\n    Array.sort compare l;\n    let sum = Array.fold_left (+) 0 l - l.(n - 1) in\n    print_endline @@ if sum > l.(n - 1) then \"Yes\" else \"No\"\n)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\n\nSample Output 3\n\nNo", "sample_input": "4\n3 8 5 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03136", "source_text": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 238, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s490672967", "group_id": "codeNet:p03136", "input_text": "let () =\n  let a = Scanf.scanf \"%d\" (fun n -> Array.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x))) in\n  let sum = Array.fold_left (fun acc x -> acc + x ) 0 a in\n  let max = Array.fold_left (fun acc x -> if acc > x then acc else x) 0 a in \n  let res = sum - max in\n  if res > max then print_endline \"Yes\" else print_endline \"No\"\n", "language": "OCaml", "metadata": {"date": 1549251227, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s490672967.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s490672967", "user_id": "u013750540"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n  let a = Scanf.scanf \"%d\" (fun n -> Array.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x))) in\n  let sum = Array.fold_left (fun acc x -> acc + x ) 0 a in\n  let max = Array.fold_left (fun acc x -> if acc > x then acc else x) 0 a in \n  let res = sum - max in\n  if res > max then print_endline \"Yes\" else print_endline \"No\"\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\n\nSample Output 3\n\nNo", "sample_input": "4\n3 8 5 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03136", "source_text": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s104844848", "group_id": "codeNet:p03139", "input_text": "let n, a, b = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet _ = Printf.printf \"%d %d\\n\" (min a b) @@ max 0 @@ a + b - n", "language": "OCaml", "metadata": {"date": 1563121272, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03139.html", "problem_id": "p03139", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03139/input.txt", "sample_output_relpath": "derived/input_output/data/p03139/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03139/OCaml/s104844848.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s104844848", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3 0\n", "input_to_evaluate": "let n, a, b = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet _ = Printf.printf \"%d %d\\n\" (min a b) @@ max 0 @@ a + b - n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe conducted a survey on newspaper subscriptions.\nMore specifically, we asked each of the N respondents the following two questions:\n\nQuestion 1: Are you subscribing to Newspaper X?\n\nQuestion 2: Are you subscribing to Newspaper Y?\n\nAs the result, A respondents answered \"yes\" to Question 1, and B respondents answered \"yes\" to Question 2.\n\nWhat are the maximum possible number and the minimum possible number of respondents subscribing to both newspapers X and Y?\n\nWrite a program to answer this question.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq A \\leq N\n\n0 \\leq B \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the maximum possible number and the minimum possible number of respondents subscribing to both newspapers, in this order, with a space in between.\n\nSample Input 1\n\n10 3 5\n\nSample Output 1\n\n3 0\n\nIn this sample, out of the 10 respondents, 3 answered they are subscribing to Newspaper X, and 5 answered they are subscribing to Newspaper Y.\n\nHere, the number of respondents subscribing to both newspapers is at most 3 and at least 0.\n\nSample Input 2\n\n10 7 5\n\nSample Output 2\n\n5 2\n\nIn this sample, out of the 10 respondents, 7 answered they are subscribing to Newspaper X, and 5 answered they are subscribing to Newspaper Y.\n\nHere, the number of respondents subscribing to both newspapers is at most 5 and at least 2.\n\nSample Input 3\n\n100 100 100\n\nSample Output 3\n\n100 100", "sample_input": "10 3 5\n"}, "reference_outputs": ["3 0\n"], "source_document_id": "p03139", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe conducted a survey on newspaper subscriptions.\nMore specifically, we asked each of the N respondents the following two questions:\n\nQuestion 1: Are you subscribing to Newspaper X?\n\nQuestion 2: Are you subscribing to Newspaper Y?\n\nAs the result, A respondents answered \"yes\" to Question 1, and B respondents answered \"yes\" to Question 2.\n\nWhat are the maximum possible number and the minimum possible number of respondents subscribing to both newspapers X and Y?\n\nWrite a program to answer this question.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq A \\leq N\n\n0 \\leq B \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the maximum possible number and the minimum possible number of respondents subscribing to both newspapers, in this order, with a space in between.\n\nSample Input 1\n\n10 3 5\n\nSample Output 1\n\n3 0\n\nIn this sample, out of the 10 respondents, 3 answered they are subscribing to Newspaper X, and 5 answered they are subscribing to Newspaper Y.\n\nHere, the number of respondents subscribing to both newspapers is at most 3 and at least 0.\n\nSample Input 2\n\n10 7 5\n\nSample Output 2\n\n5 2\n\nIn this sample, out of the 10 respondents, 7 answered they are subscribing to Newspaper X, and 5 answered they are subscribing to Newspaper Y.\n\nHere, the number of respondents subscribing to both newspapers is at most 5 and at least 2.\n\nSample Input 3\n\n100 100 100\n\nSample Output 3\n\n100 100", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 125, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s942744580", "group_id": "codeNet:p03139", "input_text": "let () = Scanf.scanf \"%d %d %d\" @@ fun n a b ->\n  Printf.printf \"%d %d\\n\" (min a b) (max 0 (a + b - n))\n", "language": "OCaml", "metadata": {"date": 1548641133, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03139.html", "problem_id": "p03139", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03139/input.txt", "sample_output_relpath": "derived/input_output/data/p03139/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03139/OCaml/s942744580.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s942744580", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3 0\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" @@ fun n a b ->\n  Printf.printf \"%d %d\\n\" (min a b) (max 0 (a + b - n))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe conducted a survey on newspaper subscriptions.\nMore specifically, we asked each of the N respondents the following two questions:\n\nQuestion 1: Are you subscribing to Newspaper X?\n\nQuestion 2: Are you subscribing to Newspaper Y?\n\nAs the result, A respondents answered \"yes\" to Question 1, and B respondents answered \"yes\" to Question 2.\n\nWhat are the maximum possible number and the minimum possible number of respondents subscribing to both newspapers X and Y?\n\nWrite a program to answer this question.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq A \\leq N\n\n0 \\leq B \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the maximum possible number and the minimum possible number of respondents subscribing to both newspapers, in this order, with a space in between.\n\nSample Input 1\n\n10 3 5\n\nSample Output 1\n\n3 0\n\nIn this sample, out of the 10 respondents, 3 answered they are subscribing to Newspaper X, and 5 answered they are subscribing to Newspaper Y.\n\nHere, the number of respondents subscribing to both newspapers is at most 3 and at least 0.\n\nSample Input 2\n\n10 7 5\n\nSample Output 2\n\n5 2\n\nIn this sample, out of the 10 respondents, 7 answered they are subscribing to Newspaper X, and 5 answered they are subscribing to Newspaper Y.\n\nHere, the number of respondents subscribing to both newspapers is at most 5 and at least 2.\n\nSample Input 3\n\n100 100 100\n\nSample Output 3\n\n100 100", "sample_input": "10 3 5\n"}, "reference_outputs": ["3 0\n"], "source_document_id": "p03139", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe conducted a survey on newspaper subscriptions.\nMore specifically, we asked each of the N respondents the following two questions:\n\nQuestion 1: Are you subscribing to Newspaper X?\n\nQuestion 2: Are you subscribing to Newspaper Y?\n\nAs the result, A respondents answered \"yes\" to Question 1, and B respondents answered \"yes\" to Question 2.\n\nWhat are the maximum possible number and the minimum possible number of respondents subscribing to both newspapers X and Y?\n\nWrite a program to answer this question.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq A \\leq N\n\n0 \\leq B \\leq N\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the maximum possible number and the minimum possible number of respondents subscribing to both newspapers, in this order, with a space in between.\n\nSample Input 1\n\n10 3 5\n\nSample Output 1\n\n3 0\n\nIn this sample, out of the 10 respondents, 3 answered they are subscribing to Newspaper X, and 5 answered they are subscribing to Newspaper Y.\n\nHere, the number of respondents subscribing to both newspapers is at most 3 and at least 0.\n\nSample Input 2\n\n10 7 5\n\nSample Output 2\n\n5 2\n\nIn this sample, out of the 10 respondents, 7 answered they are subscribing to Newspaper X, and 5 answered they are subscribing to Newspaper Y.\n\nHere, the number of respondents subscribing to both newspapers is at most 5 and at least 2.\n\nSample Input 3\n\n100 100 100\n\nSample Output 3\n\n100 100", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 104, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s216415195", "group_id": "codeNet:p03141", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let abs = Array.init n @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun a b -> a, b in\n  Array.sort (fun (a, b) (a', b') -> compare (a' + b') (a + b)) abs;\n  Printf.printf \"%d\\n\" @@ Array.fold_left ( + ) 0 @@ Array.init n @@ fun i ->\n    if i mod 2 = 0 then fst abs.(i) else ~- (snd abs.(i))\n    \n\n", "language": "OCaml", "metadata": {"date": 1548641622, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s216415195.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s216415195", "user_id": "u504158101"}, "prompt_components": {"gold_output": "20\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let abs = Array.init n @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun a b -> a, b in\n  Array.sort (fun (a, b) (a', b') -> compare (a' + b') (a + b)) abs;\n  Printf.printf \"%d\\n\" @@ Array.fold_left ( + ) 0 @@ Array.init n @@ fun i ->\n    if i mod 2 = 0 then fst abs.(i) else ~- (snd abs.(i))\n    \n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N dishes of cuisine placed in front of Takahashi and Aoki.\nFor convenience, we call these dishes Dish 1, Dish 2, ..., Dish N.\n\nWhen Takahashi eats Dish i, he earns A_i points of happiness; when Aoki eats Dish i, she earns B_i points of happiness.\n\nStarting from Takahashi, they alternately choose one dish and eat it, until there is no more dish to eat.\nHere, both of them choose dishes so that the following value is maximized: \"the sum of the happiness he/she will earn in the end\" minus \"the sum of the happiness the other person will earn in the end\".\n\nFind the value: \"the sum of the happiness Takahashi earns in the end\" minus \"the sum of the happiness Aoki earns in the end\".\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the value: \"the sum of the happiness Takahashi earns in the end\" minus \"the sum of the happiness Aoki earns in the end\".\n\nSample Input 1\n\n3\n10 10\n20 20\n30 30\n\nSample Output 1\n\n20\n\nIn this sample, both of them earns 10 points of happiness by eating Dish 1, 20 points by eating Dish 2, and 30 points by eating Dish 3.\n\nIn this case, since Takahashi and Aoki have the same \"taste\", each time they will choose the dish with which they can earn the greatest happiness. Thus, first Takahashi will choose Dish 3, then Aoki will choose Dish 2, and finally Takahashi will choose Dish 1, so the answer is (30 + 10) - 20 = 20.\n\nSample Input 2\n\n3\n20 10\n20 20\n20 30\n\nSample Output 2\n\n20\n\nIn this sample, Takahashi earns 20 points of happiness by eating any one of the dishes 1, 2 and 3, but Aoki earns 10 points of happiness by eating Dish 1, 20 points by eating Dish 2, and 30 points by eating Dish 3.\n\nIn this case, since only Aoki has likes and dislikes, each time they will choose the dish with which Aoki can earn the greatest happiness. Thus, first Takahashi will choose Dish 3, then Aoki will choose Dish 2, and finally Takahashi will choose Dish 1, so the answer is (20 + 20) - 20 = 20.\n\nSample Input 3\n\n6\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 3\n\n-2999999997\n\nNote that the answer may not fit into a 32-bit integer.", "sample_input": "3\n10 10\n20 20\n30 30\n"}, "reference_outputs": ["20\n"], "source_document_id": "p03141", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N dishes of cuisine placed in front of Takahashi and Aoki.\nFor convenience, we call these dishes Dish 1, Dish 2, ..., Dish N.\n\nWhen Takahashi eats Dish i, he earns A_i points of happiness; when Aoki eats Dish i, she earns B_i points of happiness.\n\nStarting from Takahashi, they alternately choose one dish and eat it, until there is no more dish to eat.\nHere, both of them choose dishes so that the following value is maximized: \"the sum of the happiness he/she will earn in the end\" minus \"the sum of the happiness the other person will earn in the end\".\n\nFind the value: \"the sum of the happiness Takahashi earns in the end\" minus \"the sum of the happiness Aoki earns in the end\".\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the value: \"the sum of the happiness Takahashi earns in the end\" minus \"the sum of the happiness Aoki earns in the end\".\n\nSample Input 1\n\n3\n10 10\n20 20\n30 30\n\nSample Output 1\n\n20\n\nIn this sample, both of them earns 10 points of happiness by eating Dish 1, 20 points by eating Dish 2, and 30 points by eating Dish 3.\n\nIn this case, since Takahashi and Aoki have the same \"taste\", each time they will choose the dish with which they can earn the greatest happiness. Thus, first Takahashi will choose Dish 3, then Aoki will choose Dish 2, and finally Takahashi will choose Dish 1, so the answer is (30 + 10) - 20 = 20.\n\nSample Input 2\n\n3\n20 10\n20 20\n20 30\n\nSample Output 2\n\n20\n\nIn this sample, Takahashi earns 20 points of happiness by eating any one of the dishes 1, 2 and 3, but Aoki earns 10 points of happiness by eating Dish 1, 20 points by eating Dish 2, and 30 points by eating Dish 3.\n\nIn this case, since only Aoki has likes and dislikes, each time they will choose the dish with which Aoki can earn the greatest happiness. Thus, first Takahashi will choose Dish 3, then Aoki will choose Dish 2, and finally Takahashi will choose Dish 1, so the answer is (20 + 20) - 20 = 20.\n\nSample Input 3\n\n6\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 3\n\n-2999999997\n\nNote that the answer may not fit into a 32-bit integer.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 332, "cpu_time_ms": 127, "memory_kb": 7040}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s032252864", "group_id": "codeNet:p03142", "input_text": "Scanf.scanf \"%d %d\" (fun n m ->\n    let nei = Array.make n [] in\n    let rev = Array.make n 0 in\n    for i = 1 to n - 1 + m do\n        Scanf.scanf \" %d %d\" (fun a b ->\n            let a = a - 1 in\n            let b = b - 1 in\n            nei.(a) <- b :: nei.(a);\n            rev.(b) <- rev.(b) + 1\n        )\n    done;\n    let rec loop i =\n        if rev.(i) = 0 then i else loop (i + 1)\n    in\n    let root = loop 0 in\n    let par = Array.make n 0 in\n\n    let rec loop next = function\n        | [] -> if next <> [] then loop [] next\n        | hd :: tl ->\n            let rec loop2 next = function\n                | [] -> loop next tl\n                | x :: xs ->\n                        rev.(x) <- rev.(x) - 1;\n                        if rev.(x) > 0 then loop2 next xs else (\n                            par.(x) <- hd + 1;\n                            loop2 (x :: next) xs\n                        )\n            in\n            loop2 next nei.(hd)\n    in\n    loop [] [ root ];\n    Array.iter (Printf.printf \"%d\\n\") par\n)", "language": "OCaml", "metadata": {"date": 1592029374, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03142.html", "problem_id": "p03142", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03142/input.txt", "sample_output_relpath": "derived/input_output/data/p03142/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03142/OCaml/s032252864.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s032252864", "user_id": "u342443598"}, "prompt_components": {"gold_output": "0\n1\n2\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n m ->\n    let nei = Array.make n [] in\n    let rev = Array.make n 0 in\n    for i = 1 to n - 1 + m do\n        Scanf.scanf \" %d %d\" (fun a b ->\n            let a = a - 1 in\n            let b = b - 1 in\n            nei.(a) <- b :: nei.(a);\n            rev.(b) <- rev.(b) + 1\n        )\n    done;\n    let rec loop i =\n        if rev.(i) = 0 then i else loop (i + 1)\n    in\n    let root = loop 0 in\n    let par = Array.make n 0 in\n\n    let rec loop next = function\n        | [] -> if next <> [] then loop [] next\n        | hd :: tl ->\n            let rec loop2 next = function\n                | [] -> loop next tl\n                | x :: xs ->\n                        rev.(x) <- rev.(x) - 1;\n                        if rev.(x) > 0 then loop2 next xs else (\n                            par.(x) <- hd + 1;\n                            loop2 (x :: next) xs\n                        )\n            in\n            loop2 next nei.(hd)\n    in\n    loop [] [ root ];\n    Array.iter (Printf.printf \"%d\\n\") par\n)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a rooted tree (see Notes) with N vertices numbered 1 to N.\nEach of the vertices, except the root, has a directed edge coming from its parent.\nNote that the root may not be Vertex 1.\n\nTakahashi has added M new directed edges to this graph.\nEach of these M edges, u \\rightarrow v, extends from some vertex u to its descendant v.\n\nYou are given the directed graph with N vertices and N-1+M edges after Takahashi added edges.\nMore specifically, you are given N-1+M pairs of integers, (A_1, B_1), ..., (A_{N-1+M}, B_{N-1+M}), which represent that the i-th edge extends from Vertex A_i to Vertex B_i.\n\nRestore the original rooted tree.\n\nNotes\n\nFor \"tree\" and other related terms in graph theory, see the article in Wikipedia, for example.\n\nConstraints\n\n3 \\leq N\n\n1 \\leq M\n\nN + M \\leq 10^5\n\n1 \\leq A_i, B_i \\leq N\n\nA_i \\neq B_i\n\nIf i \\neq j, (A_i, B_i) \\neq (A_j, B_j).\n\nThe graph in input can be obtained by adding M edges satisfying the condition in the problem statement to a rooted tree with N vertices.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\n:\nA_{N-1+M} B_{N-1+M}\n\nOutput\n\nPrint N lines.\nIn the i-th line, print 0 if Vertex i is the root of the original tree, and otherwise print the integer representing the parent of Vertex i in the original tree.\n\nNote that it can be shown that the original tree is uniquely determined.\n\nSample Input 1\n\n3 1\n1 2\n1 3\n2 3\n\nSample Output 1\n\n0\n1\n2\n\nThe graph in this input is shown below:\n\nIt can be seen that this graph is obtained by adding the edge 1 \\rightarrow 3 to the rooted tree 1 \\rightarrow 2 \\rightarrow 3.\n\nSample Input 2\n\n6 3\n2 1\n2 3\n4 1\n4 2\n6 1\n2 6\n4 6\n6 5\n\nSample Output 2\n\n6\n4\n2\n0\n6\n2", "sample_input": "3 1\n1 2\n1 3\n2 3\n"}, "reference_outputs": ["0\n1\n2\n"], "source_document_id": "p03142", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a rooted tree (see Notes) with N vertices numbered 1 to N.\nEach of the vertices, except the root, has a directed edge coming from its parent.\nNote that the root may not be Vertex 1.\n\nTakahashi has added M new directed edges to this graph.\nEach of these M edges, u \\rightarrow v, extends from some vertex u to its descendant v.\n\nYou are given the directed graph with N vertices and N-1+M edges after Takahashi added edges.\nMore specifically, you are given N-1+M pairs of integers, (A_1, B_1), ..., (A_{N-1+M}, B_{N-1+M}), which represent that the i-th edge extends from Vertex A_i to Vertex B_i.\n\nRestore the original rooted tree.\n\nNotes\n\nFor \"tree\" and other related terms in graph theory, see the article in Wikipedia, for example.\n\nConstraints\n\n3 \\leq N\n\n1 \\leq M\n\nN + M \\leq 10^5\n\n1 \\leq A_i, B_i \\leq N\n\nA_i \\neq B_i\n\nIf i \\neq j, (A_i, B_i) \\neq (A_j, B_j).\n\nThe graph in input can be obtained by adding M edges satisfying the condition in the problem statement to a rooted tree with N vertices.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\n:\nA_{N-1+M} B_{N-1+M}\n\nOutput\n\nPrint N lines.\nIn the i-th line, print 0 if Vertex i is the root of the original tree, and otherwise print the integer representing the parent of Vertex i in the original tree.\n\nNote that it can be shown that the original tree is uniquely determined.\n\nSample Input 1\n\n3 1\n1 2\n1 3\n2 3\n\nSample Output 1\n\n0\n1\n2\n\nThe graph in this input is shown below:\n\nIt can be seen that this graph is obtained by adding the edge 1 \\rightarrow 3 to the rooted tree 1 \\rightarrow 2 \\rightarrow 3.\n\nSample Input 2\n\n6 3\n2 1\n2 3\n4 1\n4 2\n6 1\n2 6\n4 6\n6 5\n\nSample Output 2\n\n6\n4\n2\n0\n6\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1017, "cpu_time_ms": 80, "memory_kb": 10112}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s328338512", "group_id": "codeNet:p03142", "input_text": "let rec fix f x = f (fix f) x;;\nScanf.(Array.(scanf \" %d %d\" @@ fun n m ->\n  let e = make n [] in\n  let e_rev = make n [] in\n  init (n-1+m) (fun i -> scanf \" %d %d\" @@ fun u v ->\n    let u,v = u-1,v-1 in\n    e.(u) <- v :: e.(u);\n    e_rev.(v) <- u :: e_rev.(v)\n  ) |> ignore;\n  let root = fst @@ fold_left (fun (root,i) ls ->\n    (if List.length ls = 0 then i else root),i+1\n  ) (0,0) e_rev in\n  let q = Queue.create () in\n  let v_left = init n (fun i -> List.length e_rev.(i)) in\n  Queue.add root q;\n  let par = make n 0 in\n  while not @@ Queue.is_empty q do\n    let i = Queue.pop q in\n    List.iter (fun j ->\n      v_left.(j) <- v_left.(j) - 1;\n      if v_left.(j) = 0 then (\n        par.(j) <- i + 1;\n        Queue.add j q;\n      )\n    ) e.(i)\n  done;\n  iter (Printf.printf \"%d\\n\") par\n))", "language": "OCaml", "metadata": {"date": 1548674678, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03142.html", "problem_id": "p03142", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03142/input.txt", "sample_output_relpath": "derived/input_output/data/p03142/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03142/OCaml/s328338512.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s328338512", "user_id": "u481480055"}, "prompt_components": {"gold_output": "0\n1\n2\n", "input_to_evaluate": "let rec fix f x = f (fix f) x;;\nScanf.(Array.(scanf \" %d %d\" @@ fun n m ->\n  let e = make n [] in\n  let e_rev = make n [] in\n  init (n-1+m) (fun i -> scanf \" %d %d\" @@ fun u v ->\n    let u,v = u-1,v-1 in\n    e.(u) <- v :: e.(u);\n    e_rev.(v) <- u :: e_rev.(v)\n  ) |> ignore;\n  let root = fst @@ fold_left (fun (root,i) ls ->\n    (if List.length ls = 0 then i else root),i+1\n  ) (0,0) e_rev in\n  let q = Queue.create () in\n  let v_left = init n (fun i -> List.length e_rev.(i)) in\n  Queue.add root q;\n  let par = make n 0 in\n  while not @@ Queue.is_empty q do\n    let i = Queue.pop q in\n    List.iter (fun j ->\n      v_left.(j) <- v_left.(j) - 1;\n      if v_left.(j) = 0 then (\n        par.(j) <- i + 1;\n        Queue.add j q;\n      )\n    ) e.(i)\n  done;\n  iter (Printf.printf \"%d\\n\") par\n))", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a rooted tree (see Notes) with N vertices numbered 1 to N.\nEach of the vertices, except the root, has a directed edge coming from its parent.\nNote that the root may not be Vertex 1.\n\nTakahashi has added M new directed edges to this graph.\nEach of these M edges, u \\rightarrow v, extends from some vertex u to its descendant v.\n\nYou are given the directed graph with N vertices and N-1+M edges after Takahashi added edges.\nMore specifically, you are given N-1+M pairs of integers, (A_1, B_1), ..., (A_{N-1+M}, B_{N-1+M}), which represent that the i-th edge extends from Vertex A_i to Vertex B_i.\n\nRestore the original rooted tree.\n\nNotes\n\nFor \"tree\" and other related terms in graph theory, see the article in Wikipedia, for example.\n\nConstraints\n\n3 \\leq N\n\n1 \\leq M\n\nN + M \\leq 10^5\n\n1 \\leq A_i, B_i \\leq N\n\nA_i \\neq B_i\n\nIf i \\neq j, (A_i, B_i) \\neq (A_j, B_j).\n\nThe graph in input can be obtained by adding M edges satisfying the condition in the problem statement to a rooted tree with N vertices.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\n:\nA_{N-1+M} B_{N-1+M}\n\nOutput\n\nPrint N lines.\nIn the i-th line, print 0 if Vertex i is the root of the original tree, and otherwise print the integer representing the parent of Vertex i in the original tree.\n\nNote that it can be shown that the original tree is uniquely determined.\n\nSample Input 1\n\n3 1\n1 2\n1 3\n2 3\n\nSample Output 1\n\n0\n1\n2\n\nThe graph in this input is shown below:\n\nIt can be seen that this graph is obtained by adding the edge 1 \\rightarrow 3 to the rooted tree 1 \\rightarrow 2 \\rightarrow 3.\n\nSample Input 2\n\n6 3\n2 1\n2 3\n4 1\n4 2\n6 1\n2 6\n4 6\n6 5\n\nSample Output 2\n\n6\n4\n2\n0\n6\n2", "sample_input": "3 1\n1 2\n1 3\n2 3\n"}, "reference_outputs": ["0\n1\n2\n"], "source_document_id": "p03142", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a rooted tree (see Notes) with N vertices numbered 1 to N.\nEach of the vertices, except the root, has a directed edge coming from its parent.\nNote that the root may not be Vertex 1.\n\nTakahashi has added M new directed edges to this graph.\nEach of these M edges, u \\rightarrow v, extends from some vertex u to its descendant v.\n\nYou are given the directed graph with N vertices and N-1+M edges after Takahashi added edges.\nMore specifically, you are given N-1+M pairs of integers, (A_1, B_1), ..., (A_{N-1+M}, B_{N-1+M}), which represent that the i-th edge extends from Vertex A_i to Vertex B_i.\n\nRestore the original rooted tree.\n\nNotes\n\nFor \"tree\" and other related terms in graph theory, see the article in Wikipedia, for example.\n\nConstraints\n\n3 \\leq N\n\n1 \\leq M\n\nN + M \\leq 10^5\n\n1 \\leq A_i, B_i \\leq N\n\nA_i \\neq B_i\n\nIf i \\neq j, (A_i, B_i) \\neq (A_j, B_j).\n\nThe graph in input can be obtained by adding M edges satisfying the condition in the problem statement to a rooted tree with N vertices.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\n:\nA_{N-1+M} B_{N-1+M}\n\nOutput\n\nPrint N lines.\nIn the i-th line, print 0 if Vertex i is the root of the original tree, and otherwise print the integer representing the parent of Vertex i in the original tree.\n\nNote that it can be shown that the original tree is uniquely determined.\n\nSample Input 1\n\n3 1\n1 2\n1 3\n2 3\n\nSample Output 1\n\n0\n1\n2\n\nThe graph in this input is shown below:\n\nIt can be seen that this graph is obtained by adding the edge 1 \\rightarrow 3 to the rooted tree 1 \\rightarrow 2 \\rightarrow 3.\n\nSample Input 2\n\n6 3\n2 1\n2 3\n4 1\n4 2\n6 1\n2 6\n4 6\n6 5\n\nSample Output 2\n\n6\n4\n2\n0\n6\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 791, "cpu_time_ms": 103, "memory_kb": 15104}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s839894861", "group_id": "codeNet:p03142", "input_text": "\nlet rec fix f x = f (fix f) x;;\nScanf.(Array.(scanf \" %d %d\" @@ fun n m ->\n  let e = make n [] in\n  let e_rev = make n [] in\n  init (n-1+m) (fun i -> scanf \" %d %d\" @@ fun u v ->\n    let u,v = u-1,v-1 in\n    e.(u) <- v :: e.(u);\n    e_rev.(v) <- u :: e_rev.(v)\n  ) |> ignore;\n  let root = fst @@ fold_left (fun (root,i) ls ->\n    (if List.length ls = 0 then i else root),i+1\n  ) (0,0) e_rev in\n  let dep = make n (-7) in\n  fix (fun f i d ->\n    if dep.(i) < d then (\n      dep.(i) <- max dep.(i) d;\n      List.iter (fun j ->\n        f j (d+1)\n      ) e.(i)\n    )\n  ) root 0;\n  (* iteri (fun i d -> Printf.printf \"%d: %d\\n\" i d) dep; *)\n  let res = make n 0 in\n  let done_ = make n false in\n  fix (fun f i d ->\n    List.iter (fun j ->\n      if done_.(j) then ()\n      else (\n        if dep.(j) = d + 1 then (\n          res.(j) <- i + 1;\n          done_.(j) <- true;\n        );\n        f j (d+1)\n      )\n    ) e.(i)\n  ) root 0;\n  res.(root) <- 0;\n  iter (fun d -> Printf.printf \"%d\\n\" d) res;\n));;", "language": "OCaml", "metadata": {"date": 1548670586, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03142.html", "problem_id": "p03142", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03142/input.txt", "sample_output_relpath": "derived/input_output/data/p03142/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03142/OCaml/s839894861.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s839894861", "user_id": "u481480055"}, "prompt_components": {"gold_output": "0\n1\n2\n", "input_to_evaluate": "\nlet rec fix f x = f (fix f) x;;\nScanf.(Array.(scanf \" %d %d\" @@ fun n m ->\n  let e = make n [] in\n  let e_rev = make n [] in\n  init (n-1+m) (fun i -> scanf \" %d %d\" @@ fun u v ->\n    let u,v = u-1,v-1 in\n    e.(u) <- v :: e.(u);\n    e_rev.(v) <- u :: e_rev.(v)\n  ) |> ignore;\n  let root = fst @@ fold_left (fun (root,i) ls ->\n    (if List.length ls = 0 then i else root),i+1\n  ) (0,0) e_rev in\n  let dep = make n (-7) in\n  fix (fun f i d ->\n    if dep.(i) < d then (\n      dep.(i) <- max dep.(i) d;\n      List.iter (fun j ->\n        f j (d+1)\n      ) e.(i)\n    )\n  ) root 0;\n  (* iteri (fun i d -> Printf.printf \"%d: %d\\n\" i d) dep; *)\n  let res = make n 0 in\n  let done_ = make n false in\n  fix (fun f i d ->\n    List.iter (fun j ->\n      if done_.(j) then ()\n      else (\n        if dep.(j) = d + 1 then (\n          res.(j) <- i + 1;\n          done_.(j) <- true;\n        );\n        f j (d+1)\n      )\n    ) e.(i)\n  ) root 0;\n  res.(root) <- 0;\n  iter (fun d -> Printf.printf \"%d\\n\" d) res;\n));;", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a rooted tree (see Notes) with N vertices numbered 1 to N.\nEach of the vertices, except the root, has a directed edge coming from its parent.\nNote that the root may not be Vertex 1.\n\nTakahashi has added M new directed edges to this graph.\nEach of these M edges, u \\rightarrow v, extends from some vertex u to its descendant v.\n\nYou are given the directed graph with N vertices and N-1+M edges after Takahashi added edges.\nMore specifically, you are given N-1+M pairs of integers, (A_1, B_1), ..., (A_{N-1+M}, B_{N-1+M}), which represent that the i-th edge extends from Vertex A_i to Vertex B_i.\n\nRestore the original rooted tree.\n\nNotes\n\nFor \"tree\" and other related terms in graph theory, see the article in Wikipedia, for example.\n\nConstraints\n\n3 \\leq N\n\n1 \\leq M\n\nN + M \\leq 10^5\n\n1 \\leq A_i, B_i \\leq N\n\nA_i \\neq B_i\n\nIf i \\neq j, (A_i, B_i) \\neq (A_j, B_j).\n\nThe graph in input can be obtained by adding M edges satisfying the condition in the problem statement to a rooted tree with N vertices.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\n:\nA_{N-1+M} B_{N-1+M}\n\nOutput\n\nPrint N lines.\nIn the i-th line, print 0 if Vertex i is the root of the original tree, and otherwise print the integer representing the parent of Vertex i in the original tree.\n\nNote that it can be shown that the original tree is uniquely determined.\n\nSample Input 1\n\n3 1\n1 2\n1 3\n2 3\n\nSample Output 1\n\n0\n1\n2\n\nThe graph in this input is shown below:\n\nIt can be seen that this graph is obtained by adding the edge 1 \\rightarrow 3 to the rooted tree 1 \\rightarrow 2 \\rightarrow 3.\n\nSample Input 2\n\n6 3\n2 1\n2 3\n4 1\n4 2\n6 1\n2 6\n4 6\n6 5\n\nSample Output 2\n\n6\n4\n2\n0\n6\n2", "sample_input": "3 1\n1 2\n1 3\n2 3\n"}, "reference_outputs": ["0\n1\n2\n"], "source_document_id": "p03142", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a rooted tree (see Notes) with N vertices numbered 1 to N.\nEach of the vertices, except the root, has a directed edge coming from its parent.\nNote that the root may not be Vertex 1.\n\nTakahashi has added M new directed edges to this graph.\nEach of these M edges, u \\rightarrow v, extends from some vertex u to its descendant v.\n\nYou are given the directed graph with N vertices and N-1+M edges after Takahashi added edges.\nMore specifically, you are given N-1+M pairs of integers, (A_1, B_1), ..., (A_{N-1+M}, B_{N-1+M}), which represent that the i-th edge extends from Vertex A_i to Vertex B_i.\n\nRestore the original rooted tree.\n\nNotes\n\nFor \"tree\" and other related terms in graph theory, see the article in Wikipedia, for example.\n\nConstraints\n\n3 \\leq N\n\n1 \\leq M\n\nN + M \\leq 10^5\n\n1 \\leq A_i, B_i \\leq N\n\nA_i \\neq B_i\n\nIf i \\neq j, (A_i, B_i) \\neq (A_j, B_j).\n\nThe graph in input can be obtained by adding M edges satisfying the condition in the problem statement to a rooted tree with N vertices.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 B_1\n:\nA_{N-1+M} B_{N-1+M}\n\nOutput\n\nPrint N lines.\nIn the i-th line, print 0 if Vertex i is the root of the original tree, and otherwise print the integer representing the parent of Vertex i in the original tree.\n\nNote that it can be shown that the original tree is uniquely determined.\n\nSample Input 1\n\n3 1\n1 2\n1 3\n2 3\n\nSample Output 1\n\n0\n1\n2\n\nThe graph in this input is shown below:\n\nIt can be seen that this graph is obtained by adding the edge 1 \\rightarrow 3 to the rooted tree 1 \\rightarrow 2 \\rightarrow 3.\n\nSample Input 2\n\n6 3\n2 1\n2 3\n4 1\n4 2\n6 1\n2 6\n4 6\n6 5\n\nSample Output 2\n\n6\n4\n2\n0\n6\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 996, "cpu_time_ms": 2104, "memory_kb": 26112}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s844469335", "group_id": "codeNet:p03145", "input_text": "Scanf.scanf \" %d %d %d\" @@ fun u v _ -> print_int @@ u*v", "language": "OCaml", "metadata": {"date": 1549282751, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03145.html", "problem_id": "p03145", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03145/input.txt", "sample_output_relpath": "derived/input_output/data/p03145/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03145/OCaml/s844469335.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s844469335", "user_id": "u481480055"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "Scanf.scanf \" %d %d %d\" @@ fun u v _ -> print_int @@ u*v", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a right triangle ABC with ∠ABC=90°.\n\nGiven the lengths of the three sides, |AB|,|BC| and |CA|, find the area of the right triangle ABC.\n\nIt is guaranteed that the area of the triangle ABC is an integer.\n\nConstraints\n\n1 \\leq |AB|,|BC|,|CA| \\leq 100\n\nAll values in input are integers.\n\nThe area of the triangle ABC is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\n|AB| |BC| |CA|\n\nOutput\n\nPrint the area of the triangle ABC.\n\nSample Input 1\n\n3 4 5\n\nSample Output 1\n\n6\n\nThis triangle has an area of 6.\n\nSample Input 2\n\n5 12 13\n\nSample Output 2\n\n30\n\nThis triangle has an area of 30.\n\nSample Input 3\n\n45 28 53\n\nSample Output 3\n\n630\n\nThis triangle has an area of 630.", "sample_input": "3 4 5\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03145", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a right triangle ABC with ∠ABC=90°.\n\nGiven the lengths of the three sides, |AB|,|BC| and |CA|, find the area of the right triangle ABC.\n\nIt is guaranteed that the area of the triangle ABC is an integer.\n\nConstraints\n\n1 \\leq |AB|,|BC|,|CA| \\leq 100\n\nAll values in input are integers.\n\nThe area of the triangle ABC is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\n|AB| |BC| |CA|\n\nOutput\n\nPrint the area of the triangle ABC.\n\nSample Input 1\n\n3 4 5\n\nSample Output 1\n\n6\n\nThis triangle has an area of 6.\n\nSample Input 2\n\n5 12 13\n\nSample Output 2\n\n30\n\nThis triangle has an area of 30.\n\nSample Input 3\n\n45 28 53\n\nSample Output 3\n\n630\n\nThis triangle has an area of 630.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 56, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s180796984", "group_id": "codeNet:p03145", "input_text": "Printf.printf \"%d\\n\" (Scanf.scanf \"%d %d\" (fun a b -> a * b / 2))", "language": "OCaml", "metadata": {"date": 1549278927, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03145.html", "problem_id": "p03145", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03145/input.txt", "sample_output_relpath": "derived/input_output/data/p03145/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03145/OCaml/s180796984.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s180796984", "user_id": "u798181098"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "Printf.printf \"%d\\n\" (Scanf.scanf \"%d %d\" (fun a b -> a * b / 2))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a right triangle ABC with ∠ABC=90°.\n\nGiven the lengths of the three sides, |AB|,|BC| and |CA|, find the area of the right triangle ABC.\n\nIt is guaranteed that the area of the triangle ABC is an integer.\n\nConstraints\n\n1 \\leq |AB|,|BC|,|CA| \\leq 100\n\nAll values in input are integers.\n\nThe area of the triangle ABC is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\n|AB| |BC| |CA|\n\nOutput\n\nPrint the area of the triangle ABC.\n\nSample Input 1\n\n3 4 5\n\nSample Output 1\n\n6\n\nThis triangle has an area of 6.\n\nSample Input 2\n\n5 12 13\n\nSample Output 2\n\n30\n\nThis triangle has an area of 30.\n\nSample Input 3\n\n45 28 53\n\nSample Output 3\n\n630\n\nThis triangle has an area of 630.", "sample_input": "3 4 5\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03145", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a right triangle ABC with ∠ABC=90°.\n\nGiven the lengths of the three sides, |AB|,|BC| and |CA|, find the area of the right triangle ABC.\n\nIt is guaranteed that the area of the triangle ABC is an integer.\n\nConstraints\n\n1 \\leq |AB|,|BC|,|CA| \\leq 100\n\nAll values in input are integers.\n\nThe area of the triangle ABC is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\n|AB| |BC| |CA|\n\nOutput\n\nPrint the area of the triangle ABC.\n\nSample Input 1\n\n3 4 5\n\nSample Output 1\n\n6\n\nThis triangle has an area of 6.\n\nSample Input 2\n\n5 12 13\n\nSample Output 2\n\n30\n\nThis triangle has an area of 30.\n\nSample Input 3\n\n45 28 53\n\nSample Output 3\n\n630\n\nThis triangle has an area of 630.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 65, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s327202482", "group_id": "codeNet:p03146", "input_text": "Scanf.(Array.(scanf \" %d\" @@ fun n ->\n  let a = make 2000000 false in\n  let col n = if n mod 2 = 0 then n/2 else 3*n+1 in\n  let rec f i x = if a.(x) then i else\n    (a.(x) <- true; f (i+1) (col x))\n  in print_int @@ f 1 n))", "language": "OCaml", "metadata": {"date": 1549283767, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s327202482.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s327202482", "user_id": "u481480055"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "Scanf.(Array.(scanf \" %d\" @@ fun n ->\n  let a = make 2000000 false in\n  let col n = if n mod 2 = 0 then n/2 else 3*n+1 in\n  let rec f i x = if a.(x) then i else\n    (a.(x) <- true; f (i+1) (col x))\n  in print_int @@ f 1 n))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "sample_input": "8\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03146", "source_text": "Score : 200 points\n\nProblem Statement\n\nA sequence a=\\{a_1,a_2,a_3,......\\} is determined as follows:\n\nThe first term s is given as input.\n\nLet f(n) be the following function: f(n) = n/2 if n is even, and f(n) = 3n+1 if n is odd.\n\na_i = s when i = 1, and a_i = f(a_{i-1}) when i > 1.\n\nFind the minimum integer m that satisfies the following condition:\n\nThere exists an integer n such that a_m = a_n (m > n).\n\nConstraints\n\n1 \\leq s \\leq 100\n\nAll values in input are integers.\n\nIt is guaranteed that all elements in a and the minimum m that satisfies the condition are at most 1000000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the minimum integer m that satisfies the condition.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n5\n\na=\\{8,4,2,1,4,2,1,4,2,1,......\\}. As a_5=a_2, the answer is 5.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n18\n\na=\\{7,22,11,34,17,52,26,13,40,20,10,5,16,8,4,2,1,4,2,1,......\\}.\n\nSample Input 3\n\n54\n\nSample Output 3\n\n114", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 223, "cpu_time_ms": 14, "memory_kb": 19452}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s867063782", "group_id": "codeNet:p03147", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let h = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun h -> h)) in\n    let m = Array.fold_left max 0 h in\n\n    let rec loop i x mode acc =\n        if i > m then acc else\n            if x = n then loop (i + 1) 0 0 (if mode = 0 then acc else acc + 1) else\n            if h.(x) >= i then loop i (x + 1) 1 acc else\n                let acc = if mode = 0 then acc else acc + 1 in\n                loop i (x + 1) 0 acc\n    in\n    loop 1 0 0 0 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1593464658, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s867063782.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s867063782", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let h = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun h -> h)) in\n    let m = Array.fold_left max 0 h in\n\n    let rec loop i x mode acc =\n        if i > m then acc else\n            if x = n then loop (i + 1) 0 0 (if mode = 0 then acc else acc + 1) else\n            if h.(x) >= i then loop i (x + 1) 1 acc else\n                let acc = if mode = 0 then acc else acc + 1 in\n                loop i (x + 1) 0 acc\n    in\n    loop 1 0 0 0 |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIn a flower bed, there are N flowers, numbered 1,2,......,N. Initially, the heights of all flowers are 0.\nYou are given a sequence h=\\{h_1,h_2,h_3,......\\} as input. You would like to change the height of Flower k to h_k for all k (1 \\leq k \\leq N), by repeating the following \"watering\" operation:\n\nSpecify integers l and r. Increase the height of Flower x by 1 for all x such that l \\leq x \\leq r.\n\nFind the minimum number of watering operations required to satisfy the condition.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq h_i \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 h_3 ...... h_N\n\nOutput\n\nPrint the minimum number of watering operations required to satisfy the condition.\n\nSample Input 1\n\n4\n1 2 2 1\n\nSample Output 1\n\n2\n\nThe minimum number of watering operations required is 2.\nOne way to achieve it is:\n\nPerform the operation with (l,r)=(1,3).\n\nPerform the operation with (l,r)=(2,4).\n\nSample Input 2\n\n5\n3 1 2 3 1\n\nSample Output 2\n\n5\n\nSample Input 3\n\n8\n4 23 75 0 23 96 50 100\n\nSample Output 3\n\n221", "sample_input": "4\n1 2 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03147", "source_text": "Score : 300 points\n\nProblem Statement\n\nIn a flower bed, there are N flowers, numbered 1,2,......,N. Initially, the heights of all flowers are 0.\nYou are given a sequence h=\\{h_1,h_2,h_3,......\\} as input. You would like to change the height of Flower k to h_k for all k (1 \\leq k \\leq N), by repeating the following \"watering\" operation:\n\nSpecify integers l and r. Increase the height of Flower x by 1 for all x such that l \\leq x \\leq r.\n\nFind the minimum number of watering operations required to satisfy the condition.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq h_i \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nh_1 h_2 h_3 ...... h_N\n\nOutput\n\nPrint the minimum number of watering operations required to satisfy the condition.\n\nSample Input 1\n\n4\n1 2 2 1\n\nSample Output 1\n\n2\n\nThe minimum number of watering operations required is 2.\nOne way to achieve it is:\n\nPerform the operation with (l,r)=(1,3).\n\nPerform the operation with (l,r)=(2,4).\n\nSample Input 2\n\n5\n3 1 2 3 1\n\nSample Output 2\n\n5\n\nSample Input 3\n\n8\n4 23 75 0 23 96 50 100\n\nSample Output 3\n\n221", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 490, "cpu_time_ms": 8, "memory_kb": 3796}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s963718805", "group_id": "codeNet:p03148", "input_text": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let tds = Array.init n @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun t d -> t - 1, d in\n  Array.sort (fun (_, d) (_, d') -> compare d' d) tds;\n  let q = Queue.create () in\n  let s = Stack.create () in\n  let sum = ref 0 in\n  let kind = ref 0 in\n  let card = Hashtbl.create n in\n  for i = 0 to k - 1 do\n    sum := !sum + snd tds.(i);\n    Hashtbl.replace card (fst tds.(i))\n      (1 + try Hashtbl.find card (fst tds.(i)) with Not_found -> 0);\n    if Hashtbl.find card (fst tds.(i)) = 1\n    then incr kind\n    else Stack.push (snd tds.(i)) s\n  done;\n  for i = k to n - 1 do\n    Hashtbl.replace card (fst tds.(i))\n      (1 + try Hashtbl.find card (fst tds.(i)) with Not_found -> 0);\n    if Hashtbl.find card (fst tds.(i)) = 1 then Queue.push (snd tds.(i)) q\n  done;\n  let sat = ref (!sum + !kind * !kind) in\n  while not (Stack.is_empty s) && not (Queue.is_empty q) do\n    sum := !sum + Queue.pop q - Stack.pop s;\n    incr kind;\n    sat := max !sat (!sum + !kind * !kind)\n  done;\n  Printf.printf \"%d\\n\" !sat\n", "language": "OCaml", "metadata": {"date": 1552764227, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s963718805.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s963718805", "user_id": "u504158101"}, "prompt_components": {"gold_output": "26\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let tds = Array.init n @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun t d -> t - 1, d in\n  Array.sort (fun (_, d) (_, d') -> compare d' d) tds;\n  let q = Queue.create () in\n  let s = Stack.create () in\n  let sum = ref 0 in\n  let kind = ref 0 in\n  let card = Hashtbl.create n in\n  for i = 0 to k - 1 do\n    sum := !sum + snd tds.(i);\n    Hashtbl.replace card (fst tds.(i))\n      (1 + try Hashtbl.find card (fst tds.(i)) with Not_found -> 0);\n    if Hashtbl.find card (fst tds.(i)) = 1\n    then incr kind\n    else Stack.push (snd tds.(i)) s\n  done;\n  for i = k to n - 1 do\n    Hashtbl.replace card (fst tds.(i))\n      (1 + try Hashtbl.find card (fst tds.(i)) with Not_found -> 0);\n    if Hashtbl.find card (fst tds.(i)) = 1 then Queue.push (snd tds.(i)) q\n  done;\n  let sat = ref (!sum + !kind * !kind) in\n  while not (Stack.is_empty s) && not (Queue.is_empty q) do\n    sum := !sum + Queue.pop q - Stack.pop s;\n    incr kind;\n    sat := max !sat (!sum + !kind * !kind)\n  done;\n  Printf.printf \"%d\\n\" !sat\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N pieces of sushi. Each piece has two parameters: \"kind of topping\" t_i and \"deliciousness\" d_i.\nYou are choosing K among these N pieces to eat.\nYour \"satisfaction\" here will be calculated as follows:\n\nThe satisfaction is the sum of the \"base total deliciousness\" and the \"variety bonus\".\n\nThe base total deliciousness is the sum of the deliciousness of the pieces you eat.\n\nThe variety bonus is x*x, where x is the number of different kinds of toppings of the pieces you eat.\n\nYou want to have as much satisfaction as possible.\nFind this maximum satisfaction.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 10^5\n\n1 \\leq t_i \\leq N\n\n1 \\leq d_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nt_1 d_1\nt_2 d_2\n.\n.\n.\nt_N d_N\n\nOutput\n\nPrint the maximum satisfaction that you can obtain.\n\nSample Input 1\n\n5 3\n1 9\n1 7\n2 6\n2 5\n3 1\n\nSample Output 1\n\n26\n\nIf you eat Sushi 1,2 and 3:\n\nThe base total deliciousness is 9+7+6=22.\n\nThe variety bonus is 2*2=4.\n\nThus, your satisfaction will be 26, which is optimal.\n\nSample Input 2\n\n7 4\n1 1\n2 1\n3 1\n4 6\n4 5\n4 5\n4 5\n\nSample Output 2\n\n25\n\nIt is optimal to eat Sushi 1,2,3 and 4.\n\nSample Input 3\n\n6 5\n5 1000000000\n2 990000000\n3 980000000\n6 970000000\n6 960000000\n4 950000000\n\nSample Output 3\n\n4900000016\n\nNote that the output may not fit into a 32-bit integer type.", "sample_input": "5 3\n1 9\n1 7\n2 6\n2 5\n3 1\n"}, "reference_outputs": ["26\n"], "source_document_id": "p03148", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N pieces of sushi. Each piece has two parameters: \"kind of topping\" t_i and \"deliciousness\" d_i.\nYou are choosing K among these N pieces to eat.\nYour \"satisfaction\" here will be calculated as follows:\n\nThe satisfaction is the sum of the \"base total deliciousness\" and the \"variety bonus\".\n\nThe base total deliciousness is the sum of the deliciousness of the pieces you eat.\n\nThe variety bonus is x*x, where x is the number of different kinds of toppings of the pieces you eat.\n\nYou want to have as much satisfaction as possible.\nFind this maximum satisfaction.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 10^5\n\n1 \\leq t_i \\leq N\n\n1 \\leq d_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nt_1 d_1\nt_2 d_2\n.\n.\n.\nt_N d_N\n\nOutput\n\nPrint the maximum satisfaction that you can obtain.\n\nSample Input 1\n\n5 3\n1 9\n1 7\n2 6\n2 5\n3 1\n\nSample Output 1\n\n26\n\nIf you eat Sushi 1,2 and 3:\n\nThe base total deliciousness is 9+7+6=22.\n\nThe variety bonus is 2*2=4.\n\nThus, your satisfaction will be 26, which is optimal.\n\nSample Input 2\n\n7 4\n1 1\n2 1\n3 1\n4 6\n4 5\n4 5\n4 5\n\nSample Output 2\n\n25\n\nIt is optimal to eat Sushi 1,2,3 and 4.\n\nSample Input 3\n\n6 5\n5 1000000000\n2 990000000\n3 980000000\n6 970000000\n6 960000000\n4 950000000\n\nSample Output 3\n\n4900000016\n\nNote that the output may not fit into a 32-bit integer type.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1044, "cpu_time_ms": 134, "memory_kb": 11904}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s523585501", "group_id": "codeNet:p03148", "input_text": "let rv f p q = f q p\nmodule MultiSet_test = struct\n  module Make (X:Map.OrderedType) = struct\n    include Map.Make(X)\n    let count v set =\n      try find v set with Not_found -> 0\n    let remove_each v set =\n      let k = count v set in\n      if k<=0 then raise Not_found\n      else if k=1 then remove v set\n      else add v (k-1) set\n    let add_each v set =\n      let k = count v set in\n      if k=0 then add v 1 set\n      else add v (k+1) set\n    let iter_each f set =\n      let rec f0 k = function\n      | 0 -> ()\n      | i -> let () = f k in f0 k (i-1)\n      in iter f0 set\n    let fold_each f set ac =\n      let rec f0 k i ac = match i with\n      | 0 -> ac\n      | i -> f0 k (i-1) (f k ac)\n      in fold f0 set ac\n    let bindings_each set =\n      fold_each (fun v ls -> v::ls) set []\n      |> List.rev\n    let min_binding_each set = fst @@ min_binding set\n    let max_binding_each set = fst @@ max_binding set\n    let exists_each f = exists (fun k _ -> f k)\n    let cardinal_each set = (* slow *)\n      fold (fun _ v sum -> sum + v) set 0\n  end\nend\nmodule IRSet = MultiSet_test.Make (struct type t = int let compare = rv compare end);;\nScanf.(Array.(scanf \" %d %d\" @@ fun n k ->\n  let t,d = make n 0,make n 0 in\n  let repr = make n 0 in\n  init n (fun i -> scanf \" %d %d\" @@ fun u v ->\n    t.(i) <- u-1; d.(i) <- v;\n    repr.(t.(i)) <- max v repr.(t.(i))\n  ) |> ignore;\n  let rest = init n (fun _ -> IRSet.empty) in\n  init n (fun i ->\n    (* if repr.(t.(i)) <> d.(i) then *)\n      rest.(t.(i)) <- IRSet.add_each d.(i) rest.(t.(i))\n  ) |> ignore;\n  iteri (fun i v ->\n    if v>0 then rest.(i) <- IRSet.remove_each v rest.(i)\n  ) repr;\n  (* iteri (fun i set ->\n    Printf.printf \"%d: \" @@ i+1; IRSet.iter_each (Printf.printf \"%2d \") set;\n    print_newline ()\n  ) rest;\n  iteri (fun i v ->\n    Printf.printf \"%d:%d\\n\" (i+1) v;\n  ) repr; *)\n  let repr = to_list repr\n  |> List.mapi (fun i v -> v,i)\n  |> List.filter (fun (v,i) -> v <> 0)\n  |> List.sort (rv compare)\n  in\n  (* List.iter (fun (v,i) -> Printf.printf \"%d:%d; \" v @@ i+1) repr; print_newline (); *)\n  let _,_,_,res,_ = init n (fun w -> w+1)\n  |> fold_left (fun ((best,sum_best,repr,res,car_best) as u) w -> match repr with\n    | [] -> u\n    | (v,i)::t -> (\n      (* Printf.printf \"rest.(%d) :: \" @@ i+1;\n      IRSet.iter_each (Printf.printf \"%d \") rest.(i); print_newline (); *)\n      let best = IRSet.merge (fun i p q -> match p,q with\n      | Some p,Some q -> Some (p+q)\n      | Some p,_ | _,Some p -> Some p\n      | None,None -> None\n      ) best rest.(i) in\n      let car_best = car_best + IRSet.cardinal_each rest.(i) in\n      (* Printf.printf \"car_best=%2d; i=%d\\n\" car_best @@ i+1; *)\n      rest.(i) <- IRSet.empty;\n      (* Printf.printf \"%d :: \" (k-w);\n      IRSet.iter_each (Printf.printf \"%d \") best; print_newline (); *)\n      if k - w < 0 || car_best < k - w then (\n        (best,sum_best+v,t,res,car_best)\n      ) else\n      let u = ref @@ IRSet.empty in\n      (* Printf.printf \"take: %d\\n\" (k-w); *)\n      let best,sum = init (k-w) (fun i -> i)\n      |> fold_left (fun (set,sum) _ ->\n        let v = IRSet.min_binding_each set in\n        u := IRSet.add_each v !u;\n        (IRSet.remove_each v set,sum+v)\n        (* (set,sum+v) *)\n      ) (best,0)\n      in\n      let best = IRSet.merge (fun i p q -> match p,q with\n      | Some p,Some q -> Some (p+q)\n      | Some p,_ | _,Some p -> Some p\n      | None,None -> None\n      ) best !u in\n      (* Printf.printf \"  %6d v. %6d :: %2d + %2d + %2d\\n\"\n        res\n        (w*w + sum + sum_best + v)\n        (w*w)\n        sum\n        (sum_best + v); *)\n      (best,sum_best+v,t,max res (w*w + sum + sum_best + v),car_best)\n    )\n  ) (IRSet.empty,0,repr,0,0) in\n  print_int res\n));;\n", "language": "OCaml", "metadata": {"date": 1549722467, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s523585501.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s523585501", "user_id": "u481480055"}, "prompt_components": {"gold_output": "26\n", "input_to_evaluate": "let rv f p q = f q p\nmodule MultiSet_test = struct\n  module Make (X:Map.OrderedType) = struct\n    include Map.Make(X)\n    let count v set =\n      try find v set with Not_found -> 0\n    let remove_each v set =\n      let k = count v set in\n      if k<=0 then raise Not_found\n      else if k=1 then remove v set\n      else add v (k-1) set\n    let add_each v set =\n      let k = count v set in\n      if k=0 then add v 1 set\n      else add v (k+1) set\n    let iter_each f set =\n      let rec f0 k = function\n      | 0 -> ()\n      | i -> let () = f k in f0 k (i-1)\n      in iter f0 set\n    let fold_each f set ac =\n      let rec f0 k i ac = match i with\n      | 0 -> ac\n      | i -> f0 k (i-1) (f k ac)\n      in fold f0 set ac\n    let bindings_each set =\n      fold_each (fun v ls -> v::ls) set []\n      |> List.rev\n    let min_binding_each set = fst @@ min_binding set\n    let max_binding_each set = fst @@ max_binding set\n    let exists_each f = exists (fun k _ -> f k)\n    let cardinal_each set = (* slow *)\n      fold (fun _ v sum -> sum + v) set 0\n  end\nend\nmodule IRSet = MultiSet_test.Make (struct type t = int let compare = rv compare end);;\nScanf.(Array.(scanf \" %d %d\" @@ fun n k ->\n  let t,d = make n 0,make n 0 in\n  let repr = make n 0 in\n  init n (fun i -> scanf \" %d %d\" @@ fun u v ->\n    t.(i) <- u-1; d.(i) <- v;\n    repr.(t.(i)) <- max v repr.(t.(i))\n  ) |> ignore;\n  let rest = init n (fun _ -> IRSet.empty) in\n  init n (fun i ->\n    (* if repr.(t.(i)) <> d.(i) then *)\n      rest.(t.(i)) <- IRSet.add_each d.(i) rest.(t.(i))\n  ) |> ignore;\n  iteri (fun i v ->\n    if v>0 then rest.(i) <- IRSet.remove_each v rest.(i)\n  ) repr;\n  (* iteri (fun i set ->\n    Printf.printf \"%d: \" @@ i+1; IRSet.iter_each (Printf.printf \"%2d \") set;\n    print_newline ()\n  ) rest;\n  iteri (fun i v ->\n    Printf.printf \"%d:%d\\n\" (i+1) v;\n  ) repr; *)\n  let repr = to_list repr\n  |> List.mapi (fun i v -> v,i)\n  |> List.filter (fun (v,i) -> v <> 0)\n  |> List.sort (rv compare)\n  in\n  (* List.iter (fun (v,i) -> Printf.printf \"%d:%d; \" v @@ i+1) repr; print_newline (); *)\n  let _,_,_,res,_ = init n (fun w -> w+1)\n  |> fold_left (fun ((best,sum_best,repr,res,car_best) as u) w -> match repr with\n    | [] -> u\n    | (v,i)::t -> (\n      (* Printf.printf \"rest.(%d) :: \" @@ i+1;\n      IRSet.iter_each (Printf.printf \"%d \") rest.(i); print_newline (); *)\n      let best = IRSet.merge (fun i p q -> match p,q with\n      | Some p,Some q -> Some (p+q)\n      | Some p,_ | _,Some p -> Some p\n      | None,None -> None\n      ) best rest.(i) in\n      let car_best = car_best + IRSet.cardinal_each rest.(i) in\n      (* Printf.printf \"car_best=%2d; i=%d\\n\" car_best @@ i+1; *)\n      rest.(i) <- IRSet.empty;\n      (* Printf.printf \"%d :: \" (k-w);\n      IRSet.iter_each (Printf.printf \"%d \") best; print_newline (); *)\n      if k - w < 0 || car_best < k - w then (\n        (best,sum_best+v,t,res,car_best)\n      ) else\n      let u = ref @@ IRSet.empty in\n      (* Printf.printf \"take: %d\\n\" (k-w); *)\n      let best,sum = init (k-w) (fun i -> i)\n      |> fold_left (fun (set,sum) _ ->\n        let v = IRSet.min_binding_each set in\n        u := IRSet.add_each v !u;\n        (IRSet.remove_each v set,sum+v)\n        (* (set,sum+v) *)\n      ) (best,0)\n      in\n      let best = IRSet.merge (fun i p q -> match p,q with\n      | Some p,Some q -> Some (p+q)\n      | Some p,_ | _,Some p -> Some p\n      | None,None -> None\n      ) best !u in\n      (* Printf.printf \"  %6d v. %6d :: %2d + %2d + %2d\\n\"\n        res\n        (w*w + sum + sum_best + v)\n        (w*w)\n        sum\n        (sum_best + v); *)\n      (best,sum_best+v,t,max res (w*w + sum + sum_best + v),car_best)\n    )\n  ) (IRSet.empty,0,repr,0,0) in\n  print_int res\n));;\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N pieces of sushi. Each piece has two parameters: \"kind of topping\" t_i and \"deliciousness\" d_i.\nYou are choosing K among these N pieces to eat.\nYour \"satisfaction\" here will be calculated as follows:\n\nThe satisfaction is the sum of the \"base total deliciousness\" and the \"variety bonus\".\n\nThe base total deliciousness is the sum of the deliciousness of the pieces you eat.\n\nThe variety bonus is x*x, where x is the number of different kinds of toppings of the pieces you eat.\n\nYou want to have as much satisfaction as possible.\nFind this maximum satisfaction.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 10^5\n\n1 \\leq t_i \\leq N\n\n1 \\leq d_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nt_1 d_1\nt_2 d_2\n.\n.\n.\nt_N d_N\n\nOutput\n\nPrint the maximum satisfaction that you can obtain.\n\nSample Input 1\n\n5 3\n1 9\n1 7\n2 6\n2 5\n3 1\n\nSample Output 1\n\n26\n\nIf you eat Sushi 1,2 and 3:\n\nThe base total deliciousness is 9+7+6=22.\n\nThe variety bonus is 2*2=4.\n\nThus, your satisfaction will be 26, which is optimal.\n\nSample Input 2\n\n7 4\n1 1\n2 1\n3 1\n4 6\n4 5\n4 5\n4 5\n\nSample Output 2\n\n25\n\nIt is optimal to eat Sushi 1,2,3 and 4.\n\nSample Input 3\n\n6 5\n5 1000000000\n2 990000000\n3 980000000\n6 970000000\n6 960000000\n4 950000000\n\nSample Output 3\n\n4900000016\n\nNote that the output may not fit into a 32-bit integer type.", "sample_input": "5 3\n1 9\n1 7\n2 6\n2 5\n3 1\n"}, "reference_outputs": ["26\n"], "source_document_id": "p03148", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N pieces of sushi. Each piece has two parameters: \"kind of topping\" t_i and \"deliciousness\" d_i.\nYou are choosing K among these N pieces to eat.\nYour \"satisfaction\" here will be calculated as follows:\n\nThe satisfaction is the sum of the \"base total deliciousness\" and the \"variety bonus\".\n\nThe base total deliciousness is the sum of the deliciousness of the pieces you eat.\n\nThe variety bonus is x*x, where x is the number of different kinds of toppings of the pieces you eat.\n\nYou want to have as much satisfaction as possible.\nFind this maximum satisfaction.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 10^5\n\n1 \\leq t_i \\leq N\n\n1 \\leq d_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nt_1 d_1\nt_2 d_2\n.\n.\n.\nt_N d_N\n\nOutput\n\nPrint the maximum satisfaction that you can obtain.\n\nSample Input 1\n\n5 3\n1 9\n1 7\n2 6\n2 5\n3 1\n\nSample Output 1\n\n26\n\nIf you eat Sushi 1,2 and 3:\n\nThe base total deliciousness is 9+7+6=22.\n\nThe variety bonus is 2*2=4.\n\nThus, your satisfaction will be 26, which is optimal.\n\nSample Input 2\n\n7 4\n1 1\n2 1\n3 1\n4 6\n4 5\n4 5\n4 5\n\nSample Output 2\n\n25\n\nIt is optimal to eat Sushi 1,2,3 and 4.\n\nSample Input 3\n\n6 5\n5 1000000000\n2 990000000\n3 980000000\n6 970000000\n6 960000000\n4 950000000\n\nSample Output 3\n\n4900000016\n\nNote that the output may not fit into a 32-bit integer type.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3700, "cpu_time_ms": 2105, "memory_kb": 26240}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s254628931", "group_id": "codeNet:p03150", "input_text": "let s = read_line ()\nlet n = String.length s\nlet _ = for i = 0 to n - 1 do let k = min (n - 1) @@ n + i - 8 in\n  if String.(sub s 0 i ^ sub s (k + 1) (n - 1 - k)) = \"keyence\" then (print_endline \"YES\"; exit 0) done; print_endline \"NO\"", "language": "OCaml", "metadata": {"date": 1568119217, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s254628931.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s254628931", "user_id": "u732304692"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let s = read_line ()\nlet n = String.length s\nlet _ = for i = 0 to n - 1 do let k = min (n - 1) @@ n + i - 8 in\n  if String.(sub s 0 i ^ sub s (k + 1) (n - 1 - k)) = \"keyence\" then (print_endline \"YES\"; exit 0) done; print_endline \"NO\"", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 234, "cpu_time_ms": 2, "memory_kb": 4480}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s848764921", "group_id": "codeNet:p03150", "input_text": "let s = read_line ()\nlet n = String.length s\nlet _ =\n  for i = 0 to n - 1 do\n    for j = i to n do if String.sub s 0 i ^ String.sub s j (n - j) = \"keyence\" then (print_endline \"YES\"; exit 0) done done;\n  print_endline \"NO\"", "language": "OCaml", "metadata": {"date": 1563725806, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s848764921.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s848764921", "user_id": "u732304692"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let s = read_line ()\nlet n = String.length s\nlet _ =\n  for i = 0 to n - 1 do\n    for j = i to n do if String.sub s 0 i ^ String.sub s j (n - j) = \"keyence\" then (print_endline \"YES\"; exit 0) done done;\n  print_endline \"NO\"", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 222, "cpu_time_ms": 2, "memory_kb": 1024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s553775135", "group_id": "codeNet:p03150", "input_text": "let () = \n  let s = read_line () in\n  print_endline @@ if\n    List.exists (( = ) \"keyence\") @@\n    List.concat @@ Array.to_list @@ Array.init (String.length s + 1) @@ fun i ->\n      Array.to_list @@ Array.init (String.length s + 1) @@ fun j ->\n        if j < i then \"\" else String.sub s 0 i ^ String.sub s j (String.length s - j)\n  then \"YES\" else \"NO\"\n\n", "language": "OCaml", "metadata": {"date": 1549208702, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s553775135.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s553775135", "user_id": "u504158101"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let () = \n  let s = read_line () in\n  print_endline @@ if\n    List.exists (( = ) \"keyence\") @@\n    List.concat @@ Array.to_list @@ Array.init (String.length s + 1) @@ fun i ->\n      Array.to_list @@ Array.init (String.length s + 1) @@ fun j ->\n        if j < i then \"\" else String.sub s 0 i ^ String.sub s j (String.length s - j)\n  then \"YES\" else \"NO\"\n\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s085666791", "group_id": "codeNet:p03155", "input_text": "Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d %d %d\" @@ fun n h w -> (n+1-h)*(n+1-w)", "language": "OCaml", "metadata": {"date": 1547351676, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03155.html", "problem_id": "p03155", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03155/input.txt", "sample_output_relpath": "derived/input_output/data/p03155/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03155/OCaml/s085666791.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s085666791", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d %d %d\" @@ fun n h w -> (n+1-h)*(n+1-w)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIt has been decided that a programming contest sponsored by company A will be held, so we will post the notice on a bulletin board.\n\nThe bulletin board is in the form of a grid with N rows and N columns, and the notice will occupy a rectangular region with H rows and W columns.\n\nHow many ways are there to choose where to put the notice so that it completely covers exactly HW squares?\n\nConstraints\n\n1 \\leq H, W \\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\nH\nW\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n2\n3\n\nSample Output 1\n\n2\n\nThere are two ways to put the notice, as follows:\n\n### ...\n### ###\n... ###\n\nHere, # represents a square covered by the notice, and . represents a square not covered.\n\nSample Input 2\n\n100\n1\n1\n\nSample Output 2\n\n10000\n\nSample Input 3\n\n5\n4\n2\n\nSample Output 3\n\n8", "sample_input": "3\n2\n3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03155", "source_text": "Score : 100 points\n\nProblem Statement\n\nIt has been decided that a programming contest sponsored by company A will be held, so we will post the notice on a bulletin board.\n\nThe bulletin board is in the form of a grid with N rows and N columns, and the notice will occupy a rectangular region with H rows and W columns.\n\nHow many ways are there to choose where to put the notice so that it completely covers exactly HW squares?\n\nConstraints\n\n1 \\leq H, W \\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\nH\nW\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n2\n3\n\nSample Output 1\n\n2\n\nThere are two ways to put the notice, as follows:\n\n### ...\n### ###\n... ###\n\nHere, # represents a square covered by the notice, and . represents a square not covered.\n\nSample Input 2\n\n100\n1\n1\n\nSample Output 2\n\n10000\n\nSample Input 3\n\n5\n4\n2\n\nSample Output 3\n\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 78, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s506975805", "group_id": "codeNet:p03156", "input_text": "Scanf.(scanf \" %d %d %d\" @@ fun n a b -> Array.(\n  init n (fun _ -> scanf \" %d\" @@ fun v -> v)\n  |> fold_left (fun (p,q,r) v ->\n    if v<=a then (p+1,q,r)\n    else if v<=b then (p,q+1,r)\n    else (p,q,r+1)) (0,0,0)\n  |> (fun (p,q,r) -> print_int @@ min p (min q r))))", "language": "OCaml", "metadata": {"date": 1547426413, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03156.html", "problem_id": "p03156", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03156/input.txt", "sample_output_relpath": "derived/input_output/data/p03156/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03156/OCaml/s506975805.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s506975805", "user_id": "u481480055"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "Scanf.(scanf \" %d %d %d\" @@ fun n a b -> Array.(\n  init n (fun _ -> scanf \" %d\" @@ fun v -> v)\n  |> fold_left (fun (p,q,r) v ->\n    if v<=a then (p+1,q,r)\n    else if v<=b then (p,q+1,r)\n    else (p,q,r+1)) (0,0,0)\n  |> (fun (p,q,r) -> print_int @@ min p (min q r))))", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have written N problems to hold programming contests.\nThe i-th problem will have a score of P_i points if used in a contest.\n\nWith these problems, you would like to hold as many contests as possible under the following condition:\n\nA contest has three problems. The first problem has a score not greater than A points, the second has a score between A + 1 and B points (inclusive), and the third has a score not less than B + 1 points.\n\nThe same problem should not be used in multiple contests.\nAt most how many contests can be held?\n\nConstraints\n\n3 \\leq N \\leq 100\n\n1 \\leq P_i \\leq 20 (1 \\leq i \\leq N)\n\n1 \\leq A < B < 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA B\nP_1 P_2 ... P_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n5 15\n1 10 16 2 7 20 12\n\nSample Output 1\n\n2\n\nTwo contests can be held by putting the first, second, third problems and the fourth, fifth, sixth problems together.\n\nSample Input 2\n\n8\n3 8\n5 5 5 10 10 10 15 20\n\nSample Output 2\n\n0\n\nNo contest can be held, because there is no problem with a score of A = 3 or less.\n\nSample Input 3\n\n3\n5 6\n5 6 10\n\nSample Output 3\n\n1", "sample_input": "7\n5 15\n1 10 16 2 7 20 12\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03156", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have written N problems to hold programming contests.\nThe i-th problem will have a score of P_i points if used in a contest.\n\nWith these problems, you would like to hold as many contests as possible under the following condition:\n\nA contest has three problems. The first problem has a score not greater than A points, the second has a score between A + 1 and B points (inclusive), and the third has a score not less than B + 1 points.\n\nThe same problem should not be used in multiple contests.\nAt most how many contests can be held?\n\nConstraints\n\n3 \\leq N \\leq 100\n\n1 \\leq P_i \\leq 20 (1 \\leq i \\leq N)\n\n1 \\leq A < B < 20\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA B\nP_1 P_2 ... P_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n5 15\n1 10 16 2 7 20 12\n\nSample Output 1\n\n2\n\nTwo contests can be held by putting the first, second, third problems and the fourth, fifth, sixth problems together.\n\nSample Input 2\n\n8\n3 8\n5 5 5 10 10 10 15 20\n\nSample Output 2\n\n0\n\nNo contest can be held, because there is no problem with a score of A = 3 or less.\n\nSample Input 3\n\n3\n5 6\n5 6 10\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 267, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s264087286", "group_id": "codeNet:p03170", "input_text": "let () =\n  Scanf.scanf \"%d %d\" @@ fun n k ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  let dp = Array.make (k+1) 0 in\n  for i = 1 to k do\n    dp.(i) <-\n      1 - Array.fold_left (fun s w -> if w <= i then min s dp.(i-w) else s) 1 a\n  done;\n  print_endline [|\"Second\"; \"First\"|].(dp.(k))\n", "language": "OCaml", "metadata": {"date": 1546833319, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s264087286.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s264087286", "user_id": "u798181098"}, "prompt_components": {"gold_output": "First\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d\" @@ fun n k ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  let dp = Array.make (k+1) 0 in\n  for i = 1 to k do\n    dp.(i) <-\n      1 - Array.fold_left (fun s w -> if w <= i then min s dp.(i-w) else s) 1 a\n  done;\n  print_endline [|\"Second\"; \"First\"|].(dp.(k))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a set A = \\{ a_1, a_2, \\ldots, a_N \\} consisting of N positive integers.\nTaro and Jiro will play the following game against each other.\n\nInitially, we have a pile consisting of K stones.\nThe two players perform the following operation alternately, starting from Taro:\n\nChoose an element x in A, and remove exactly x stones from the pile.\n\nA player loses when he becomes unable to play.\nAssuming that both players play optimally, determine the winner.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 10^5\n\n1 \\leq a_1 < a_2 < \\cdots < a_N \\leq K\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 a_2 \\ldots a_N\n\nOutput\n\nIf Taro will win, print First; if Jiro will win, print Second.\n\nSample Input 1\n\n2 4\n2 3\n\nSample Output 1\n\nFirst\n\nIf Taro removes three stones, Jiro cannot make a move.\nThus, Taro wins.\n\nSample Input 2\n\n2 5\n2 3\n\nSample Output 2\n\nSecond\n\nWhatever Taro does in his operation, Jiro wins, as follows:\n\nIf Taro removes two stones, Jiro can remove three stones to make Taro unable to make a move.\n\nIf Taro removes three stones, Jiro can remove two stones to make Taro unable to make a move.\n\nSample Input 3\n\n2 7\n2 3\n\nSample Output 3\n\nFirst\n\nTaro should remove two stones. Then, whatever Jiro does in his operation, Taro wins, as follows:\n\nIf Jiro removes two stones, Taro can remove three stones to make Jiro unable to make a move.\n\nIf Jiro removes three stones, Taro can remove two stones to make Jiro unable to make a move.\n\nSample Input 4\n\n3 20\n1 2 3\n\nSample Output 4\n\nSecond\n\nSample Input 5\n\n3 21\n1 2 3\n\nSample Output 5\n\nFirst\n\nSample Input 6\n\n1 100000\n1\n\nSample Output 6\n\nSecond", "sample_input": "2 4\n2 3\n"}, "reference_outputs": ["First\n"], "source_document_id": "p03170", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a set A = \\{ a_1, a_2, \\ldots, a_N \\} consisting of N positive integers.\nTaro and Jiro will play the following game against each other.\n\nInitially, we have a pile consisting of K stones.\nThe two players perform the following operation alternately, starting from Taro:\n\nChoose an element x in A, and remove exactly x stones from the pile.\n\nA player loses when he becomes unable to play.\nAssuming that both players play optimally, determine the winner.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 10^5\n\n1 \\leq a_1 < a_2 < \\cdots < a_N \\leq K\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 a_2 \\ldots a_N\n\nOutput\n\nIf Taro will win, print First; if Jiro will win, print Second.\n\nSample Input 1\n\n2 4\n2 3\n\nSample Output 1\n\nFirst\n\nIf Taro removes three stones, Jiro cannot make a move.\nThus, Taro wins.\n\nSample Input 2\n\n2 5\n2 3\n\nSample Output 2\n\nSecond\n\nWhatever Taro does in his operation, Jiro wins, as follows:\n\nIf Taro removes two stones, Jiro can remove three stones to make Taro unable to make a move.\n\nIf Taro removes three stones, Jiro can remove two stones to make Taro unable to make a move.\n\nSample Input 3\n\n2 7\n2 3\n\nSample Output 3\n\nFirst\n\nTaro should remove two stones. Then, whatever Jiro does in his operation, Taro wins, as follows:\n\nIf Jiro removes two stones, Taro can remove three stones to make Jiro unable to make a move.\n\nIf Jiro removes three stones, Taro can remove two stones to make Jiro unable to make a move.\n\nSample Input 4\n\n3 20\n1 2 3\n\nSample Output 4\n\nSecond\n\nSample Input 5\n\n3 21\n1 2 3\n\nSample Output 5\n\nFirst\n\nSample Input 6\n\n1 100000\n1\n\nSample Output 6\n\nSecond", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 310, "cpu_time_ms": 134, "memory_kb": 5120}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s570448050", "group_id": "codeNet:p03171", "input_text": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list sep conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet n = scan \"%d\" id\nlet arr = scan_array ~sep:' ' Int.of_string\n\nlet memo = Array.make_matrix n n None\n\nlet rec solve i j t =\n  if t then\n    if i = j then arr.(i)\n    else\n      match memo.(i).(j)with\n      | Some v ->  v\n      | None ->\n        let v = max (solve (succ i) j  false + arr.(i))\n            (solve i (pred j) false + arr.(j)) in\n        memo.(i).(j) <- Some v; v\n  else\n  if i = j then 0\n  else\n  if arr.(i) < arr.(j) then\n    solve i (pred j) true\n  else\n    solve (succ i) j true\n\nlet () =\n  solve 0 (pred n) true\n  |> (fun x -> Printf.printf \"%d\\n\" @@ 2*x-Array.sum arr)\n", "language": "OCaml", "metadata": {"date": 1588711085, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03171.html", "problem_id": "p03171", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03171/input.txt", "sample_output_relpath": "derived/input_output/data/p03171/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03171/OCaml/s570448050.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s570448050", "user_id": "u802614675"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list sep conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet n = scan \"%d\" id\nlet arr = scan_array ~sep:' ' Int.of_string\n\nlet memo = Array.make_matrix n n None\n\nlet rec solve i j t =\n  if t then\n    if i = j then arr.(i)\n    else\n      match memo.(i).(j)with\n      | Some v ->  v\n      | None ->\n        let v = max (solve (succ i) j  false + arr.(i))\n            (solve i (pred j) false + arr.(j)) in\n        memo.(i).(j) <- Some v; v\n  else\n  if i = j then 0\n  else\n  if arr.(i) < arr.(j) then\n    solve i (pred j) true\n  else\n    solve (succ i) j true\n\nlet () =\n  solve 0 (pred n) true\n  |> (fun x -> Printf.printf \"%d\\n\" @@ 2*x-Array.sum arr)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTaro and Jiro will play the following game against each other.\n\nInitially, they are given a sequence a = (a_1, a_2, \\ldots, a_N).\nUntil a becomes empty, the two players perform the following operation alternately, starting from Taro:\n\nRemove the element at the beginning or the end of a. The player earns x points, where x is the removed element.\n\nLet X and Y be Taro's and Jiro's total score at the end of the game, respectively.\nTaro tries to maximize X - Y, while Jiro tries to minimize X - Y.\n\nAssuming that the two players play optimally, find the resulting value of X - Y.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3000\n\n1 \\leq a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_N\n\nOutput\n\nPrint the resulting value of X - Y, assuming that the two players play optimally.\n\nSample Input 1\n\n4\n10 80 90 30\n\nSample Output 1\n\n10\n\nThe game proceeds as follows when the two players play optimally (the element being removed is written bold):\n\nTaro: (10, 80, 90, 30) → (10, 80, 90)\n\nJiro: (10, 80, 90) → (10, 80)\n\nTaro: (10, 80) → (10)\n\nJiro: (10) → ()\n\nHere, X = 30 + 80 = 110 and Y = 90 + 10 = 100.\n\nSample Input 2\n\n3\n10 100 10\n\nSample Output 2\n\n-80\n\nThe game proceeds, for example, as follows when the two players play optimally:\n\nTaro: (10, 100, 10) → (100, 10)\n\nJiro: (100, 10) → (10)\n\nTaro: (10) → ()\n\nHere, X = 10 + 10 = 20 and Y = 100.\n\nSample Input 3\n\n1\n10\n\nSample Output 3\n\n10\n\nSample Input 4\n\n10\n1000000000 1 1000000000 1 1000000000 1 1000000000 1 1000000000 1\n\nSample Output 4\n\n4999999995\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 5\n\n6\n4 2 9 7 1 5\n\nSample Output 5\n\n2\n\nThe game proceeds, for example, as follows when the two players play optimally:\n\nTaro: (4, 2, 9, 7, 1, 5) → (4, 2, 9, 7, 1)\n\nJiro: (4, 2, 9, 7, 1) → (2, 9, 7, 1)\n\nTaro: (2, 9, 7, 1) → (2, 9, 7)\n\nJiro: (2, 9, 7) → (2, 9)\n\nTaro: (2, 9) → (2)\n\nJiro: (2) → ()\n\nHere, X = 5 + 1 + 9 = 15 and Y = 4 + 7 + 2 = 13.", "sample_input": "4\n10 80 90 30\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03171", "source_text": "Score : 100 points\n\nProblem Statement\n\nTaro and Jiro will play the following game against each other.\n\nInitially, they are given a sequence a = (a_1, a_2, \\ldots, a_N).\nUntil a becomes empty, the two players perform the following operation alternately, starting from Taro:\n\nRemove the element at the beginning or the end of a. The player earns x points, where x is the removed element.\n\nLet X and Y be Taro's and Jiro's total score at the end of the game, respectively.\nTaro tries to maximize X - Y, while Jiro tries to minimize X - Y.\n\nAssuming that the two players play optimally, find the resulting value of X - Y.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3000\n\n1 \\leq a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\ldots a_N\n\nOutput\n\nPrint the resulting value of X - Y, assuming that the two players play optimally.\n\nSample Input 1\n\n4\n10 80 90 30\n\nSample Output 1\n\n10\n\nThe game proceeds as follows when the two players play optimally (the element being removed is written bold):\n\nTaro: (10, 80, 90, 30) → (10, 80, 90)\n\nJiro: (10, 80, 90) → (10, 80)\n\nTaro: (10, 80) → (10)\n\nJiro: (10) → ()\n\nHere, X = 30 + 80 = 110 and Y = 90 + 10 = 100.\n\nSample Input 2\n\n3\n10 100 10\n\nSample Output 2\n\n-80\n\nThe game proceeds, for example, as follows when the two players play optimally:\n\nTaro: (10, 100, 10) → (100, 10)\n\nJiro: (100, 10) → (10)\n\nTaro: (10) → ()\n\nHere, X = 10 + 10 = 20 and Y = 100.\n\nSample Input 3\n\n1\n10\n\nSample Output 3\n\n10\n\nSample Input 4\n\n10\n1000000000 1 1000000000 1 1000000000 1 1000000000 1 1000000000 1\n\nSample Output 4\n\n4999999995\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 5\n\n6\n4 2 9 7 1 5\n\nSample Output 5\n\n2\n\nThe game proceeds, for example, as follows when the two players play optimally:\n\nTaro: (4, 2, 9, 7, 1, 5) → (4, 2, 9, 7, 1)\n\nJiro: (4, 2, 9, 7, 1) → (2, 9, 7, 1)\n\nTaro: (2, 9, 7, 1) → (2, 9, 7)\n\nJiro: (2, 9, 7) → (2, 9)\n\nTaro: (2, 9) → (2)\n\nJiro: (2) → ()\n\nHere, X = 5 + 1 + 9 = 15 and Y = 4 + 7 + 2 = 13.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2419, "cpu_time_ms": 220, "memory_kb": 97980}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s123524292", "group_id": "codeNet:p03194", "input_text": "(* O(√p) *)\nlet n, p = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet factorize_primes n =\n  let rec f acc c d m =\n    if d > m || d * d > n then\n      List.rev @@ if c > 0 then (d, c) :: acc else if m > 1 then (m, 1) :: acc else acc\n    else\n      if m mod d = 0 then f acc (c + 1) d @@ m / d\n      else f (if c > 0 then (d, c) :: acc else acc) 0 (d + 1) m in\n  f [] 0 2 n\nlet rec pow b n =\n  if n <= 0 then 1\n  else let p = pow b (n / 2) in p * p * if n mod 2 = 0 then 1 else b\nlet ps = factorize_primes p\nlet _ = List.fold_left (fun acc (b, c) -> acc * pow b (c / n)) 1 ps |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1561050197, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s123524292.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s123524292", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(* O(√p) *)\nlet n, p = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet factorize_primes n =\n  let rec f acc c d m =\n    if d > m || d * d > n then\n      List.rev @@ if c > 0 then (d, c) :: acc else if m > 1 then (m, 1) :: acc else acc\n    else\n      if m mod d = 0 then f acc (c + 1) d @@ m / d\n      else f (if c > 0 then (d, c) :: acc else acc) 0 (d + 1) m in\n  f [] 0 2 n\nlet rec pow b n =\n  if n <= 0 then 1\n  else let p = pow b (n / 2) in p * p * if n mod 2 = 0 then 1 else b\nlet ps = factorize_primes p\nlet _ = List.fold_left (fun acc (b, c) -> acc * pow b (c / n)) 1 ps |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers a_1, a_2, ..., a_N not less than 1.\nThe values of a_1, a_2, ..., a_N are not known, but it is known that a_1 \\times a_2 \\times ... \\times a_N = P.\n\nFind the maximum possible greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\n1 \\leq N \\leq 10^{12}\n\n1 \\leq P \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 24\n\nSample Output 1\n\n2\n\nThe greatest common divisor would be 2 when, for example, a_1=2, a_2=6 and a_3=2.\n\nSample Input 2\n\n5 1\n\nSample Output 2\n\n1\n\nAs a_i are positive integers, the only possible case is a_1 = a_2 = a_3 = a_4 = a_5 = 1.\n\nSample Input 3\n\n1 111\n\nSample Output 3\n\n111\n\nSample Input 4\n\n4 972439611840\n\nSample Output 4\n\n206", "sample_input": "3 24\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03194", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers a_1, a_2, ..., a_N not less than 1.\nThe values of a_1, a_2, ..., a_N are not known, but it is known that a_1 \\times a_2 \\times ... \\times a_N = P.\n\nFind the maximum possible greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\n1 \\leq N \\leq 10^{12}\n\n1 \\leq P \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 24\n\nSample Output 1\n\n2\n\nThe greatest common divisor would be 2 when, for example, a_1=2, a_2=6 and a_3=2.\n\nSample Input 2\n\n5 1\n\nSample Output 2\n\n1\n\nAs a_i are positive integers, the only possible case is a_1 = a_2 = a_3 = a_4 = a_5 = 1.\n\nSample Input 3\n\n1 111\n\nSample Output 3\n\n111\n\nSample Input 4\n\n4 972439611840\n\nSample Output 4\n\n206", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 598, "cpu_time_ms": 12, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s102956533", "group_id": "codeNet:p03196", "input_text": "let (n, p) = Scanf.scanf \"%d %d\\n\" @@ fun n p -> (n, p)\n\nlet prime_fact n =\n  let rec f arr i n =\n    if n <= 1 then arr\n    else if n < i * i then n :: arr\n    else if n mod i = 0 then f (i :: arr) i (n / i)\n    else f arr (i + 1) n\n  in\n  match f [] 2 n with\n    | [] -> []\n    | p :: ps ->\n        let (acc, p, n) = List.fold_left (fun (acc, p, n) q ->\n          if p = q\n          then (acc, p, n + 1)\n          else ((p, n) :: acc, q, 1)) ([], p, 1) ps in\n        (p, n) :: acc\n\nlet rec pow n = function\n  | 0 -> 1\n  | i -> n * pow n (i - 1)\n\nlet () = \n  prime_fact p\n    |> List.map (fun (i, j) -> pow i (j / n))\n    |> List.fold_left ( * ) 1\n    |> print_int", "language": "OCaml", "metadata": {"date": 1588991397, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03196.html", "problem_id": "p03196", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03196/input.txt", "sample_output_relpath": "derived/input_output/data/p03196/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03196/OCaml/s102956533.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s102956533", "user_id": "u811309788"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let (n, p) = Scanf.scanf \"%d %d\\n\" @@ fun n p -> (n, p)\n\nlet prime_fact n =\n  let rec f arr i n =\n    if n <= 1 then arr\n    else if n < i * i then n :: arr\n    else if n mod i = 0 then f (i :: arr) i (n / i)\n    else f arr (i + 1) n\n  in\n  match f [] 2 n with\n    | [] -> []\n    | p :: ps ->\n        let (acc, p, n) = List.fold_left (fun (acc, p, n) q ->\n          if p = q\n          then (acc, p, n + 1)\n          else ((p, n) :: acc, q, 1)) ([], p, 1) ps in\n        (p, n) :: acc\n\nlet rec pow n = function\n  | 0 -> 1\n  | i -> n * pow n (i - 1)\n\nlet () = \n  prime_fact p\n    |> List.map (fun (i, j) -> pow i (j / n))\n    |> List.fold_left ( * ) 1\n    |> print_int", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers a_1, a_2, ..., a_N not less than 1.\nThe values of a_1, a_2, ..., a_N are not known, but it is known that a_1 \\times a_2 \\times ... \\times a_N = P.\n\nFind the maximum possible greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\n1 \\leq N \\leq 10^{12}\n\n1 \\leq P \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 24\n\nSample Output 1\n\n2\n\nThe greatest common divisor would be 2 when, for example, a_1=2, a_2=6 and a_3=2.\n\nSample Input 2\n\n5 1\n\nSample Output 2\n\n1\n\nAs a_i are positive integers, the only possible case is a_1 = a_2 = a_3 = a_4 = a_5 = 1.\n\nSample Input 3\n\n1 111\n\nSample Output 3\n\n111\n\nSample Input 4\n\n4 972439611840\n\nSample Output 4\n\n206", "sample_input": "3 24\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03196", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers a_1, a_2, ..., a_N not less than 1.\nThe values of a_1, a_2, ..., a_N are not known, but it is known that a_1 \\times a_2 \\times ... \\times a_N = P.\n\nFind the maximum possible greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\n1 \\leq N \\leq 10^{12}\n\n1 \\leq P \\leq 10^{12}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN P\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 24\n\nSample Output 1\n\n2\n\nThe greatest common divisor would be 2 when, for example, a_1=2, a_2=6 and a_3=2.\n\nSample Input 2\n\n5 1\n\nSample Output 2\n\n1\n\nAs a_i are positive integers, the only possible case is a_1 = a_2 = a_3 = a_4 = a_5 = 1.\n\nSample Input 3\n\n1 111\n\nSample Output 3\n\n111\n\nSample Input 4\n\n4 972439611840\n\nSample Output 4\n\n206", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 665, "cpu_time_ms": 6, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s374946278", "group_id": "codeNet:p03197", "input_text": "let () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let idx =\n    Array.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x mod 2))\n    |> Array.fold_left (lor) 0\n  in print_endline [|\"second\"; \"first\"|].(idx)\n", "language": "OCaml", "metadata": {"date": 1545598597, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03197.html", "problem_id": "p03197", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03197/input.txt", "sample_output_relpath": "derived/input_output/data/p03197/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03197/OCaml/s374946278.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s374946278", "user_id": "u798181098"}, "prompt_components": {"gold_output": "first\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let idx =\n    Array.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x mod 2))\n    |> Array.fold_left (lor) 0\n  in print_endline [|\"second\"; \"first\"|].(idx)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is an apple tree that bears apples of N colors. The N colors of these apples are numbered 1 to N, and there are a_i apples of Color i.\n\nYou and Lunlun the dachshund alternately perform the following operation (starting from you):\n\nChoose one or more apples from the tree and eat them. Here, the apples chosen at the same time must all have different colors.\n\nThe one who eats the last apple from the tree will be declared winner. If both you and Lunlun play optimally, which will win?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\na_2\n:\na_N\n\nOutput\n\nIf you will win, print first; if Lunlun will win, print second.\n\nSample Input 1\n\n2\n1\n2\n\nSample Output 1\n\nfirst\n\nLet Color 1 be red, and Color 2 be blue. In this case, the tree bears one red apple and two blue apples.\n\nYou should eat the red apple in your first turn. Lunlun is then forced to eat one of the blue apples, and you can win by eating the other in your next turn.\n\nNote that you are also allowed to eat two apples in your first turn, one red and one blue (not a winning move, though).\n\nSample Input 2\n\n3\n100000\n30000\n20000\n\nSample Output 2\n\nsecond", "sample_input": "2\n1\n2\n"}, "reference_outputs": ["first\n"], "source_document_id": "p03197", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is an apple tree that bears apples of N colors. The N colors of these apples are numbered 1 to N, and there are a_i apples of Color i.\n\nYou and Lunlun the dachshund alternately perform the following operation (starting from you):\n\nChoose one or more apples from the tree and eat them. Here, the apples chosen at the same time must all have different colors.\n\nThe one who eats the last apple from the tree will be declared winner. If both you and Lunlun play optimally, which will win?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\na_2\n:\na_N\n\nOutput\n\nIf you will win, print first; if Lunlun will win, print second.\n\nSample Input 1\n\n2\n1\n2\n\nSample Output 1\n\nfirst\n\nLet Color 1 be red, and Color 2 be blue. In this case, the tree bears one red apple and two blue apples.\n\nYou should eat the red apple in your first turn. Lunlun is then forced to eat one of the blue apples, and you can win by eating the other in your next turn.\n\nNote that you are also allowed to eat two apples in your first turn, one red and one blue (not a winning move, though).\n\nSample Input 2\n\n3\n100000\n30000\n20000\n\nSample Output 2\n\nsecond", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 195, "cpu_time_ms": 32, "memory_kb": 5376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s861403824", "group_id": "codeNet:p03197", "input_text": "let () = print_endline @@ Scanf.scanf \"%d\\n\" @@ function\n  | 1 -> Scanf.scanf \"%d\\n\" @@ fun a ->\n      if a mod 2 = 0 then \"second\" else \"first\"\n  | n ->\n      let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d\\n\" @@ fun a -> a in\n      Array.sort (fun i j -> compare j i) as_;\n      if (as_.(0) - as_.(1)) mod 2 = 0 || as_.(1) mod 2 = 0\n      then \"first\"\n      else \"second\"\n", "language": "OCaml", "metadata": {"date": 1545534465, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03197.html", "problem_id": "p03197", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03197/input.txt", "sample_output_relpath": "derived/input_output/data/p03197/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03197/OCaml/s861403824.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s861403824", "user_id": "u504158101"}, "prompt_components": {"gold_output": "first\n", "input_to_evaluate": "let () = print_endline @@ Scanf.scanf \"%d\\n\" @@ function\n  | 1 -> Scanf.scanf \"%d\\n\" @@ fun a ->\n      if a mod 2 = 0 then \"second\" else \"first\"\n  | n ->\n      let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d\\n\" @@ fun a -> a in\n      Array.sort (fun i j -> compare j i) as_;\n      if (as_.(0) - as_.(1)) mod 2 = 0 || as_.(1) mod 2 = 0\n      then \"first\"\n      else \"second\"\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is an apple tree that bears apples of N colors. The N colors of these apples are numbered 1 to N, and there are a_i apples of Color i.\n\nYou and Lunlun the dachshund alternately perform the following operation (starting from you):\n\nChoose one or more apples from the tree and eat them. Here, the apples chosen at the same time must all have different colors.\n\nThe one who eats the last apple from the tree will be declared winner. If both you and Lunlun play optimally, which will win?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\na_2\n:\na_N\n\nOutput\n\nIf you will win, print first; if Lunlun will win, print second.\n\nSample Input 1\n\n2\n1\n2\n\nSample Output 1\n\nfirst\n\nLet Color 1 be red, and Color 2 be blue. In this case, the tree bears one red apple and two blue apples.\n\nYou should eat the red apple in your first turn. Lunlun is then forced to eat one of the blue apples, and you can win by eating the other in your next turn.\n\nNote that you are also allowed to eat two apples in your first turn, one red and one blue (not a winning move, though).\n\nSample Input 2\n\n3\n100000\n30000\n20000\n\nSample Output 2\n\nsecond", "sample_input": "2\n1\n2\n"}, "reference_outputs": ["first\n"], "source_document_id": "p03197", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is an apple tree that bears apples of N colors. The N colors of these apples are numbered 1 to N, and there are a_i apples of Color i.\n\nYou and Lunlun the dachshund alternately perform the following operation (starting from you):\n\nChoose one or more apples from the tree and eat them. Here, the apples chosen at the same time must all have different colors.\n\nThe one who eats the last apple from the tree will be declared winner. If both you and Lunlun play optimally, which will win?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\na_2\n:\na_N\n\nOutput\n\nIf you will win, print first; if Lunlun will win, print second.\n\nSample Input 1\n\n2\n1\n2\n\nSample Output 1\n\nfirst\n\nLet Color 1 be red, and Color 2 be blue. In this case, the tree bears one red apple and two blue apples.\n\nYou should eat the red apple in your first turn. Lunlun is then forced to eat one of the blue apples, and you can win by eating the other in your next turn.\n\nNote that you are also allowed to eat two apples in your first turn, one red and one blue (not a winning move, though).\n\nSample Input 2\n\n3\n100000\n30000\n20000\n\nSample Output 2\n\nsecond", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 68, "memory_kb": 5248}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s424820942", "group_id": "codeNet:p03200", "input_text": "let id x = x\n\nlet init n f =\n  let rec g i ns = if i = 0 then 0 :: ns else g (i - 1) (i :: ns) in\n  List.map f (g n [])\n\nlet split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\n\nlet ss = split_string @@ Scanf.scanf \"%s\\n\" id\n\nlet len = List.length ss\n\nlet () =\n  ss\n    |> List.mapi (fun idx s -> (len - idx - 1, s))\n    |> (fun lst -> List.fold_right (fun (idx, s) (sum, b_cnt) -> if s = \"B\" then (sum + idx - b_cnt, b_cnt + 1) else (sum, b_cnt)) lst (0, 0))\n    |> (fun (sum, _) -> sum)\n    |> print_int;\n  print_newline ()", "language": "OCaml", "metadata": {"date": 1588539453, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s424820942.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s424820942", "user_id": "u811309788"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let id x = x\n\nlet init n f =\n  let rec g i ns = if i = 0 then 0 :: ns else g (i - 1) (i :: ns) in\n  List.map f (g n [])\n\nlet split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\n\nlet ss = split_string @@ Scanf.scanf \"%s\\n\" id\n\nlet len = List.length ss\n\nlet () =\n  ss\n    |> List.mapi (fun idx s -> (len - idx - 1, s))\n    |> (fun lst -> List.fold_right (fun (idx, s) (sum, b_cnt) -> if s = \"B\" then (sum + idx - b_cnt, b_cnt + 1) else (sum, b_cnt)) lst (0, 0))\n    |> (fun (sum, _) -> sum)\n    |> print_int;\n  print_newline ()", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\n\nSample Output 2\n\n6", "sample_input": "BBW\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03200", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\n\nSample Output 2\n\n6", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 534, "cpu_time_ms": 106, "memory_kb": 30976}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s915601088", "group_id": "codeNet:p03200", "input_text": "let s, k, ans = read_line (), ref 0, ref 0\nlet _ = String.iter (fun c -> if c = 'B' then incr k else ans := !ans + !k) s; Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1572459845, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s915601088.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s915601088", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let s, k, ans = read_line (), ref 0, ref 0\nlet _ = String.iter (fun c -> if c = 'B' then incr k else ans := !ans + !k) s; Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\n\nSample Output 2\n\n6", "sample_input": "BBW\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03200", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\n\nSample Output 2\n\n6", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 147, "cpu_time_ms": 3, "memory_kb": 2688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s959844988", "group_id": "codeNet:p03201", "input_text": "open Printf open Scanf\nmodule Lib = struct\n  let i32,i64,ist = Int64.(to_int,of_int,to_string)\n  let (+$) = (+) let (-$) = (-) let (/$) = (/) let ( *$) = ( * ) let (%$) = (mod)\n  let labs = Int64.abs\n  let (+),(-),( * ),(/),(mod),(%) = Int64.(add,sub,mul,div,rem,rem)\n  let (+=) r v = r := !r + v\n  let (-=) r v = r := !r - v\n  let ( *= ) r v = r := !r * v\n  let (/=) r v = r := !r / v\n  let (%=) r v = r := !r % v\n  let max_i64,min_i64 = Int64.(max_int,min_int)\n  (* math *)\n  let ceildiv p q = (p+q-1L) / q\n  let rec gcd m n = match m,n with | m,0L -> m | m,n -> gcd n (m mod n)\n  let lcm m n = m / gcd m n * n\n  module Int64_infix = struct\n    let (land),(lor),(lxor),lnot,(lsl),(lsr),(asr) =\n      let open Int64 in\n      (logand),(logor),(logxor),lognot,\n      (fun u v -> shift_left u (i32 v)),\n      (fun u v -> shift_right u (i32 v)),\n      (fun u v -> shift_right_logical u (i32 v))\n  end\n  let pow n k =\n    let rec f a n = function\n    | 0L -> a | 1L -> n*a | k when k mod 2L = 0L -> f a (n*n) (k/2L) | k -> f (a*n) (n*n) (k/2L)\n    in f 1L n k\n  (* input *)\n  let input_i64_array n = Array.init (i32 n) (fun _ -> Scanf.scanf \" %Ld\" (fun v -> v)) let iia = input_i64_array\n  let get_i64 _ = Scanf.scanf \" %Ld\" (fun v -> v) let gi = get_i64\n  let get_2_i64 _ = Scanf.scanf \" %Ld %Ld\" (fun u v -> u,v) let g2 = get_2_i64\n  let get_3_i64 _ = Scanf.scanf \" %Ld %Ld %Ld\" (fun u v w -> u,v,w) let g3 = get_3_i64\n  let get_4_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld\" (fun u v w x -> u,v,w,x) let g4 = get_4_i64\n  let get_5_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld %Ld\" (fun u v w x y -> u,v,w,x,y) let g5 = get_5_i64\n  let i32_get_int _ = Scanf.scanf \" %d\" (fun v -> v) let i32_get_2_ints _ = Scanf.scanf \" %d %d\" (fun u v -> u,v) let i32_get_3_ints _ = Scanf.scanf \" %d %d %d\" (fun u v w -> u,v,w) let i32_get_4_ints _ = Scanf.scanf \" %d %d %d %d\" (fun u v w x -> u,v,w,x) let i32_get_5_ints _ = Scanf.scanf \" %d %d %d %d %d\" (fun u v w x y -> u,v,w,x,y)\n  (* utils *)\n  external id : 'a -> 'a = \"%identity\"\n  let ( *< ) f g x = f (g x)\n  let ( *> ) f g x = g (f x)\n  let rv f p q = f q p (* ex. 24 |> rv (/) 6 *)\n  let alen a = i64 @@ Array.length a\n  let llen l = i64 @@  List.length l\n  let slen s = String.length s\n  let string_of_list ?(separator=\" \") f ls = ls |> List.map f |> String.concat separator\n  let string_of_array ?(separator=\" \") f a = a |> Array.to_list |> string_of_list ~separator f\n  let char_list_of_string str = let rec f0 i a = if i<0 then a else f0 (i-$1) (str.[i]::a) in f0 (String.length str -$ 1) []\n  let string_of_char_list ls = List.fold_left (fun u v -> u ^ (String.make 1 v)) \"\" ls\n  let fail _ = failwith \"fail\"\n  let dx,dy = [|1;0;-1;0|],[|0;1;0;-1|]\n  let range l r = let ls = ref [] in for i=i32 l to i32 r do ls := i :: !ls done;!ls |> List.rev\n  let cartesian_product u v = u |> List.map (fun p -> List.map (fun q -> p,q) v) |> List.flatten\n  let shuffle a = Array.sort (fun _ _ -> (Random.int 3) -$ 1) a\n  let binary_search ng ok f = let d = if ng < ok then 1L else -1L in\n    let rec f0 ng ok =\n      if labs (ok - ng) <= 1L then ok\n      else let mid = ng + (ok - ng) / 2L in if f mid then f0 ng mid else f0 mid ok\n    in f0 (ng-1L*d) (ok+1L*d)\n  let lower_bound a v = binary_search 0L (alen a - 1L) (fun i -> a.(i32 i) >= v)\n  let upper_bound a v = binary_search 0L (alen a - 1L) (fun i -> a.(i32 i) >  v)\n  let equal_range a v = lower_bound a v, upper_bound a v (* #=snd-fst *)\n  let rec fix f x = f (fix f) x\n  let fix_memo ?(size=10000) f x =\n    let tb = Hashtbl.create ~random:true size in\n    let rec f0 x =\n      try Hashtbl.find tb x with\n      | Not_found -> (let v = f f0 x in Hashtbl.add tb x v; v)\n    in f0 x\n  (* imperative *)\n  let rep f t ?(stride=1L) fbod = let i = ref f in while !i <= t do fbod !i; i := !i + stride done\n  let repb f t ?(stride=1L) fbod = let i,c = ref f,ref true in while !i <= t && !c do\n    match fbod !i with | `Break -> c := false | `Ok -> i := !i + stride done\n  let repm f t ?(stride=1L) m0 fbod =\n    let i,c,m = ref f,ref true,ref m0 in\n    while !i<=t && !c do match fbod !m !i with\n    | `Break -> c := false | `Break_m m' -> (c := false; m := m') | `Ok m' -> m := m'; i := !i + stride done; !m\n  let repi f t ?(stride=1) fbod = let i = ref f in while !i <= t do fbod !i; i := !i +$ stride done\n  let repib f t ?(stride=1) fbod = let i,c = ref f,ref true in while !i <= t && !c do\n    match fbod !i with | `Break -> c := false | `Ok -> i := !i +$ stride done\n  let repim f t ?(stride=1) m0 fbod =\n    let i,c,m = ref f,ref true,ref m0 in\n    while !i<=t && !c do match fbod !m !i with\n    | `Break -> c := false | `Break_m m' -> (c := false; m := m') | `Ok m' -> m := m'; i := !i +$ stride done; !m\n  let rep_rev f t ?(stride=1L) fbod = rep t f ~stride @@ fun v -> fbod @@ f + t - v\n  let repb_rev f t ?(stride=1L) fbod = repb t f ~stride @@ fun v -> fbod @@ f + t - v\n  let repm_rev f t ?(stride=1L) m0 fbod = repm f t ~stride m0 @@ fun u v -> fbod u @@ f + t - v\n  let repi_rev f t ?(stride=1) fbod = repi t f ~stride @@ fun v -> fbod @@ f +$ t -$ v\n  let repib_rev f t ?(stride=1) fbod = repib t f ~stride @@ fun v -> fbod @@ f +$ t -$ v\n  let repim_rev f t ?(stride=1) m0 fbod = repim f t ~stride m0 @@ fun u v -> fbod u @@ f +$ t -$ v\n  (* output *)\n  let print_list_mle f ls = string_of_list f ls |> print_endline\n  let print_array_mle f a = string_of_array f a |> print_endline\n  let print_list f ls = ls |> List.iter (fun v -> printf \"%s \" @@ f v); print_newline ()\n  let print_array f a = a |> Array.iter (fun v -> printf \"%s \" @@ f v); print_newline ()\n  (* debug *)\n  let dump_2darr f a = a |> Array.iter (fun b -> print_array f b)\n  let dump_i64_list ls = print_list ist ls\n  let dump_i64_array a = print_array ist a\nend open Lib open Array\n\nmodule IMap = Map.Make(Int64)\n\nmodule UnionFind_i32 = struct\n  let init n = Array.make (i32 n) (-1)\n  let is_root i a = a.(i) < 0\n  let rec root_destructive x a = (* find the root of the tree x belongs to *)\n    if a.(x) < 0 then x\n    else (\n      a.(x) <- root_destructive a.(x) a;\n      a.(x))\n  let size_destructive i a = let r = root_destructive i a in -r\n  let same_destructive x y a = root_destructive x a = root_destructive y a\n  let connect_destructive x y a = (* merge the trees x and y belongs to respectively *)\n    let p,q = root_destructive x a,root_destructive y a\n    in if p = q then () else (\n      let p,q = if a.(p) > a.(q) then q,p else p,q\n      in\n      a.(p) <- a.(p) +$ a.(q);\n      a.(q) <- p)\nend\nlet coordinate_compression a =\n  (* zip:i64->int, unzip:int->i64 *)\n  let ls = a |> Array.to_list |> List.sort_uniq compare in\n  let unzip = Array.make (List.length ls) 0L in\n  let zip = fst @@ List.fold_left (fun (m,i) v ->\n    unzip.(i) <- v; IMap.add v i m,i+$1) (IMap.empty,0) ls\n  in zip,unzip\nlet () =\n  let n=gi 0 in let a = iia n in\n  let mp = ref IMap.empty in\n  iter (fun v ->\n    mp := IMap.add v (1L + try IMap.find v !mp with _ -> 0L) !mp\n  ) a;\n  let zip,unz = coordinate_compression a in\n  let uf = UnionFind_i32.init (alen unz) in\n  let size = init (i32 @@ alen unz) (fun i ->\n    let v = unz.(i) in\n    let z = fix (fun f a -> if a>v then a else f (a*2L)) 1L in\n    (* printf \"%Ld %Ld\\n\" z v; *)\n    if z=v+v then IMap.find v !mp else 1L)\n  in\n  let size_con x y a = UnionFind_i32.(\n    let p,q = root_destructive x a,root_destructive y a\n    in if p = q then () else (\n      let p,q = if a.(p) > a.(q) then q,p else p,q\n      in\n      size.(p) <- size.(p) + size.(q);\n      size.(q) <- 0L\n    )\n  ) in\n  IMap.iter (fun v c ->\n    let z = fix (fun f a -> if a>v then a else f (a*2L)) 1L in\n    let cp = z - v in\n    (* printf \"%Ld + %Ld = %Ld\\n\" v cp z; *)\n    try\n      let _ = IMap.find cp !mp in\n      let p,q = IMap.find v zip,IMap.find cp zip in\n      size_con p q uf;\n      UnionFind_i32.connect_destructive p q uf;\n      (* print_array (sprintf \"%2d\") uf;\n      print_array (sprintf \"%2Ld\") size; *)\n    with _ -> ()\n  ) !mp;\n  let r = ref 0L in iter (fun v ->\n    if v>=2L then r += v / 2L\n  ) size; printf \"%Ld\" @@ !r\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "language": "OCaml", "metadata": {"date": 1545229300, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s959844988.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s959844988", "user_id": "u481480055"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Printf open Scanf\nmodule Lib = struct\n  let i32,i64,ist = Int64.(to_int,of_int,to_string)\n  let (+$) = (+) let (-$) = (-) let (/$) = (/) let ( *$) = ( * ) let (%$) = (mod)\n  let labs = Int64.abs\n  let (+),(-),( * ),(/),(mod),(%) = Int64.(add,sub,mul,div,rem,rem)\n  let (+=) r v = r := !r + v\n  let (-=) r v = r := !r - v\n  let ( *= ) r v = r := !r * v\n  let (/=) r v = r := !r / v\n  let (%=) r v = r := !r % v\n  let max_i64,min_i64 = Int64.(max_int,min_int)\n  (* math *)\n  let ceildiv p q = (p+q-1L) / q\n  let rec gcd m n = match m,n with | m,0L -> m | m,n -> gcd n (m mod n)\n  let lcm m n = m / gcd m n * n\n  module Int64_infix = struct\n    let (land),(lor),(lxor),lnot,(lsl),(lsr),(asr) =\n      let open Int64 in\n      (logand),(logor),(logxor),lognot,\n      (fun u v -> shift_left u (i32 v)),\n      (fun u v -> shift_right u (i32 v)),\n      (fun u v -> shift_right_logical u (i32 v))\n  end\n  let pow n k =\n    let rec f a n = function\n    | 0L -> a | 1L -> n*a | k when k mod 2L = 0L -> f a (n*n) (k/2L) | k -> f (a*n) (n*n) (k/2L)\n    in f 1L n k\n  (* input *)\n  let input_i64_array n = Array.init (i32 n) (fun _ -> Scanf.scanf \" %Ld\" (fun v -> v)) let iia = input_i64_array\n  let get_i64 _ = Scanf.scanf \" %Ld\" (fun v -> v) let gi = get_i64\n  let get_2_i64 _ = Scanf.scanf \" %Ld %Ld\" (fun u v -> u,v) let g2 = get_2_i64\n  let get_3_i64 _ = Scanf.scanf \" %Ld %Ld %Ld\" (fun u v w -> u,v,w) let g3 = get_3_i64\n  let get_4_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld\" (fun u v w x -> u,v,w,x) let g4 = get_4_i64\n  let get_5_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld %Ld\" (fun u v w x y -> u,v,w,x,y) let g5 = get_5_i64\n  let i32_get_int _ = Scanf.scanf \" %d\" (fun v -> v) let i32_get_2_ints _ = Scanf.scanf \" %d %d\" (fun u v -> u,v) let i32_get_3_ints _ = Scanf.scanf \" %d %d %d\" (fun u v w -> u,v,w) let i32_get_4_ints _ = Scanf.scanf \" %d %d %d %d\" (fun u v w x -> u,v,w,x) let i32_get_5_ints _ = Scanf.scanf \" %d %d %d %d %d\" (fun u v w x y -> u,v,w,x,y)\n  (* utils *)\n  external id : 'a -> 'a = \"%identity\"\n  let ( *< ) f g x = f (g x)\n  let ( *> ) f g x = g (f x)\n  let rv f p q = f q p (* ex. 24 |> rv (/) 6 *)\n  let alen a = i64 @@ Array.length a\n  let llen l = i64 @@  List.length l\n  let slen s = String.length s\n  let string_of_list ?(separator=\" \") f ls = ls |> List.map f |> String.concat separator\n  let string_of_array ?(separator=\" \") f a = a |> Array.to_list |> string_of_list ~separator f\n  let char_list_of_string str = let rec f0 i a = if i<0 then a else f0 (i-$1) (str.[i]::a) in f0 (String.length str -$ 1) []\n  let string_of_char_list ls = List.fold_left (fun u v -> u ^ (String.make 1 v)) \"\" ls\n  let fail _ = failwith \"fail\"\n  let dx,dy = [|1;0;-1;0|],[|0;1;0;-1|]\n  let range l r = let ls = ref [] in for i=i32 l to i32 r do ls := i :: !ls done;!ls |> List.rev\n  let cartesian_product u v = u |> List.map (fun p -> List.map (fun q -> p,q) v) |> List.flatten\n  let shuffle a = Array.sort (fun _ _ -> (Random.int 3) -$ 1) a\n  let binary_search ng ok f = let d = if ng < ok then 1L else -1L in\n    let rec f0 ng ok =\n      if labs (ok - ng) <= 1L then ok\n      else let mid = ng + (ok - ng) / 2L in if f mid then f0 ng mid else f0 mid ok\n    in f0 (ng-1L*d) (ok+1L*d)\n  let lower_bound a v = binary_search 0L (alen a - 1L) (fun i -> a.(i32 i) >= v)\n  let upper_bound a v = binary_search 0L (alen a - 1L) (fun i -> a.(i32 i) >  v)\n  let equal_range a v = lower_bound a v, upper_bound a v (* #=snd-fst *)\n  let rec fix f x = f (fix f) x\n  let fix_memo ?(size=10000) f x =\n    let tb = Hashtbl.create ~random:true size in\n    let rec f0 x =\n      try Hashtbl.find tb x with\n      | Not_found -> (let v = f f0 x in Hashtbl.add tb x v; v)\n    in f0 x\n  (* imperative *)\n  let rep f t ?(stride=1L) fbod = let i = ref f in while !i <= t do fbod !i; i := !i + stride done\n  let repb f t ?(stride=1L) fbod = let i,c = ref f,ref true in while !i <= t && !c do\n    match fbod !i with | `Break -> c := false | `Ok -> i := !i + stride done\n  let repm f t ?(stride=1L) m0 fbod =\n    let i,c,m = ref f,ref true,ref m0 in\n    while !i<=t && !c do match fbod !m !i with\n    | `Break -> c := false | `Break_m m' -> (c := false; m := m') | `Ok m' -> m := m'; i := !i + stride done; !m\n  let repi f t ?(stride=1) fbod = let i = ref f in while !i <= t do fbod !i; i := !i +$ stride done\n  let repib f t ?(stride=1) fbod = let i,c = ref f,ref true in while !i <= t && !c do\n    match fbod !i with | `Break -> c := false | `Ok -> i := !i +$ stride done\n  let repim f t ?(stride=1) m0 fbod =\n    let i,c,m = ref f,ref true,ref m0 in\n    while !i<=t && !c do match fbod !m !i with\n    | `Break -> c := false | `Break_m m' -> (c := false; m := m') | `Ok m' -> m := m'; i := !i +$ stride done; !m\n  let rep_rev f t ?(stride=1L) fbod = rep t f ~stride @@ fun v -> fbod @@ f + t - v\n  let repb_rev f t ?(stride=1L) fbod = repb t f ~stride @@ fun v -> fbod @@ f + t - v\n  let repm_rev f t ?(stride=1L) m0 fbod = repm f t ~stride m0 @@ fun u v -> fbod u @@ f + t - v\n  let repi_rev f t ?(stride=1) fbod = repi t f ~stride @@ fun v -> fbod @@ f +$ t -$ v\n  let repib_rev f t ?(stride=1) fbod = repib t f ~stride @@ fun v -> fbod @@ f +$ t -$ v\n  let repim_rev f t ?(stride=1) m0 fbod = repim f t ~stride m0 @@ fun u v -> fbod u @@ f +$ t -$ v\n  (* output *)\n  let print_list_mle f ls = string_of_list f ls |> print_endline\n  let print_array_mle f a = string_of_array f a |> print_endline\n  let print_list f ls = ls |> List.iter (fun v -> printf \"%s \" @@ f v); print_newline ()\n  let print_array f a = a |> Array.iter (fun v -> printf \"%s \" @@ f v); print_newline ()\n  (* debug *)\n  let dump_2darr f a = a |> Array.iter (fun b -> print_array f b)\n  let dump_i64_list ls = print_list ist ls\n  let dump_i64_array a = print_array ist a\nend open Lib open Array\n\nmodule IMap = Map.Make(Int64)\n\nmodule UnionFind_i32 = struct\n  let init n = Array.make (i32 n) (-1)\n  let is_root i a = a.(i) < 0\n  let rec root_destructive x a = (* find the root of the tree x belongs to *)\n    if a.(x) < 0 then x\n    else (\n      a.(x) <- root_destructive a.(x) a;\n      a.(x))\n  let size_destructive i a = let r = root_destructive i a in -r\n  let same_destructive x y a = root_destructive x a = root_destructive y a\n  let connect_destructive x y a = (* merge the trees x and y belongs to respectively *)\n    let p,q = root_destructive x a,root_destructive y a\n    in if p = q then () else (\n      let p,q = if a.(p) > a.(q) then q,p else p,q\n      in\n      a.(p) <- a.(p) +$ a.(q);\n      a.(q) <- p)\nend\nlet coordinate_compression a =\n  (* zip:i64->int, unzip:int->i64 *)\n  let ls = a |> Array.to_list |> List.sort_uniq compare in\n  let unzip = Array.make (List.length ls) 0L in\n  let zip = fst @@ List.fold_left (fun (m,i) v ->\n    unzip.(i) <- v; IMap.add v i m,i+$1) (IMap.empty,0) ls\n  in zip,unzip\nlet () =\n  let n=gi 0 in let a = iia n in\n  let mp = ref IMap.empty in\n  iter (fun v ->\n    mp := IMap.add v (1L + try IMap.find v !mp with _ -> 0L) !mp\n  ) a;\n  let zip,unz = coordinate_compression a in\n  let uf = UnionFind_i32.init (alen unz) in\n  let size = init (i32 @@ alen unz) (fun i ->\n    let v = unz.(i) in\n    let z = fix (fun f a -> if a>v then a else f (a*2L)) 1L in\n    (* printf \"%Ld %Ld\\n\" z v; *)\n    if z=v+v then IMap.find v !mp else 1L)\n  in\n  let size_con x y a = UnionFind_i32.(\n    let p,q = root_destructive x a,root_destructive y a\n    in if p = q then () else (\n      let p,q = if a.(p) > a.(q) then q,p else p,q\n      in\n      size.(p) <- size.(p) + size.(q);\n      size.(q) <- 0L\n    )\n  ) in\n  IMap.iter (fun v c ->\n    let z = fix (fun f a -> if a>v then a else f (a*2L)) 1L in\n    let cp = z - v in\n    (* printf \"%Ld + %Ld = %Ld\\n\" v cp z; *)\n    try\n      let _ = IMap.find cp !mp in\n      let p,q = IMap.find v zip,IMap.find cp zip in\n      size_con p q uf;\n      UnionFind_i32.connect_destructive p q uf;\n      (* print_array (sprintf \"%2d\") uf;\n      print_array (sprintf \"%2Ld\") size; *)\n    with _ -> ()\n  ) !mp;\n  let r = ref 0L in iter (fun v ->\n    if v>=2L then r += v / 2L\n  ) size; printf \"%Ld\" @@ !r\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nTakahashi has N balls with positive integers written on them. The integer written on the i-th ball is A_i.\nHe would like to form some number of pairs such that the sum of the integers written on each pair of balls is a power of 2.\nNote that a ball cannot belong to multiple pairs.\nFind the maximum possible number of pairs that can be formed.\n\nHere, a positive integer is said to be a power of 2 when it can be written as 2^t using some non-negative integer t.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible number of pairs such that the sum of the integers written on each pair of balls is a power of 2.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n1\n\nWe can form one pair whose sum of the written numbers is 4 by pairing the first and third balls.\nNote that we cannot pair the second ball with itself.\n\nSample Input 2\n\n5\n3 11 14 5 13\n\nSample Output 2\n\n2", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03201", "source_text": "Score : 600 points\n\nProblem Statement\n\nTakahashi has N balls with positive integers written on them. The integer written on the i-th ball is A_i.\nHe would like to form some number of pairs such that the sum of the integers written on each pair of balls is a power of 2.\nNote that a ball cannot belong to multiple pairs.\nFind the maximum possible number of pairs that can be formed.\n\nHere, a positive integer is said to be a power of 2 when it can be written as 2^t using some non-negative integer t.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible number of pairs such that the sum of the integers written on each pair of balls is a power of 2.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n1\n\nWe can form one pair whose sum of the written numbers is 4 by pairing the first and third balls.\nNote that we cannot pair the second ball with itself.\n\nSample Input 2\n\n5\n3 11 14 5 13\n\nSample Output 2\n\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8025, "cpu_time_ms": 1020, "memory_kb": 59260}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s334101122", "group_id": "codeNet:p03207", "input_text": "let n = Scanf.scanf \" %d\" @@ (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet s = Array.fold_left (+) 0 a_s\nlet m = Array.fold_left max 0 a_s\nlet _ = Printf.printf \"%d\\n\" @@ s - m / 2", "language": "OCaml", "metadata": {"date": 1561673212, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03207.html", "problem_id": "p03207", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03207/input.txt", "sample_output_relpath": "derived/input_output/data/p03207/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03207/OCaml/s334101122.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s334101122", "user_id": "u732304692"}, "prompt_components": {"gold_output": "15950\n", "input_to_evaluate": "let n = Scanf.scanf \" %d\" @@ (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet s = Array.fold_left (+) 0 a_s\nlet m = Array.fold_left max 0 a_s\nlet _ = Printf.printf \"%d\\n\" @@ s - m / 2", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn some other world, today is the day before Christmas Eve.\n\nMr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \\leq i \\leq N) is p_i yen (the currency of Japan).\n\nHe has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay?\n\nConstraints\n\n2 \\leq N \\leq 10\n\n100 \\leq p_i \\leq 10000\n\np_i is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\np_1\np_2\n:\np_N\n\nOutput\n\nPrint the total amount Mr. Takaha will pay.\n\nSample Input 1\n\n3\n4980\n7980\n6980\n\nSample Output 1\n\n15950\n\nThe 7980-yen item gets the discount and the total is 4980 + 7980 / 2 + 6980 = 15950 yen.\n\nNote that outputs such as 15950.0 will be judged as Wrong Answer.\n\nSample Input 2\n\n4\n4320\n4320\n4320\n4320\n\nSample Output 2\n\n15120\n\nOnly one of the four items gets the discount and the total is 4320 / 2 + 4320 + 4320 + 4320 = 15120 yen.", "sample_input": "3\n4980\n7980\n6980\n"}, "reference_outputs": ["15950\n"], "source_document_id": "p03207", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn some other world, today is the day before Christmas Eve.\n\nMr. Takaha is buying N items at a department store. The regular price of the i-th item (1 \\leq i \\leq N) is p_i yen (the currency of Japan).\n\nHe has a discount coupon, and can buy one item with the highest price for half the regular price. The remaining N-1 items cost their regular prices. What is the total amount he will pay?\n\nConstraints\n\n2 \\leq N \\leq 10\n\n100 \\leq p_i \\leq 10000\n\np_i is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\np_1\np_2\n:\np_N\n\nOutput\n\nPrint the total amount Mr. Takaha will pay.\n\nSample Input 1\n\n3\n4980\n7980\n6980\n\nSample Output 1\n\n15950\n\nThe 7980-yen item gets the discount and the total is 4980 + 7980 / 2 + 6980 = 15950 yen.\n\nNote that outputs such as 15950.0 will be judged as Wrong Answer.\n\nSample Input 2\n\n4\n4320\n4320\n4320\n4320\n\nSample Output 2\n\n15120\n\nOnly one of the four items gets the discount and the total is 4320 / 2 + 4320 + 4320 + 4320 = 15120 yen.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 206, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s863415838", "group_id": "codeNet:p03208", "input_text": "Scanf.(Array.(\n  let n,k=scanf\" %d %d\"@@fun u v->u,v in\n  let h=init n@@fun _->scanf\" %d\"@@fun v->v in\n  sort compare h;\n  init(n-k+1)(fun i->h.(i+k-1)-h.(i))\n  |>fold_left min max_int\n  |>print_int))", "language": "OCaml", "metadata": {"date": 1544397804, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s863415838.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s863415838", "user_id": "u481480055"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "Scanf.(Array.(\n  let n,k=scanf\" %d %d\"@@fun u v->u,v in\n  let h=init n@@fun _->scanf\" %d\"@@fun v->v in\n  sort compare h;\n  init(n-k+1)(fun i->h.(i+k-1)-h.(i))\n  |>fold_left min max_int\n  |>print_int))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIn some other world, today is Christmas Eve.\n\nThere are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \\leq i \\leq N) is h_i meters.\n\nHe decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible.\n\nMore specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}?\n\nConstraints\n\n2 \\leq K < N \\leq 10^5\n\n1 \\leq h_i \\leq 10^9\n\nh_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1\nh_2\n:\nh_N\n\nOutput\n\nPrint the minimum possible value of h_{max} - h_{min}.\n\nSample Input 1\n\n5 3\n10\n15\n11\n14\n12\n\nSample Output 1\n\n2\n\nIf we decorate the first, third and fifth trees, h_{max} = 12, h_{min} = 10 so h_{max} - h_{min} = 2. This is optimal.\n\nSample Input 2\n\n5 3\n5\n7\n5\n7\n7\n\nSample Output 2\n\n0\n\nIf we decorate the second, fourth and fifth trees, h_{max} = 7, h_{min} = 7 so h_{max} - h_{min} = 0. This is optimal.\n\nThere are not too many trees in these sample inputs, but note that there can be at most one hundred thousand trees (we just can't put a sample with a hundred thousand lines here).", "sample_input": "5 3\n10\n15\n11\n14\n12\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03208", "source_text": "Score : 300 points\n\nProblem Statement\n\nIn some other world, today is Christmas Eve.\n\nThere are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \\leq i \\leq N) is h_i meters.\n\nHe decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible.\n\nMore specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}?\n\nConstraints\n\n2 \\leq K < N \\leq 10^5\n\n1 \\leq h_i \\leq 10^9\n\nh_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1\nh_2\n:\nh_N\n\nOutput\n\nPrint the minimum possible value of h_{max} - h_{min}.\n\nSample Input 1\n\n5 3\n10\n15\n11\n14\n12\n\nSample Output 1\n\n2\n\nIf we decorate the first, third and fifth trees, h_{max} = 12, h_{min} = 10 so h_{max} - h_{min} = 2. This is optimal.\n\nSample Input 2\n\n5 3\n5\n7\n5\n7\n7\n\nSample Output 2\n\n0\n\nIf we decorate the second, fourth and fifth trees, h_{max} = 7, h_{min} = 7 so h_{max} - h_{min} = 0. This is optimal.\n\nThere are not too many trees in these sample inputs, but note that there can be at most one hundred thousand trees (we just can't put a sample with a hundred thousand lines here).", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 200, "cpu_time_ms": 81, "memory_kb": 5376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s029928302", "group_id": "codeNet:p03208", "input_text": "let id x = x\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n    let h = Array.init n (fun _ -> Scanf.scanf \"%d\\n\" id) in\n    Array.sort (-) h;\n    Array.init (n-k+1) (fun i -> h.(i+k-1) - h.(i))\n    |> Array.fold_left min 1000000001\n    |> Printf.printf \"%d\"\n", "language": "OCaml", "metadata": {"date": 1544323348, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s029928302.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s029928302", "user_id": "u604818425"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let id x = x\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n    let h = Array.init n (fun _ -> Scanf.scanf \"%d\\n\" id) in\n    Array.sort (-) h;\n    Array.init (n-k+1) (fun i -> h.(i+k-1) - h.(i))\n    |> Array.fold_left min 1000000001\n    |> Printf.printf \"%d\"\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIn some other world, today is Christmas Eve.\n\nThere are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \\leq i \\leq N) is h_i meters.\n\nHe decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible.\n\nMore specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}?\n\nConstraints\n\n2 \\leq K < N \\leq 10^5\n\n1 \\leq h_i \\leq 10^9\n\nh_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1\nh_2\n:\nh_N\n\nOutput\n\nPrint the minimum possible value of h_{max} - h_{min}.\n\nSample Input 1\n\n5 3\n10\n15\n11\n14\n12\n\nSample Output 1\n\n2\n\nIf we decorate the first, third and fifth trees, h_{max} = 12, h_{min} = 10 so h_{max} - h_{min} = 2. This is optimal.\n\nSample Input 2\n\n5 3\n5\n7\n5\n7\n7\n\nSample Output 2\n\n0\n\nIf we decorate the second, fourth and fifth trees, h_{max} = 7, h_{min} = 7 so h_{max} - h_{min} = 0. This is optimal.\n\nThere are not too many trees in these sample inputs, but note that there can be at most one hundred thousand trees (we just can't put a sample with a hundred thousand lines here).", "sample_input": "5 3\n10\n15\n11\n14\n12\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03208", "source_text": "Score : 300 points\n\nProblem Statement\n\nIn some other world, today is Christmas Eve.\n\nThere are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \\leq i \\leq N) is h_i meters.\n\nHe decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible.\n\nMore specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}?\n\nConstraints\n\n2 \\leq K < N \\leq 10^5\n\n1 \\leq h_i \\leq 10^9\n\nh_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1\nh_2\n:\nh_N\n\nOutput\n\nPrint the minimum possible value of h_{max} - h_{min}.\n\nSample Input 1\n\n5 3\n10\n15\n11\n14\n12\n\nSample Output 1\n\n2\n\nIf we decorate the first, third and fifth trees, h_{max} = 12, h_{min} = 10 so h_{max} - h_{min} = 2. This is optimal.\n\nSample Input 2\n\n5 3\n5\n7\n5\n7\n7\n\nSample Output 2\n\n0\n\nIf we decorate the second, fourth and fifth trees, h_{max} = 7, h_{min} = 7 so h_{max} - h_{min} = 0. This is optimal.\n\nThere are not too many trees in these sample inputs, but note that there can be at most one hundred thousand trees (we just can't put a sample with a hundred thousand lines here).", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 258, "cpu_time_ms": 64, "memory_kb": 6144}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s573537796", "group_id": "codeNet:p03209", "input_text": "let rec size = function\n    | 0 -> 1\n    | n -> 3 + 2 * size (n - 1) \n\nlet rec full = function\n    | 0 -> 1\n    | n -> 1 + 2 * full (n - 1)\n\nlet rec f x = function\n    | 0 -> if x > 0 then 1 else 0\n    | n -> let m = (size n) / 2 + 1 in\n        if x < m\n        then f (x - 1) (n - 1)\n        else (full (n - 1)) + 1 + f (x - m) (n - 1)\n\nlet () = Scanf.scanf \"%d %d\" @@ fun n x ->\n    f x n |> Printf.printf \"%d\"\n", "language": "OCaml", "metadata": {"date": 1544331060, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s573537796.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s573537796", "user_id": "u604818425"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let rec size = function\n    | 0 -> 1\n    | n -> 3 + 2 * size (n - 1) \n\nlet rec full = function\n    | 0 -> 1\n    | n -> 1 + 2 * full (n - 1)\n\nlet rec f x = function\n    | 0 -> if x > 0 then 1 else 0\n    | n -> let m = (size n) / 2 + 1 in\n        if x < m\n        then f (x - 1) (n - 1)\n        else (full (n - 1)) + 1 + f (x - m) (n - 1)\n\nlet () = Scanf.scanf \"%d %d\" @@ fun n x ->\n    f x n |> Printf.printf \"%d\"\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nIn some other world, today is Christmas.\n\nMr. Takaha decides to make a multi-dimensional burger in his party. A level-L burger (L is an integer greater than or equal to 0) is the following thing:\n\nA level-0 burger is a patty.\n\nA level-L burger (L \\geq 1) is a bun, a level-(L-1) burger, a patty, another level-(L-1) burger and another bun, stacked vertically in this order from the bottom.\n\nFor example, a level-1 burger and a level-2 burger look like BPPPB and BBPPPBPBPPPBB (rotated 90 degrees), where B and P stands for a bun and a patty.\n\nThe burger Mr. Takaha will make is a level-N burger. Lunlun the Dachshund will eat X layers from the bottom of this burger (a layer is a patty or a bun). How many patties will she eat?\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq X \\leq ( the total number of layers in a level-N burger )\n\nN and X are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\n\nOutput\n\nPrint the number of patties in the bottom-most X layers from the bottom of a level-N burger.\n\nSample Input 1\n\n2 7\n\nSample Output 1\n\n4\n\nThere are 4 patties in the bottom-most 7 layers of a level-2 burger (BBPPPBPBPPPBB).\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\n0\n\nThe bottom-most layer of a level-1 burger is a bun.\n\nSample Input 3\n\n50 4321098765432109\n\nSample Output 3\n\n2160549382716056\n\nA level-50 burger is rather thick, to the extent that the number of its layers does not fit into a 32-bit integer.", "sample_input": "2 7\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03209", "source_text": "Score : 400 points\n\nProblem Statement\n\nIn some other world, today is Christmas.\n\nMr. Takaha decides to make a multi-dimensional burger in his party. A level-L burger (L is an integer greater than or equal to 0) is the following thing:\n\nA level-0 burger is a patty.\n\nA level-L burger (L \\geq 1) is a bun, a level-(L-1) burger, a patty, another level-(L-1) burger and another bun, stacked vertically in this order from the bottom.\n\nFor example, a level-1 burger and a level-2 burger look like BPPPB and BBPPPBPBPPPBB (rotated 90 degrees), where B and P stands for a bun and a patty.\n\nThe burger Mr. Takaha will make is a level-N burger. Lunlun the Dachshund will eat X layers from the bottom of this burger (a layer is a patty or a bun). How many patties will she eat?\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq X \\leq ( the total number of layers in a level-N burger )\n\nN and X are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\n\nOutput\n\nPrint the number of patties in the bottom-most X layers from the bottom of a level-N burger.\n\nSample Input 1\n\n2 7\n\nSample Output 1\n\n4\n\nThere are 4 patties in the bottom-most 7 layers of a level-2 burger (BBPPPBPBPPPBB).\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\n0\n\nThe bottom-most layer of a level-1 burger is a bun.\n\nSample Input 3\n\n50 4321098765432109\n\nSample Output 3\n\n2160549382716056\n\nA level-50 burger is rather thick, to the extent that the number of its layers does not fit into a 32-bit integer.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s795241427", "group_id": "codeNet:p03210", "input_text": "let x = read_int ()\nlet _ = if x = 3 || x = 5 || x = 7 then print_endline \"YES\" else print_endline \"NO\"\n", "language": "OCaml", "metadata": {"date": 1583974363, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s795241427.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s795241427", "user_id": "u511870776"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let x = read_int ()\nlet _ = if x = 3 || x = 5 || x = 7 then print_endline \"YES\" else print_endline \"NO\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "sample_input": "5\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03210", "source_text": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 104, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s952621090", "group_id": "codeNet:p03210", "input_text": "let () = print_endline @@ Scanf.scanf \"%d\" @@ function\n  | 7 | 5 | 3 -> \"YES\"\n  | _ -> \"NO\"\n", "language": "OCaml", "metadata": {"date": 1543802604, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s952621090.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s952621090", "user_id": "u504158101"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let () = print_endline @@ Scanf.scanf \"%d\" @@ function\n  | 7 | 5 | 3 -> \"YES\"\n  | _ -> \"NO\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "sample_input": "5\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03210", "source_text": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 92, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s771384357", "group_id": "codeNet:p03211", "input_text": "\nlet s = read_line ();;\n\nlet rec f i min_diff =\n    let min_diff = min min_diff (abs ((int_of_string (String.sub s i 3)) - 753)) in\n    if (String.length s) = (i + 3) then\n        min_diff\n    else\n        f (i+1) min_diff\n;;\n\nprint_endline (string_of_int (f 0 999999))\n", "language": "OCaml", "metadata": {"date": 1544286798, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03211.html", "problem_id": "p03211", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03211/input.txt", "sample_output_relpath": "derived/input_output/data/p03211/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03211/OCaml/s771384357.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s771384357", "user_id": "u981708764"}, "prompt_components": {"gold_output": "34\n", "input_to_evaluate": "\nlet s = read_line ();;\n\nlet rec f i min_diff =\n    let min_diff = min min_diff (abs ((int_of_string (String.sub s i 3)) - 753)) in\n    if (String.length s) = (i + 3) then\n        min_diff\n    else\n        f (i+1) min_diff\n;;\n\nprint_endline (string_of_int (f 0 999999))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere is a string S consisting of digits 1, 2, ..., 9.\nLunlun, the Dachshund, will take out three consecutive digits from S, treat them as a single integer X and bring it to her master. (She cannot rearrange the digits.)\n\nThe master's favorite number is 753. The closer to this number, the better.\nWhat is the minimum possible (absolute) difference between X and 753?\n\nConstraints\n\nS is a string of length between 4 and 10 (inclusive).\n\nEach character in S is 1, 2, ..., or 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum possible difference between X and 753.\n\nSample Input 1\n\n1234567876\n\nSample Output 1\n\n34\n\nTaking out the seventh to ninth characters results in X = 787, and the difference between this and 753 is 787 - 753 = 34. The difference cannot be made smaller, no matter where X is taken from.\n\nNote that the digits cannot be rearranged. For example, taking out 567 and rearranging it to 765 is not allowed.\n\nWe cannot take out three digits that are not consecutive from S, either. For example, taking out the seventh digit 7, the ninth digit 7 and the tenth digit 6 to obtain 776 is not allowed.\n\nSample Input 2\n\n35753\n\nSample Output 2\n\n0\n\nIf 753 itself can be taken out, the answer is 0.\n\nSample Input 3\n\n1111111111\n\nSample Output 3\n\n642\n\nNo matter where X is taken from, X = 111, with the difference 753 - 111 = 642.", "sample_input": "1234567876\n"}, "reference_outputs": ["34\n"], "source_document_id": "p03211", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere is a string S consisting of digits 1, 2, ..., 9.\nLunlun, the Dachshund, will take out three consecutive digits from S, treat them as a single integer X and bring it to her master. (She cannot rearrange the digits.)\n\nThe master's favorite number is 753. The closer to this number, the better.\nWhat is the minimum possible (absolute) difference between X and 753?\n\nConstraints\n\nS is a string of length between 4 and 10 (inclusive).\n\nEach character in S is 1, 2, ..., or 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum possible difference between X and 753.\n\nSample Input 1\n\n1234567876\n\nSample Output 1\n\n34\n\nTaking out the seventh to ninth characters results in X = 787, and the difference between this and 753 is 787 - 753 = 34. The difference cannot be made smaller, no matter where X is taken from.\n\nNote that the digits cannot be rearranged. For example, taking out 567 and rearranging it to 765 is not allowed.\n\nWe cannot take out three digits that are not consecutive from S, either. For example, taking out the seventh digit 7, the ninth digit 7 and the tenth digit 6 to obtain 776 is not allowed.\n\nSample Input 2\n\n35753\n\nSample Output 2\n\n0\n\nIf 753 itself can be taken out, the answer is 0.\n\nSample Input 3\n\n1111111111\n\nSample Output 3\n\n642\n\nNo matter where X is taken from, X = 111, with the difference 753 - 111 = 642.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 270, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s380674315", "group_id": "codeNet:p03213", "input_text": "open Printf open Scanf\nmodule Lib = struct\n  let i32,i64,ist = Int64.(to_int,of_int,to_string)\n  let (+$) = (+) let (-$) = (-) let (/$) = (/) let ( *$) = ( * ) let (%$) = (mod)\n  let labs = Int64.abs\n  let (+),(-),( * ),(/),(mod),(%) = Int64.(add,sub,mul,div,rem,rem)\n  let (+=) r v = r := !r + v\n  let (-=) r v = r := !r - v\n  let ( *= ) r v = r := !r * v\n  let (/=) r v = r := !r / v\n  let (%=) r v = r := !r % v\n  let max_i64,min_i64 = Int64.(max_int,min_int)\n  (* math *)\n  let ceildiv p q = (p+q-1L) / q\n  let rec gcd m n = match m,n with | m,0L -> m | m,n -> gcd n (m mod n)\n  let lcm m n = m / gcd m n * n\n  module I64_infix = struct\n    let (land),(lor),(lxor),lnot,(lsl),(lsr),(asr) =\n      let open Int64 in\n      (logand),(logor),(logxor),lognot,\n      (fun u v -> shift_left u (i32 v)),\n      (fun u v -> shift_right u (i32 v)),\n      (fun u v -> shift_right_logical u (i32 v))\n  end\n  (* input *)\n  let input_i64_array n = Array.init (i32 n) (fun _ -> Scanf.scanf \" %Ld\" (fun v -> v))\n  let get_i64 _ = Scanf.scanf \" %Ld\" (fun v -> v)\n  let get_2_i64 _ = Scanf.scanf \" %Ld %Ld\" (fun u v -> u,v)\n  let get_3_i64 _ = Scanf.scanf \" %Ld %Ld %Ld\" (fun u v w -> u,v,w)\n  let get_4_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld\" (fun u v w x -> u,v,w,x)\n  let get_5_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld %Ld\" (fun u v w x y -> u,v,w,x,y)\n  let i32_get_int _ = Scanf.scanf \" %d\" (fun v -> v) let i32_get_2_ints _ = Scanf.scanf \" %d %d\" (fun u v -> u,v) let i32_get_3_ints _ = Scanf.scanf \" %d %d %d\" (fun u v w -> u,v,w) let i32_get_4_ints _ = Scanf.scanf \" %d %d %d %d\" (fun u v w x -> u,v,w,x) let i32_get_5_ints _ = Scanf.scanf \" %d %d %d %d %d\" (fun u v w x y -> u,v,w,x,y)\n  (* utils *)\n  external id : 'a -> 'a = \"%identity\"\n  let ( *< ) f g x = f (g x)\n  let ( *> ) f g x = g (f x)\n  let rv f p q = f q p (* ex. 24 |> rv (/) 6 *)\n  let alen a = i64 @@ Array.length a\n  let llen l = i64 @@  List.length l\n  let string_of_list ?(separator=\" \") f ls = ls |> List.map f |> String.concat separator\n  let string_of_array ?(separator=\" \") f a = a |> Array.to_list |> string_of_list ~separator f\n  let char_list_of_string str = let rec f0 i a = if i<0 then a else f0 (i-$1) (str.[i]::a) in f0 (String.length str -$ 1) []\n  let string_of_char_list ls = List.fold_left (fun u v -> u ^ (String.make 1 v)) \"\" ls\n  let fail _ = failwith \"fail\"\n  let dx,dy = [|1;0;-1;0|],[|0;1;0;-1|]\n  let range l r = let ls = ref [] in for i=i32 l to i32 r do ls := i :: !ls done;!ls |> List.rev\n  let cartesian_product u v = u |> List.map (fun p -> List.map (fun q -> p,q) v) |> List.flatten\n  let shuffle a = Array.sort (fun _ _ -> (Random.int 3) -$ 1) a\n  let binary_search ng ok f = let d = if ng < ok then 1L else -1L in\n    let rec f0 ng ok =\n      if labs (ok - ng) <= 1L then ok\n      else let mid = ng + (ok - ng) / 2L in if f mid then f0 ng mid else f0 mid ok\n    in f0 (ng-1L*d) (ok+1L*d)\n  let lower_bound a v = binary_search 0L (alen a - 1L) (fun i -> a.(i32 i) >= v)\n  let upper_bound a v = binary_search 0L (alen a - 1L) (fun i -> a.(i32 i) >  v)\n  let equal_range a v = lower_bound a v, upper_bound a v (* #=snd-fst *)\n  let rec fix f x = f (fix f) x\n  let fix_memo ?(size=10000) f x =\n    let tb = Hashtbl.create ~random:true size in\n    let rec f0 x =\n      try Hashtbl.find tb x with\n      | Not_found -> (let v = f f0 x in Hashtbl.add tb x v; v)\n    in f0 x\n  (* imperative *)\n  let rep f t ?(stride=1L) fbod = let i = ref f in while !i <= t do fbod !i; i := !i + stride done\n  let repb f t ?(stride=1L) fbod = let i,c = ref f,ref true in while !i <= t && !c do\n    match fbod !i with | `Break -> c := false | `Ok -> i := !i + stride done\n  let repm f t ?(stride=1L) m0 fbod =\n    let i,c,m = ref f,ref true,ref m0 in\n    while !i<=t && !c do match fbod !m !i with\n    | `Break -> c := false | `Break_m m' -> (c := false; m := m') | `Ok m' -> m := m'; i := !i + stride done; !m\n  let repi f t ?(stride=1) fbod = let i = ref f in while !i <= t do fbod !i; i := !i +$ stride done\n  let repib f t ?(stride=1) fbod = let i,c = ref f,ref true in while !i <= t && !c do\n    match fbod !i with | `Break -> c := false | `Ok -> i := !i +$ stride done\n  let repim f t ?(stride=1) m0 fbod =\n    let i,c,m = ref f,ref true,ref m0 in\n    while !i<=t && !c do match fbod !m !i with\n    | `Break -> c := false | `Break_m m' -> (c := false; m := m') | `Ok m' -> m := m'; i := !i +$ stride done; !m\n  let rep_rev f t ?(stride=1L) fbod = rep t f ~stride @@ fun v -> fbod @@ f + t - v\n  let repb_rev f t ?(stride=1L) fbod = repb t f ~stride @@ fun v -> fbod @@ f + t - v\n  let repm_rev f t ?(stride=1L) m0 fbod = repm f t ~stride m0 @@ fun u v -> fbod u @@ f + t - v\n  let repi_rev f t ?(stride=1) fbod = repi t f ~stride @@ fun v -> fbod @@ f +$ t -$ v\n  let repib_rev f t ?(stride=1) fbod = repib t f ~stride @@ fun v -> fbod @@ f +$ t -$ v\n  let repim_rev f t ?(stride=1) m0 fbod = repim f t ~stride m0 @@ fun u v -> fbod u @@ f +$ t -$ v\n  (* output *)\n  let print_list_mle f ls = string_of_list f ls |> print_endline\n  let print_array_mle f a = string_of_array f a |> print_endline\n  let print_list f ls = ls |> List.iter (fun v -> printf \"%s \" @@ f v); print_newline ()\n  let print_array f a = a |> Array.iter (fun v -> printf \"%s \" @@ f v); print_newline ()\n  (* debug *)\n  let dump_2darr f a = a |> Array.iter (fun b -> print_array f b)\n  let dump_i64_list ls = print_list ist ls\n  let dump_i64_array a = print_array ist a\nend open Lib open Array\n\nlet () =\n  let n = i32_get_int 0 in\n  let r = [|0;0;0;0;0;0;0;0;0;1;1;1;1;2;2;3;3;3;3;8;8;11;11;11;11;14;14;32;32;35;35;35;35;42;42;42;42;49;49;49;49;49;49;75;75;86;86;86;86;86;86;123;123;131;131;131;131;148;148;153;153;170;170;170;170;170;170;227;227;227;227;227;227;250;250;323;323;324;324;324;324;354;354;354;354;384;384;384;384;384;391;491;491;529;529;529;529;529;529;543;|]\n  in\n  printf \"%d\\n\" r.(n-$1)\n(*\n  let sieve n = (* includes 0, O(nloglogn) *)\n  let n = i32 n in\n  let prime = Array.make (n+$1) true in\n  prime.(0) <- false;\n  prime.(1) <- false;\n  for i=2 to n do\n    if prime.(i) then let j = ref @@ i*$2 in\n    while !j <= n do prime.(!j) <- false; j := !j +$ i; done\n  done; prime\n\n  let divisors_1_to_n n = (* O(nloglogn) *)\n    let res = Array.make (n+$1) [] in\n    for i=1 to n do\n      let j = ref @@ i in\n      while !j <= n do res.(!j) <- i::res.(!j); j := !j +$ i; done;\n      res.(i) <- List.rev res.(i)\n    done; res\n    let factors n =\n      let m,r = ref n,ref [] in\n      rep 2L (n/2L) (fun i ->\n        if !m mod i = 0L then (\n          let k = ref 0L in\n          while !m mod i = 0L do\n            k += 1L; m /= i;\n          done;\n          r := (i,!k) :: !r));\n      if !m>1L then (!m,1L)::!r else !r\nlet () =\n  let primes =\n    let a = sieve 108L in\n    fold_left (fun (l,i) v -> if v then ((i)::l,i+1L) else (l,i+1L)) ([],0L) a\n    |> fst |> of_list\n  in\n  let divs = divisors_1_to_n 108 in\n  (* let n = get_i64 0 in *)\n  rep 1L 100L (fun n ->\n  let nprimes = make 108 0L in\n  rep 1L n (fun i ->\n    let facts = factors i in\n    (* print_list (fun (n,k) -> sprintf \"(%Ld,%Ld)\" n k) facts; *)\n    List.iter (fun (n,k) -> nprimes.(i32 n) <- nprimes.(i32 n) + k) facts;\n  );\n  (* print_array ist nprimes; *)\n  let res = ref 0L in\n  (* 3,5,5 *)\n  rep 1L n (fun i ->\n    rep (i+1L) n (fun j ->\n      rep (j+1L) n (fun k ->\n        let h = [3L,5L,5L;5L,3L,5L;5L,5L,3L] in\n        let i,j,k = nprimes.(i32 i)+1L,nprimes.(i32 j)+1L,nprimes.(i32 k)+1L in\n        List.iter (fun (p,q,r) ->\n          if p<=i && q<=j && r<=k then (\n            res += 1L;\n            (* (i-p+1L)*(j-q+1L)*(k-r+1L) *)\n            (* let h = [3L,15L;15L,3L] in\n            let i,j = nprimes.(i32 i)+1L,nprimes.(i32 j)+1L in\n            let f = ref false in\n            List.iter (fun (p,q) ->\n              if p<=i && q<=j then f:=true\n              (* (i-p+1L)*(j-q+1L) *)\n            ) h;\n            if not !f then res += 1L; *)\n          )\n        ) h\n      )\n    )\n  );\n  (* 5,15 *)\n  rep 1L n (fun i ->\n    rep (i+1L) n (fun j ->\n      let h = [5L,15L;15L,5L] in\n      let i,j = nprimes.(i32 i)+1L,nprimes.(i32 j)+1L in\n      List.iter (fun (p,q) ->\n        if p<=i && q<=j then res += 1L\n        (* (i-p+1L)*(j-q+1L) *)\n      ) h\n    )\n  );\n  (* 3,25 *)\n  rep 1L n (fun i ->\n    rep (i+1L) n (fun j ->\n      let h = [3L,25L;25L,3L] in\n      let i,j = nprimes.(i32 i)+1L,nprimes.(i32 j)+1L in\n      List.iter (fun (p,q) ->\n        if p<=i && q<=j then res += 1L\n        (* (i-p+1L)*(j-q+1L) *)\n      ) h\n    )\n  );\n  (* 75 *)\n  rep 1L n (fun i ->\n    if nprimes.(i32 i)+1L >= 75L then res += 1L\n  );\n  printf \"%Ld;\" !res\n  )\n\n\n\n\n\n\n\n\n *)\n", "language": "OCaml", "metadata": {"date": 1543805052, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03213.html", "problem_id": "p03213", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03213/input.txt", "sample_output_relpath": "derived/input_output/data/p03213/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03213/OCaml/s380674315.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s380674315", "user_id": "u481480055"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "open Printf open Scanf\nmodule Lib = struct\n  let i32,i64,ist = Int64.(to_int,of_int,to_string)\n  let (+$) = (+) let (-$) = (-) let (/$) = (/) let ( *$) = ( * ) let (%$) = (mod)\n  let labs = Int64.abs\n  let (+),(-),( * ),(/),(mod),(%) = Int64.(add,sub,mul,div,rem,rem)\n  let (+=) r v = r := !r + v\n  let (-=) r v = r := !r - v\n  let ( *= ) r v = r := !r * v\n  let (/=) r v = r := !r / v\n  let (%=) r v = r := !r % v\n  let max_i64,min_i64 = Int64.(max_int,min_int)\n  (* math *)\n  let ceildiv p q = (p+q-1L) / q\n  let rec gcd m n = match m,n with | m,0L -> m | m,n -> gcd n (m mod n)\n  let lcm m n = m / gcd m n * n\n  module I64_infix = struct\n    let (land),(lor),(lxor),lnot,(lsl),(lsr),(asr) =\n      let open Int64 in\n      (logand),(logor),(logxor),lognot,\n      (fun u v -> shift_left u (i32 v)),\n      (fun u v -> shift_right u (i32 v)),\n      (fun u v -> shift_right_logical u (i32 v))\n  end\n  (* input *)\n  let input_i64_array n = Array.init (i32 n) (fun _ -> Scanf.scanf \" %Ld\" (fun v -> v))\n  let get_i64 _ = Scanf.scanf \" %Ld\" (fun v -> v)\n  let get_2_i64 _ = Scanf.scanf \" %Ld %Ld\" (fun u v -> u,v)\n  let get_3_i64 _ = Scanf.scanf \" %Ld %Ld %Ld\" (fun u v w -> u,v,w)\n  let get_4_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld\" (fun u v w x -> u,v,w,x)\n  let get_5_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld %Ld\" (fun u v w x y -> u,v,w,x,y)\n  let i32_get_int _ = Scanf.scanf \" %d\" (fun v -> v) let i32_get_2_ints _ = Scanf.scanf \" %d %d\" (fun u v -> u,v) let i32_get_3_ints _ = Scanf.scanf \" %d %d %d\" (fun u v w -> u,v,w) let i32_get_4_ints _ = Scanf.scanf \" %d %d %d %d\" (fun u v w x -> u,v,w,x) let i32_get_5_ints _ = Scanf.scanf \" %d %d %d %d %d\" (fun u v w x y -> u,v,w,x,y)\n  (* utils *)\n  external id : 'a -> 'a = \"%identity\"\n  let ( *< ) f g x = f (g x)\n  let ( *> ) f g x = g (f x)\n  let rv f p q = f q p (* ex. 24 |> rv (/) 6 *)\n  let alen a = i64 @@ Array.length a\n  let llen l = i64 @@  List.length l\n  let string_of_list ?(separator=\" \") f ls = ls |> List.map f |> String.concat separator\n  let string_of_array ?(separator=\" \") f a = a |> Array.to_list |> string_of_list ~separator f\n  let char_list_of_string str = let rec f0 i a = if i<0 then a else f0 (i-$1) (str.[i]::a) in f0 (String.length str -$ 1) []\n  let string_of_char_list ls = List.fold_left (fun u v -> u ^ (String.make 1 v)) \"\" ls\n  let fail _ = failwith \"fail\"\n  let dx,dy = [|1;0;-1;0|],[|0;1;0;-1|]\n  let range l r = let ls = ref [] in for i=i32 l to i32 r do ls := i :: !ls done;!ls |> List.rev\n  let cartesian_product u v = u |> List.map (fun p -> List.map (fun q -> p,q) v) |> List.flatten\n  let shuffle a = Array.sort (fun _ _ -> (Random.int 3) -$ 1) a\n  let binary_search ng ok f = let d = if ng < ok then 1L else -1L in\n    let rec f0 ng ok =\n      if labs (ok - ng) <= 1L then ok\n      else let mid = ng + (ok - ng) / 2L in if f mid then f0 ng mid else f0 mid ok\n    in f0 (ng-1L*d) (ok+1L*d)\n  let lower_bound a v = binary_search 0L (alen a - 1L) (fun i -> a.(i32 i) >= v)\n  let upper_bound a v = binary_search 0L (alen a - 1L) (fun i -> a.(i32 i) >  v)\n  let equal_range a v = lower_bound a v, upper_bound a v (* #=snd-fst *)\n  let rec fix f x = f (fix f) x\n  let fix_memo ?(size=10000) f x =\n    let tb = Hashtbl.create ~random:true size in\n    let rec f0 x =\n      try Hashtbl.find tb x with\n      | Not_found -> (let v = f f0 x in Hashtbl.add tb x v; v)\n    in f0 x\n  (* imperative *)\n  let rep f t ?(stride=1L) fbod = let i = ref f in while !i <= t do fbod !i; i := !i + stride done\n  let repb f t ?(stride=1L) fbod = let i,c = ref f,ref true in while !i <= t && !c do\n    match fbod !i with | `Break -> c := false | `Ok -> i := !i + stride done\n  let repm f t ?(stride=1L) m0 fbod =\n    let i,c,m = ref f,ref true,ref m0 in\n    while !i<=t && !c do match fbod !m !i with\n    | `Break -> c := false | `Break_m m' -> (c := false; m := m') | `Ok m' -> m := m'; i := !i + stride done; !m\n  let repi f t ?(stride=1) fbod = let i = ref f in while !i <= t do fbod !i; i := !i +$ stride done\n  let repib f t ?(stride=1) fbod = let i,c = ref f,ref true in while !i <= t && !c do\n    match fbod !i with | `Break -> c := false | `Ok -> i := !i +$ stride done\n  let repim f t ?(stride=1) m0 fbod =\n    let i,c,m = ref f,ref true,ref m0 in\n    while !i<=t && !c do match fbod !m !i with\n    | `Break -> c := false | `Break_m m' -> (c := false; m := m') | `Ok m' -> m := m'; i := !i +$ stride done; !m\n  let rep_rev f t ?(stride=1L) fbod = rep t f ~stride @@ fun v -> fbod @@ f + t - v\n  let repb_rev f t ?(stride=1L) fbod = repb t f ~stride @@ fun v -> fbod @@ f + t - v\n  let repm_rev f t ?(stride=1L) m0 fbod = repm f t ~stride m0 @@ fun u v -> fbod u @@ f + t - v\n  let repi_rev f t ?(stride=1) fbod = repi t f ~stride @@ fun v -> fbod @@ f +$ t -$ v\n  let repib_rev f t ?(stride=1) fbod = repib t f ~stride @@ fun v -> fbod @@ f +$ t -$ v\n  let repim_rev f t ?(stride=1) m0 fbod = repim f t ~stride m0 @@ fun u v -> fbod u @@ f +$ t -$ v\n  (* output *)\n  let print_list_mle f ls = string_of_list f ls |> print_endline\n  let print_array_mle f a = string_of_array f a |> print_endline\n  let print_list f ls = ls |> List.iter (fun v -> printf \"%s \" @@ f v); print_newline ()\n  let print_array f a = a |> Array.iter (fun v -> printf \"%s \" @@ f v); print_newline ()\n  (* debug *)\n  let dump_2darr f a = a |> Array.iter (fun b -> print_array f b)\n  let dump_i64_list ls = print_list ist ls\n  let dump_i64_array a = print_array ist a\nend open Lib open Array\n\nlet () =\n  let n = i32_get_int 0 in\n  let r = [|0;0;0;0;0;0;0;0;0;1;1;1;1;2;2;3;3;3;3;8;8;11;11;11;11;14;14;32;32;35;35;35;35;42;42;42;42;49;49;49;49;49;49;75;75;86;86;86;86;86;86;123;123;131;131;131;131;148;148;153;153;170;170;170;170;170;170;227;227;227;227;227;227;250;250;323;323;324;324;324;324;354;354;354;354;384;384;384;384;384;391;491;491;529;529;529;529;529;529;543;|]\n  in\n  printf \"%d\\n\" r.(n-$1)\n(*\n  let sieve n = (* includes 0, O(nloglogn) *)\n  let n = i32 n in\n  let prime = Array.make (n+$1) true in\n  prime.(0) <- false;\n  prime.(1) <- false;\n  for i=2 to n do\n    if prime.(i) then let j = ref @@ i*$2 in\n    while !j <= n do prime.(!j) <- false; j := !j +$ i; done\n  done; prime\n\n  let divisors_1_to_n n = (* O(nloglogn) *)\n    let res = Array.make (n+$1) [] in\n    for i=1 to n do\n      let j = ref @@ i in\n      while !j <= n do res.(!j) <- i::res.(!j); j := !j +$ i; done;\n      res.(i) <- List.rev res.(i)\n    done; res\n    let factors n =\n      let m,r = ref n,ref [] in\n      rep 2L (n/2L) (fun i ->\n        if !m mod i = 0L then (\n          let k = ref 0L in\n          while !m mod i = 0L do\n            k += 1L; m /= i;\n          done;\n          r := (i,!k) :: !r));\n      if !m>1L then (!m,1L)::!r else !r\nlet () =\n  let primes =\n    let a = sieve 108L in\n    fold_left (fun (l,i) v -> if v then ((i)::l,i+1L) else (l,i+1L)) ([],0L) a\n    |> fst |> of_list\n  in\n  let divs = divisors_1_to_n 108 in\n  (* let n = get_i64 0 in *)\n  rep 1L 100L (fun n ->\n  let nprimes = make 108 0L in\n  rep 1L n (fun i ->\n    let facts = factors i in\n    (* print_list (fun (n,k) -> sprintf \"(%Ld,%Ld)\" n k) facts; *)\n    List.iter (fun (n,k) -> nprimes.(i32 n) <- nprimes.(i32 n) + k) facts;\n  );\n  (* print_array ist nprimes; *)\n  let res = ref 0L in\n  (* 3,5,5 *)\n  rep 1L n (fun i ->\n    rep (i+1L) n (fun j ->\n      rep (j+1L) n (fun k ->\n        let h = [3L,5L,5L;5L,3L,5L;5L,5L,3L] in\n        let i,j,k = nprimes.(i32 i)+1L,nprimes.(i32 j)+1L,nprimes.(i32 k)+1L in\n        List.iter (fun (p,q,r) ->\n          if p<=i && q<=j && r<=k then (\n            res += 1L;\n            (* (i-p+1L)*(j-q+1L)*(k-r+1L) *)\n            (* let h = [3L,15L;15L,3L] in\n            let i,j = nprimes.(i32 i)+1L,nprimes.(i32 j)+1L in\n            let f = ref false in\n            List.iter (fun (p,q) ->\n              if p<=i && q<=j then f:=true\n              (* (i-p+1L)*(j-q+1L) *)\n            ) h;\n            if not !f then res += 1L; *)\n          )\n        ) h\n      )\n    )\n  );\n  (* 5,15 *)\n  rep 1L n (fun i ->\n    rep (i+1L) n (fun j ->\n      let h = [5L,15L;15L,5L] in\n      let i,j = nprimes.(i32 i)+1L,nprimes.(i32 j)+1L in\n      List.iter (fun (p,q) ->\n        if p<=i && q<=j then res += 1L\n        (* (i-p+1L)*(j-q+1L) *)\n      ) h\n    )\n  );\n  (* 3,25 *)\n  rep 1L n (fun i ->\n    rep (i+1L) n (fun j ->\n      let h = [3L,25L;25L,3L] in\n      let i,j = nprimes.(i32 i)+1L,nprimes.(i32 j)+1L in\n      List.iter (fun (p,q) ->\n        if p<=i && q<=j then res += 1L\n        (* (i-p+1L)*(j-q+1L) *)\n      ) h\n    )\n  );\n  (* 75 *)\n  rep 1L n (fun i ->\n    if nprimes.(i32 i)+1L >= 75L then res += 1L\n  );\n  printf \"%Ld;\" !res\n  )\n\n\n\n\n\n\n\n\n *)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given an integer N. Among the divisors of N! (= 1 \\times 2 \\times ... \\times N), how many Shichi-Go numbers (literally \"Seven-Five numbers\") are there?\n\nHere, a Shichi-Go number is a positive integer that has exactly 75 divisors.\n\nNote\n\nWhen a positive integer A divides a positive integer B, A is said to a divisor of B.\nFor example, 6 has four divisors: 1, 2, 3 and 6.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of the Shichi-Go numbers that are divisors of N!.\n\nSample Input 1\n\n9\n\nSample Output 1\n\n0\n\nThere are no Shichi-Go numbers among the divisors of 9! = 1 \\times 2 \\times ... \\times 9 = 362880.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1\n\nThere is one Shichi-Go number among the divisors of 10! = 3628800: 32400.\n\nSample Input 3\n\n100\n\nSample Output 3\n\n543", "sample_input": "9\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03213", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given an integer N. Among the divisors of N! (= 1 \\times 2 \\times ... \\times N), how many Shichi-Go numbers (literally \"Seven-Five numbers\") are there?\n\nHere, a Shichi-Go number is a positive integer that has exactly 75 divisors.\n\nNote\n\nWhen a positive integer A divides a positive integer B, A is said to a divisor of B.\nFor example, 6 has four divisors: 1, 2, 3 and 6.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of the Shichi-Go numbers that are divisors of N!.\n\nSample Input 1\n\n9\n\nSample Output 1\n\n0\n\nThere are no Shichi-Go numbers among the divisors of 9! = 1 \\times 2 \\times ... \\times 9 = 362880.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1\n\nThere is one Shichi-Go number among the divisors of 10! = 3628800: 32400.\n\nSample Input 3\n\n100\n\nSample Output 3\n\n543", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8582, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s481775403", "group_id": "codeNet:p03214", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n    let s = Array.fold_left (+) 0 a in\n\n    let rec loop i dist df =\n        if i = n then df else\n            if abs (a.(i) * n - s) < dist then loop (i + 1) (abs (a.(i) * n - s)) i\n                                          else loop (i + 1) dist df\n    in\n    loop 0 max_int 0 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1600659812, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s481775403.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s481775403", "user_id": "u342443598"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n    let s = Array.fold_left (+) 0 a in\n\n    let rec loop i dist df =\n        if i = n then df else\n            if abs (a.(i) * n - s) < dist then loop (i + 1) (abs (a.(i) * n - s)) i\n                                          else loop (i + 1) dist df\n    in\n    loop 0 max_int 0 |> Printf.printf \"%d\\n\"\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 3824}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s568818164", "group_id": "codeNet:p03214", "input_text": "open Printf open Scanf\nmodule Lib = struct\n  let i32,i64,ist = Int64.(to_int,of_int,to_string)\n  let (+$) = (+) let (-$) = (-) let (/$) = (/) let ( *$) = ( * ) let (%$) = (mod)\n  let labs = Int64.abs\n  let (+),(-),( * ),(/),(mod),(%) = Int64.(add,sub,mul,div,rem,rem)\n  let (+=) r v = r := !r + v\n  let (-=) r v = r := !r - v\n  let ( *= ) r v = r := !r * v\n  let (/=) r v = r := !r / v\n  let (%=) r v = r := !r % v\n  let max_i64,min_i64 = Int64.(max_int,min_int)\n  (* math *)\n  let ceildiv p q = (p+q-1L) / q\n  let rec gcd m n = match m,n with | m,0L -> m | m,n -> gcd n (m mod n)\n  let lcm m n = m / gcd m n * n\n  module I64_infix = struct\n    let (land),(lor),(lxor),lnot,(lsl),(lsr),(asr) =\n      let open Int64 in\n      (logand),(logor),(logxor),lognot,\n      (fun u v -> shift_left u (i32 v)),\n      (fun u v -> shift_right u (i32 v)),\n      (fun u v -> shift_right_logical u (i32 v))\n  end\n  (* input *)\n  let input_i64_array n = Array.init (i32 n) (fun _ -> Scanf.scanf \" %Ld\" (fun v -> v))\n  let get_i64 _ = Scanf.scanf \" %Ld\" (fun v -> v)\n  let get_2_i64 _ = Scanf.scanf \" %Ld %Ld\" (fun u v -> u,v)\n  let get_3_i64 _ = Scanf.scanf \" %Ld %Ld %Ld\" (fun u v w -> u,v,w)\n  let get_4_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld\" (fun u v w x -> u,v,w,x)\n  let get_5_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld %Ld\" (fun u v w x y -> u,v,w,x,y)\n  let i32_get_int _ = Scanf.scanf \" %d\" (fun v -> v) let i32_get_2_ints _ = Scanf.scanf \" %d %d\" (fun u v -> u,v) let i32_get_3_ints _ = Scanf.scanf \" %d %d %d\" (fun u v w -> u,v,w) let i32_get_4_ints _ = Scanf.scanf \" %d %d %d %d\" (fun u v w x -> u,v,w,x) let i32_get_5_ints _ = Scanf.scanf \" %d %d %d %d %d\" (fun u v w x y -> u,v,w,x,y)\n  (* utils *)\n  external id : 'a -> 'a = \"%identity\"\n  let ( *< ) f g x = f (g x)\n  let ( *> ) f g x = g (f x)\n  let rv f p q = f q p (* ex. 24 |> rv (/) 6 *)\n  let alen a = i64 @@ Array.length a\n  let llen l = i64 @@  List.length l\n  let string_of_list ?(separator=\" \") f ls = ls |> List.map f |> String.concat separator\n  let string_of_array ?(separator=\" \") f a = a |> Array.to_list |> string_of_list ~separator f\n  let char_list_of_string str = let rec f0 i a = if i<0 then a else f0 (i-$1) (str.[i]::a) in f0 (String.length str -$ 1) []\n  let string_of_char_list ls = List.fold_left (fun u v -> u ^ (String.make 1 v)) \"\" ls\n  let fail _ = failwith \"fail\"\n  let dx,dy = [|1;0;-1;0|],[|0;1;0;-1|]\n  let range l r = let ls = ref [] in for i=i32 l to i32 r do ls := i :: !ls done;!ls |> List.rev\n  let cartesian_product u v = u |> List.map (fun p -> List.map (fun q -> p,q) v) |> List.flatten\n  let shuffle a = Array.sort (fun _ _ -> (Random.int 3) -$ 1) a\n  let binary_search ng ok f = let d = if ng < ok then 1L else -1L in\n    let rec f0 ng ok =\n      if labs (ok - ng) <= 1L then ok\n      else let mid = ng + (ok - ng) / 2L in if f mid then f0 ng mid else f0 mid ok\n    in f0 (ng-1L*d) (ok+1L*d)\n  let lower_bound a v = binary_search 0L (alen a - 1L) (fun i -> a.(i32 i) >= v)\n  let upper_bound a v = binary_search 0L (alen a - 1L) (fun i -> a.(i32 i) >  v)\n  let equal_range a v = lower_bound a v, upper_bound a v (* #=snd-fst *)\n  let rec fix f x = f (fix f) x\n  let fix_memo ?(size=10000) f x =\n    let tb = Hashtbl.create ~random:true size in\n    let rec f0 x =\n      try Hashtbl.find tb x with\n      | Not_found -> (let v = f f0 x in Hashtbl.add tb x v; v)\n    in f0 x\n  (* imperative *)\n  let rep f t ?(stride=1L) fbod = let i = ref f in while !i <= t do fbod !i; i := !i + stride done\n  let repb f t ?(stride=1L) fbod = let i,c = ref f,ref true in while !i <= t && !c do\n    match fbod !i with | `Break -> c := false | `Ok -> i := !i + stride done\n  let repm f t ?(stride=1L) m0 fbod =\n    let i,c,m = ref f,ref true,ref m0 in\n    while !i<=t && !c do match fbod !m !i with\n    | `Break -> c := false | `Break_m m' -> (c := false; m := m') | `Ok m' -> m := m'; i := !i + stride done; !m\n  let repi f t ?(stride=1) fbod = let i = ref f in while !i <= t do fbod !i; i := !i +$ stride done\n  let repib f t ?(stride=1) fbod = let i,c = ref f,ref true in while !i <= t && !c do\n    match fbod !i with | `Break -> c := false | `Ok -> i := !i +$ stride done\n  let repim f t ?(stride=1) m0 fbod =\n    let i,c,m = ref f,ref true,ref m0 in\n    while !i<=t && !c do match fbod !m !i with\n    | `Break -> c := false | `Break_m m' -> (c := false; m := m') | `Ok m' -> m := m'; i := !i +$ stride done; !m\n  let rep_rev f t ?(stride=1L) fbod = rep t f ~stride @@ fun v -> fbod @@ f + t - v\n  let repb_rev f t ?(stride=1L) fbod = repb t f ~stride @@ fun v -> fbod @@ f + t - v\n  let repm_rev f t ?(stride=1L) m0 fbod = repm f t ~stride m0 @@ fun u v -> fbod u @@ f + t - v\n  let repi_rev f t ?(stride=1) fbod = repi t f ~stride @@ fun v -> fbod @@ f +$ t -$ v\n  let repib_rev f t ?(stride=1) fbod = repib t f ~stride @@ fun v -> fbod @@ f +$ t -$ v\n  let repim_rev f t ?(stride=1) m0 fbod = repim f t ~stride m0 @@ fun u v -> fbod u @@ f +$ t -$ v\n  (* output *)\n  let print_list_mle f ls = string_of_list f ls |> print_endline\n  let print_array_mle f a = string_of_array f a |> print_endline\n  let print_list f ls = ls |> List.iter (fun v -> printf \"%s \" @@ f v); print_newline ()\n  let print_array f a = a |> Array.iter (fun v -> printf \"%s \" @@ f v); print_newline ()\n  (* debug *)\n  let dump_2darr f a = a |> Array.iter (fun b -> print_array f b)\n  let dump_i64_list ls = print_list ist ls\n  let dump_i64_array a = print_array ist a\nend open Lib open Array\n\nlet () =\n  let n = get_i64 0 in\n  let a = input_i64_array n in\n  let sum = fold_left (+) 0L a in\n  let b = mapi (fun i v -> (labs @@ v*n-sum,i)) a in\n  (* sort (fun (u,i) (v,j) -> let p = compare u v in if p<>0 then p else compare j i) b; *)\n  sort compare b;\n  printf \"%d\\n\" @@ snd b.(0);\n  (* print_array (fun (v,i) -> sprintf \"<%Ld:%d>\" v i) b; *)\n  (* printf \"%d\" @@ snd b.(\n    let v = binary_search 0L (alen b-1L) (fun i -> fst b.(i32 i) >= sum)\n    in i32 v) *)\n\n\n\n\n\n\n\n\n\n", "language": "OCaml", "metadata": {"date": 1543108311, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s568818164.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s568818164", "user_id": "u481480055"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Printf open Scanf\nmodule Lib = struct\n  let i32,i64,ist = Int64.(to_int,of_int,to_string)\n  let (+$) = (+) let (-$) = (-) let (/$) = (/) let ( *$) = ( * ) let (%$) = (mod)\n  let labs = Int64.abs\n  let (+),(-),( * ),(/),(mod),(%) = Int64.(add,sub,mul,div,rem,rem)\n  let (+=) r v = r := !r + v\n  let (-=) r v = r := !r - v\n  let ( *= ) r v = r := !r * v\n  let (/=) r v = r := !r / v\n  let (%=) r v = r := !r % v\n  let max_i64,min_i64 = Int64.(max_int,min_int)\n  (* math *)\n  let ceildiv p q = (p+q-1L) / q\n  let rec gcd m n = match m,n with | m,0L -> m | m,n -> gcd n (m mod n)\n  let lcm m n = m / gcd m n * n\n  module I64_infix = struct\n    let (land),(lor),(lxor),lnot,(lsl),(lsr),(asr) =\n      let open Int64 in\n      (logand),(logor),(logxor),lognot,\n      (fun u v -> shift_left u (i32 v)),\n      (fun u v -> shift_right u (i32 v)),\n      (fun u v -> shift_right_logical u (i32 v))\n  end\n  (* input *)\n  let input_i64_array n = Array.init (i32 n) (fun _ -> Scanf.scanf \" %Ld\" (fun v -> v))\n  let get_i64 _ = Scanf.scanf \" %Ld\" (fun v -> v)\n  let get_2_i64 _ = Scanf.scanf \" %Ld %Ld\" (fun u v -> u,v)\n  let get_3_i64 _ = Scanf.scanf \" %Ld %Ld %Ld\" (fun u v w -> u,v,w)\n  let get_4_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld\" (fun u v w x -> u,v,w,x)\n  let get_5_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld %Ld\" (fun u v w x y -> u,v,w,x,y)\n  let i32_get_int _ = Scanf.scanf \" %d\" (fun v -> v) let i32_get_2_ints _ = Scanf.scanf \" %d %d\" (fun u v -> u,v) let i32_get_3_ints _ = Scanf.scanf \" %d %d %d\" (fun u v w -> u,v,w) let i32_get_4_ints _ = Scanf.scanf \" %d %d %d %d\" (fun u v w x -> u,v,w,x) let i32_get_5_ints _ = Scanf.scanf \" %d %d %d %d %d\" (fun u v w x y -> u,v,w,x,y)\n  (* utils *)\n  external id : 'a -> 'a = \"%identity\"\n  let ( *< ) f g x = f (g x)\n  let ( *> ) f g x = g (f x)\n  let rv f p q = f q p (* ex. 24 |> rv (/) 6 *)\n  let alen a = i64 @@ Array.length a\n  let llen l = i64 @@  List.length l\n  let string_of_list ?(separator=\" \") f ls = ls |> List.map f |> String.concat separator\n  let string_of_array ?(separator=\" \") f a = a |> Array.to_list |> string_of_list ~separator f\n  let char_list_of_string str = let rec f0 i a = if i<0 then a else f0 (i-$1) (str.[i]::a) in f0 (String.length str -$ 1) []\n  let string_of_char_list ls = List.fold_left (fun u v -> u ^ (String.make 1 v)) \"\" ls\n  let fail _ = failwith \"fail\"\n  let dx,dy = [|1;0;-1;0|],[|0;1;0;-1|]\n  let range l r = let ls = ref [] in for i=i32 l to i32 r do ls := i :: !ls done;!ls |> List.rev\n  let cartesian_product u v = u |> List.map (fun p -> List.map (fun q -> p,q) v) |> List.flatten\n  let shuffle a = Array.sort (fun _ _ -> (Random.int 3) -$ 1) a\n  let binary_search ng ok f = let d = if ng < ok then 1L else -1L in\n    let rec f0 ng ok =\n      if labs (ok - ng) <= 1L then ok\n      else let mid = ng + (ok - ng) / 2L in if f mid then f0 ng mid else f0 mid ok\n    in f0 (ng-1L*d) (ok+1L*d)\n  let lower_bound a v = binary_search 0L (alen a - 1L) (fun i -> a.(i32 i) >= v)\n  let upper_bound a v = binary_search 0L (alen a - 1L) (fun i -> a.(i32 i) >  v)\n  let equal_range a v = lower_bound a v, upper_bound a v (* #=snd-fst *)\n  let rec fix f x = f (fix f) x\n  let fix_memo ?(size=10000) f x =\n    let tb = Hashtbl.create ~random:true size in\n    let rec f0 x =\n      try Hashtbl.find tb x with\n      | Not_found -> (let v = f f0 x in Hashtbl.add tb x v; v)\n    in f0 x\n  (* imperative *)\n  let rep f t ?(stride=1L) fbod = let i = ref f in while !i <= t do fbod !i; i := !i + stride done\n  let repb f t ?(stride=1L) fbod = let i,c = ref f,ref true in while !i <= t && !c do\n    match fbod !i with | `Break -> c := false | `Ok -> i := !i + stride done\n  let repm f t ?(stride=1L) m0 fbod =\n    let i,c,m = ref f,ref true,ref m0 in\n    while !i<=t && !c do match fbod !m !i with\n    | `Break -> c := false | `Break_m m' -> (c := false; m := m') | `Ok m' -> m := m'; i := !i + stride done; !m\n  let repi f t ?(stride=1) fbod = let i = ref f in while !i <= t do fbod !i; i := !i +$ stride done\n  let repib f t ?(stride=1) fbod = let i,c = ref f,ref true in while !i <= t && !c do\n    match fbod !i with | `Break -> c := false | `Ok -> i := !i +$ stride done\n  let repim f t ?(stride=1) m0 fbod =\n    let i,c,m = ref f,ref true,ref m0 in\n    while !i<=t && !c do match fbod !m !i with\n    | `Break -> c := false | `Break_m m' -> (c := false; m := m') | `Ok m' -> m := m'; i := !i +$ stride done; !m\n  let rep_rev f t ?(stride=1L) fbod = rep t f ~stride @@ fun v -> fbod @@ f + t - v\n  let repb_rev f t ?(stride=1L) fbod = repb t f ~stride @@ fun v -> fbod @@ f + t - v\n  let repm_rev f t ?(stride=1L) m0 fbod = repm f t ~stride m0 @@ fun u v -> fbod u @@ f + t - v\n  let repi_rev f t ?(stride=1) fbod = repi t f ~stride @@ fun v -> fbod @@ f +$ t -$ v\n  let repib_rev f t ?(stride=1) fbod = repib t f ~stride @@ fun v -> fbod @@ f +$ t -$ v\n  let repim_rev f t ?(stride=1) m0 fbod = repim f t ~stride m0 @@ fun u v -> fbod u @@ f +$ t -$ v\n  (* output *)\n  let print_list_mle f ls = string_of_list f ls |> print_endline\n  let print_array_mle f a = string_of_array f a |> print_endline\n  let print_list f ls = ls |> List.iter (fun v -> printf \"%s \" @@ f v); print_newline ()\n  let print_array f a = a |> Array.iter (fun v -> printf \"%s \" @@ f v); print_newline ()\n  (* debug *)\n  let dump_2darr f a = a |> Array.iter (fun b -> print_array f b)\n  let dump_i64_list ls = print_list ist ls\n  let dump_i64_array a = print_array ist a\nend open Lib open Array\n\nlet () =\n  let n = get_i64 0 in\n  let a = input_i64_array n in\n  let sum = fold_left (+) 0L a in\n  let b = mapi (fun i v -> (labs @@ v*n-sum,i)) a in\n  (* sort (fun (u,i) (v,j) -> let p = compare u v in if p<>0 then p else compare j i) b; *)\n  sort compare b;\n  printf \"%d\\n\" @@ snd b.(0);\n  (* print_array (fun (v,i) -> sprintf \"<%Ld:%d>\" v i) b; *)\n  (* printf \"%d\" @@ snd b.(\n    let v = binary_search 0L (alen b-1L) (fun i -> fst b.(i32 i) >= sum)\n    in i32 v) *)\n\n\n\n\n\n\n\n\n\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5911, "cpu_time_ms": 2, "memory_kb": 4480}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s424639851", "group_id": "codeNet:p03219", "input_text": "let discount_fare x y = x + y / 2\n\nlet () = Scanf.scanf \"%d %d\" discount_fare |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1595853774, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s424639851.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s424639851", "user_id": "u272377260"}, "prompt_components": {"gold_output": "110\n", "input_to_evaluate": "let discount_fare x y = x + y / 2\n\nlet () = Scanf.scanf \"%d %d\" discount_fare |> Printf.printf \"%d\\n\"", "problem_context": "Score: 100 points\n\nProblem Statement\n\nThere is a train going from Station A to Station B that costs X yen (the currency of Japan).\n\nAlso, there is a bus going from Station B to Station C that costs Y yen.\n\nJoisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.\n\nHow much does it cost to travel from Station A to Station C if she uses this ticket?\n\nConstraints\n\n1 \\leq X,Y \\leq 100\n\nY is an even number.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf it costs x yen to travel from Station A to Station C, print x.\n\nSample Input 1\n\n81 58\n\nSample Output 1\n\n110\n\nThe train fare is 81 yen.\n\nThe train fare is 58 ⁄ 2=29 yen with the 50% discount.\n\nThus, it costs 110 yen to travel from Station A to Station C.\n\nSample Input 2\n\n4 54\n\nSample Output 2\n\n31", "sample_input": "81 58\n"}, "reference_outputs": ["110\n"], "source_document_id": "p03219", "source_text": "Score: 100 points\n\nProblem Statement\n\nThere is a train going from Station A to Station B that costs X yen (the currency of Japan).\n\nAlso, there is a bus going from Station B to Station C that costs Y yen.\n\nJoisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.\n\nHow much does it cost to travel from Station A to Station C if she uses this ticket?\n\nConstraints\n\n1 \\leq X,Y \\leq 100\n\nY is an even number.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf it costs x yen to travel from Station A to Station C, print x.\n\nSample Input 1\n\n81 58\n\nSample Output 1\n\n110\n\nThe train fare is 81 yen.\n\nThe train fare is 58 ⁄ 2=29 yen with the 50% discount.\n\nThus, it costs 110 yen to travel from Station A to Station C.\n\nSample Input 2\n\n4 54\n\nSample Output 2\n\n31", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 101, "cpu_time_ms": 8, "memory_kb": 3812}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s983037312", "group_id": "codeNet:p03219", "input_text": "Scanf.scanf \"%d %d\" @@ fun x y ->\n  Printf.printf \" %d\" (x+(y/2))\n", "language": "OCaml", "metadata": {"date": 1541392693, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s983037312.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s983037312", "user_id": "u472975241"}, "prompt_components": {"gold_output": "110\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" @@ fun x y ->\n  Printf.printf \" %d\" (x+(y/2))\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nThere is a train going from Station A to Station B that costs X yen (the currency of Japan).\n\nAlso, there is a bus going from Station B to Station C that costs Y yen.\n\nJoisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.\n\nHow much does it cost to travel from Station A to Station C if she uses this ticket?\n\nConstraints\n\n1 \\leq X,Y \\leq 100\n\nY is an even number.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf it costs x yen to travel from Station A to Station C, print x.\n\nSample Input 1\n\n81 58\n\nSample Output 1\n\n110\n\nThe train fare is 81 yen.\n\nThe train fare is 58 ⁄ 2=29 yen with the 50% discount.\n\nThus, it costs 110 yen to travel from Station A to Station C.\n\nSample Input 2\n\n4 54\n\nSample Output 2\n\n31", "sample_input": "81 58\n"}, "reference_outputs": ["110\n"], "source_document_id": "p03219", "source_text": "Score: 100 points\n\nProblem Statement\n\nThere is a train going from Station A to Station B that costs X yen (the currency of Japan).\n\nAlso, there is a bus going from Station B to Station C that costs Y yen.\n\nJoisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.\n\nHow much does it cost to travel from Station A to Station C if she uses this ticket?\n\nConstraints\n\n1 \\leq X,Y \\leq 100\n\nY is an even number.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf it costs x yen to travel from Station A to Station C, print x.\n\nSample Input 1\n\n81 58\n\nSample Output 1\n\n110\n\nThe train fare is 81 yen.\n\nThe train fare is 58 ⁄ 2=29 yen with the 50% discount.\n\nThus, it costs 110 yen to travel from Station A to Station C.\n\nSample Input 2\n\n4 54\n\nSample Output 2\n\n31", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 66, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s231369761", "group_id": "codeNet:p03220", "input_text": "let n, t, a = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet hs = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet f x = abs @@ 1000 * t - 6 * x - 1000 * a\nlet _ = Array.fold_left (fun (m, i) h -> min m (f h, i), i + 1) ((max_int, -1), 1) hs |> fst |> snd |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1563586633, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03220.html", "problem_id": "p03220", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03220/input.txt", "sample_output_relpath": "derived/input_output/data/p03220/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03220/OCaml/s231369761.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s231369761", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let n, t, a = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet hs = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet f x = abs @@ 1000 * t - 6 * x - 1000 * a\nlet _ = Array.fold_left (fun (m, i) h -> min m (f h, i), i + 1) ((max_int, -1), 1) hs |> fst |> snd |> Printf.printf \"%d\\n\"", "problem_context": "Score: 200 points\n\nProblem Statement\n\nA country decides to build a palace.\n\nIn this country, the average temperature of a point at an elevation of x meters is T-x \\times 0.006 degrees Celsius.\n\nThere are N places proposed for the place. The elevation of Place i is H_i meters.\n\nAmong them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there.\n\nPrint the index of the place where the palace should be built.\n\nIt is guaranteed that the solution is unique.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n0 \\leq T \\leq 50\n\n-60 \\leq A \\leq T\n\n0 \\leq H_i \\leq 10^5\n\nAll values in input are integers.\n\nThe solution is unique.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nT A\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the index of the place where the palace should be built.\n\nSample Input 1\n\n2\n12 5\n1000 2000\n\nSample Output 1\n\n1\n\nThe average temperature of Place 1 is 12-1000 \\times 0.006=6 degrees Celsius.\n\nThe average temperature of Place 2 is 12-2000 \\times 0.006=0 degrees Celsius.\n\nThus, the palace should be built at Place 1.\n\nSample Input 2\n\n3\n21 -11\n81234 94124 52141\n\nSample Output 2\n\n3", "sample_input": "2\n12 5\n1000 2000\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03220", "source_text": "Score: 200 points\n\nProblem Statement\n\nA country decides to build a palace.\n\nIn this country, the average temperature of a point at an elevation of x meters is T-x \\times 0.006 degrees Celsius.\n\nThere are N places proposed for the place. The elevation of Place i is H_i meters.\n\nAmong them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there.\n\nPrint the index of the place where the palace should be built.\n\nIt is guaranteed that the solution is unique.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n0 \\leq T \\leq 50\n\n-60 \\leq A \\leq T\n\n0 \\leq H_i \\leq 10^5\n\nAll values in input are integers.\n\nThe solution is unique.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nT A\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the index of the place where the palace should be built.\n\nSample Input 1\n\n2\n12 5\n1000 2000\n\nSample Output 1\n\n1\n\nThe average temperature of Place 1 is 12-1000 \\times 0.006=6 degrees Celsius.\n\nThe average temperature of Place 2 is 12-2000 \\times 0.006=0 degrees Celsius.\n\nThus, the palace should be built at Place 1.\n\nSample Input 2\n\n3\n21 -11\n81234 94124 52141\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 288, "cpu_time_ms": 1, "memory_kb": 768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s290584978", "group_id": "codeNet:p03221", "input_text": "let n, m = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet yps = Array.init m @@ fun i -> Scanf.scanf \" %d %d\" @@ fun a b -> b, a, i\nlet rs, ns = Array.(make (n + 1) 1, make m \"\")\nlet _ = Array.(sort compare yps; iter (fun (_, p, i) -> ns.(i) <- Printf.sprintf \"%06d%06d\" p rs.(p); rs.(p) <- rs.(p) + 1) yps; iter print_endline ns)", "language": "OCaml", "metadata": {"date": 1567139205, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03221.html", "problem_id": "p03221", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03221/input.txt", "sample_output_relpath": "derived/input_output/data/p03221/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03221/OCaml/s290584978.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s290584978", "user_id": "u732304692"}, "prompt_components": {"gold_output": "000001000002\n000002000001\n000001000001\n", "input_to_evaluate": "let n, m = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet yps = Array.init m @@ fun i -> Scanf.scanf \" %d %d\" @@ fun a b -> b, a, i\nlet rs, ns = Array.(make (n + 1) 1, make m \"\")\nlet _ = Array.(sort compare yps; iter (fun (_, p, i) -> ns.(i) <- Printf.sprintf \"%06d%06d\" p rs.(p); rs.(p) <- rs.(p) + 1) yps; iter print_endline ns)", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn Republic of Atcoder, there are N prefectures, and a total of M cities that belong to those prefectures.\n\nCity i is established in year Y_i and belongs to Prefecture P_i.\n\nYou can assume that there are no multiple cities that are established in the same year.\n\nIt is decided to allocate a 12-digit ID number to each city.\n\nIf City i is the x-th established city among the cities that belong to Prefecture i, the first six digits of the ID number of City i is P_i, and the last six digits of the ID number is x.\n\nHere, if P_i or x (or both) has less than six digits, zeros are added to the left until it has six digits.\n\nFind the ID numbers for all the cities.\n\nNote that there can be a prefecture with no cities.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq P_i \\leq N\n\n1 \\leq Y_i \\leq 10^9\n\nY_i are all different.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nP_1 Y_1\n:\nP_M Y_M\n\nOutput\n\nPrint the ID numbers for all the cities, in ascending order of indices (City 1, City 2, ...).\n\nSample Input 1\n\n2 3\n1 32\n2 63\n1 12\n\nSample Output 1\n\n000001000002\n000002000001\n000001000001\n\nAs City 1 is the second established city among the cities that belong to Prefecture 1, its ID number is 000001000002.\n\nAs City 2 is the first established city among the cities that belong to Prefecture 2, its ID number is 000002000001.\n\nAs City 3 is the first established city among the cities that belong to Prefecture 1, its ID number is 000001000001.\n\nSample Input 2\n\n2 3\n2 55\n2 77\n2 99\n\nSample Output 2\n\n000002000001\n000002000002\n000002000003", "sample_input": "2 3\n1 32\n2 63\n1 12\n"}, "reference_outputs": ["000001000002\n000002000001\n000001000001\n"], "source_document_id": "p03221", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn Republic of Atcoder, there are N prefectures, and a total of M cities that belong to those prefectures.\n\nCity i is established in year Y_i and belongs to Prefecture P_i.\n\nYou can assume that there are no multiple cities that are established in the same year.\n\nIt is decided to allocate a 12-digit ID number to each city.\n\nIf City i is the x-th established city among the cities that belong to Prefecture i, the first six digits of the ID number of City i is P_i, and the last six digits of the ID number is x.\n\nHere, if P_i or x (or both) has less than six digits, zeros are added to the left until it has six digits.\n\nFind the ID numbers for all the cities.\n\nNote that there can be a prefecture with no cities.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq P_i \\leq N\n\n1 \\leq Y_i \\leq 10^9\n\nY_i are all different.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nP_1 Y_1\n:\nP_M Y_M\n\nOutput\n\nPrint the ID numbers for all the cities, in ascending order of indices (City 1, City 2, ...).\n\nSample Input 1\n\n2 3\n1 32\n2 63\n1 12\n\nSample Output 1\n\n000001000002\n000002000001\n000001000001\n\nAs City 1 is the second established city among the cities that belong to Prefecture 1, its ID number is 000001000002.\n\nAs City 2 is the first established city among the cities that belong to Prefecture 2, its ID number is 000002000001.\n\nAs City 3 is the first established city among the cities that belong to Prefecture 1, its ID number is 000001000001.\n\nSample Input 2\n\n2 3\n2 55\n2 77\n2 99\n\nSample Output 2\n\n000002000001\n000002000002\n000002000003", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 358, "memory_kb": 12416}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s408945209", "group_id": "codeNet:p03228", "input_text": "let solve tak aoki k =\n    let rec solve_t tak aoki k =\n        if k = 0 then tak, aoki\n        else solve_a (tak / 2) (aoki + tak / 2) (k - 1)\n    and solve_a tak aoki k =\n        if k = 0 then tak, aoki\n        else solve_t (tak + aoki / 2) (aoki / 2) (k - 1)\n    in solve_t tak aoki k\n\nlet () =\n    let tak, aoki = Scanf.scanf \"%d %d %d\\n\" solve in\n    Printf.printf \"%d %d\\n\" tak aoki\n", "language": "OCaml", "metadata": {"date": 1540692238, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s408945209.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s408945209", "user_id": "u420267469"}, "prompt_components": {"gold_output": "5 3\n", "input_to_evaluate": "let solve tak aoki k =\n    let rec solve_t tak aoki k =\n        if k = 0 then tak, aoki\n        else solve_a (tak / 2) (aoki + tak / 2) (k - 1)\n    and solve_a tak aoki k =\n        if k = 0 then tak, aoki\n        else solve_t (tak + aoki / 2) (aoki / 2) (k - 1)\n    in solve_t tak aoki k\n\nlet () =\n    let tak, aoki = Scanf.scanf \"%d %d %d\\n\" solve in\n    Printf.printf \"%d %d\\n\" tak aoki\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn the beginning, Takahashi has A cookies, and Aoki has B cookies.\nThey will perform the following operation alternately, starting from Takahashi:\n\nIf the number of cookies in his hand is odd, eat one of those cookies; if the number is even, do nothing. Then, give one-half of the cookies in his hand to the other person.\n\nFind the numbers of cookies Takahashi and Aoki respectively have after performing K operations in total.\n\nConstraints\n\n1 \\leq A,B \\leq 10^9\n\n1 \\leq K \\leq 100\n\nA,B and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the number of cookies Takahashi has, and the number of cookies Aoki has, in this order, after performing K operations in total.\n\nSample Input 1\n\n5 4 2\n\nSample Output 1\n\n5 3\n\nThe process will go as follows:\n\nIn the beginning, Takahashi and Aoki have 5 and 4 cookies, respectively.\n\nTakahashi eats one cookie and gives two cookies to Aoki. They now have 2 and 6 cookies, respectively.\n\nAoki gives three cookies to Takahashi. They now have 5 and 3 cookies, respectively.\n\nSample Input 2\n\n3 3 3\n\nSample Output 2\n\n1 3\n\nSample Input 3\n\n314159265 358979323 84\n\nSample Output 3\n\n448759046 224379523", "sample_input": "5 4 2\n"}, "reference_outputs": ["5 3\n"], "source_document_id": "p03228", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn the beginning, Takahashi has A cookies, and Aoki has B cookies.\nThey will perform the following operation alternately, starting from Takahashi:\n\nIf the number of cookies in his hand is odd, eat one of those cookies; if the number is even, do nothing. Then, give one-half of the cookies in his hand to the other person.\n\nFind the numbers of cookies Takahashi and Aoki respectively have after performing K operations in total.\n\nConstraints\n\n1 \\leq A,B \\leq 10^9\n\n1 \\leq K \\leq 100\n\nA,B and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the number of cookies Takahashi has, and the number of cookies Aoki has, in this order, after performing K operations in total.\n\nSample Input 1\n\n5 4 2\n\nSample Output 1\n\n5 3\n\nThe process will go as follows:\n\nIn the beginning, Takahashi and Aoki have 5 and 4 cookies, respectively.\n\nTakahashi eats one cookie and gives two cookies to Aoki. They now have 2 and 6 cookies, respectively.\n\nAoki gives three cookies to Takahashi. They now have 5 and 3 cookies, respectively.\n\nSample Input 2\n\n3 3 3\n\nSample Output 2\n\n1 3\n\nSample Input 3\n\n314159265 358979323 84\n\nSample Output 3\n\n448759046 224379523", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s062523606", "group_id": "codeNet:p03229", "input_text": "open Printf\nopen Scanf\n\nlet id x = x\nlet pair x y = x, y\n\nlet n = scanf \"%d\" id\nlet vs = Array.init n (fun _ -> scanf \" %d\" id)\n\nlet () = Array.sort (fun x y -> x - y) vs\n\nlet odd1 vs =\n  let mid = n / 2 in\n  let up = ref (n - 1) in\n  let lo = ref 0 in\n  let r1 = ref 0 in\n  let p = ref vs.(mid) in\n  for i = 0 to n / 2 - 1 do\n    r1 := !r1 + abs (!p - vs.(!up));\n    p := vs.(!up);\n    decr up;\n    r1 := !r1 + abs (!p - vs.(!lo));\n    p := vs.(!lo);\n    incr lo\n  done;\n  !r1\n  \nlet odd2 vs =\n  let mid = n / 2 in\n  let up = ref (n - 1) in\n  let lo = ref 0 in\n  let r1 = ref 0 in\n  let p = ref vs.(mid) in\n  for i = 0 to n / 2 - 1 do\n    r1 := !r1 + abs (!p - vs.(!lo));\n    p := vs.(!lo);\n    incr lo;\n    r1 := !r1 + abs (!p - vs.(!up));\n    p := vs.(!up);\n    decr up\n  done;\n  !r1\n\nlet even1 vs =\n  let mid = n / 2 in\n  let up = ref (n - 1) in\n  let lo = ref 0 in\n  let r1 = ref 0 in\n  let p = ref vs.(mid) in\n  for i = 0 to n / 2 - 2 do\n    r1 := !r1 + abs (!p - vs.(!lo));\n    p := vs.(!lo);\n    incr lo;\n    r1 := !r1 + abs (!p - vs.(!up));\n    p := vs.(!up);\n    decr up\n  done;\n  r1 := !r1 + abs (!p - vs.(mid - 1));\n  !r1\n\nlet even2 vs =\n  let mid = n / 2 - 1 in\n  let up = ref (n - 1) in\n  let lo = ref 0 in\n  let r1 = ref 0 in\n  let p = ref vs.(mid) in\n  for i = 0 to n / 2 - 2 do\n    r1 := !r1 + abs (!p - vs.(!up));\n    p := vs.(!up);\n    decr up;\n    r1 := !r1 + abs (!p - vs.(!lo));\n    p := vs.(!lo);\n    incr lo;\n  done;\n  r1 := !r1 + abs (!p - vs.(mid + 1));\n  !r1\n\nlet () =\n  if n mod 2 = 0 then begin\n    let e1 = even1 vs in\n    let e2 = even2 vs in\n    printf \"%d\\n\" (max e1 e2)\n  end else begin\n    let o1 = odd1 vs in\n    let o2 = odd2 vs in\n    printf \"%d\\n\" (max o1 o2)\n  end\n", "language": "OCaml", "metadata": {"date": 1540691531, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s062523606.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s062523606", "user_id": "u450300828"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet id x = x\nlet pair x y = x, y\n\nlet n = scanf \"%d\" id\nlet vs = Array.init n (fun _ -> scanf \" %d\" id)\n\nlet () = Array.sort (fun x y -> x - y) vs\n\nlet odd1 vs =\n  let mid = n / 2 in\n  let up = ref (n - 1) in\n  let lo = ref 0 in\n  let r1 = ref 0 in\n  let p = ref vs.(mid) in\n  for i = 0 to n / 2 - 1 do\n    r1 := !r1 + abs (!p - vs.(!up));\n    p := vs.(!up);\n    decr up;\n    r1 := !r1 + abs (!p - vs.(!lo));\n    p := vs.(!lo);\n    incr lo\n  done;\n  !r1\n  \nlet odd2 vs =\n  let mid = n / 2 in\n  let up = ref (n - 1) in\n  let lo = ref 0 in\n  let r1 = ref 0 in\n  let p = ref vs.(mid) in\n  for i = 0 to n / 2 - 1 do\n    r1 := !r1 + abs (!p - vs.(!lo));\n    p := vs.(!lo);\n    incr lo;\n    r1 := !r1 + abs (!p - vs.(!up));\n    p := vs.(!up);\n    decr up\n  done;\n  !r1\n\nlet even1 vs =\n  let mid = n / 2 in\n  let up = ref (n - 1) in\n  let lo = ref 0 in\n  let r1 = ref 0 in\n  let p = ref vs.(mid) in\n  for i = 0 to n / 2 - 2 do\n    r1 := !r1 + abs (!p - vs.(!lo));\n    p := vs.(!lo);\n    incr lo;\n    r1 := !r1 + abs (!p - vs.(!up));\n    p := vs.(!up);\n    decr up\n  done;\n  r1 := !r1 + abs (!p - vs.(mid - 1));\n  !r1\n\nlet even2 vs =\n  let mid = n / 2 - 1 in\n  let up = ref (n - 1) in\n  let lo = ref 0 in\n  let r1 = ref 0 in\n  let p = ref vs.(mid) in\n  for i = 0 to n / 2 - 2 do\n    r1 := !r1 + abs (!p - vs.(!up));\n    p := vs.(!up);\n    decr up;\n    r1 := !r1 + abs (!p - vs.(!lo));\n    p := vs.(!lo);\n    incr lo;\n  done;\n  r1 := !r1 + abs (!p - vs.(mid + 1));\n  !r1\n\nlet () =\n  if n mod 2 = 0 then begin\n    let e1 = even1 vs in\n    let e2 = even2 vs in\n    printf \"%d\\n\" (max e1 e2)\n  end else begin\n    let o1 = odd1 vs in\n    let o2 = odd2 vs in\n    printf \"%d\\n\" (max o1 o2)\n  end\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given N integers; the i-th of them is A_i.\nFind the maximum possible sum of the absolute differences between the adjacent elements after arranging these integers in a row in any order you like.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint the maximum possible sum of the absolute differences between the adjacent elements after arranging the given integers in a row in any order you like.\n\nSample Input 1\n\n5\n6\n8\n1\n2\n3\n\nSample Output 1\n\n21\n\nWhen the integers are arranged as 3,8,1,6,2, the sum of the absolute differences between the adjacent elements is |3 - 8| + |8 - 1| + |1 - 6| + |6 - 2| = 21. This is the maximum possible sum.\n\nSample Input 2\n\n6\n3\n1\n4\n1\n5\n9\n\nSample Output 2\n\n25\n\nSample Input 3\n\n3\n5\n5\n1\n\nSample Output 3\n\n8", "sample_input": "5\n6\n8\n1\n2\n3\n"}, "reference_outputs": ["21\n"], "source_document_id": "p03229", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given N integers; the i-th of them is A_i.\nFind the maximum possible sum of the absolute differences between the adjacent elements after arranging these integers in a row in any order you like.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint the maximum possible sum of the absolute differences between the adjacent elements after arranging the given integers in a row in any order you like.\n\nSample Input 1\n\n5\n6\n8\n1\n2\n3\n\nSample Output 1\n\n21\n\nWhen the integers are arranged as 3,8,1,6,2, the sum of the absolute differences between the adjacent elements is |3 - 8| + |8 - 1| + |1 - 6| + |6 - 2| = 21. This is the maximum possible sum.\n\nSample Input 2\n\n6\n3\n1\n4\n1\n5\n9\n\nSample Output 2\n\n25\n\nSample Input 3\n\n3\n5\n5\n1\n\nSample Output 3\n\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1705, "cpu_time_ms": 64, "memory_kb": 5504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s445489860", "group_id": "codeNet:p03232", "input_text": "let rec power ( * ) e m n =\n  if n <= 0 then e\n  else power ( * ) (if n land 1 = 0 then e else m * e) (m * m) (n lsr 1)\n\nlet m = 1000000007\nlet ( +^ ) x y = (x + y) mod m\nlet ( -^ ) x y = x +^ (m - y)\nlet ( *^ ) x y = (x * y) mod m\n\nlet inv x = power ( *^ ) 1 x (m - 2)\nlet perm n k =\n  Array.fold_left ( *^ ) 1 @@\n  Array.init k @@ ( + ) @@ n - k + 1\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ = Array.init n @@ fun i -> Scanf.scanf \"%d \" @@ fun a -> a in\n  let ps = Array.make n 0 in\n  for i = 0 to n - 1 do\n    ps.(0) <- inv (1 + i) +^ ps.(0)\n  done;\n  for i = 1 to n - 1 do\n    ps.(i) <- ps.(i - 1) +^ inv (1 + i) -^ inv (1 + n - i)\n  done;\n  Printf.printf \"%d\\n\" @@\n    ( *^ ) (perm n n) @@\n      Array.fold_left ( +^ ) 0 @@\n        Array.init n @@ fun i -> as_.(i) *^ ps.(i)\n", "language": "OCaml", "metadata": {"date": 1539606902, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03232.html", "problem_id": "p03232", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03232/input.txt", "sample_output_relpath": "derived/input_output/data/p03232/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03232/OCaml/s445489860.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s445489860", "user_id": "u504158101"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "let rec power ( * ) e m n =\n  if n <= 0 then e\n  else power ( * ) (if n land 1 = 0 then e else m * e) (m * m) (n lsr 1)\n\nlet m = 1000000007\nlet ( +^ ) x y = (x + y) mod m\nlet ( -^ ) x y = x +^ (m - y)\nlet ( *^ ) x y = (x * y) mod m\n\nlet inv x = power ( *^ ) 1 x (m - 2)\nlet perm n k =\n  Array.fold_left ( *^ ) 1 @@\n  Array.init k @@ ( + ) @@ n - k + 1\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ = Array.init n @@ fun i -> Scanf.scanf \"%d \" @@ fun a -> a in\n  let ps = Array.make n 0 in\n  for i = 0 to n - 1 do\n    ps.(0) <- inv (1 + i) +^ ps.(0)\n  done;\n  for i = 1 to n - 1 do\n    ps.(i) <- ps.(i - 1) +^ inv (1 + i) -^ inv (1 + n - i)\n  done;\n  Printf.printf \"%d\\n\" @@\n    ( *^ ) (perm n n) @@\n      Array.fold_left ( +^ ) 0 @@\n        Array.init n @@ fun i -> as_.(i) *^ ps.(i)\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere are N blocks arranged in a row, numbered 1 to N from left to right.\nEach block has a weight, and the weight of Block i is A_i.\nSnuke will perform the following operation on these blocks N times:\n\nChoose one block that is still not removed, and remove it.\nThe cost of this operation is the sum of the weights of the blocks that are connected to the block being removed (including itself).\nHere, two blocks x and y ( x \\leq y ) are connected when, for all z ( x \\leq z \\leq y ), Block z is still not removed.\n\nThere are N! possible orders in which Snuke removes the blocks.\nFor all of those N! orders, find the total cost of the N operations, and calculate the sum of those N! total costs.\nAs the answer can be extremely large, compute the sum modulo 10^9+7.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFor all of the N! orders, find the total cost of the N operations, and print the sum of those N! total costs, modulo 10^9+7.\n\nSample Input 1\n\n2\n1 2\n\nSample Output 1\n\n9\n\nFirst, we will consider the order \"Block 1 -> Block 2\".\nIn the first operation, the cost of the operation is 1+2=3, as Block 1 and 2 are connected.\nIn the second operation, the cost of the operation is 2, as only Block 2 remains.\nThus, the total cost of the two operations for this order is 3+2=5.\n\nThen, we will consider the order \"Block 2 -> Block 1\".\nIn the first operation, the cost of the operation is 1+2=3, as Block 1 and 2 are connected.\nIn the second operation, the cost of the operation is 1, as only Block 1 remains.\nThus, the total cost of the two operations for this order is 3+1=4.\n\nTherefore, the answer is 5+4=9.\n\nSample Input 2\n\n4\n1 1 1 1\n\nSample Output 2\n\n212\n\nSample Input 3\n\n10\n1 2 4 8 16 32 64 128 256 512\n\nSample Output 3\n\n880971923", "sample_input": "2\n1 2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03232", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere are N blocks arranged in a row, numbered 1 to N from left to right.\nEach block has a weight, and the weight of Block i is A_i.\nSnuke will perform the following operation on these blocks N times:\n\nChoose one block that is still not removed, and remove it.\nThe cost of this operation is the sum of the weights of the blocks that are connected to the block being removed (including itself).\nHere, two blocks x and y ( x \\leq y ) are connected when, for all z ( x \\leq z \\leq y ), Block z is still not removed.\n\nThere are N! possible orders in which Snuke removes the blocks.\nFor all of those N! orders, find the total cost of the N operations, and calculate the sum of those N! total costs.\nAs the answer can be extremely large, compute the sum modulo 10^9+7.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFor all of the N! orders, find the total cost of the N operations, and print the sum of those N! total costs, modulo 10^9+7.\n\nSample Input 1\n\n2\n1 2\n\nSample Output 1\n\n9\n\nFirst, we will consider the order \"Block 1 -> Block 2\".\nIn the first operation, the cost of the operation is 1+2=3, as Block 1 and 2 are connected.\nIn the second operation, the cost of the operation is 2, as only Block 2 remains.\nThus, the total cost of the two operations for this order is 3+2=5.\n\nThen, we will consider the order \"Block 2 -> Block 1\".\nIn the first operation, the cost of the operation is 1+2=3, as Block 1 and 2 are connected.\nIn the second operation, the cost of the operation is 1, as only Block 1 remains.\nThus, the total cost of the two operations for this order is 3+1=4.\n\nTherefore, the answer is 5+4=9.\n\nSample Input 2\n\n4\n1 1 1 1\n\nSample Output 2\n\n212\n\nSample Input 3\n\n10\n1 2 4 8 16 32 64 128 256 512\n\nSample Output 3\n\n880971923", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 789, "cpu_time_ms": 114, "memory_kb": 6400}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s324960464", "group_id": "codeNet:p03238", "input_text": "let n = read_int ()\nlet () =\n  if n = 1 then\n    print_endline \"Hello World\"\n  else\n    Printf.printf \"%d\\n\" @@ read_int () + read_int ()\n", "language": "OCaml", "metadata": {"date": 1567826779, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s324960464.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s324960464", "user_id": "u614063956"}, "prompt_components": {"gold_output": "Hello World\n", "input_to_evaluate": "let n = read_int ()\nlet () =\n  if n = 1 then\n    print_endline \"Hello World\"\n  else\n    Printf.printf \"%d\\n\" @@ read_int () + read_int ()\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 138, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s230863756", "group_id": "codeNet:p03238", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ function\n  | 1 -> print_endline \"Hello World\"\n  | 2 -> Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d\\n%d\" ( + )\n", "language": "OCaml", "metadata": {"date": 1539206383, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s230863756.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s230863756", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Hello World\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ function\n  | 1 -> print_endline \"Hello World\"\n  | 2 -> Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d\\n%d\" ( + )\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 137, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s822445698", "group_id": "codeNet:p03239", "input_text": "let () = Scanf.scanf \"%d %d\" @@ fun n t ->\n  let cts = Array.to_list @@ Array.init n @@ fun _ ->\n    Scanf.scanf \"\\n%d %d\" @@ fun c t -> c, t in\n  match\n    List.concat @@ List.map (fun (ci, ti) ->\n      if t < ti then [] else [ci]) cts\n  with\n  | [] -> print_endline \"TLE\"\n  | c :: cs -> Printf.printf \"%d\\n\" @@ List.fold_left min c cs\n", "language": "OCaml", "metadata": {"date": 1539206395, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s822445698.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s822445698", "user_id": "u504158101"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\" @@ fun n t ->\n  let cts = Array.to_list @@ Array.init n @@ fun _ ->\n    Scanf.scanf \"\\n%d %d\" @@ fun c t -> c, t in\n  match\n    List.concat @@ List.map (fun (ci, ti) ->\n      if t < ti then [] else [ci]) cts\n  with\n  | [] -> print_endline \"TLE\"\n  | c :: cs -> Printf.printf \"%d\\n\" @@ List.fold_left min c cs\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWhen Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.\n\nYou, the smartwatch, has found N routes to his home.\n\nIf Mr. X uses the i-th of these routes, he will get home in time t_i at cost c_i.\n\nFind the smallest cost of a route that takes not longer than time T.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq T \\leq 1000\n\n1 \\leq c_i \\leq 1000\n\n1 \\leq t_i \\leq 1000\n\nThe pairs (c_i, t_i) are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nc_1 t_1\nc_2 t_2\n:\nc_N t_N\n\nOutput\n\nPrint the smallest cost of a route that takes not longer than time T.\n\nIf there is no route that takes not longer than time T, print TLE instead.\n\nSample Input 1\n\n3 70\n7 60\n1 80\n4 50\n\nSample Output 1\n\n4\n\nThe first route gets him home at cost 7.\n\nThe second route takes longer than time T = 70.\n\nThe third route gets him home at cost 4.\n\nThus, the cost 4 of the third route is the minimum.\n\nSample Input 2\n\n4 3\n1 1000\n2 4\n3 1000\n4 500\n\nSample Output 2\n\nTLE\n\nThere is no route that takes not longer than time T = 3.\n\nSample Input 3\n\n5 9\n25 8\n5 9\n4 10\n1000 1000\n6 1\n\nSample Output 3\n\n5", "sample_input": "3 70\n7 60\n1 80\n4 50\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03239", "source_text": "Score : 200 points\n\nProblem Statement\n\nWhen Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.\n\nYou, the smartwatch, has found N routes to his home.\n\nIf Mr. X uses the i-th of these routes, he will get home in time t_i at cost c_i.\n\nFind the smallest cost of a route that takes not longer than time T.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq T \\leq 1000\n\n1 \\leq c_i \\leq 1000\n\n1 \\leq t_i \\leq 1000\n\nThe pairs (c_i, t_i) are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nc_1 t_1\nc_2 t_2\n:\nc_N t_N\n\nOutput\n\nPrint the smallest cost of a route that takes not longer than time T.\n\nIf there is no route that takes not longer than time T, print TLE instead.\n\nSample Input 1\n\n3 70\n7 60\n1 80\n4 50\n\nSample Output 1\n\n4\n\nThe first route gets him home at cost 7.\n\nThe second route takes longer than time T = 70.\n\nThe third route gets him home at cost 4.\n\nThus, the cost 4 of the third route is the minimum.\n\nSample Input 2\n\n4 3\n1 1000\n2 4\n3 1000\n4 500\n\nSample Output 2\n\nTLE\n\nThere is no route that takes not longer than time T = 3.\n\nSample Input 3\n\n5 9\n25 8\n5 9\n4 10\n1000 1000\n6 1\n\nSample Output 3\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 337, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s950982696", "group_id": "codeNet:p03239", "input_text": "let () = Scanf.scanf \"%d %d\" @@ fun n t ->\n  let cts = Array.to_list @@ Array.init n @@ fun _ ->\n    Scanf.scanf \"\\n%d %d\" @@ fun c t -> c, t in\n  match\n    List.concat @@ List.map (fun (ci, ti) ->\n      if t < ti then [] else [ci]) cts\n  with\n  | [] -> print_endline \"TLE\"\n  | c :: cs -> Printf.printf \"%d\\n\" @@ List.fold_left min c cs\n", "language": "OCaml", "metadata": {"date": 1538879623, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s950982696.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s950982696", "user_id": "u504158101"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\" @@ fun n t ->\n  let cts = Array.to_list @@ Array.init n @@ fun _ ->\n    Scanf.scanf \"\\n%d %d\" @@ fun c t -> c, t in\n  match\n    List.concat @@ List.map (fun (ci, ti) ->\n      if t < ti then [] else [ci]) cts\n  with\n  | [] -> print_endline \"TLE\"\n  | c :: cs -> Printf.printf \"%d\\n\" @@ List.fold_left min c cs\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWhen Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.\n\nYou, the smartwatch, has found N routes to his home.\n\nIf Mr. X uses the i-th of these routes, he will get home in time t_i at cost c_i.\n\nFind the smallest cost of a route that takes not longer than time T.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq T \\leq 1000\n\n1 \\leq c_i \\leq 1000\n\n1 \\leq t_i \\leq 1000\n\nThe pairs (c_i, t_i) are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nc_1 t_1\nc_2 t_2\n:\nc_N t_N\n\nOutput\n\nPrint the smallest cost of a route that takes not longer than time T.\n\nIf there is no route that takes not longer than time T, print TLE instead.\n\nSample Input 1\n\n3 70\n7 60\n1 80\n4 50\n\nSample Output 1\n\n4\n\nThe first route gets him home at cost 7.\n\nThe second route takes longer than time T = 70.\n\nThe third route gets him home at cost 4.\n\nThus, the cost 4 of the third route is the minimum.\n\nSample Input 2\n\n4 3\n1 1000\n2 4\n3 1000\n4 500\n\nSample Output 2\n\nTLE\n\nThere is no route that takes not longer than time T = 3.\n\nSample Input 3\n\n5 9\n25 8\n5 9\n4 10\n1000 1000\n6 1\n\nSample Output 3\n\n5", "sample_input": "3 70\n7 60\n1 80\n4 50\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03239", "source_text": "Score : 200 points\n\nProblem Statement\n\nWhen Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.\n\nYou, the smartwatch, has found N routes to his home.\n\nIf Mr. X uses the i-th of these routes, he will get home in time t_i at cost c_i.\n\nFind the smallest cost of a route that takes not longer than time T.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq T \\leq 1000\n\n1 \\leq c_i \\leq 1000\n\n1 \\leq t_i \\leq 1000\n\nThe pairs (c_i, t_i) are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nc_1 t_1\nc_2 t_2\n:\nc_N t_N\n\nOutput\n\nPrint the smallest cost of a route that takes not longer than time T.\n\nIf there is no route that takes not longer than time T, print TLE instead.\n\nSample Input 1\n\n3 70\n7 60\n1 80\n4 50\n\nSample Output 1\n\n4\n\nThe first route gets him home at cost 7.\n\nThe second route takes longer than time T = 70.\n\nThe third route gets him home at cost 4.\n\nThus, the cost 4 of the third route is the minimum.\n\nSample Input 2\n\n4 3\n1 1000\n2 4\n3 1000\n4 500\n\nSample Output 2\n\nTLE\n\nThere is no route that takes not longer than time T = 3.\n\nSample Input 3\n\n5 9\n25 8\n5 9\n4 10\n1000 1000\n6 1\n\nSample Output 3\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 337, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s898583977", "group_id": "codeNet:p03239", "input_text": "open Printf\nopen Scanf\n\nlet id x = x\nlet pair x y = x, y\n\nlet n, t = scanf \"%d %d\" pair\n\nlet vs = Array.init n (fun _ -> scanf \" %d %d\" pair)\n\nlet f c' t' = if t' <= t then c' else 2000\n\nlet () =\n  Array.sort (fun (ac, at) (bc, bt) -> f ac at - f bc bt) vs;\n  let (a, b) = vs.(0) in\n  if b <= t then printf \"%d\\n\" a else printf \"LTE\\n\"\n", "language": "OCaml", "metadata": {"date": 1538874807, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s898583977.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s898583977", "user_id": "u450300828"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet id x = x\nlet pair x y = x, y\n\nlet n, t = scanf \"%d %d\" pair\n\nlet vs = Array.init n (fun _ -> scanf \" %d %d\" pair)\n\nlet f c' t' = if t' <= t then c' else 2000\n\nlet () =\n  Array.sort (fun (ac, at) (bc, bt) -> f ac at - f bc bt) vs;\n  let (a, b) = vs.(0) in\n  if b <= t then printf \"%d\\n\" a else printf \"LTE\\n\"\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWhen Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.\n\nYou, the smartwatch, has found N routes to his home.\n\nIf Mr. X uses the i-th of these routes, he will get home in time t_i at cost c_i.\n\nFind the smallest cost of a route that takes not longer than time T.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq T \\leq 1000\n\n1 \\leq c_i \\leq 1000\n\n1 \\leq t_i \\leq 1000\n\nThe pairs (c_i, t_i) are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nc_1 t_1\nc_2 t_2\n:\nc_N t_N\n\nOutput\n\nPrint the smallest cost of a route that takes not longer than time T.\n\nIf there is no route that takes not longer than time T, print TLE instead.\n\nSample Input 1\n\n3 70\n7 60\n1 80\n4 50\n\nSample Output 1\n\n4\n\nThe first route gets him home at cost 7.\n\nThe second route takes longer than time T = 70.\n\nThe third route gets him home at cost 4.\n\nThus, the cost 4 of the third route is the minimum.\n\nSample Input 2\n\n4 3\n1 1000\n2 4\n3 1000\n4 500\n\nSample Output 2\n\nTLE\n\nThere is no route that takes not longer than time T = 3.\n\nSample Input 3\n\n5 9\n25 8\n5 9\n4 10\n1000 1000\n6 1\n\nSample Output 3\n\n5", "sample_input": "3 70\n7 60\n1 80\n4 50\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03239", "source_text": "Score : 200 points\n\nProblem Statement\n\nWhen Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.\n\nYou, the smartwatch, has found N routes to his home.\n\nIf Mr. X uses the i-th of these routes, he will get home in time t_i at cost c_i.\n\nFind the smallest cost of a route that takes not longer than time T.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq T \\leq 1000\n\n1 \\leq c_i \\leq 1000\n\n1 \\leq t_i \\leq 1000\n\nThe pairs (c_i, t_i) are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\nc_1 t_1\nc_2 t_2\n:\nc_N t_N\n\nOutput\n\nPrint the smallest cost of a route that takes not longer than time T.\n\nIf there is no route that takes not longer than time T, print TLE instead.\n\nSample Input 1\n\n3 70\n7 60\n1 80\n4 50\n\nSample Output 1\n\n4\n\nThe first route gets him home at cost 7.\n\nThe second route takes longer than time T = 70.\n\nThe third route gets him home at cost 4.\n\nThus, the cost 4 of the third route is the minimum.\n\nSample Input 2\n\n4 3\n1 1000\n2 4\n3 1000\n4 500\n\nSample Output 2\n\nTLE\n\nThere is no route that takes not longer than time T = 3.\n\nSample Input 3\n\n5 9\n25 8\n5 9\n4 10\n1000 1000\n6 1\n\nSample Output 3\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 336, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s100052481", "group_id": "codeNet:p03241", "input_text": "let ans = ref 0\nlet f g n = let rec f i = if i * i <= n then (if n mod i = 0 then (g i; if i <> n / i then g (n / i)); f (i + 1)) in f 1\nlet _ = Scanf.scanf \"%d %d\" @@ fun n m -> f (fun d -> if m / d >= n then ans := max !ans d) m; Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1580502617, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s100052481.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s100052481", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let ans = ref 0\nlet f g n = let rec f i = if i * i <= n then (if n mod i = 0 then (g i; if i <> n / i then g (n / i)); f (i + 1)) in f 1\nlet _ = Scanf.scanf \"%d %d\" @@ fun n m -> f (fun d -> if m / d >= n then ans := max !ans d) m; Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given integers N and M.\n\nConsider a sequence a of length N consisting of positive integers such that a_1 + a_2 + ... + a_N = M. Find the maximum possible value of the greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\nN \\leq M \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the maximum possible value of the greatest common divisor of a sequence a_1, a_2, ..., a_N that satisfies the condition.\n\nSample Input 1\n\n3 14\n\nSample Output 1\n\n2\n\nConsider the sequence (a_1, a_2, a_3) = (2, 4, 8). Their greatest common divisor is 2, and this is the maximum value.\n\nSample Input 2\n\n10 123\n\nSample Output 2\n\n3\n\nSample Input 3\n\n100000 1000000000\n\nSample Output 3\n\n10000", "sample_input": "3 14\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03241", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given integers N and M.\n\nConsider a sequence a of length N consisting of positive integers such that a_1 + a_2 + ... + a_N = M. Find the maximum possible value of the greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\nN \\leq M \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the maximum possible value of the greatest common divisor of a sequence a_1, a_2, ..., a_N that satisfies the condition.\n\nSample Input 1\n\n3 14\n\nSample Output 1\n\n2\n\nConsider the sequence (a_1, a_2, a_3) = (2, 4, 8). Their greatest common divisor is 2, and this is the maximum value.\n\nSample Input 2\n\n10 123\n\nSample Output 2\n\n3\n\nSample Input 3\n\n100000 1000000000\n\nSample Output 3\n\n10000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 257, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s785774096", "group_id": "codeNet:p03241", "input_text": "open Printf open Scanf\nlet divisors v = \n\tlet rec f0 i a =\n\t\tif i*i > v then a\n\t\telse if i*i = v && v mod i = 0 then i::a\n\t\telse if v mod i = 0 then f0 (i+1) (i::(v/i)::a)\n\t\telse f0 (i+1) a in f0 1 []\nlet () = scanf \" %d %d\" @@ fun n m -> \n\tlet l = m/n in\n\tdivisors m |> List.sort compare |> List.rev\n\t|> List.iter @@ fun v ->\n\t\tif v <= l then (printf \"%d\\n\" v; exit 0)", "language": "OCaml", "metadata": {"date": 1539511022, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s785774096.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s785774096", "user_id": "u481480055"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Printf open Scanf\nlet divisors v = \n\tlet rec f0 i a =\n\t\tif i*i > v then a\n\t\telse if i*i = v && v mod i = 0 then i::a\n\t\telse if v mod i = 0 then f0 (i+1) (i::(v/i)::a)\n\t\telse f0 (i+1) a in f0 1 []\nlet () = scanf \" %d %d\" @@ fun n m -> \n\tlet l = m/n in\n\tdivisors m |> List.sort compare |> List.rev\n\t|> List.iter @@ fun v ->\n\t\tif v <= l then (printf \"%d\\n\" v; exit 0)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given integers N and M.\n\nConsider a sequence a of length N consisting of positive integers such that a_1 + a_2 + ... + a_N = M. Find the maximum possible value of the greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\nN \\leq M \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the maximum possible value of the greatest common divisor of a sequence a_1, a_2, ..., a_N that satisfies the condition.\n\nSample Input 1\n\n3 14\n\nSample Output 1\n\n2\n\nConsider the sequence (a_1, a_2, a_3) = (2, 4, 8). Their greatest common divisor is 2, and this is the maximum value.\n\nSample Input 2\n\n10 123\n\nSample Output 2\n\n3\n\nSample Input 3\n\n100000 1000000000\n\nSample Output 3\n\n10000", "sample_input": "3 14\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03241", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given integers N and M.\n\nConsider a sequence a of length N consisting of positive integers such that a_1 + a_2 + ... + a_N = M. Find the maximum possible value of the greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\nN \\leq M \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the maximum possible value of the greatest common divisor of a sequence a_1, a_2, ..., a_N that satisfies the condition.\n\nSample Input 1\n\n3 14\n\nSample Output 1\n\n2\n\nConsider the sequence (a_1, a_2, a_3) = (2, 4, 8). Their greatest common divisor is 2, and this is the maximum value.\n\nSample Input 2\n\n10 123\n\nSample Output 2\n\n3\n\nSample Input 3\n\n100000 1000000000\n\nSample Output 3\n\n10000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 369, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s776680433", "group_id": "codeNet:p03241", "input_text": "let rec floor_sqrt acc acc_x_2_x_r sq_acc_minus_z r sq_r =\n  if r = 0 then acc\n  else\n    let sq_acc_minus_z' = sq_acc_minus_z + acc_x_2_x_r + sq_r in\n    ( if sq_acc_minus_z' <= 0 then\n        floor_sqrt (acc + r) ((acc_x_2_x_r lsr 1) + sq_r) sq_acc_minus_z'\n      else\n        floor_sqrt acc (acc_x_2_x_r lsr 1) sq_acc_minus_z) (r lsr 1) (sq_r lsr 2)\nlet floor_sqrt z = floor_sqrt 0 0 (~-z) (1 lsl 30) (1 lsl 60)\n\nlet () = Scanf.scanf \"%d %d\" @@ fun n m ->\n  Printf.printf \"%d\\n\" @@\n  if n = 1 then m\n  else Array.fold_left (List.fold_left max) 1 @@\n    Array.init (floor_sqrt m) @@ fun i ->\n      if 0 < m mod (i + 1)\n      then []\n      else (if m / (i + 1) < n then [] else [i + 1]) @ (if (i + 1) < n then [] else [m / (i + 1)])\n\n", "language": "OCaml", "metadata": {"date": 1538885214, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s776680433.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s776680433", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let rec floor_sqrt acc acc_x_2_x_r sq_acc_minus_z r sq_r =\n  if r = 0 then acc\n  else\n    let sq_acc_minus_z' = sq_acc_minus_z + acc_x_2_x_r + sq_r in\n    ( if sq_acc_minus_z' <= 0 then\n        floor_sqrt (acc + r) ((acc_x_2_x_r lsr 1) + sq_r) sq_acc_minus_z'\n      else\n        floor_sqrt acc (acc_x_2_x_r lsr 1) sq_acc_minus_z) (r lsr 1) (sq_r lsr 2)\nlet floor_sqrt z = floor_sqrt 0 0 (~-z) (1 lsl 30) (1 lsl 60)\n\nlet () = Scanf.scanf \"%d %d\" @@ fun n m ->\n  Printf.printf \"%d\\n\" @@\n  if n = 1 then m\n  else Array.fold_left (List.fold_left max) 1 @@\n    Array.init (floor_sqrt m) @@ fun i ->\n      if 0 < m mod (i + 1)\n      then []\n      else (if m / (i + 1) < n then [] else [i + 1]) @ (if (i + 1) < n then [] else [m / (i + 1)])\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given integers N and M.\n\nConsider a sequence a of length N consisting of positive integers such that a_1 + a_2 + ... + a_N = M. Find the maximum possible value of the greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\nN \\leq M \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the maximum possible value of the greatest common divisor of a sequence a_1, a_2, ..., a_N that satisfies the condition.\n\nSample Input 1\n\n3 14\n\nSample Output 1\n\n2\n\nConsider the sequence (a_1, a_2, a_3) = (2, 4, 8). Their greatest common divisor is 2, and this is the maximum value.\n\nSample Input 2\n\n10 123\n\nSample Output 2\n\n3\n\nSample Input 3\n\n100000 1000000000\n\nSample Output 3\n\n10000", "sample_input": "3 14\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03241", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given integers N and M.\n\nConsider a sequence a of length N consisting of positive integers such that a_1 + a_2 + ... + a_N = M. Find the maximum possible value of the greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\nN \\leq M \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the maximum possible value of the greatest common divisor of a sequence a_1, a_2, ..., a_N that satisfies the condition.\n\nSample Input 1\n\n3 14\n\nSample Output 1\n\n2\n\nConsider the sequence (a_1, a_2, a_3) = (2, 4, 8). Their greatest common divisor is 2, and this is the maximum value.\n\nSample Input 2\n\n10 123\n\nSample Output 2\n\n3\n\nSample Input 3\n\n100000 1000000000\n\nSample Output 3\n\n10000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 735, "cpu_time_ms": 2, "memory_kb": 768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s511206850", "group_id": "codeNet:p03242", "input_text": "open Batteries\nlet explode s = List.init (String.length s) (String.get s)\nlet string_of_chars chars = \n  let buf = Buffer.create 16 in\n  List.iter (Buffer.add_char buf) chars;\n  Buffer.contents buf\nlet n = read_line () |> explode\nlet rec ans lst = \n  match lst with\n  | [] -> []\n  | first :: rest -> if first = '9' then '1' :: ans rest else '9' :: ans rest\n\nlet _ = print_endline (string_of_chars (ans n))", "language": "OCaml", "metadata": {"date": 1583975133, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s511206850.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s511206850", "user_id": "u511870776"}, "prompt_components": {"gold_output": "991\n", "input_to_evaluate": "open Batteries\nlet explode s = List.init (String.length s) (String.get s)\nlet string_of_chars chars = \n  let buf = Buffer.create 16 in\n  List.iter (Buffer.add_char buf) chars;\n  Buffer.contents buf\nlet n = read_line () |> explode\nlet rec ans lst = \n  match lst with\n  | [] -> []\n  | first :: rest -> if first = '9' then '1' :: ans rest else '9' :: ans rest\n\nlet _ = print_endline (string_of_chars (ans n))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nCat Snuke is learning to write characters.\nToday, he practiced writing digits 1 and 9, but he did it the other way around.\n\nYou are given a three-digit integer n written by Snuke.\nPrint the integer obtained by replacing each digit 1 with 9 and each digit 9 with 1 in n.\n\nConstraints\n\n111 \\leq n \\leq 999\n\nn is an integer consisting of digits 1 and 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\n\nOutput\n\nPrint the integer obtained by replacing each occurrence of 1 with 9 and each occurrence of 9 with 1 in n.\n\nSample Input 1\n\n119\n\nSample Output 1\n\n991\n\nReplace the 9 in the ones place with 1, the 1 in the tens place with 9 and the 1 in the hundreds place with 9. The answer is 991.\n\nSample Input 2\n\n999\n\nSample Output 2\n\n111", "sample_input": "119\n"}, "reference_outputs": ["991\n"], "source_document_id": "p03242", "source_text": "Score : 100 points\n\nProblem Statement\n\nCat Snuke is learning to write characters.\nToday, he practiced writing digits 1 and 9, but he did it the other way around.\n\nYou are given a three-digit integer n written by Snuke.\nPrint the integer obtained by replacing each digit 1 with 9 and each digit 9 with 1 in n.\n\nConstraints\n\n111 \\leq n \\leq 999\n\nn is an integer consisting of digits 1 and 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\n\nOutput\n\nPrint the integer obtained by replacing each occurrence of 1 with 9 and each occurrence of 9 with 1 in n.\n\nSample Input 1\n\n119\n\nSample Output 1\n\n991\n\nReplace the 9 in the ones place with 1, the 1 in the tens place with 9 and the 1 in the hundreds place with 9. The answer is 991.\n\nSample Input 2\n\n999\n\nSample Output 2\n\n111", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 405, "cpu_time_ms": 2, "memory_kb": 1024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s669980025", "group_id": "codeNet:p03243", "input_text": "open Printf open Scanf\nmodule MyInt = struct let (+) = (+) let (-) = (-) let (/) = (/) let ( * ) = ( * ) let (mod) = (mod) let (%) = (mod) let (+=) r v = r := !r + v let (-=) r v = r := !r - v let ( *=) r v= r := !r * v let (/=) r v = r := !r / v let abs v = abs v let (land),(lor),(lxor),lnot,(lsl),(lsr),(asr) = (land),(lor),(lxor),lnot,(lsl),(lsr),(asr) let min_int,max_int = min_int,max_int end\nmodule MyInt64 = struct\n\tlet (+$) = (+) let (-$) = (-) let (/$) = (/) let ( *$) = ( * ) let (+) p q = Int64.add p q let (-) p q = Int64.sub p q let ( * ) p q = Int64.mul p q let (/) p q = Int64.div p q let (+=) r v = r := !r + v let (-=) r v = r := !r - v let ( *=) r v= r := !r * v let (/=) r v = r := !r / v let labs p = if p < 0L then -1L*p else p let (~|) p = Int64.to_int p let (~~|) p = Int64.of_int p let input_i64_array n = Array.init (~| n) (fun _ -> Scanf.scanf \" %Ld\" (fun v -> v)) let get_i64 _ = Scanf.scanf \" %Ld\" (fun v -> v) let get_2_i64 _ = Scanf.scanf \" %Ld %Ld\" (fun u v -> u,v) let get_3_i64 _ = Scanf.scanf \" %Ld %Ld %Ld\" (fun u v w -> u,v,w) let get_4_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld\" (fun u v w x -> u,v,w,x) let get_5_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld %Ld\" (fun u v w x y -> u,v,w,x,y) let print_i64_endline n = n |> Int64.to_string |> print_endline let (mod) m n = m - (m/n) * n let (%) = (mod) let rec gcd m n = match m,n with | m,0L -> m | m,n -> gcd n (m mod n) let lcm m n = (m*n) / gcd m n let rep from_ to_ fbod = let i,f = ref ~|from_,ref true in while !i <= ~|to_ && !f do match fbod ~~| !i with | `Break -> f := false | _ -> i := !i +$ 1; done let repb from_ to_ fbod = let i,f = ref ~|from_,ref true in while !i <= ~|to_ && !f do match fbod (~~| !i) with | `Break -> f := false | _ -> i := !i +$ 1 done; !f let repm from_ to_ m_init fbod = let i,f,m = ref ~|from_,ref true,ref m_init in while !i <= ~|to_ && !f do match fbod !m (~~| !i) with | `Break -> f := false | `Break_m m' -> (f := false; m := m') | `Ok m' -> (i := !i +$ 1; m := m') done; !m let repmb from_ to_ m_init fbod = let i,f,m = ref ~|from_,ref true,ref m_init in while !i <= ~|to_ && !f do match fbod (~~| !i) !m with | `Break -> f := false | `Break_m m' -> (f := false; m := m') | `Ok m' -> (i := !i +$ 1; m := m') done; (!m,!f) let string_of_list ?(separator=\" \") f ls = let rec f0 a s = match a with | [] -> s | [h] -> s ^ (f h) ^ separator | h::t -> f0 t (s ^ (f h) ^ separator) in f0 ls \"\" let char_list_of_string str = let rec f0 i a = if i<0 then a else f0 (i-$1) (str.[i]::a) in f0 (String.length str -$ 1) [] let string_of_char_list ls = List.fold_left (fun u v -> u ^ (String.make 1 v)) \"\" ls\n\tlet (@@@) = (@) let (@) a i = a.(~|i) let (<@) a (i,v) = a.(~|i) <- v\n\tlet ceildiv m n = (m+n-1L) / n\n\tlet abs v = Int64.abs v let (land),(lor),(lxor),lnot,(lsl),(lsr),(asr) = let open Int64 in (logand),(logor),(logxor),lognot,(fun u v -> shift_left u (~|v)),(fun u v -> shift_right u (~|v)),(fun u v -> shift_right_logical u (~|v)) let min_int,max_int = Int64.min_int,Int64.max_int let get_string _ = scanf \" %s\" (fun v -> v)\n\tlet i32,i64 = Int64.to_int,Int64.of_int let alen a = i64 @@ Array.length a\n\tlet dump_array a = a |> Array.to_list |> string_of_list Int64.to_string |> print_endline let i32_get_int _ = Scanf.scanf \" %d\" (fun v -> v) let i32_get_2_ints _ = Scanf.scanf \" %d %d\" (fun u v -> u,v) let i32_get_3_ints _ = Scanf.scanf \" %d %d %d\" (fun u v w -> u,v,w) let i32_get_4_ints _ = Scanf.scanf \" %d %d %d %d\" (fun u v w x -> u,v,w,x) let i32_get_5_ints _ = Scanf.scanf \" %d %d %d %d %d\" (fun u v w x y -> u,v,w,x,y) let repi from_ to_ fbod = let i,f = ref from_,ref true in while !i <= to_ && !f do match fbod !i with | `Break -> f := false | _ -> i := !i +$ 1 done\nend open MyInt64\n\nlet digits v =\n\tlet rec f0 p a = if p=0L then a else f0 (p/10L) ((p mod 10L)::a)\n\tin f0 v []\nlet () =\n\tlet n = get_i64 0 in\n\tlet a = digits n |> Array.of_list in\n\tlet m = a.(0) * 111L in (\n\t\tif n <= m then m else (a.(0)+1L)*111L\n\t) |> printf \"%Ld\\n\"\n\n\n\n\n\n\n\n", "language": "OCaml", "metadata": {"date": 1538269481, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s669980025.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s669980025", "user_id": "u481480055"}, "prompt_components": {"gold_output": "111\n", "input_to_evaluate": "open Printf open Scanf\nmodule MyInt = struct let (+) = (+) let (-) = (-) let (/) = (/) let ( * ) = ( * ) let (mod) = (mod) let (%) = (mod) let (+=) r v = r := !r + v let (-=) r v = r := !r - v let ( *=) r v= r := !r * v let (/=) r v = r := !r / v let abs v = abs v let (land),(lor),(lxor),lnot,(lsl),(lsr),(asr) = (land),(lor),(lxor),lnot,(lsl),(lsr),(asr) let min_int,max_int = min_int,max_int end\nmodule MyInt64 = struct\n\tlet (+$) = (+) let (-$) = (-) let (/$) = (/) let ( *$) = ( * ) let (+) p q = Int64.add p q let (-) p q = Int64.sub p q let ( * ) p q = Int64.mul p q let (/) p q = Int64.div p q let (+=) r v = r := !r + v let (-=) r v = r := !r - v let ( *=) r v= r := !r * v let (/=) r v = r := !r / v let labs p = if p < 0L then -1L*p else p let (~|) p = Int64.to_int p let (~~|) p = Int64.of_int p let input_i64_array n = Array.init (~| n) (fun _ -> Scanf.scanf \" %Ld\" (fun v -> v)) let get_i64 _ = Scanf.scanf \" %Ld\" (fun v -> v) let get_2_i64 _ = Scanf.scanf \" %Ld %Ld\" (fun u v -> u,v) let get_3_i64 _ = Scanf.scanf \" %Ld %Ld %Ld\" (fun u v w -> u,v,w) let get_4_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld\" (fun u v w x -> u,v,w,x) let get_5_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld %Ld\" (fun u v w x y -> u,v,w,x,y) let print_i64_endline n = n |> Int64.to_string |> print_endline let (mod) m n = m - (m/n) * n let (%) = (mod) let rec gcd m n = match m,n with | m,0L -> m | m,n -> gcd n (m mod n) let lcm m n = (m*n) / gcd m n let rep from_ to_ fbod = let i,f = ref ~|from_,ref true in while !i <= ~|to_ && !f do match fbod ~~| !i with | `Break -> f := false | _ -> i := !i +$ 1; done let repb from_ to_ fbod = let i,f = ref ~|from_,ref true in while !i <= ~|to_ && !f do match fbod (~~| !i) with | `Break -> f := false | _ -> i := !i +$ 1 done; !f let repm from_ to_ m_init fbod = let i,f,m = ref ~|from_,ref true,ref m_init in while !i <= ~|to_ && !f do match fbod !m (~~| !i) with | `Break -> f := false | `Break_m m' -> (f := false; m := m') | `Ok m' -> (i := !i +$ 1; m := m') done; !m let repmb from_ to_ m_init fbod = let i,f,m = ref ~|from_,ref true,ref m_init in while !i <= ~|to_ && !f do match fbod (~~| !i) !m with | `Break -> f := false | `Break_m m' -> (f := false; m := m') | `Ok m' -> (i := !i +$ 1; m := m') done; (!m,!f) let string_of_list ?(separator=\" \") f ls = let rec f0 a s = match a with | [] -> s | [h] -> s ^ (f h) ^ separator | h::t -> f0 t (s ^ (f h) ^ separator) in f0 ls \"\" let char_list_of_string str = let rec f0 i a = if i<0 then a else f0 (i-$1) (str.[i]::a) in f0 (String.length str -$ 1) [] let string_of_char_list ls = List.fold_left (fun u v -> u ^ (String.make 1 v)) \"\" ls\n\tlet (@@@) = (@) let (@) a i = a.(~|i) let (<@) a (i,v) = a.(~|i) <- v\n\tlet ceildiv m n = (m+n-1L) / n\n\tlet abs v = Int64.abs v let (land),(lor),(lxor),lnot,(lsl),(lsr),(asr) = let open Int64 in (logand),(logor),(logxor),lognot,(fun u v -> shift_left u (~|v)),(fun u v -> shift_right u (~|v)),(fun u v -> shift_right_logical u (~|v)) let min_int,max_int = Int64.min_int,Int64.max_int let get_string _ = scanf \" %s\" (fun v -> v)\n\tlet i32,i64 = Int64.to_int,Int64.of_int let alen a = i64 @@ Array.length a\n\tlet dump_array a = a |> Array.to_list |> string_of_list Int64.to_string |> print_endline let i32_get_int _ = Scanf.scanf \" %d\" (fun v -> v) let i32_get_2_ints _ = Scanf.scanf \" %d %d\" (fun u v -> u,v) let i32_get_3_ints _ = Scanf.scanf \" %d %d %d\" (fun u v w -> u,v,w) let i32_get_4_ints _ = Scanf.scanf \" %d %d %d %d\" (fun u v w x -> u,v,w,x) let i32_get_5_ints _ = Scanf.scanf \" %d %d %d %d %d\" (fun u v w x y -> u,v,w,x,y) let repi from_ to_ fbod = let i,f = ref from_,ref true in while !i <= to_ && !f do match fbod !i with | `Break -> f := false | _ -> i := !i +$ 1 done\nend open MyInt64\n\nlet digits v =\n\tlet rec f0 p a = if p=0L then a else f0 (p/10L) ((p mod 10L)::a)\n\tin f0 v []\nlet () =\n\tlet n = get_i64 0 in\n\tlet a = digits n |> Array.of_list in\n\tlet m = a.(0) * 111L in (\n\t\tif n <= m then m else (a.(0)+1L)*111L\n\t) |> printf \"%Ld\\n\"\n\n\n\n\n\n\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nKurohashi has never participated in AtCoder Beginner Contest (ABC).\n\nThe next ABC to be held is ABC N (the N-th ABC ever held).\nKurohashi wants to make his debut in some ABC x such that all the digits of x in base ten are the same.\n\nWhat is the earliest ABC where Kurohashi can make his debut?\n\nConstraints\n\n100 \\leq N \\leq 999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf the earliest ABC where Kurohashi can make his debut is ABC n, print n.\n\nSample Input 1\n\n111\n\nSample Output 1\n\n111\n\nThe next ABC to be held is ABC 111, where Kurohashi can make his debut.\n\nSample Input 2\n\n112\n\nSample Output 2\n\n222\n\nThe next ABC to be held is ABC 112, which means Kurohashi can no longer participate in ABC 111.\nAmong the ABCs where Kurohashi can make his debut, the earliest one is ABC 222.\n\nSample Input 3\n\n750\n\nSample Output 3\n\n777", "sample_input": "111\n"}, "reference_outputs": ["111\n"], "source_document_id": "p03243", "source_text": "Score : 200 points\n\nProblem Statement\n\nKurohashi has never participated in AtCoder Beginner Contest (ABC).\n\nThe next ABC to be held is ABC N (the N-th ABC ever held).\nKurohashi wants to make his debut in some ABC x such that all the digits of x in base ten are the same.\n\nWhat is the earliest ABC where Kurohashi can make his debut?\n\nConstraints\n\n100 \\leq N \\leq 999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf the earliest ABC where Kurohashi can make his debut is ABC n, print n.\n\nSample Input 1\n\n111\n\nSample Output 1\n\n111\n\nThe next ABC to be held is ABC 111, where Kurohashi can make his debut.\n\nSample Input 2\n\n112\n\nSample Output 2\n\n222\n\nThe next ABC to be held is ABC 112, which means Kurohashi can no longer participate in ABC 111.\nAmong the ABCs where Kurohashi can make his debut, the earliest one is ABC 222.\n\nSample Input 3\n\n750\n\nSample Output 3\n\n777", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3971, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s038907188", "group_id": "codeNet:p03244", "input_text": "open Printf open Scanf\nmodule MyInt = struct let (+) = (+) let (-) = (-) let (/) = (/) let ( * ) = ( * ) let (mod) = (mod) let (%) = (mod) let (+=) r v = r := !r + v let (-=) r v = r := !r - v let ( *=) r v= r := !r * v let (/=) r v = r := !r / v let abs v = abs v let (land),(lor),(lxor),lnot,(lsl),(lsr),(asr) = (land),(lor),(lxor),lnot,(lsl),(lsr),(asr) let min_int,max_int = min_int,max_int end\nmodule MyInt64 = struct\n\tlet (+$) = (+) let (-$) = (-) let (/$) = (/) let ( *$) = ( * ) let (+) p q = Int64.add p q let (-) p q = Int64.sub p q let ( * ) p q = Int64.mul p q let (/) p q = Int64.div p q let (+=) r v = r := !r + v let (-=) r v = r := !r - v let ( *=) r v= r := !r * v let (/=) r v = r := !r / v let labs p = if p < 0L then -1L*p else p let (~|) p = Int64.to_int p let (~~|) p = Int64.of_int p let input_i64_array n = Array.init (~| n) (fun _ -> Scanf.scanf \" %Ld\" (fun v -> v)) let get_i64 _ = Scanf.scanf \" %Ld\" (fun v -> v) let get_2_i64 _ = Scanf.scanf \" %Ld %Ld\" (fun u v -> u,v) let get_3_i64 _ = Scanf.scanf \" %Ld %Ld %Ld\" (fun u v w -> u,v,w) let get_4_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld\" (fun u v w x -> u,v,w,x) let get_5_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld %Ld\" (fun u v w x y -> u,v,w,x,y) let print_i64_endline n = n |> Int64.to_string |> print_endline let (mod) m n = m - (m/n) * n let (%) = (mod) let rec gcd m n = match m,n with | m,0L -> m | m,n -> gcd n (m mod n) let lcm m n = (m*n) / gcd m n let rep from_ to_ fbod = let i,f = ref ~|from_,ref true in while !i <= ~|to_ && !f do match fbod ~~| !i with | `Break -> f := false | _ -> i := !i +$ 1; done let repb from_ to_ fbod = let i,f = ref ~|from_,ref true in while !i <= ~|to_ && !f do match fbod (~~| !i) with | `Break -> f := false | _ -> i := !i +$ 1 done; !f let repm from_ to_ m_init fbod = let i,f,m = ref ~|from_,ref true,ref m_init in while !i <= ~|to_ && !f do match fbod !m (~~| !i) with | `Break -> f := false | `Break_m m' -> (f := false; m := m') | `Ok m' -> (i := !i +$ 1; m := m') done; !m let repmb from_ to_ m_init fbod = let i,f,m = ref ~|from_,ref true,ref m_init in while !i <= ~|to_ && !f do match fbod (~~| !i) !m with | `Break -> f := false | `Break_m m' -> (f := false; m := m') | `Ok m' -> (i := !i +$ 1; m := m') done; (!m,!f) let string_of_list ?(separator=\" \") f ls = let rec f0 a s = match a with | [] -> s | [h] -> s ^ (f h) ^ separator | h::t -> f0 t (s ^ (f h) ^ separator) in f0 ls \"\" let char_list_of_string str = let rec f0 i a = if i<0 then a else f0 (i-$1) (str.[i]::a) in f0 (String.length str -$ 1) [] let string_of_char_list ls = List.fold_left (fun u v -> u ^ (String.make 1 v)) \"\" ls\n\tlet (@@@) = (@) let (@) a i = a.(~|i) let (<@) a (i,v) = a.(~|i) <- v\n\tlet ceildiv m n = (m+n-1L) / n\n\tlet abs v = Int64.abs v let (land),(lor),(lxor),lnot,(lsl),(lsr),(asr) = let open Int64 in (logand),(logor),(logxor),lognot,(fun u v -> shift_left u (~|v)),(fun u v -> shift_right u (~|v)),(fun u v -> shift_right_logical u (~|v)) let min_int,max_int = Int64.min_int,Int64.max_int let get_string _ = scanf \" %s\" (fun v -> v)\n\tlet i32,i64 = Int64.to_int,Int64.of_int let alen a = i64 @@ Array.length a\n\tlet dump_array a = a |> Array.to_list |> string_of_list Int64.to_string |> print_endline let i32_get_int _ = Scanf.scanf \" %d\" (fun v -> v) let i32_get_2_ints _ = Scanf.scanf \" %d %d\" (fun u v -> u,v) let i32_get_3_ints _ = Scanf.scanf \" %d %d %d\" (fun u v w -> u,v,w) let i32_get_4_ints _ = Scanf.scanf \" %d %d %d %d\" (fun u v w x -> u,v,w,x) let i32_get_5_ints _ = Scanf.scanf \" %d %d %d %d %d\" (fun u v w x y -> u,v,w,x,y) let repi from_ to_ fbod = let i,f = ref from_,ref true in while !i <= to_ && !f do match fbod !i with | `Break -> f := false | _ -> i := !i +$ 1 done\nend open MyInt64\nlet llen l = i64 @@ List.length l\n(* module IMap = Map.Make (struct\n\ttype t = int64\n\tlet compare i j = \nend) *)\nmodule IMap = Map.Make (Int64)\nlet find k m = try IMap.find k m with | Not_found -> 0L\n\nlet f = List.fold_left (fun (k,u) (j,v) -> \n\t\tif u < v then (j,v) else (k,u)\n) (-1L,Int64.min_int)\n\nlet d l = string_of_list (fun (k,v) -> sprintf \"(%Ld,%Ld)\" k v) l |> print_endline\n\nlet () =\n\tlet n = get_i64 0 in let a = input_i64_array n in\n\tlet a0 = (Array.init (i32 n) (fun i -> a.(i))) in\n\tArray.sort compare a0;\n\tif a0.(0) = a0.(i32 n -$ 1) then (\n\t\tprintf \"%Ld\\n\" (n/2L)\n\t) else (\n\t\tlet (o,e,_) = Array.fold_left (fun (o,e,i) v ->\n\t\t\t(* printf \"%Ld %Ld\\n\" i v; *)\n\t\t\tif i mod 2L = 0L then (o,IMap.add v (find v e + 1L) e,i+1L)\n\t\t\telse (IMap.add v (find v o + 1L) o,e,i+1L)\n\t\t) (IMap.empty, IMap.empty, 0L) a\n\t\tin\n\t\tlet (o2,e2) = IMap.bindings o,IMap.bindings e in\n\t\t(* d o2;\n\t\td e2; *)\n\t\t(* List.iter (fun (u,v) -> printf \"(%Ld,%Ld);\" u v) o2;\n\t\tprint_endline \"\";\n\t\tList.iter (fun (u,v) -> printf \"(%Ld,%Ld);\" u v) e2;\n\t\tprint_endline \"\";\n\t\tlet ((k,p),(j,q)) = f o2, f e2\n\t\tin\n\t\tif k = j then (\n\t\t\tprintf \"%Ld\\n\" (n - (max p q))\n\n\t\t) else (\n\t\t\tprintf \"%Ld %Ld %Ld %Ld\\n\" (n / 2L) p ((n+1L)/2L) q;\n\t\t\tprintf \"%Ld\\n\" (n - p - q)\n\t\t) *)\n\t\tlet (o2,e2) = List.sort (fun (k,u) (j,v) -> -compare u v) o2,List.sort (fun (k,u) (j,v) -> compare u v) e2\n\t\tin\n\t\tlet (o2,e2) = Array.of_list o2,Array.of_list e2 in\n\t\tlet ((k,p),(j,q)) = o2.(0),e2.(0) in\n\t\t(* printf \"%Ld %Ld %Ld %Ld\\n\" k p j q; *)\n\t\tif k = j then (\n\t\t\tif snd o2.(1) > snd e2.(1) then (\n\t\t\t\tprintf \"%Ld\\n\" (n - (snd o2.(1)) - q)\n\t\t\t) else (\n\t\t\t\tprintf \"%Ld\\n\" (n - (snd e2.(1)) - p)\n\t\t\t)\n\t\t) else (\n\t\t\tprintf \"%Ld\\n\" (n - p - q)\n\t\t)\n\t)\n\n\n\n\n\n\n\n", "language": "OCaml", "metadata": {"date": 1538270982, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s038907188.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s038907188", "user_id": "u481480055"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Printf open Scanf\nmodule MyInt = struct let (+) = (+) let (-) = (-) let (/) = (/) let ( * ) = ( * ) let (mod) = (mod) let (%) = (mod) let (+=) r v = r := !r + v let (-=) r v = r := !r - v let ( *=) r v= r := !r * v let (/=) r v = r := !r / v let abs v = abs v let (land),(lor),(lxor),lnot,(lsl),(lsr),(asr) = (land),(lor),(lxor),lnot,(lsl),(lsr),(asr) let min_int,max_int = min_int,max_int end\nmodule MyInt64 = struct\n\tlet (+$) = (+) let (-$) = (-) let (/$) = (/) let ( *$) = ( * ) let (+) p q = Int64.add p q let (-) p q = Int64.sub p q let ( * ) p q = Int64.mul p q let (/) p q = Int64.div p q let (+=) r v = r := !r + v let (-=) r v = r := !r - v let ( *=) r v= r := !r * v let (/=) r v = r := !r / v let labs p = if p < 0L then -1L*p else p let (~|) p = Int64.to_int p let (~~|) p = Int64.of_int p let input_i64_array n = Array.init (~| n) (fun _ -> Scanf.scanf \" %Ld\" (fun v -> v)) let get_i64 _ = Scanf.scanf \" %Ld\" (fun v -> v) let get_2_i64 _ = Scanf.scanf \" %Ld %Ld\" (fun u v -> u,v) let get_3_i64 _ = Scanf.scanf \" %Ld %Ld %Ld\" (fun u v w -> u,v,w) let get_4_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld\" (fun u v w x -> u,v,w,x) let get_5_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld %Ld\" (fun u v w x y -> u,v,w,x,y) let print_i64_endline n = n |> Int64.to_string |> print_endline let (mod) m n = m - (m/n) * n let (%) = (mod) let rec gcd m n = match m,n with | m,0L -> m | m,n -> gcd n (m mod n) let lcm m n = (m*n) / gcd m n let rep from_ to_ fbod = let i,f = ref ~|from_,ref true in while !i <= ~|to_ && !f do match fbod ~~| !i with | `Break -> f := false | _ -> i := !i +$ 1; done let repb from_ to_ fbod = let i,f = ref ~|from_,ref true in while !i <= ~|to_ && !f do match fbod (~~| !i) with | `Break -> f := false | _ -> i := !i +$ 1 done; !f let repm from_ to_ m_init fbod = let i,f,m = ref ~|from_,ref true,ref m_init in while !i <= ~|to_ && !f do match fbod !m (~~| !i) with | `Break -> f := false | `Break_m m' -> (f := false; m := m') | `Ok m' -> (i := !i +$ 1; m := m') done; !m let repmb from_ to_ m_init fbod = let i,f,m = ref ~|from_,ref true,ref m_init in while !i <= ~|to_ && !f do match fbod (~~| !i) !m with | `Break -> f := false | `Break_m m' -> (f := false; m := m') | `Ok m' -> (i := !i +$ 1; m := m') done; (!m,!f) let string_of_list ?(separator=\" \") f ls = let rec f0 a s = match a with | [] -> s | [h] -> s ^ (f h) ^ separator | h::t -> f0 t (s ^ (f h) ^ separator) in f0 ls \"\" let char_list_of_string str = let rec f0 i a = if i<0 then a else f0 (i-$1) (str.[i]::a) in f0 (String.length str -$ 1) [] let string_of_char_list ls = List.fold_left (fun u v -> u ^ (String.make 1 v)) \"\" ls\n\tlet (@@@) = (@) let (@) a i = a.(~|i) let (<@) a (i,v) = a.(~|i) <- v\n\tlet ceildiv m n = (m+n-1L) / n\n\tlet abs v = Int64.abs v let (land),(lor),(lxor),lnot,(lsl),(lsr),(asr) = let open Int64 in (logand),(logor),(logxor),lognot,(fun u v -> shift_left u (~|v)),(fun u v -> shift_right u (~|v)),(fun u v -> shift_right_logical u (~|v)) let min_int,max_int = Int64.min_int,Int64.max_int let get_string _ = scanf \" %s\" (fun v -> v)\n\tlet i32,i64 = Int64.to_int,Int64.of_int let alen a = i64 @@ Array.length a\n\tlet dump_array a = a |> Array.to_list |> string_of_list Int64.to_string |> print_endline let i32_get_int _ = Scanf.scanf \" %d\" (fun v -> v) let i32_get_2_ints _ = Scanf.scanf \" %d %d\" (fun u v -> u,v) let i32_get_3_ints _ = Scanf.scanf \" %d %d %d\" (fun u v w -> u,v,w) let i32_get_4_ints _ = Scanf.scanf \" %d %d %d %d\" (fun u v w x -> u,v,w,x) let i32_get_5_ints _ = Scanf.scanf \" %d %d %d %d %d\" (fun u v w x y -> u,v,w,x,y) let repi from_ to_ fbod = let i,f = ref from_,ref true in while !i <= to_ && !f do match fbod !i with | `Break -> f := false | _ -> i := !i +$ 1 done\nend open MyInt64\nlet llen l = i64 @@ List.length l\n(* module IMap = Map.Make (struct\n\ttype t = int64\n\tlet compare i j = \nend) *)\nmodule IMap = Map.Make (Int64)\nlet find k m = try IMap.find k m with | Not_found -> 0L\n\nlet f = List.fold_left (fun (k,u) (j,v) -> \n\t\tif u < v then (j,v) else (k,u)\n) (-1L,Int64.min_int)\n\nlet d l = string_of_list (fun (k,v) -> sprintf \"(%Ld,%Ld)\" k v) l |> print_endline\n\nlet () =\n\tlet n = get_i64 0 in let a = input_i64_array n in\n\tlet a0 = (Array.init (i32 n) (fun i -> a.(i))) in\n\tArray.sort compare a0;\n\tif a0.(0) = a0.(i32 n -$ 1) then (\n\t\tprintf \"%Ld\\n\" (n/2L)\n\t) else (\n\t\tlet (o,e,_) = Array.fold_left (fun (o,e,i) v ->\n\t\t\t(* printf \"%Ld %Ld\\n\" i v; *)\n\t\t\tif i mod 2L = 0L then (o,IMap.add v (find v e + 1L) e,i+1L)\n\t\t\telse (IMap.add v (find v o + 1L) o,e,i+1L)\n\t\t) (IMap.empty, IMap.empty, 0L) a\n\t\tin\n\t\tlet (o2,e2) = IMap.bindings o,IMap.bindings e in\n\t\t(* d o2;\n\t\td e2; *)\n\t\t(* List.iter (fun (u,v) -> printf \"(%Ld,%Ld);\" u v) o2;\n\t\tprint_endline \"\";\n\t\tList.iter (fun (u,v) -> printf \"(%Ld,%Ld);\" u v) e2;\n\t\tprint_endline \"\";\n\t\tlet ((k,p),(j,q)) = f o2, f e2\n\t\tin\n\t\tif k = j then (\n\t\t\tprintf \"%Ld\\n\" (n - (max p q))\n\n\t\t) else (\n\t\t\tprintf \"%Ld %Ld %Ld %Ld\\n\" (n / 2L) p ((n+1L)/2L) q;\n\t\t\tprintf \"%Ld\\n\" (n - p - q)\n\t\t) *)\n\t\tlet (o2,e2) = List.sort (fun (k,u) (j,v) -> -compare u v) o2,List.sort (fun (k,u) (j,v) -> compare u v) e2\n\t\tin\n\t\tlet (o2,e2) = Array.of_list o2,Array.of_list e2 in\n\t\tlet ((k,p),(j,q)) = o2.(0),e2.(0) in\n\t\t(* printf \"%Ld %Ld %Ld %Ld\\n\" k p j q; *)\n\t\tif k = j then (\n\t\t\tif snd o2.(1) > snd e2.(1) then (\n\t\t\t\tprintf \"%Ld\\n\" (n - (snd o2.(1)) - q)\n\t\t\t) else (\n\t\t\t\tprintf \"%Ld\\n\" (n - (snd e2.(1)) - p)\n\t\t\t)\n\t\t) else (\n\t\t\tprintf \"%Ld\\n\" (n - p - q)\n\t\t)\n\t)\n\n\n\n\n\n\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA sequence a_1,a_2,... ,a_n is said to be /\\/\\/\\/ when the following conditions are satisfied:\n\nFor each i = 1,2,..., n-2, a_i = a_{i+2}.\n\nExactly two different numbers appear in the sequence.\n\nYou are given a sequence v_1,v_2,...,v_n whose length is even.\nWe would like to make this sequence /\\/\\/\\/ by replacing some of its elements.\nFind the minimum number of elements that needs to be replaced.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\nn is even.\n\n1 \\leq v_i \\leq 10^5\n\nv_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\nv_1 v_2 ... v_n\n\nOutput\n\nPrint the minimum number of elements that needs to be replaced.\n\nSample Input 1\n\n4\n3 1 3 2\n\nSample Output 1\n\n1\n\nThe sequence 3,1,3,2 is not /\\/\\/\\/, but we can make it /\\/\\/\\/ by replacing one of its elements: for example, replace the fourth element to make it 3,1,3,1.\n\nSample Input 2\n\n6\n105 119 105 119 105 119\n\nSample Output 2\n\n0\n\nThe sequence 105,119,105,119,105,119 is /\\/\\/\\/.\n\nSample Input 3\n\n4\n1 1 1 1\n\nSample Output 3\n\n2\n\nThe elements of the sequence 1,1,1,1 are all the same, so it is not /\\/\\/\\/.", "sample_input": "4\n3 1 3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03244", "source_text": "Score : 300 points\n\nProblem Statement\n\nA sequence a_1,a_2,... ,a_n is said to be /\\/\\/\\/ when the following conditions are satisfied:\n\nFor each i = 1,2,..., n-2, a_i = a_{i+2}.\n\nExactly two different numbers appear in the sequence.\n\nYou are given a sequence v_1,v_2,...,v_n whose length is even.\nWe would like to make this sequence /\\/\\/\\/ by replacing some of its elements.\nFind the minimum number of elements that needs to be replaced.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\nn is even.\n\n1 \\leq v_i \\leq 10^5\n\nv_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\nv_1 v_2 ... v_n\n\nOutput\n\nPrint the minimum number of elements that needs to be replaced.\n\nSample Input 1\n\n4\n3 1 3 2\n\nSample Output 1\n\n1\n\nThe sequence 3,1,3,2 is not /\\/\\/\\/, but we can make it /\\/\\/\\/ by replacing one of its elements: for example, replace the fourth element to make it 3,1,3,1.\n\nSample Input 2\n\n6\n105 119 105 119 105 119\n\nSample Output 2\n\n0\n\nThe sequence 105,119,105,119,105,119 is /\\/\\/\\/.\n\nSample Input 3\n\n4\n1 1 1 1\n\nSample Output 3\n\n2\n\nThe elements of the sequence 1,1,1,1 are all the same, so it is not /\\/\\/\\/.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5416, "cpu_time_ms": 318, "memory_kb": 24832}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s543108116", "group_id": "codeNet:p03246", "input_text": "Scanf.(Array.(let s,q,a,c,f,d=(fun f->Scanf.scanf\" %d\"f),make 100005(0,0),(fun a i->a.(i)<-fst a.(i)+1,i),(fun u v->compare v u),fst,snd in s@@fun n->let e,o=init n(fun i->s@@fun v->i,v)|>fold_left(fun(e,o)(i,v)->(if i mod 2=0 then a e v else a o v);e,o)(q,q)in sort c e;sort c o;print_int@@n-(if d e.(0)=d o.(0)then max(f e.(0)+f o.(1))(f e.(1)+f o.(0))else(f e.(0)+f o.(0)));0,0))", "language": "OCaml", "metadata": {"date": 1540264938, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03246.html", "problem_id": "p03246", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03246/input.txt", "sample_output_relpath": "derived/input_output/data/p03246/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03246/OCaml/s543108116.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s543108116", "user_id": "u481480055"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "Scanf.(Array.(let s,q,a,c,f,d=(fun f->Scanf.scanf\" %d\"f),make 100005(0,0),(fun a i->a.(i)<-fst a.(i)+1,i),(fun u v->compare v u),fst,snd in s@@fun n->let e,o=init n(fun i->s@@fun v->i,v)|>fold_left(fun(e,o)(i,v)->(if i mod 2=0 then a e v else a o v);e,o)(q,q)in sort c e;sort c o;print_int@@n-(if d e.(0)=d o.(0)then max(f e.(0)+f o.(1))(f e.(1)+f o.(0))else(f e.(0)+f o.(0)));0,0))", "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": "p03246", "source_text": "Score : 300 points\n\nProblem Statement\n\nA sequence a_1,a_2,... ,a_n is said to be /\\/\\/\\/ when the following conditions are satisfied:\n\nFor each i = 1,2,..., n-2, a_i = a_{i+2}.\n\nExactly two different numbers appear in the sequence.\n\nYou are given a sequence v_1,v_2,...,v_n whose length is even.\nWe would like to make this sequence /\\/\\/\\/ by replacing some of its elements.\nFind the minimum number of elements that needs to be replaced.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\nn is even.\n\n1 \\leq v_i \\leq 10^5\n\nv_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\nv_1 v_2 ... v_n\n\nOutput\n\nPrint the minimum number of elements that needs to be replaced.\n\nSample Input 1\n\n4\n3 1 3 2\n\nSample Output 1\n\n1\n\nThe sequence 3,1,3,2 is not /\\/\\/\\/, but we can make it /\\/\\/\\/ by replacing one of its elements: for example, replace the fourth element to make it 3,1,3,1.\n\nSample Input 2\n\n6\n105 119 105 119 105 119\n\nSample Output 2\n\n0\n\nThe sequence 105,119,105,119,105,119 is /\\/\\/\\/.\n\nSample Input 3\n\n4\n1 1 1 1\n\nSample Output 3\n\n2\n\nThe elements of the sequence 1,1,1,1 are all the same, so it is not /\\/\\/\\/.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 382, "cpu_time_ms": 223, "memory_kb": 9728}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s813483713", "group_id": "codeNet:p03246", "input_text": "open Printf\nopen Scanf\n\nlet id x = x\nlet pair x y = x, y\n\nlet n = scanf \"%d\" id\nlet vs = Array.init n @@ fun _ -> scanf \" %d\" id\n\nmodule IMap = Map.Make(struct type t = int let compare = Pervasives.compare end)\n\nlet odd = ref IMap.empty\nlet even = ref IMap.empty\n\nlet incrmap mapr key =\n  if IMap.mem key !mapr then\n    mapr := IMap.add key (IMap.find key !mapr + 1) !mapr\n  else\n    mapr := IMap.add key 1 !mapr\n\nlet maxi mapr =\n  let lis = IMap.bindings !mapr in\n  let lis = List.sort (fun (k1,v1) (k1,v2) -> v2 - v1) lis in\n  match lis with\n  | [] -> failwith \"\"\n  | (v, n) :: rest -> (v, n, rest)\n\nlet () =\n  for i = 0 to n - 1 do\n    if i mod 2 == 0 then begin\n      incrmap odd vs.(i)\n    end else begin\n      incrmap even vs.(i)\n    end\n  done;\n  let (k1, v1, rest1) = maxi odd in\n  let (k2, v2, rest2) = maxi even in\n  let run k1 k2 v1 v2 rest1 rest2 =\n    if k1 <> k2 then begin\n      let n1 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest1 in\n      let n2 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest2 in\n      n1 + n2\n    end else if v1 > v2 then begin\n      let n1 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest1 in\n      match rest2 with\n      | [] -> n1 + n / 2\n      | (k, v) :: _ -> n1 + n / 2 - v\n    end else if v1 < v2 then begin\n      let n2 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest2 in\n      match rest1 with\n      | [] -> n2 + n / 2\n      | (k, v) :: _ -> n2 + n / 2 - v \n    end else begin\n      (* k1 = k2, v1 = v2 *)\n      let rec loop rest1 rest2 =\n        match rest1, rest2 with\n        | [], [] -> 0\n        | [], (k', v') :: rest' -> v'\n        | (k', v') :: rest', [] -> v'\n        | (k1', v1') :: rest1', (k2', v2') :: rest2' ->\n          if v1' < v2' then\n            let n1 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest1' in\n            let n2 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest2' in\n            n1 + n2 - v1'\n          else if v1' > v2' then\n            let n1 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest1' in\n            let n2 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest2' in\n            n1 + n2 - v2' \n          else n / 0 (* loop rest1' rest2' *)\n      in\n      v1 + loop rest1 rest2\n    end\n  in\n  let result = run k1 k2 v1 v2 rest1 rest2 in\n  printf \"%d\\n\" result\n", "language": "OCaml", "metadata": {"date": 1538274576, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03246.html", "problem_id": "p03246", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03246/input.txt", "sample_output_relpath": "derived/input_output/data/p03246/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03246/OCaml/s813483713.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s813483713", "user_id": "u450300828"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet id x = x\nlet pair x y = x, y\n\nlet n = scanf \"%d\" id\nlet vs = Array.init n @@ fun _ -> scanf \" %d\" id\n\nmodule IMap = Map.Make(struct type t = int let compare = Pervasives.compare end)\n\nlet odd = ref IMap.empty\nlet even = ref IMap.empty\n\nlet incrmap mapr key =\n  if IMap.mem key !mapr then\n    mapr := IMap.add key (IMap.find key !mapr + 1) !mapr\n  else\n    mapr := IMap.add key 1 !mapr\n\nlet maxi mapr =\n  let lis = IMap.bindings !mapr in\n  let lis = List.sort (fun (k1,v1) (k1,v2) -> v2 - v1) lis in\n  match lis with\n  | [] -> failwith \"\"\n  | (v, n) :: rest -> (v, n, rest)\n\nlet () =\n  for i = 0 to n - 1 do\n    if i mod 2 == 0 then begin\n      incrmap odd vs.(i)\n    end else begin\n      incrmap even vs.(i)\n    end\n  done;\n  let (k1, v1, rest1) = maxi odd in\n  let (k2, v2, rest2) = maxi even in\n  let run k1 k2 v1 v2 rest1 rest2 =\n    if k1 <> k2 then begin\n      let n1 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest1 in\n      let n2 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest2 in\n      n1 + n2\n    end else if v1 > v2 then begin\n      let n1 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest1 in\n      match rest2 with\n      | [] -> n1 + n / 2\n      | (k, v) :: _ -> n1 + n / 2 - v\n    end else if v1 < v2 then begin\n      let n2 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest2 in\n      match rest1 with\n      | [] -> n2 + n / 2\n      | (k, v) :: _ -> n2 + n / 2 - v \n    end else begin\n      (* k1 = k2, v1 = v2 *)\n      let rec loop rest1 rest2 =\n        match rest1, rest2 with\n        | [], [] -> 0\n        | [], (k', v') :: rest' -> v'\n        | (k', v') :: rest', [] -> v'\n        | (k1', v1') :: rest1', (k2', v2') :: rest2' ->\n          if v1' < v2' then\n            let n1 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest1' in\n            let n2 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest2' in\n            n1 + n2 - v1'\n          else if v1' > v2' then\n            let n1 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest1' in\n            let n2 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest2' in\n            n1 + n2 - v2' \n          else n / 0 (* loop rest1' rest2' *)\n      in\n      v1 + loop rest1 rest2\n    end\n  in\n  let result = run k1 k2 v1 v2 rest1 rest2 in\n  printf \"%d\\n\" result\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA sequence a_1,a_2,... ,a_n is said to be /\\/\\/\\/ when the following conditions are satisfied:\n\nFor each i = 1,2,..., n-2, a_i = a_{i+2}.\n\nExactly two different numbers appear in the sequence.\n\nYou are given a sequence v_1,v_2,...,v_n whose length is even.\nWe would like to make this sequence /\\/\\/\\/ by replacing some of its elements.\nFind the minimum number of elements that needs to be replaced.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\nn is even.\n\n1 \\leq v_i \\leq 10^5\n\nv_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\nv_1 v_2 ... v_n\n\nOutput\n\nPrint the minimum number of elements that needs to be replaced.\n\nSample Input 1\n\n4\n3 1 3 2\n\nSample Output 1\n\n1\n\nThe sequence 3,1,3,2 is not /\\/\\/\\/, but we can make it /\\/\\/\\/ by replacing one of its elements: for example, replace the fourth element to make it 3,1,3,1.\n\nSample Input 2\n\n6\n105 119 105 119 105 119\n\nSample Output 2\n\n0\n\nThe sequence 105,119,105,119,105,119 is /\\/\\/\\/.\n\nSample Input 3\n\n4\n1 1 1 1\n\nSample Output 3\n\n2\n\nThe elements of the sequence 1,1,1,1 are all the same, so it is not /\\/\\/\\/.", "sample_input": "4\n3 1 3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03246", "source_text": "Score : 300 points\n\nProblem Statement\n\nA sequence a_1,a_2,... ,a_n is said to be /\\/\\/\\/ when the following conditions are satisfied:\n\nFor each i = 1,2,..., n-2, a_i = a_{i+2}.\n\nExactly two different numbers appear in the sequence.\n\nYou are given a sequence v_1,v_2,...,v_n whose length is even.\nWe would like to make this sequence /\\/\\/\\/ by replacing some of its elements.\nFind the minimum number of elements that needs to be replaced.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\nn is even.\n\n1 \\leq v_i \\leq 10^5\n\nv_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\nv_1 v_2 ... v_n\n\nOutput\n\nPrint the minimum number of elements that needs to be replaced.\n\nSample Input 1\n\n4\n3 1 3 2\n\nSample Output 1\n\n1\n\nThe sequence 3,1,3,2 is not /\\/\\/\\/, but we can make it /\\/\\/\\/ by replacing one of its elements: for example, replace the fourth element to make it 3,1,3,1.\n\nSample Input 2\n\n6\n105 119 105 119 105 119\n\nSample Output 2\n\n0\n\nThe sequence 105,119,105,119,105,119 is /\\/\\/\\/.\n\nSample Input 3\n\n4\n1 1 1 1\n\nSample Output 3\n\n2\n\nThe elements of the sequence 1,1,1,1 are all the same, so it is not /\\/\\/\\/.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2271, "cpu_time_ms": 184, "memory_kb": 18816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s468918641", "group_id": "codeNet:p03246", "input_text": "open Printf\nopen Scanf\n\nlet id x = x\nlet pair x y = x, y\n\nlet n = scanf \"%d\" id\nlet vs = Array.init n @@ fun _ -> scanf \" %d\" id\n\nmodule IMap = Map.Make(struct type t = int let compare = Pervasives.compare end)\n\nlet odd = ref IMap.empty\nlet even = ref IMap.empty\n\nlet incrmap mapr key =\n  if IMap.mem key !mapr then\n    mapr := IMap.add key (IMap.find key !mapr + 1) !mapr\n  else\n    mapr := IMap.add key 1 !mapr\n\nlet maxi mapr =\n  let lis = IMap.bindings !mapr in\n  let lis = List.sort (fun (k1,v1) (k1,v2) -> v2 - v1) lis in\n  match lis with\n  | [] -> failwith \"\"\n  | (v, n) :: rest -> (v, n, rest)\n\nlet () =\n  for i = 0 to n - 1 do\n    if i mod 2 == 0 then begin\n      incrmap odd vs.(i)\n    end else begin\n      incrmap even vs.(i)\n    end\n  done;\n  let (k1, v1, rest1) = maxi odd in\n  let (k2, v2, rest2) = maxi even in\n  let run k1 k2 v1 v2 rest1 rest2 =\n    if k1 <> k2 then begin\n      let n1 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest1 in\n      let n2 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest2 in\n      n1 + n2\n    end else if v1 > v2 then begin\n      let n1 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest1 in\n      match rest2 with\n      | [] -> n1 + n / 2\n      | (k, v) :: _ -> n1 + n / 2 - v\n    end else if v1 < v2 then begin\n      let n2 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest2 in\n      match rest1 with\n      | [] -> n2 + n / 2\n      | (k, v) :: _ -> n2 + n / 2 - v \n    end else begin\n      (* k1 = k2, v1 = v2 *)\n      let rec loop rest1 rest2 =\n        match rest1, rest2 with\n        | [], [] -> 0\n        | [], (k', v') :: rest' -> v'\n        | (k', v') :: rest', [] -> v'\n        | (k1', v1') :: rest1', (k2', v2') :: rest2' ->\n          if v1' < v2' then\n            let n1 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest1' in\n            let n2 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest2' in\n            n1 + n2 + v2'\n          else if v1' > v2' then\n            let n1 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest1' in\n            let n2 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest2' in\n            n1 + n2 + v1' \n          else n / 0 (* loop rest1' rest2' *)\n      in\n      v1 + loop rest1 rest2\n    end\n  in\n  let result = run k1 k2 v1 v2 rest1 rest2 in\n  printf \"%d\\n\" result\n", "language": "OCaml", "metadata": {"date": 1538274430, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03246.html", "problem_id": "p03246", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03246/input.txt", "sample_output_relpath": "derived/input_output/data/p03246/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03246/OCaml/s468918641.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s468918641", "user_id": "u450300828"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet id x = x\nlet pair x y = x, y\n\nlet n = scanf \"%d\" id\nlet vs = Array.init n @@ fun _ -> scanf \" %d\" id\n\nmodule IMap = Map.Make(struct type t = int let compare = Pervasives.compare end)\n\nlet odd = ref IMap.empty\nlet even = ref IMap.empty\n\nlet incrmap mapr key =\n  if IMap.mem key !mapr then\n    mapr := IMap.add key (IMap.find key !mapr + 1) !mapr\n  else\n    mapr := IMap.add key 1 !mapr\n\nlet maxi mapr =\n  let lis = IMap.bindings !mapr in\n  let lis = List.sort (fun (k1,v1) (k1,v2) -> v2 - v1) lis in\n  match lis with\n  | [] -> failwith \"\"\n  | (v, n) :: rest -> (v, n, rest)\n\nlet () =\n  for i = 0 to n - 1 do\n    if i mod 2 == 0 then begin\n      incrmap odd vs.(i)\n    end else begin\n      incrmap even vs.(i)\n    end\n  done;\n  let (k1, v1, rest1) = maxi odd in\n  let (k2, v2, rest2) = maxi even in\n  let run k1 k2 v1 v2 rest1 rest2 =\n    if k1 <> k2 then begin\n      let n1 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest1 in\n      let n2 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest2 in\n      n1 + n2\n    end else if v1 > v2 then begin\n      let n1 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest1 in\n      match rest2 with\n      | [] -> n1 + n / 2\n      | (k, v) :: _ -> n1 + n / 2 - v\n    end else if v1 < v2 then begin\n      let n2 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest2 in\n      match rest1 with\n      | [] -> n2 + n / 2\n      | (k, v) :: _ -> n2 + n / 2 - v \n    end else begin\n      (* k1 = k2, v1 = v2 *)\n      let rec loop rest1 rest2 =\n        match rest1, rest2 with\n        | [], [] -> 0\n        | [], (k', v') :: rest' -> v'\n        | (k', v') :: rest', [] -> v'\n        | (k1', v1') :: rest1', (k2', v2') :: rest2' ->\n          if v1' < v2' then\n            let n1 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest1' in\n            let n2 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest2' in\n            n1 + n2 + v2'\n          else if v1' > v2' then\n            let n1 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest1' in\n            let n2 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest2' in\n            n1 + n2 + v1' \n          else n / 0 (* loop rest1' rest2' *)\n      in\n      v1 + loop rest1 rest2\n    end\n  in\n  let result = run k1 k2 v1 v2 rest1 rest2 in\n  printf \"%d\\n\" result\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA sequence a_1,a_2,... ,a_n is said to be /\\/\\/\\/ when the following conditions are satisfied:\n\nFor each i = 1,2,..., n-2, a_i = a_{i+2}.\n\nExactly two different numbers appear in the sequence.\n\nYou are given a sequence v_1,v_2,...,v_n whose length is even.\nWe would like to make this sequence /\\/\\/\\/ by replacing some of its elements.\nFind the minimum number of elements that needs to be replaced.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\nn is even.\n\n1 \\leq v_i \\leq 10^5\n\nv_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\nv_1 v_2 ... v_n\n\nOutput\n\nPrint the minimum number of elements that needs to be replaced.\n\nSample Input 1\n\n4\n3 1 3 2\n\nSample Output 1\n\n1\n\nThe sequence 3,1,3,2 is not /\\/\\/\\/, but we can make it /\\/\\/\\/ by replacing one of its elements: for example, replace the fourth element to make it 3,1,3,1.\n\nSample Input 2\n\n6\n105 119 105 119 105 119\n\nSample Output 2\n\n0\n\nThe sequence 105,119,105,119,105,119 is /\\/\\/\\/.\n\nSample Input 3\n\n4\n1 1 1 1\n\nSample Output 3\n\n2\n\nThe elements of the sequence 1,1,1,1 are all the same, so it is not /\\/\\/\\/.", "sample_input": "4\n3 1 3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03246", "source_text": "Score : 300 points\n\nProblem Statement\n\nA sequence a_1,a_2,... ,a_n is said to be /\\/\\/\\/ when the following conditions are satisfied:\n\nFor each i = 1,2,..., n-2, a_i = a_{i+2}.\n\nExactly two different numbers appear in the sequence.\n\nYou are given a sequence v_1,v_2,...,v_n whose length is even.\nWe would like to make this sequence /\\/\\/\\/ by replacing some of its elements.\nFind the minimum number of elements that needs to be replaced.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\nn is even.\n\n1 \\leq v_i \\leq 10^5\n\nv_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\nv_1 v_2 ... v_n\n\nOutput\n\nPrint the minimum number of elements that needs to be replaced.\n\nSample Input 1\n\n4\n3 1 3 2\n\nSample Output 1\n\n1\n\nThe sequence 3,1,3,2 is not /\\/\\/\\/, but we can make it /\\/\\/\\/ by replacing one of its elements: for example, replace the fourth element to make it 3,1,3,1.\n\nSample Input 2\n\n6\n105 119 105 119 105 119\n\nSample Output 2\n\n0\n\nThe sequence 105,119,105,119,105,119 is /\\/\\/\\/.\n\nSample Input 3\n\n4\n1 1 1 1\n\nSample Output 3\n\n2\n\nThe elements of the sequence 1,1,1,1 are all the same, so it is not /\\/\\/\\/.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2271, "cpu_time_ms": 175, "memory_kb": 18816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s316109419", "group_id": "codeNet:p03246", "input_text": "open Printf\nopen Scanf\n\nlet id x = x\nlet pair x y = x, y\n\nlet n = scanf \"%d\" id\nlet vs = Array.init n @@ fun _ -> scanf \" %d\" id\n\nmodule IMap = Map.Make(struct type t = int let compare = Pervasives.compare end)\n\nlet odd = ref IMap.empty\nlet even = ref IMap.empty\n\nlet incrmap mapr key =\n  if IMap.mem key !mapr then\n    mapr := IMap.add key (IMap.find key !mapr + 1) !mapr\n  else\n    mapr := IMap.add key 1 !mapr\n\nlet maxi mapr =\n  let lis = IMap.bindings !mapr in\n  let lis = List.sort (fun (k1,v1) (k1,v2) -> v2 - v1) lis in\n  match lis with\n  | [] -> failwith \"\"\n  | (v, n) :: rest -> (v, n, rest)\n\nlet () =\n  for i = 0 to n - 1 do\n    if i mod 2 == 0 then begin\n      incrmap odd vs.(i)\n    end else begin\n      incrmap even vs.(i)\n    end\n  done;\n  let (k1, v1, rest1) = maxi odd in\n  let (k2, v2, rest2) = maxi even in\n  let rec loop k1 k2 v1 v2 rest1 rest2 =\n    if k1 <> k2 then begin\n      let n1 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest1 in\n      let n2 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest2 in\n      n1 + n2\n    end else begin\n      if v1 > v2 then begin\n        let n1 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest1 in\n        match rest2 with\n        | [] -> n1 + n / 2\n        | (k, v) :: _ -> n1 + n / 2 - v\n      end else if v1 < v2 then begin\n        let n2 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest2 in\n        match rest1 with\n        | [] -> n2 + n / 2\n        | (k, v) :: _ -> n2 + n / 2 - v\n      end else begin\n        match rest1, rest2 with\n        | (k1', v1') :: rest1', (k2', v2') :: rest2' ->\n          v1 + v2 + loop k1' k2' v1' v2' rest1' rest2'\n        | (k1', v1') :: rest1', [] ->\n          v1' + List.fold_left (fun acc (v, n) -> acc + n) 0 rest1'\n        | [], (k2', v2') :: rest2' ->\n          v2' + List.fold_left (fun acc (v, n) -> acc + n) 0 rest2'\n        | [], [] ->\n          0\n      end\n    end\n  in\n  let result = loop k1 k2 v1 v2 rest1 rest2 in\n  printf \"%d\\n\" result\n", "language": "OCaml", "metadata": {"date": 1538272390, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03246.html", "problem_id": "p03246", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03246/input.txt", "sample_output_relpath": "derived/input_output/data/p03246/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03246/OCaml/s316109419.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s316109419", "user_id": "u450300828"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet id x = x\nlet pair x y = x, y\n\nlet n = scanf \"%d\" id\nlet vs = Array.init n @@ fun _ -> scanf \" %d\" id\n\nmodule IMap = Map.Make(struct type t = int let compare = Pervasives.compare end)\n\nlet odd = ref IMap.empty\nlet even = ref IMap.empty\n\nlet incrmap mapr key =\n  if IMap.mem key !mapr then\n    mapr := IMap.add key (IMap.find key !mapr + 1) !mapr\n  else\n    mapr := IMap.add key 1 !mapr\n\nlet maxi mapr =\n  let lis = IMap.bindings !mapr in\n  let lis = List.sort (fun (k1,v1) (k1,v2) -> v2 - v1) lis in\n  match lis with\n  | [] -> failwith \"\"\n  | (v, n) :: rest -> (v, n, rest)\n\nlet () =\n  for i = 0 to n - 1 do\n    if i mod 2 == 0 then begin\n      incrmap odd vs.(i)\n    end else begin\n      incrmap even vs.(i)\n    end\n  done;\n  let (k1, v1, rest1) = maxi odd in\n  let (k2, v2, rest2) = maxi even in\n  let rec loop k1 k2 v1 v2 rest1 rest2 =\n    if k1 <> k2 then begin\n      let n1 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest1 in\n      let n2 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest2 in\n      n1 + n2\n    end else begin\n      if v1 > v2 then begin\n        let n1 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest1 in\n        match rest2 with\n        | [] -> n1 + n / 2\n        | (k, v) :: _ -> n1 + n / 2 - v\n      end else if v1 < v2 then begin\n        let n2 = List.fold_left (fun acc (v, n) -> acc + n) 0 rest2 in\n        match rest1 with\n        | [] -> n2 + n / 2\n        | (k, v) :: _ -> n2 + n / 2 - v\n      end else begin\n        match rest1, rest2 with\n        | (k1', v1') :: rest1', (k2', v2') :: rest2' ->\n          v1 + v2 + loop k1' k2' v1' v2' rest1' rest2'\n        | (k1', v1') :: rest1', [] ->\n          v1' + List.fold_left (fun acc (v, n) -> acc + n) 0 rest1'\n        | [], (k2', v2') :: rest2' ->\n          v2' + List.fold_left (fun acc (v, n) -> acc + n) 0 rest2'\n        | [], [] ->\n          0\n      end\n    end\n  in\n  let result = loop k1 k2 v1 v2 rest1 rest2 in\n  printf \"%d\\n\" result\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA sequence a_1,a_2,... ,a_n is said to be /\\/\\/\\/ when the following conditions are satisfied:\n\nFor each i = 1,2,..., n-2, a_i = a_{i+2}.\n\nExactly two different numbers appear in the sequence.\n\nYou are given a sequence v_1,v_2,...,v_n whose length is even.\nWe would like to make this sequence /\\/\\/\\/ by replacing some of its elements.\nFind the minimum number of elements that needs to be replaced.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\nn is even.\n\n1 \\leq v_i \\leq 10^5\n\nv_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\nv_1 v_2 ... v_n\n\nOutput\n\nPrint the minimum number of elements that needs to be replaced.\n\nSample Input 1\n\n4\n3 1 3 2\n\nSample Output 1\n\n1\n\nThe sequence 3,1,3,2 is not /\\/\\/\\/, but we can make it /\\/\\/\\/ by replacing one of its elements: for example, replace the fourth element to make it 3,1,3,1.\n\nSample Input 2\n\n6\n105 119 105 119 105 119\n\nSample Output 2\n\n0\n\nThe sequence 105,119,105,119,105,119 is /\\/\\/\\/.\n\nSample Input 3\n\n4\n1 1 1 1\n\nSample Output 3\n\n2\n\nThe elements of the sequence 1,1,1,1 are all the same, so it is not /\\/\\/\\/.", "sample_input": "4\n3 1 3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03246", "source_text": "Score : 300 points\n\nProblem Statement\n\nA sequence a_1,a_2,... ,a_n is said to be /\\/\\/\\/ when the following conditions are satisfied:\n\nFor each i = 1,2,..., n-2, a_i = a_{i+2}.\n\nExactly two different numbers appear in the sequence.\n\nYou are given a sequence v_1,v_2,...,v_n whose length is even.\nWe would like to make this sequence /\\/\\/\\/ by replacing some of its elements.\nFind the minimum number of elements that needs to be replaced.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\nn is even.\n\n1 \\leq v_i \\leq 10^5\n\nv_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\nv_1 v_2 ... v_n\n\nOutput\n\nPrint the minimum number of elements that needs to be replaced.\n\nSample Input 1\n\n4\n3 1 3 2\n\nSample Output 1\n\n1\n\nThe sequence 3,1,3,2 is not /\\/\\/\\/, but we can make it /\\/\\/\\/ by replacing one of its elements: for example, replace the fourth element to make it 3,1,3,1.\n\nSample Input 2\n\n6\n105 119 105 119 105 119\n\nSample Output 2\n\n0\n\nThe sequence 105,119,105,119,105,119 is /\\/\\/\\/.\n\nSample Input 3\n\n4\n1 1 1 1\n\nSample Output 3\n\n2\n\nThe elements of the sequence 1,1,1,1 are all the same, so it is not /\\/\\/\\/.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1956, "cpu_time_ms": 174, "memory_kb": 21120}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s939073375", "group_id": "codeNet:p03247", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let xys = Array.to_list @@ Array.init n @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun x y -> x, y in\n  try\n    let odd =\n      match\n        List.for_all (fun (x, y) -> (x land 1) = (y land 1)) xys,\n        List.for_all (fun (x, y) -> (x land 1) <> (y land 1)) xys\n      with\n      | false, true -> true\n      | true, false -> false\n      | _, _ -> raise Not_found in\n    print_string (if odd then \"39\\n\" else \"40\\n1 \");\n    for i = 38 downto 0 do\n      Printf.printf \"%d \" @@ 1 lsl i\n    done;\n    print_newline ();\n    let solve =\n      Array.fold_right (fun d (x, y) ->\n        match 0 <= x + y, 0 <= x - y with\n        | true, true -> print_char 'R'; (x - d, y)\n        | true, false -> print_char 'U'; (x, y - d)\n        | false, true -> print_char 'D'; (x, y + d)\n        | false, false -> print_char 'L'; (x + d, y)) @@\n      Array.init 39 @@ ( lsl ) 1 in\n    List.iter (fun (x, y) ->\n      ignore (solve\n        ( if odd\n          then (x, y)\n          else (print_char 'L'; (x + 1, y)) ));\n      print_newline ()) xys\n  with Not_found -> print_endline \"-1\"", "language": "OCaml", "metadata": {"date": 1538284993, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03247.html", "problem_id": "p03247", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03247/input.txt", "sample_output_relpath": "derived/input_output/data/p03247/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03247/OCaml/s939073375.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s939073375", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n1 2\nRL\nUU\nDR\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let xys = Array.to_list @@ Array.init n @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun x y -> x, y in\n  try\n    let odd =\n      match\n        List.for_all (fun (x, y) -> (x land 1) = (y land 1)) xys,\n        List.for_all (fun (x, y) -> (x land 1) <> (y land 1)) xys\n      with\n      | false, true -> true\n      | true, false -> false\n      | _, _ -> raise Not_found in\n    print_string (if odd then \"39\\n\" else \"40\\n1 \");\n    for i = 38 downto 0 do\n      Printf.printf \"%d \" @@ 1 lsl i\n    done;\n    print_newline ();\n    let solve =\n      Array.fold_right (fun d (x, y) ->\n        match 0 <= x + y, 0 <= x - y with\n        | true, true -> print_char 'R'; (x - d, y)\n        | true, false -> print_char 'U'; (x, y - d)\n        | false, true -> print_char 'D'; (x, y + d)\n        | false, false -> print_char 'L'; (x + d, y)) @@\n      Array.init 39 @@ ( lsl ) 1 in\n    List.iter (fun (x, y) ->\n      ignore (solve\n        ( if odd\n          then (x, y)\n          else (print_char 'L'; (x + 1, y)) ));\n      print_newline ()) xys\n  with Not_found -> print_endline \"-1\"", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke is introducing a robot arm with the following properties to his factory:\n\nThe robot arm consists of m sections and m+1 joints. The sections are numbered 1, 2, ..., m, and the joints are numbered 0, 1, ..., m. Section i connects Joint i-1 and Joint i. The length of Section i is d_i.\n\nFor each section, its mode can be specified individually. There are four modes: L, R, D and U. The mode of a section decides the direction of that section. If we consider the factory as a coordinate plane, the position of Joint i will be determined as follows (we denote its coordinates as (x_i, y_i)):\n\n(x_0, y_0) = (0, 0).\n\nIf the mode of Section i is L, (x_{i}, y_{i}) = (x_{i-1} - d_{i}, y_{i-1}).\n\nIf the mode of Section i is R, (x_{i}, y_{i}) = (x_{i-1} + d_{i}, y_{i-1}).\n\nIf the mode of Section i is D, (x_{i}, y_{i}) = (x_{i-1}, y_{i-1} - d_{i}).\n\nIf the mode of Section i is U, (x_{i}, y_{i}) = (x_{i-1}, y_{i-1} + d_{i}).\n\nSnuke would like to introduce a robot arm so that the position of Joint m can be matched with all of the N points (X_1, Y_1), (X_2, Y_2), ..., (X_N, Y_N) by properly specifying the modes of the sections.\nIs this possible?\nIf so, find such a robot arm and how to bring Joint m to each point (X_j, Y_j).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 1000\n\n-10^9 \\leq X_i \\leq 10^9\n\n-10^9 \\leq Y_i \\leq 10^9\n\nPartial Score\n\nIn the test cases worth 300 points, -10 \\leq X_i \\leq 10 and -10 \\leq Y_i \\leq 10 hold.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 Y_1\nX_2 Y_2\n:\nX_N Y_N\n\nOutput\n\nIf the condition can be satisfied, follow the following format. If the condition cannot be satisfied, print -1.\n\nm\nd_1 d_2 ... d_m\nw_1\nw_2\n:\nw_N\n\nm and d_i are the configurations of the robot arm. Refer to the problem statement for what each of them means.\nHere, 1 \\leq m \\leq 40 and 1 \\leq d_i \\leq 10^{12} must hold. Also, m and d_i must all be integers.\n\nw_j is a string of length m that represents the way to bring Joint m of the robot arm to point (X_j, Y_j).\nThe i-th character of w_j should be one of the letters L, R, D and U, representing the mode of Section i.\n\nSample Input 1\n\n3\n-1 0\n0 3\n2 -1\n\nSample Output 1\n\n2\n1 2\nRL\nUU\nDR\n\nIn the given way to bring Joint m of the robot arm to each (X_j, Y_j), the positions of the joints will be as follows:\n\nTo (X_1, Y_1) = (-1, 0): First, the position of Joint 0 is (x_0, y_0) = (0, 0). As the mode of Section 1 is R, the position of Joint 1 is (x_1, y_1) = (1, 0). Then, as the mode of Section 2 is L, the position of Joint 2 is (x_2, y_2) = (-1, 0).\n\nTo (X_2, Y_2) = (0, 3): (x_0, y_0) = (0, 0), (x_1, y_1) = (0, 1), (x_2, y_2) = (0, 3).\n\nTo (X_3, Y_3) = (2, -1): (x_0, y_0) = (0, 0), (x_1, y_1) = (0, -1), (x_2, y_2) = (2, -1).\n\nSample Input 2\n\n5\n0 0\n1 0\n2 0\n3 0\n4 0\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n2\n1 1\n1 1\n\nSample Output 3\n\n2\n1 1\nRU\nUR\n\nThere may be duplicated points among (X_j, Y_j).\n\nSample Input 4\n\n3\n-7 -3\n7 3\n-3 -7\n\nSample Output 4\n\n5\n3 1 4 1 5\nLRDUL\nRDULR\nDULRD", "sample_input": "3\n-1 0\n0 3\n2 -1\n"}, "reference_outputs": ["2\n1 2\nRL\nUU\nDR\n"], "source_document_id": "p03247", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke is introducing a robot arm with the following properties to his factory:\n\nThe robot arm consists of m sections and m+1 joints. The sections are numbered 1, 2, ..., m, and the joints are numbered 0, 1, ..., m. Section i connects Joint i-1 and Joint i. The length of Section i is d_i.\n\nFor each section, its mode can be specified individually. There are four modes: L, R, D and U. The mode of a section decides the direction of that section. If we consider the factory as a coordinate plane, the position of Joint i will be determined as follows (we denote its coordinates as (x_i, y_i)):\n\n(x_0, y_0) = (0, 0).\n\nIf the mode of Section i is L, (x_{i}, y_{i}) = (x_{i-1} - d_{i}, y_{i-1}).\n\nIf the mode of Section i is R, (x_{i}, y_{i}) = (x_{i-1} + d_{i}, y_{i-1}).\n\nIf the mode of Section i is D, (x_{i}, y_{i}) = (x_{i-1}, y_{i-1} - d_{i}).\n\nIf the mode of Section i is U, (x_{i}, y_{i}) = (x_{i-1}, y_{i-1} + d_{i}).\n\nSnuke would like to introduce a robot arm so that the position of Joint m can be matched with all of the N points (X_1, Y_1), (X_2, Y_2), ..., (X_N, Y_N) by properly specifying the modes of the sections.\nIs this possible?\nIf so, find such a robot arm and how to bring Joint m to each point (X_j, Y_j).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 1000\n\n-10^9 \\leq X_i \\leq 10^9\n\n-10^9 \\leq Y_i \\leq 10^9\n\nPartial Score\n\nIn the test cases worth 300 points, -10 \\leq X_i \\leq 10 and -10 \\leq Y_i \\leq 10 hold.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 Y_1\nX_2 Y_2\n:\nX_N Y_N\n\nOutput\n\nIf the condition can be satisfied, follow the following format. If the condition cannot be satisfied, print -1.\n\nm\nd_1 d_2 ... d_m\nw_1\nw_2\n:\nw_N\n\nm and d_i are the configurations of the robot arm. Refer to the problem statement for what each of them means.\nHere, 1 \\leq m \\leq 40 and 1 \\leq d_i \\leq 10^{12} must hold. Also, m and d_i must all be integers.\n\nw_j is a string of length m that represents the way to bring Joint m of the robot arm to point (X_j, Y_j).\nThe i-th character of w_j should be one of the letters L, R, D and U, representing the mode of Section i.\n\nSample Input 1\n\n3\n-1 0\n0 3\n2 -1\n\nSample Output 1\n\n2\n1 2\nRL\nUU\nDR\n\nIn the given way to bring Joint m of the robot arm to each (X_j, Y_j), the positions of the joints will be as follows:\n\nTo (X_1, Y_1) = (-1, 0): First, the position of Joint 0 is (x_0, y_0) = (0, 0). As the mode of Section 1 is R, the position of Joint 1 is (x_1, y_1) = (1, 0). Then, as the mode of Section 2 is L, the position of Joint 2 is (x_2, y_2) = (-1, 0).\n\nTo (X_2, Y_2) = (0, 3): (x_0, y_0) = (0, 0), (x_1, y_1) = (0, 1), (x_2, y_2) = (0, 3).\n\nTo (X_3, Y_3) = (2, -1): (x_0, y_0) = (0, 0), (x_1, y_1) = (0, -1), (x_2, y_2) = (2, -1).\n\nSample Input 2\n\n5\n0 0\n1 0\n2 0\n3 0\n4 0\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n2\n1 1\n1 1\n\nSample Output 3\n\n2\n1 1\nRU\nUR\n\nThere may be duplicated points among (X_j, Y_j).\n\nSample Input 4\n\n3\n-7 -3\n7 3\n-3 -7\n\nSample Output 4\n\n5\n3 1 4 1 5\nLRDUL\nRDULR\nDULRD", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1102, "cpu_time_ms": 5, "memory_kb": 4736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s300952732", "group_id": "codeNet:p03254", "input_text": "open Batteries\n\nlet calc x li =\n  let rec aux c = function\n    | [] -> c\n    | a :: al when a + c <= x -> aux (1 + c) al\n    | a :: al -> c\n  in\n  aux 0 li\n\nlet () =\n  Scanf.scanf \" %d %d \" (fun n x ->\n      let ans =\n        List.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x))\n        |> List.sort (fun x y -> x - y)\n        |> calc x\n      in\n      (if ans = n then n - 1 else ans) |> Printf.printf \"%d\\n\" )\n", "language": "OCaml", "metadata": {"date": 1551067784, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s300952732.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s300952732", "user_id": "u406828576"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Batteries\n\nlet calc x li =\n  let rec aux c = function\n    | [] -> c\n    | a :: al when a + c <= x -> aux (1 + c) al\n    | a :: al -> c\n  in\n  aux 0 li\n\nlet () =\n  Scanf.scanf \" %d %d \" (fun n x ->\n      let ans =\n        List.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x))\n        |> List.sort (fun x y -> x - y)\n        |> calc x\n      in\n      (if ans = n then n - 1 else ans) |> Printf.printf \"%d\\n\" )\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N children, numbered 1, 2, ..., N.\n\nSnuke has decided to distribute x sweets among them.\nHe needs to give out all the x sweets, but some of the children may get zero sweets.\n\nFor each i (1 \\leq i \\leq N), Child i will be happy if he/she gets exactly a_i sweets.\nSnuke is trying to maximize the number of happy children by optimally distributing the sweets.\nFind the maximum possible number of happy children.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n1 \\leq x \\leq 10^9\n\n1 \\leq a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN x\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum possible number of happy children.\n\nSample Input 1\n\n3 70\n20 30 10\n\nSample Output 1\n\n2\n\nOne optimal way to distribute sweets is (20, 30, 20).\n\nSample Input 2\n\n3 10\n20 30 10\n\nSample Output 2\n\n1\n\nThe optimal way to distribute sweets is (0, 0, 10).\n\nSample Input 3\n\n4 1111\n1 10 100 1000\n\nSample Output 3\n\n4\n\nThe optimal way to distribute sweets is (1, 10, 100, 1000).\n\nSample Input 4\n\n2 10\n20 20\n\nSample Output 4\n\n0\n\nNo children will be happy, no matter how the sweets are distributed.", "sample_input": "3 70\n20 30 10\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03254", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N children, numbered 1, 2, ..., N.\n\nSnuke has decided to distribute x sweets among them.\nHe needs to give out all the x sweets, but some of the children may get zero sweets.\n\nFor each i (1 \\leq i \\leq N), Child i will be happy if he/she gets exactly a_i sweets.\nSnuke is trying to maximize the number of happy children by optimally distributing the sweets.\nFind the maximum possible number of happy children.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n1 \\leq x \\leq 10^9\n\n1 \\leq a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN x\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum possible number of happy children.\n\nSample Input 1\n\n3 70\n20 30 10\n\nSample Output 1\n\n2\n\nOne optimal way to distribute sweets is (20, 30, 20).\n\nSample Input 2\n\n3 10\n20 30 10\n\nSample Output 2\n\n1\n\nThe optimal way to distribute sweets is (0, 0, 10).\n\nSample Input 3\n\n4 1111\n1 10 100 1000\n\nSample Output 3\n\n4\n\nThe optimal way to distribute sweets is (1, 10, 100, 1000).\n\nSample Input 4\n\n2 10\n20 20\n\nSample Output 4\n\n0\n\nNo children will be happy, no matter how the sweets are distributed.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 412, "cpu_time_ms": 2, "memory_kb": 1152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s946832852", "group_id": "codeNet:p03263", "input_text": "open Printf open Scanf\nmodule MyInt = struct let (+) = (+) let (-) = (-) let (/) = (/) let ( * ) = ( * ) let (mod) = (mod) let (%) = (mod) let (+=) r v = r := !r + v let (-=) r v = r := !r - v let ( *=) r v= r := !r * v let (/=) r v = r := !r / v end\nmodule MyInt64 = struct\n\tlet (+$) = (+) let (-$) = (-) let (/$) = (/) let ( *$) = ( * ) let (+) p q = Int64.add p q let (-) p q = Int64.sub p q let ( * ) p q = Int64.mul p q let (/) p q = Int64.div p q let (+=) r v = r := !r + v let (-=) r v = r := !r - v let ( *=) r v= r := !r * v let (/=) r v = r := !r / v let labs p = if p < 0L then -1L*p else p let (~|) p = Int64.to_int p let (~~|) p = Int64.of_int p let input_i64_array n = Array.init (~| n) (fun _ -> Scanf.scanf \" %Ld\" (fun v -> v)) let get_i64 _ = Scanf.scanf \" %Ld\" (fun v -> v) let get_2_i64 _ = Scanf.scanf \" %Ld %Ld\" (fun u v -> u,v) let get_3_i64 _ = Scanf.scanf \" %Ld %Ld %Ld\" (fun u v w -> u,v,w) let get_4_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld\" (fun u v w x -> u,v,w,x) let get_5_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld %Ld\" (fun u v w x y -> u,v,w,x,y) let print_i64_endline n = n |> Int64.to_string |> print_endline let (mod) m n = m - (m/n) * n let (%) = (mod) let rec gcd m n = match m,n with | m,0L -> m | m,n -> gcd n (m mod n) let lcm m n = (m*n) / gcd m n let rep from_ to_ fbod = let i,f = ref ~|from_,ref true in while !i <= ~|to_ && !f do match fbod ~~| !i with | `Break -> f := false | _ -> i := !i +$ 1; done\n\tlet string_of_list ?(separator=\" \") f ls = let rec f0 a s = match a with | [] -> s | [h] -> s ^ (f h) ^ separator | h::t -> f0 t (s ^ (f h) ^ separator) in f0 ls \"\" let char_list_of_string str = let rec f0 i a = if i<0 then a else f0 (i-$1) (str.[i]::a) in f0 (String.length str -$ 1) [] let string_of_char_list ls = List.fold_left (fun u v -> u ^ (String.make 1 v)) \"\" ls\n\tlet (@@@) = (@) let (@) a i = a.(~|i) let (<@) a (i,v) = a.(~|i) <- v\n\tlet ceildiv m n = (m+n-1L) / n\nend open MyInt64\nlet (@) a (i,j) = a.(~|i).(~|j) let (<@) a (i,j,v) = a.(~|i).(~|j) <- v let (<+) a (i,j,v) = a.(~|i).(~|j) <- v + a.(~|i).(~|j)\n\nlet () =\n\tlet h,w = get_2_i64 0 in\n\tlet a = Array.init (~|h) (fun _ -> input_i64_array w)\n\tin\n\tlet ls = ref [] in\n\trep 0L (h-2L) (fun i ->\n\t\trep 0L (w-2L) (fun j ->\n\t\t\tif (a@(i,j)) mod 2L = 1L then (\n\t\t\t\ta<+(i,j,-1L);\n\t\t\t\ta<+(i,j+1L,1L);\n\t\t\t\tls := (i,j,i,j+1L)::!ls;\n\t\t\t); `Ok\n\t\t);\n\t\tlet j = w-1L in\n\t\tif (a@(i,j)) mod 2L = 1L then (\n\t\t\ta<+(i,j,-1L);\n\t\t\ta<+(i+1L,j,1L);\n\t\t\tls := (i,j,i+1L,j)::!ls;\n\t\t);\n\t\t`Ok\n\t);\n\tlet i = h-1L in\n\trep 0L (w-2L) (fun j ->\n\t\tif (a@(i,j)) mod 2L = 1L then (\n\t\t\ta<+(i,j,-1L);\n\t\t\ta<+(i,j+1L,1L);\n\t\t\tls := (i,j,i,j+1L)::!ls;\n\t\t); `Ok\n\t);\n\tprintf \"%d\\n\" @@ List.length !ls;\n\tList.iter (fun (p,q,r,s) -> let p,q,r,s = p+1L,q+1L,r+1L,s+1L\n\tin printf \"%Ld %Ld %Ld %Ld\\n\" p q r s) @@ List.rev !ls;\n\n", "language": "OCaml", "metadata": {"date": 1536464078, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03263.html", "problem_id": "p03263", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03263/input.txt", "sample_output_relpath": "derived/input_output/data/p03263/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03263/OCaml/s946832852.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s946832852", "user_id": "u481480055"}, "prompt_components": {"gold_output": "3\n2 2 2 3\n1 1 1 2\n1 3 1 2\n", "input_to_evaluate": "open Printf open Scanf\nmodule MyInt = struct let (+) = (+) let (-) = (-) let (/) = (/) let ( * ) = ( * ) let (mod) = (mod) let (%) = (mod) let (+=) r v = r := !r + v let (-=) r v = r := !r - v let ( *=) r v= r := !r * v let (/=) r v = r := !r / v end\nmodule MyInt64 = struct\n\tlet (+$) = (+) let (-$) = (-) let (/$) = (/) let ( *$) = ( * ) let (+) p q = Int64.add p q let (-) p q = Int64.sub p q let ( * ) p q = Int64.mul p q let (/) p q = Int64.div p q let (+=) r v = r := !r + v let (-=) r v = r := !r - v let ( *=) r v= r := !r * v let (/=) r v = r := !r / v let labs p = if p < 0L then -1L*p else p let (~|) p = Int64.to_int p let (~~|) p = Int64.of_int p let input_i64_array n = Array.init (~| n) (fun _ -> Scanf.scanf \" %Ld\" (fun v -> v)) let get_i64 _ = Scanf.scanf \" %Ld\" (fun v -> v) let get_2_i64 _ = Scanf.scanf \" %Ld %Ld\" (fun u v -> u,v) let get_3_i64 _ = Scanf.scanf \" %Ld %Ld %Ld\" (fun u v w -> u,v,w) let get_4_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld\" (fun u v w x -> u,v,w,x) let get_5_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld %Ld\" (fun u v w x y -> u,v,w,x,y) let print_i64_endline n = n |> Int64.to_string |> print_endline let (mod) m n = m - (m/n) * n let (%) = (mod) let rec gcd m n = match m,n with | m,0L -> m | m,n -> gcd n (m mod n) let lcm m n = (m*n) / gcd m n let rep from_ to_ fbod = let i,f = ref ~|from_,ref true in while !i <= ~|to_ && !f do match fbod ~~| !i with | `Break -> f := false | _ -> i := !i +$ 1; done\n\tlet string_of_list ?(separator=\" \") f ls = let rec f0 a s = match a with | [] -> s | [h] -> s ^ (f h) ^ separator | h::t -> f0 t (s ^ (f h) ^ separator) in f0 ls \"\" let char_list_of_string str = let rec f0 i a = if i<0 then a else f0 (i-$1) (str.[i]::a) in f0 (String.length str -$ 1) [] let string_of_char_list ls = List.fold_left (fun u v -> u ^ (String.make 1 v)) \"\" ls\n\tlet (@@@) = (@) let (@) a i = a.(~|i) let (<@) a (i,v) = a.(~|i) <- v\n\tlet ceildiv m n = (m+n-1L) / n\nend open MyInt64\nlet (@) a (i,j) = a.(~|i).(~|j) let (<@) a (i,j,v) = a.(~|i).(~|j) <- v let (<+) a (i,j,v) = a.(~|i).(~|j) <- v + a.(~|i).(~|j)\n\nlet () =\n\tlet h,w = get_2_i64 0 in\n\tlet a = Array.init (~|h) (fun _ -> input_i64_array w)\n\tin\n\tlet ls = ref [] in\n\trep 0L (h-2L) (fun i ->\n\t\trep 0L (w-2L) (fun j ->\n\t\t\tif (a@(i,j)) mod 2L = 1L then (\n\t\t\t\ta<+(i,j,-1L);\n\t\t\t\ta<+(i,j+1L,1L);\n\t\t\t\tls := (i,j,i,j+1L)::!ls;\n\t\t\t); `Ok\n\t\t);\n\t\tlet j = w-1L in\n\t\tif (a@(i,j)) mod 2L = 1L then (\n\t\t\ta<+(i,j,-1L);\n\t\t\ta<+(i+1L,j,1L);\n\t\t\tls := (i,j,i+1L,j)::!ls;\n\t\t);\n\t\t`Ok\n\t);\n\tlet i = h-1L in\n\trep 0L (w-2L) (fun j ->\n\t\tif (a@(i,j)) mod 2L = 1L then (\n\t\t\ta<+(i,j,-1L);\n\t\t\ta<+(i,j+1L,1L);\n\t\t\tls := (i,j,i,j+1L)::!ls;\n\t\t); `Ok\n\t);\n\tprintf \"%d\\n\" @@ List.length !ls;\n\tList.iter (fun (p,q,r,s) -> let p,q,r,s = p+1L,q+1L,r+1L,s+1L\n\tin printf \"%Ld %Ld %Ld %Ld\\n\" p q r s) @@ List.rev !ls;\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).\n\nIn Cell (i, j), a_{ij} coins are placed.\n\nYou can perform the following operation any number of times:\n\nOperation: Choose a cell that was not chosen before and contains one or more coins, then move one of those coins to a vertically or horizontally adjacent cell.\n\nMaximize the number of cells containing an even number of coins.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 500\n\n0 \\leq a_{ij} \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{11} a_{12} ... a_{1W}\na_{21} a_{22} ... a_{2W}\n:\na_{H1} a_{H2} ... a_{HW}\n\nOutput\n\nPrint a sequence of operations that maximizes the number of cells containing an even number of coins, in the following format:\n\nN\ny_1 x_1 y_1' x_1'\ny_2 x_2 y_2' x_2'\n:\ny_N x_N y_N' x_N'\n\nThat is, in the first line, print an integer N between 0 and H \\times W (inclusive), representing the number of operations.\n\nIn the (i+1)-th line (1 \\leq i \\leq N), print four integers y_i, x_i, y_i' and x_i' (1 \\leq y_i, y_i' \\leq H and 1 \\leq x_i, x_i' \\leq W), representing the i-th operation. These four integers represents the operation of moving one of the coins placed in Cell (y_i, x_i) to a vertically or horizontally adjacent cell, (y_i', x_i').\n\nNote that if the specified operation violates the specification in the problem statement or the output format is invalid, it will result in Wrong Answer.\n\nSample Input 1\n\n2 3\n1 2 3\n0 1 1\n\nSample Output 1\n\n3\n2 2 2 3\n1 1 1 2\n1 3 1 2\n\nEvery cell contains an even number of coins after the following sequence of operations:\n\nMove the coin in Cell (2, 2) to Cell (2, 3).\n\nMove the coin in Cell (1, 1) to Cell (1, 2).\n\nMove one of the coins in Cell (1, 3) to Cell (1, 2).\n\nSample Input 2\n\n3 2\n1 0\n2 1\n1 0\n\nSample Output 2\n\n3\n1 1 1 2\n1 2 2 2\n3 1 3 2\n\nSample Input 3\n\n1 5\n9 9 9 9 9\n\nSample Output 3\n\n2\n1 1 1 2\n1 3 1 4", "sample_input": "2 3\n1 2 3\n0 1 1\n"}, "reference_outputs": ["3\n2 2 2 3\n1 1 1 2\n1 3 1 2\n"], "source_document_id": "p03263", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).\n\nIn Cell (i, j), a_{ij} coins are placed.\n\nYou can perform the following operation any number of times:\n\nOperation: Choose a cell that was not chosen before and contains one or more coins, then move one of those coins to a vertically or horizontally adjacent cell.\n\nMaximize the number of cells containing an even number of coins.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 500\n\n0 \\leq a_{ij} \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{11} a_{12} ... a_{1W}\na_{21} a_{22} ... a_{2W}\n:\na_{H1} a_{H2} ... a_{HW}\n\nOutput\n\nPrint a sequence of operations that maximizes the number of cells containing an even number of coins, in the following format:\n\nN\ny_1 x_1 y_1' x_1'\ny_2 x_2 y_2' x_2'\n:\ny_N x_N y_N' x_N'\n\nThat is, in the first line, print an integer N between 0 and H \\times W (inclusive), representing the number of operations.\n\nIn the (i+1)-th line (1 \\leq i \\leq N), print four integers y_i, x_i, y_i' and x_i' (1 \\leq y_i, y_i' \\leq H and 1 \\leq x_i, x_i' \\leq W), representing the i-th operation. These four integers represents the operation of moving one of the coins placed in Cell (y_i, x_i) to a vertically or horizontally adjacent cell, (y_i', x_i').\n\nNote that if the specified operation violates the specification in the problem statement or the output format is invalid, it will result in Wrong Answer.\n\nSample Input 1\n\n2 3\n1 2 3\n0 1 1\n\nSample Output 1\n\n3\n2 2 2 3\n1 1 1 2\n1 3 1 2\n\nEvery cell contains an even number of coins after the following sequence of operations:\n\nMove the coin in Cell (2, 2) to Cell (2, 3).\n\nMove the coin in Cell (1, 1) to Cell (1, 2).\n\nMove one of the coins in Cell (1, 3) to Cell (1, 2).\n\nSample Input 2\n\n3 2\n1 0\n2 1\n1 0\n\nSample Output 2\n\n3\n1 1 1 2\n1 2 2 2\n3 1 3 2\n\nSample Input 3\n\n1 5\n9 9 9 9 9\n\nSample Output 3\n\n2\n1 1 1 2\n1 3 1 4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2785, "cpu_time_ms": 268, "memory_kb": 34800}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s234559427", "group_id": "codeNet:p03264", "input_text": "open Printf\nopen Scanf\n\nlet id x = x\n\nlet k = scanf \"%d\" id\n\nlet () =\n    let n = k / 2 in\n    if k mod 2 = 0 then begin\n      printf \"%d\\n\" (n * n)\n    end else begin\n      printf \"%d \\n\" (n * (n + 1))\n    end\n    ", "language": "OCaml", "metadata": {"date": 1535850253, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s234559427.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s234559427", "user_id": "u450300828"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet id x = x\n\nlet k = scanf \"%d\" id\n\nlet () =\n    let n = k / 2 in\n    if k mod 2 = 0 then begin\n      printf \"%d\\n\" (n * n)\n    end else begin\n      printf \"%d \\n\" (n * (n + 1))\n    end\n    ", "problem_context": "Score : 100 points\n\nProblem Statement\n\nFind the number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive). The order does not matter.\n\nConstraints\n\n2\\leq K\\leq 100\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive).\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2\n\nTwo pairs can be chosen: (2,1) and (2,3).\n\nSample Input 2\n\n6\n\nSample Output 2\n\n9\n\nSample Input 3\n\n11\n\nSample Output 3\n\n30\n\nSample Input 4\n\n50\n\nSample Output 4\n\n625", "sample_input": "3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03264", "source_text": "Score : 100 points\n\nProblem Statement\n\nFind the number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive). The order does not matter.\n\nConstraints\n\n2\\leq K\\leq 100\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive).\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2\n\nTwo pairs can be chosen: (2,1) and (2,3).\n\nSample Input 2\n\n6\n\nSample Output 2\n\n9\n\nSample Input 3\n\n11\n\nSample Output 3\n\n30\n\nSample Input 4\n\n50\n\nSample Output 4\n\n625", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 215, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s327874409", "group_id": "codeNet:p03265", "input_text": "open Printf open Scanf\nmodule MyInt = struct let (+) = (+) let (-) = (-) let (/) = (/) let ( * ) = ( * ) let (mod) = (mod) let (%) = (mod) let (+=) r v = r := !r + v let (-=) r v = r := !r - v let ( *=) r v= r := !r * v let (/=) r v = r := !r / v end\n\n(* open MyInt64 *)\nlet () =\n\tlet x1,y1,x2,y2 = scanf \" %d %d %d %d\" (fun u v w x -> (u,v,w,x))\n\tin\n\tlet dx,dy = x2 - x1, y2 - y1 in\n\tlet px,py = x2 - dy, y2 + dx in\n\tlet qx,qy = px - dx, py - dy in\n\tprintf \"%d %d %d %d\\n\" px py qx qy\n\n\n\n\n\n\n\n\n\n", "language": "OCaml", "metadata": {"date": 1535850877, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s327874409.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s327874409", "user_id": "u481480055"}, "prompt_components": {"gold_output": "-1 1 -1 0\n", "input_to_evaluate": "open Printf open Scanf\nmodule MyInt = struct let (+) = (+) let (-) = (-) let (/) = (/) let ( * ) = ( * ) let (mod) = (mod) let (%) = (mod) let (+=) r v = r := !r + v let (-=) r v = r := !r - v let ( *=) r v= r := !r * v let (/=) r v = r := !r / v end\n\n(* open MyInt64 *)\nlet () =\n\tlet x1,y1,x2,y2 = scanf \" %d %d %d %d\" (fun u v w x -> (u,v,w,x))\n\tin\n\tlet dx,dy = x2 - x1, y2 - y1 in\n\tlet px,py = x2 - dy, y2 + dx in\n\tlet qx,qy = px - dx, py - dy in\n\tprintf \"%d %d %d %d\\n\" px py qx qy\n\n\n\n\n\n\n\n\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere is a square in the xy-plane. The coordinates of its four vertices are (x_1,y_1),(x_2,y_2),(x_3,y_3) and (x_4,y_4) in counter-clockwise order.\n(Assume that the positive x-axis points right, and the positive y-axis points up.)\n\nTakahashi remembers (x_1,y_1) and (x_2,y_2), but he has forgot (x_3,y_3) and (x_4,y_4).\n\nGiven x_1,x_2,y_1,y_2, restore x_3,y_3,x_4,y_4. It can be shown that x_3,y_3,x_4 and y_4 uniquely exist and have integer values.\n\nConstraints\n\n|x_1|,|y_1|,|x_2|,|y_2| \\leq 100\n\n(x_1,y_1) ≠ (x_2,y_2)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 y_1 x_2 y_2\n\nOutput\n\nPrint x_3,y_3,x_4 and y_4 as integers, in this order.\n\nSample Input 1\n\n0 0 0 1\n\nSample Output 1\n\n-1 1 -1 0\n\n(0,0),(0,1),(-1,1),(-1,0) is the four vertices of a square in counter-clockwise order.\nNote that (x_3,y_3)=(1,1),(x_4,y_4)=(1,0) is not accepted, as the vertices are in clockwise order.\n\nSample Input 2\n\n2 3 6 6\n\nSample Output 2\n\n3 10 -1 7\n\nSample Input 3\n\n31 -41 -59 26\n\nSample Output 3\n\n-126 -64 -36 -131", "sample_input": "0 0 0 1\n"}, "reference_outputs": ["-1 1 -1 0\n"], "source_document_id": "p03265", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere is a square in the xy-plane. The coordinates of its four vertices are (x_1,y_1),(x_2,y_2),(x_3,y_3) and (x_4,y_4) in counter-clockwise order.\n(Assume that the positive x-axis points right, and the positive y-axis points up.)\n\nTakahashi remembers (x_1,y_1) and (x_2,y_2), but he has forgot (x_3,y_3) and (x_4,y_4).\n\nGiven x_1,x_2,y_1,y_2, restore x_3,y_3,x_4,y_4. It can be shown that x_3,y_3,x_4 and y_4 uniquely exist and have integer values.\n\nConstraints\n\n|x_1|,|y_1|,|x_2|,|y_2| \\leq 100\n\n(x_1,y_1) ≠ (x_2,y_2)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx_1 y_1 x_2 y_2\n\nOutput\n\nPrint x_3,y_3,x_4 and y_4 as integers, in this order.\n\nSample Input 1\n\n0 0 0 1\n\nSample Output 1\n\n-1 1 -1 0\n\n(0,0),(0,1),(-1,1),(-1,0) is the four vertices of a square in counter-clockwise order.\nNote that (x_3,y_3)=(1,1),(x_4,y_4)=(1,0) is not accepted, as the vertices are in clockwise order.\n\nSample Input 2\n\n2 3 6 6\n\nSample Output 2\n\n3 10 -1 7\n\nSample Input 3\n\n31 -41 -59 26\n\nSample Output 3\n\n-126 -64 -36 -131", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 495, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s123254244", "group_id": "codeNet:p03266", "input_text": "open Printf\nopen Scanf\n\nlet id x = x\n\nlet n, k = scanf \"%d %d\" (fun n k -> n, k)\n\nlet cond v = v mod k = 0\n\nlet rec gcd m n =\n  if m < n then gcd n m\n  else if n = 0 then m\n  else gcd n (m mod n)\n\nlet lcm m n = m * n / gcd m n\n\nlet rec step_loop st ed step f =\n  if st <= ed then begin\n    f st; step_loop (st + step) ed step f\n  end else ()\n\nlet () =\n  let count = ref 0 in\n  for a = 1 to n do\n    let m1 = a mod k in\n    let m2 = (k - m1) mod k in\n    if m1 = m2 then\n      if m1 = 0 then begin\n        count := !count + (n / k) * (n / k);\n      end else begin\n        let v = (n - m1) / k + 1 in\n        count := !count + v * v\n      end;\n  done;\n  printf \"%d\\n\" !count\n", "language": "OCaml", "metadata": {"date": 1535855928, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s123254244.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s123254244", "user_id": "u450300828"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet id x = x\n\nlet n, k = scanf \"%d %d\" (fun n k -> n, k)\n\nlet cond v = v mod k = 0\n\nlet rec gcd m n =\n  if m < n then gcd n m\n  else if n = 0 then m\n  else gcd n (m mod n)\n\nlet lcm m n = m * n / gcd m n\n\nlet rec step_loop st ed step f =\n  if st <= ed then begin\n    f st; step_loop (st + step) ed step f\n  end else ()\n\nlet () =\n  let count = ref 0 in\n  for a = 1 to n do\n    let m1 = a mod k in\n    let m2 = (k - m1) mod k in\n    if m1 = m2 then\n      if m1 = 0 then begin\n        count := !count + (n / k) * (n / k);\n      end else begin\n        let v = (n - m1) / k + 1 in\n        count := !count + v * v\n      end;\n  done;\n  printf \"%d\\n\" !count\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given integers N and K. Find the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\nThe order of a,b,c does matter, and some of them can be the same.\n\nConstraints\n\n1 \\leq N,K \\leq 2\\times 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n(1,1,1),(1,1,3),(1,3,1),(1,3,3),(2,2,2),(3,1,1),(3,1,3),(3,3,1) and (3,3,3) satisfy the condition.\n\nSample Input 2\n\n5 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n27\n\nSample Input 4\n\n35897 932\n\nSample Output 4\n\n114191", "sample_input": "3 2\n"}, "reference_outputs": ["9\n"], "source_document_id": "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 673, "cpu_time_ms": 10, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s154616441", "group_id": "codeNet:p03266", "input_text": "open Printf open Scanf\nmodule MyInt = struct let (+) = (+) let (-) = (-) let (/) = (/) let ( * ) = ( * ) let (mod) = (mod) let (%) = (mod) let (+=) r v = r := !r + v let (-=) r v = r := !r - v let ( *=) r v= r := !r * v let (/=) r v = r := !r / v end\n\nlet () =\n\tlet n,k = scanf \" %d %d\" (fun u v -> u,v)\n\tin let q = n/k in\n\t(\n\t\tif k mod 2 = 1 then (\n\t\t\tq*q*q\n\t\t) else (\n\t\t\tq*q*q + (\n\t\t\t\tlet v = k/2 in let r = n mod k in\n\t\t\t\tif r>=v then let qq=q+1 in qq*qq*qq\n\t\t\t\telse q*q*q\n\t\t\t)\n\t\t)\n\t)\n\t|> printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1535852864, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s154616441.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s154616441", "user_id": "u481480055"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "open Printf open Scanf\nmodule MyInt = struct let (+) = (+) let (-) = (-) let (/) = (/) let ( * ) = ( * ) let (mod) = (mod) let (%) = (mod) let (+=) r v = r := !r + v let (-=) r v = r := !r - v let ( *=) r v= r := !r * v let (/=) r v = r := !r / v end\n\nlet () =\n\tlet n,k = scanf \" %d %d\" (fun u v -> u,v)\n\tin let q = n/k in\n\t(\n\t\tif k mod 2 = 1 then (\n\t\t\tq*q*q\n\t\t) else (\n\t\t\tq*q*q + (\n\t\t\t\tlet v = k/2 in let r = n mod k in\n\t\t\t\tif r>=v then let qq=q+1 in qq*qq*qq\n\t\t\t\telse q*q*q\n\t\t\t)\n\t\t)\n\t)\n\t|> printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given integers N and K. Find the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\nThe order of a,b,c does matter, and some of them can be the same.\n\nConstraints\n\n1 \\leq N,K \\leq 2\\times 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n(1,1,1),(1,1,3),(1,3,1),(1,3,3),(2,2,2),(3,1,1),(3,1,3),(3,3,1) and (3,3,3) satisfy the condition.\n\nSample Input 2\n\n5 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n27\n\nSample Input 4\n\n35897 932\n\nSample Output 4\n\n114191", "sample_input": "3 2\n"}, "reference_outputs": ["9\n"], "source_document_id": "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 505, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s592081119", "group_id": "codeNet:p03268", "input_text": "let n, k = Scanf.sscanf (read_line ()) \"%d %d\" @@ fun n k -> (n, k)\n\nlet rec pow x n = if n = 1 then x else x * pow x (n - 1)\n\nlet () =\n  let a = n / k in\n  let b = (n + k / 2) / k in\n  Printf.printf \"%d %d\\n\" a b;\n  Printf.printf \"%d\\n\" @@ pow a 3 + if k mod 2 = 0 then pow b 3 else 0", "language": "OCaml", "metadata": {"date": 1593660435, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s592081119.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s592081119", "user_id": "u811309788"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "let n, k = Scanf.sscanf (read_line ()) \"%d %d\" @@ fun n k -> (n, k)\n\nlet rec pow x n = if n = 1 then x else x * pow x (n - 1)\n\nlet () =\n  let a = n / k in\n  let b = (n + k / 2) / k in\n  Printf.printf \"%d %d\\n\" a b;\n  Printf.printf \"%d\\n\" @@ pow a 3 + if k mod 2 = 0 then pow b 3 else 0", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given integers N and K. Find the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\nThe order of a,b,c does matter, and some of them can be the same.\n\nConstraints\n\n1 \\leq N,K \\leq 2\\times 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n(1,1,1),(1,1,3),(1,3,1),(1,3,3),(2,2,2),(3,1,1),(3,1,3),(3,3,1) and (3,3,3) satisfy the condition.\n\nSample Input 2\n\n5 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n27\n\nSample Input 4\n\n35897 932\n\nSample Output 4\n\n114191", "sample_input": "3 2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03268", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given integers N and K. Find the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\nThe order of a,b,c does matter, and some of them can be the same.\n\nConstraints\n\n1 \\leq N,K \\leq 2\\times 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n(1,1,1),(1,1,3),(1,3,1),(1,3,3),(2,2,2),(3,1,1),(3,1,3),(3,3,1) and (3,3,3) satisfy the condition.\n\nSample Input 2\n\n5 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n27\n\nSample Input 4\n\n35897 932\n\nSample Output 4\n\n114191", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 285, "cpu_time_ms": 7, "memory_kb": 3856}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s773913378", "group_id": "codeNet:p03272", "input_text": "Scanf.scanf \"%d %d\" (fun n i ->\n    Printf.printf \"%d\\n\" (n - i + 1)\n)", "language": "OCaml", "metadata": {"date": 1597806909, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03272.html", "problem_id": "p03272", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03272/input.txt", "sample_output_relpath": "derived/input_output/data/p03272/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03272/OCaml/s773913378.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s773913378", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n i ->\n    Printf.printf \"%d\\n\" (n - i + 1)\n)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is an N-car train.\n\nYou are given an integer i. Find the value of j such that the following statement is true: \"the i-th car from the front of the train is the j-th car from the back.\"\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN i\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 2\n\nSample Output 1\n\n3\n\nThe second car from the front of a 4-car train is the third car from the back.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n15 11\n\nSample Output 3\n\n5", "sample_input": "4 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03272", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is an N-car train.\n\nYou are given an integer i. Find the value of j such that the following statement is true: \"the i-th car from the front of the train is the j-th car from the back.\"\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN i\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 2\n\nSample Output 1\n\n3\n\nThe second car from the front of a 4-car train is the third car from the back.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n15 11\n\nSample Output 3\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 70, "cpu_time_ms": 8, "memory_kb": 3804}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s417491122", "group_id": "codeNet:p03272", "input_text": "let n, i = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet _ = Printf.printf \"%d\\n\" @@ n - i + 1", "language": "OCaml", "metadata": {"date": 1562301882, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03272.html", "problem_id": "p03272", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03272/input.txt", "sample_output_relpath": "derived/input_output/data/p03272/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03272/OCaml/s417491122.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s417491122", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let n, i = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet _ = Printf.printf \"%d\\n\" @@ n - i + 1", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is an N-car train.\n\nYou are given an integer i. Find the value of j such that the following statement is true: \"the i-th car from the front of the train is the j-th car from the back.\"\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN i\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 2\n\nSample Output 1\n\n3\n\nThe second car from the front of a 4-car train is the third car from the back.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n15 11\n\nSample Output 3\n\n5", "sample_input": "4 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03272", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is an N-car train.\n\nYou are given an integer i. Find the value of j such that the following statement is true: \"the i-th car from the front of the train is the j-th car from the back.\"\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN i\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 2\n\nSample Output 1\n\n3\n\nThe second car from the front of a 4-car train is the third car from the back.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n15 11\n\nSample Output 3\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 92, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s134483534", "group_id": "codeNet:p03272", "input_text": "open Batteries\nopen Printf\nlet () =\n  let a,b = Scanf.scanf \"%d %d \" (fun a b -> a,b) in\n\n  Printf.printf \"%d\\n\" \n    (if a = 1 then 1 else a-b+1)\n", "language": "OCaml", "metadata": {"date": 1558150292, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03272.html", "problem_id": "p03272", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03272/input.txt", "sample_output_relpath": "derived/input_output/data/p03272/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03272/OCaml/s134483534.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s134483534", "user_id": "u139013163"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Batteries\nopen Printf\nlet () =\n  let a,b = Scanf.scanf \"%d %d \" (fun a b -> a,b) in\n\n  Printf.printf \"%d\\n\" \n    (if a = 1 then 1 else a-b+1)\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is an N-car train.\n\nYou are given an integer i. Find the value of j such that the following statement is true: \"the i-th car from the front of the train is the j-th car from the back.\"\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN i\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 2\n\nSample Output 1\n\n3\n\nThe second car from the front of a 4-car train is the third car from the back.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n15 11\n\nSample Output 3\n\n5", "sample_input": "4 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03272", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is an N-car train.\n\nYou are given an integer i. Find the value of j such that the following statement is true: \"the i-th car from the front of the train is the j-th car from the back.\"\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN i\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n4 2\n\nSample Output 1\n\n3\n\nThe second car from the front of a 4-car train is the third car from the back.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n15 11\n\nSample Output 3\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 147, "cpu_time_ms": 5, "memory_kb": 1408}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s345327557", "group_id": "codeNet:p03276", "input_text": "Scanf.scanf \"%d %d\" (fun n k ->\n    let x = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x)) in\n\n    let rec loop p acc =\n        if p = n then acc else\n            let s1 = x.(p - k + 1) in\n            let s2 = x.(p) in\n            let v1 = if s1 < 0 && s2 <= 0 then abs s1 else\n                     if s1 >= 0 && s2 > 0 then s2 else\n                         min (abs s1 * 2 + s2) (abs s1 + s2 * 2)\n            in\n            let acc = min acc v1 in\n            loop (p + 1) acc\n    in\n    loop (k - 1) max_int |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1597290831, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s345327557.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s345327557", "user_id": "u342443598"}, "prompt_components": {"gold_output": "40\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n k ->\n    let x = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x)) in\n\n    let rec loop p acc =\n        if p = n then acc else\n            let s1 = x.(p - k + 1) in\n            let s2 = x.(p) in\n            let v1 = if s1 < 0 && s2 <= 0 then abs s1 else\n                     if s1 >= 0 && s2 > 0 then s2 else\n                         min (abs s1 * 2 + s2) (abs s1 + s2 * 2)\n            in\n            let acc = min acc v1 in\n            loop (p + 1) acc\n    in\n    loop (k - 1) max_int |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N candles placed on a number line.\nThe i-th candle from the left is placed on coordinate x_i.\nHere, x_1 < x_2 < ... < x_N holds.\n\nInitially, no candles are burning.\nSnuke decides to light K of the N candles.\n\nNow, he is at coordinate 0.\nHe can move left and right along the line with speed 1.\nHe can also light a candle when he is at the same position as the candle, in negligible time.\n\nFind the minimum time required to light K candles.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N\n\nx_i is an integer.\n\n|x_i| \\leq 10^8\n\nx_1 < x_2 < ... < x_N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the minimum time required to light K candles.\n\nSample Input 1\n\n5 3\n-30 -10 10 20 50\n\nSample Output 1\n\n40\n\nHe should move and light candles as follows:\n\nMove from coordinate 0 to -10.\n\nLight the second candle from the left.\n\nMove from coordinate -10 to 10.\n\nLight the third candle from the left.\n\nMove from coordinate 10 to 20.\n\nLight the fourth candle from the left.\n\nSample Input 2\n\n3 2\n10 20 30\n\nSample Output 2\n\n20\n\nSample Input 3\n\n1 1\n0\n\nSample Output 3\n\n0\n\nThere may be a candle placed at coordinate 0.\n\nSample Input 4\n\n8 5\n-9 -7 -4 -3 1 2 3 4\n\nSample Output 4\n\n10", "sample_input": "5 3\n-30 -10 10 20 50\n"}, "reference_outputs": ["40\n"], "source_document_id": "p03276", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N candles placed on a number line.\nThe i-th candle from the left is placed on coordinate x_i.\nHere, x_1 < x_2 < ... < x_N holds.\n\nInitially, no candles are burning.\nSnuke decides to light K of the N candles.\n\nNow, he is at coordinate 0.\nHe can move left and right along the line with speed 1.\nHe can also light a candle when he is at the same position as the candle, in negligible time.\n\nFind the minimum time required to light K candles.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N\n\nx_i is an integer.\n\n|x_i| \\leq 10^8\n\nx_1 < x_2 < ... < x_N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the minimum time required to light K candles.\n\nSample Input 1\n\n5 3\n-30 -10 10 20 50\n\nSample Output 1\n\n40\n\nHe should move and light candles as follows:\n\nMove from coordinate 0 to -10.\n\nLight the second candle from the left.\n\nMove from coordinate -10 to 10.\n\nLight the third candle from the left.\n\nMove from coordinate 10 to 20.\n\nLight the fourth candle from the left.\n\nSample Input 2\n\n3 2\n10 20 30\n\nSample Output 2\n\n20\n\nSample Input 3\n\n1 1\n0\n\nSample Output 3\n\n0\n\nThere may be a candle placed at coordinate 0.\n\nSample Input 4\n\n8 5\n-9 -7 -4 -3 1 2 3 4\n\nSample Output 4\n\n10", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 35, "memory_kb": 6696}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s285793557", "group_id": "codeNet:p03280", "input_text": "let a, b = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet _ = Printf.printf \"%d\\n\" @@ (a - 1) * (b - 1)", "language": "OCaml", "metadata": {"date": 1571249147, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s285793557.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s285793557", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let a, b = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet _ = Printf.printf \"%d\\n\" @@ (a - 1) * (b - 1)", "problem_context": "Score: 100 points\n\nProblem Statement\n\nThere is a farm whose length and width are A yard and B yard, respectively. A farmer, John, made a vertical road and a horizontal road inside the farm from one border to another, as shown below: (The gray part represents the roads.)\n\nWhat is the area of this yard excluding the roads? Find it.\n\nNote\n\nIt can be proved that the positions of the roads do not affect the area.\n\nConstraints\n\nA is an integer between 2 and 100 (inclusive).\n\nB is an integer between 2 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the area of this yard excluding the roads (in square yards).\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n1\n\nIn this case, the area is 1 square yard.\n\nSample Input 2\n\n5 7\n\nSample Output 2\n\n24\n\nIn this case, the area is 24 square yards.", "sample_input": "2 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03280", "source_text": "Score: 100 points\n\nProblem Statement\n\nThere is a farm whose length and width are A yard and B yard, respectively. A farmer, John, made a vertical road and a horizontal road inside the farm from one border to another, as shown below: (The gray part represents the roads.)\n\nWhat is the area of this yard excluding the roads? Find it.\n\nNote\n\nIt can be proved that the positions of the roads do not affect the area.\n\nConstraints\n\nA is an integer between 2 and 100 (inclusive).\n\nB is an integer between 2 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the area of this yard excluding the roads (in square yards).\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n1\n\nIn this case, the area is 1 square yard.\n\nSample Input 2\n\n5 7\n\nSample Output 2\n\n24\n\nIn this case, the area is 24 square yards.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 100, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s480532426", "group_id": "codeNet:p03280", "input_text": "let () =\n  Scanf.scanf \"%d %d\\n\"\n    (fun a b -> (a-1) * (b-1)) |> print_int", "language": "OCaml", "metadata": {"date": 1556025099, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s480532426.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s480532426", "user_id": "u307426615"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d\\n\"\n    (fun a b -> (a-1) * (b-1)) |> print_int", "problem_context": "Score: 100 points\n\nProblem Statement\n\nThere is a farm whose length and width are A yard and B yard, respectively. A farmer, John, made a vertical road and a horizontal road inside the farm from one border to another, as shown below: (The gray part represents the roads.)\n\nWhat is the area of this yard excluding the roads? Find it.\n\nNote\n\nIt can be proved that the positions of the roads do not affect the area.\n\nConstraints\n\nA is an integer between 2 and 100 (inclusive).\n\nB is an integer between 2 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the area of this yard excluding the roads (in square yards).\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n1\n\nIn this case, the area is 1 square yard.\n\nSample Input 2\n\n5 7\n\nSample Output 2\n\n24\n\nIn this case, the area is 24 square yards.", "sample_input": "2 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03280", "source_text": "Score: 100 points\n\nProblem Statement\n\nThere is a farm whose length and width are A yard and B yard, respectively. A farmer, John, made a vertical road and a horizontal road inside the farm from one border to another, as shown below: (The gray part represents the roads.)\n\nWhat is the area of this yard excluding the roads? Find it.\n\nNote\n\nIt can be proved that the positions of the roads do not affect the area.\n\nConstraints\n\nA is an integer between 2 and 100 (inclusive).\n\nB is an integer between 2 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the area of this yard excluding the roads (in square yards).\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n1\n\nIn this case, the area is 1 square yard.\n\nSample Input 2\n\n5 7\n\nSample Output 2\n\n24\n\nIn this case, the area is 24 square yards.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 76, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s051652185", "group_id": "codeNet:p03280", "input_text": "Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d %d\" @@ fun a b -> a * b - a - b + 1\n", "language": "OCaml", "metadata": {"date": 1534640466, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s051652185.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s051652185", "user_id": "u798181098"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d %d\" @@ fun a b -> a * b - a - b + 1\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nThere is a farm whose length and width are A yard and B yard, respectively. A farmer, John, made a vertical road and a horizontal road inside the farm from one border to another, as shown below: (The gray part represents the roads.)\n\nWhat is the area of this yard excluding the roads? Find it.\n\nNote\n\nIt can be proved that the positions of the roads do not affect the area.\n\nConstraints\n\nA is an integer between 2 and 100 (inclusive).\n\nB is an integer between 2 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the area of this yard excluding the roads (in square yards).\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n1\n\nIn this case, the area is 1 square yard.\n\nSample Input 2\n\n5 7\n\nSample Output 2\n\n24\n\nIn this case, the area is 24 square yards.", "sample_input": "2 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03280", "source_text": "Score: 100 points\n\nProblem Statement\n\nThere is a farm whose length and width are A yard and B yard, respectively. A farmer, John, made a vertical road and a horizontal road inside the farm from one border to another, as shown below: (The gray part represents the roads.)\n\nWhat is the area of this yard excluding the roads? Find it.\n\nNote\n\nIt can be proved that the positions of the roads do not affect the area.\n\nConstraints\n\nA is an integer between 2 and 100 (inclusive).\n\nB is an integer between 2 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the area of this yard excluding the roads (in square yards).\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n1\n\nIn this case, the area is 1 square yard.\n\nSample Input 2\n\n5 7\n\nSample Output 2\n\n24\n\nIn this case, the area is 24 square yards.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 76, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s358414631", "group_id": "codeNet:p03281", "input_text": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list ?sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list ?sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list ?sep conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet n = scan \"%d\" id\n\nlet factors n =\n  let rec aux n i =\n    if n = 1 then 0\n    else if n mod i = 0 then 1 + aux (n/i) i\n    else aux n (succ i)\n  in aux n 2\n\nlet () =\n  ListL.map (1++n) ~f:(fun i ->\n      if i mod 2 = 1 && factors i = 8 then 1 else 0\n    )\n  |> List.sum\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1591067548, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s358414631.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s358414631", "user_id": "u802614675"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list ?sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list ?sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list ?sep conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet n = scan \"%d\" id\n\nlet factors n =\n  let rec aux n i =\n    if n = 1 then 0\n    else if n mod i = 0 then 1 + aux (n/i) i\n    else aux n (succ i)\n  in aux n 2\n\nlet () =\n  ListL.map (1++n) ~f:(fun i ->\n      if i mod 2 = 1 && factors i = 8 then 1 else 0\n    )\n  |> List.sum\n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nThe number 105 is quite special - it is odd but still it has eight divisors.\nNow, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)?\n\nConstraints\n\nN is an integer between 1 and 200 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the count.\n\nSample Input 1\n\n105\n\nSample Output 1\n\n1\n\nAmong the numbers between 1 and 105, the only number that is odd and has exactly eight divisors is 105.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n0\n\n1 has one divisor. 3, 5 and 7 are all prime and have two divisors. Thus, there is no number that satisfies the condition.", "sample_input": "105\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03281", "source_text": "Score: 200 points\n\nProblem Statement\n\nThe number 105 is quite special - it is odd but still it has eight divisors.\nNow, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)?\n\nConstraints\n\nN is an integer between 1 and 200 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the count.\n\nSample Input 1\n\n105\n\nSample Output 1\n\n1\n\nAmong the numbers between 1 and 105, the only number that is odd and has exactly eight divisors is 105.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n0\n\n1 has one divisor. 3, 5 and 7 are all prime and have two divisors. Thus, there is no number that satisfies the condition.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2304, "cpu_time_ms": 4, "memory_kb": 1408}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s641102511", "group_id": "codeNet:p03281", "input_text": "let () = Scanf.scanf \"%d\" @@ fun n ->\n  Printf.printf \"%d\\n\" @@ List.length @@\n    List.filter (fun x -> ( = ) 8 @@\n      List.length @@\n        List.filter (fun i -> x mod i = 0) @@\n          Array.to_list @@ Array.init x (( + ) 1)) @@\n      List.filter (fun x -> x mod 2 = 1) @@\n        Array.to_list @@ Array.init n (( + ) 1)", "language": "OCaml", "metadata": {"date": 1534657333, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s641102511.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s641102511", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\" @@ fun n ->\n  Printf.printf \"%d\\n\" @@ List.length @@\n    List.filter (fun x -> ( = ) 8 @@\n      List.length @@\n        List.filter (fun i -> x mod i = 0) @@\n          Array.to_list @@ Array.init x (( + ) 1)) @@\n      List.filter (fun x -> x mod 2 = 1) @@\n        Array.to_list @@ Array.init n (( + ) 1)", "problem_context": "Score: 200 points\n\nProblem Statement\n\nThe number 105 is quite special - it is odd but still it has eight divisors.\nNow, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)?\n\nConstraints\n\nN is an integer between 1 and 200 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the count.\n\nSample Input 1\n\n105\n\nSample Output 1\n\n1\n\nAmong the numbers between 1 and 105, the only number that is odd and has exactly eight divisors is 105.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n0\n\n1 has one divisor. 3, 5 and 7 are all prime and have two divisors. Thus, there is no number that satisfies the condition.", "sample_input": "105\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03281", "source_text": "Score: 200 points\n\nProblem Statement\n\nThe number 105 is quite special - it is odd but still it has eight divisors.\nNow, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)?\n\nConstraints\n\nN is an integer between 1 and 200 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the count.\n\nSample Input 1\n\n105\n\nSample Output 1\n\n1\n\nAmong the numbers between 1 and 105, the only number that is odd and has exactly eight divisors is 105.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n0\n\n1 has one divisor. 3, 5 and 7 are all prime and have two divisors. Thus, there is no number that satisfies the condition.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 328, "cpu_time_ms": 1, "memory_kb": 768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s396078363", "group_id": "codeNet:p03282", "input_text": "let solve s i =\n  let rec find_aux s i cur = match String.get s (cur-1) with\n    | '1' when i > cur -> find_aux s i (cur+1)\n    | '1' when i = cur -> '1'\n    | x -> x\n  in\n  find_aux s i 1\n\n\nlet () =\n  let rec read () =\n    try let ans = (Scanf.scanf \"%s\\n%i\\n\" solve) in\n        Printf.printf \"%c\\n\" ans\n    with End_of_file -> ()\n  in\n  read ()\n;;\n", "language": "OCaml", "metadata": {"date": 1534647276, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s396078363.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s396078363", "user_id": "u980152513"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let solve s i =\n  let rec find_aux s i cur = match String.get s (cur-1) with\n    | '1' when i > cur -> find_aux s i (cur+1)\n    | '1' when i = cur -> '1'\n    | x -> x\n  in\n  find_aux s i 1\n\n\nlet () =\n  let rec read () =\n    try let ans = (Scanf.scanf \"%s\\n%i\\n\" solve) in\n        Printf.printf \"%c\\n\" ans\n    with End_of_file -> ()\n  in\n  read ()\n;;\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nMr. Infinity has a string S consisting of digits from 1 to 9. Each time the date changes, this string changes as follows:\n\nEach occurrence of 2 in S is replaced with 22. Similarly, each 3 becomes 333, 4 becomes 4444, 5 becomes 55555, 6 becomes 666666, 7 becomes 7777777, 8 becomes 88888888 and 9 becomes 999999999. 1 remains as 1.\n\nFor example, if S is 1324, it becomes 1333224444 the next day, and it becomes 133333333322224444444444444444 the day after next.\nYou are interested in what the string looks like after 5 \\times 10^{15} days. What is the K-th character from the left in the string after 5 \\times 10^{15} days?\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nK is an integer between 1 and 10^{18} (inclusive).\n\nThe length of the string after 5 \\times 10^{15} days is at least K.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the K-th character from the left in Mr. Infinity's string after 5 \\times 10^{15} days.\n\nSample Input 1\n\n1214\n4\n\nSample Output 1\n\n2\n\nThe string S changes as follows:\n\nNow: 1214\n\nAfter one day: 12214444\n\nAfter two days: 1222214444444444444444\n\nAfter three days: 12222222214444444444444444444444444444444444444444444444444444444444444444\n\nThe first five characters in the string after 5 \\times 10^{15} days is 12222. As K=4, we should print the fourth character, 2.\n\nSample Input 2\n\n3\n157\n\nSample Output 2\n\n3\n\nThe initial string is 3. The string after 5 \\times 10^{15} days consists only of 3.\n\nSample Input 3\n\n299792458\n9460730472580800\n\nSample Output 3\n\n2", "sample_input": "1214\n4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03282", "source_text": "Score: 300 points\n\nProblem Statement\n\nMr. Infinity has a string S consisting of digits from 1 to 9. Each time the date changes, this string changes as follows:\n\nEach occurrence of 2 in S is replaced with 22. Similarly, each 3 becomes 333, 4 becomes 4444, 5 becomes 55555, 6 becomes 666666, 7 becomes 7777777, 8 becomes 88888888 and 9 becomes 999999999. 1 remains as 1.\n\nFor example, if S is 1324, it becomes 1333224444 the next day, and it becomes 133333333322224444444444444444 the day after next.\nYou are interested in what the string looks like after 5 \\times 10^{15} days. What is the K-th character from the left in the string after 5 \\times 10^{15} days?\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nK is an integer between 1 and 10^{18} (inclusive).\n\nThe length of the string after 5 \\times 10^{15} days is at least K.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the K-th character from the left in Mr. Infinity's string after 5 \\times 10^{15} days.\n\nSample Input 1\n\n1214\n4\n\nSample Output 1\n\n2\n\nThe string S changes as follows:\n\nNow: 1214\n\nAfter one day: 12214444\n\nAfter two days: 1222214444444444444444\n\nAfter three days: 12222222214444444444444444444444444444444444444444444444444444444444444444\n\nThe first five characters in the string after 5 \\times 10^{15} days is 12222. As K=4, we should print the fourth character, 2.\n\nSample Input 2\n\n3\n157\n\nSample Output 2\n\n3\n\nThe initial string is 3. The string after 5 \\times 10^{15} days consists only of 3.\n\nSample Input 3\n\n299792458\n9460730472580800\n\nSample Output 3\n\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 350, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s289557615", "group_id": "codeNet:p03282", "input_text": "let arr_of_str s = Array.init (String.length s) (fun i -> s.[i])\nlet () =\n  Scanf.scanf \"%s %d\" @@ fun s k ->\n  let s = arr_of_str s in\n  if k = 1 then Printf.printf \"%c\\n\" s.(0)\n  else\n    Array.fold_left (fun z c ->\n      if z <> '1' then z else if c <> '1' then c else '1') '1' s\n    |> Printf.printf \"%c\\n\"", "language": "OCaml", "metadata": {"date": 1534640874, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s289557615.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s289557615", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let arr_of_str s = Array.init (String.length s) (fun i -> s.[i])\nlet () =\n  Scanf.scanf \"%s %d\" @@ fun s k ->\n  let s = arr_of_str s in\n  if k = 1 then Printf.printf \"%c\\n\" s.(0)\n  else\n    Array.fold_left (fun z c ->\n      if z <> '1' then z else if c <> '1' then c else '1') '1' s\n    |> Printf.printf \"%c\\n\"", "problem_context": "Score: 300 points\n\nProblem Statement\n\nMr. Infinity has a string S consisting of digits from 1 to 9. Each time the date changes, this string changes as follows:\n\nEach occurrence of 2 in S is replaced with 22. Similarly, each 3 becomes 333, 4 becomes 4444, 5 becomes 55555, 6 becomes 666666, 7 becomes 7777777, 8 becomes 88888888 and 9 becomes 999999999. 1 remains as 1.\n\nFor example, if S is 1324, it becomes 1333224444 the next day, and it becomes 133333333322224444444444444444 the day after next.\nYou are interested in what the string looks like after 5 \\times 10^{15} days. What is the K-th character from the left in the string after 5 \\times 10^{15} days?\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nK is an integer between 1 and 10^{18} (inclusive).\n\nThe length of the string after 5 \\times 10^{15} days is at least K.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the K-th character from the left in Mr. Infinity's string after 5 \\times 10^{15} days.\n\nSample Input 1\n\n1214\n4\n\nSample Output 1\n\n2\n\nThe string S changes as follows:\n\nNow: 1214\n\nAfter one day: 12214444\n\nAfter two days: 1222214444444444444444\n\nAfter three days: 12222222214444444444444444444444444444444444444444444444444444444444444444\n\nThe first five characters in the string after 5 \\times 10^{15} days is 12222. As K=4, we should print the fourth character, 2.\n\nSample Input 2\n\n3\n157\n\nSample Output 2\n\n3\n\nThe initial string is 3. The string after 5 \\times 10^{15} days consists only of 3.\n\nSample Input 3\n\n299792458\n9460730472580800\n\nSample Output 3\n\n2", "sample_input": "1214\n4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03282", "source_text": "Score: 300 points\n\nProblem Statement\n\nMr. Infinity has a string S consisting of digits from 1 to 9. Each time the date changes, this string changes as follows:\n\nEach occurrence of 2 in S is replaced with 22. Similarly, each 3 becomes 333, 4 becomes 4444, 5 becomes 55555, 6 becomes 666666, 7 becomes 7777777, 8 becomes 88888888 and 9 becomes 999999999. 1 remains as 1.\n\nFor example, if S is 1324, it becomes 1333224444 the next day, and it becomes 133333333322224444444444444444 the day after next.\nYou are interested in what the string looks like after 5 \\times 10^{15} days. What is the K-th character from the left in the string after 5 \\times 10^{15} days?\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nK is an integer between 1 and 10^{18} (inclusive).\n\nThe length of the string after 5 \\times 10^{15} days is at least K.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the K-th character from the left in Mr. Infinity's string after 5 \\times 10^{15} days.\n\nSample Input 1\n\n1214\n4\n\nSample Output 1\n\n2\n\nThe string S changes as follows:\n\nNow: 1214\n\nAfter one day: 12214444\n\nAfter two days: 1222214444444444444444\n\nAfter three days: 12222222214444444444444444444444444444444444444444444444444444444444444444\n\nThe first five characters in the string after 5 \\times 10^{15} days is 12222. As K=4, we should print the fourth character, 2.\n\nSample Input 2\n\n3\n157\n\nSample Output 2\n\n3\n\nThe initial string is 3. The string after 5 \\times 10^{15} days consists only of 3.\n\nSample Input 3\n\n299792458\n9460730472580800\n\nSample Output 3\n\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 310, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s449466504", "group_id": "codeNet:p03284", "input_text": "let _ = Scanf.sscanf (read_line ()) \"%d %d\" (fun n k ->\n  if n mod k = 0 then 0 else 1\n) |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1583977406, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s449466504.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s449466504", "user_id": "u511870776"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let _ = Scanf.sscanf (read_line ()) \"%d %d\" (fun n k ->\n  if n mod k = 0 then 0 else 1\n) |> Printf.printf \"%d\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible.\nWhen all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nConstraints\n\n1 \\leq N,K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nSample Input 1\n\n7 3\n\nSample Output 1\n\n1\n\nWhen the users receive two, two and three crackers, respectively, the (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user, is 1.\n\nSample Input 2\n\n100 10\n\nSample Output 2\n\n0\n\nThe crackers can be distributed evenly.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "sample_input": "7 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03284", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible.\nWhen all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nConstraints\n\n1 \\leq N,K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nSample Input 1\n\n7 3\n\nSample Output 1\n\n1\n\nWhen the users receive two, two and three crackers, respectively, the (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user, is 1.\n\nSample Input 2\n\n100 10\n\nSample Output 2\n\n0\n\nThe crackers can be distributed evenly.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 112, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s900072129", "group_id": "codeNet:p03285", "input_text": "let make_no =\n  let rec one n f =\n    let i = (4 * n) + 1 in\n    if i < 21 then i :: one (n + 1) f else f\n  in\n  let rec two n f =\n    let i = (4 * n) + 2 in\n    if i < 14 then i :: two (n + 1) f else f\n  in\n  let rec three n f =\n    let i = (4 * n) + 3 in\n    if i < 7 then i :: three (n + 1) f else f\n  in\n  one 0 (two 0 (three 0 []))\n\nlet () =\n  let n = read_int () in\n  let l = make_no in\n  (match List.mem n l with true -> \"No\" | false -> \"Yes\") |> print_endline\n", "language": "OCaml", "metadata": {"date": 1551049763, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03285.html", "problem_id": "p03285", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03285/input.txt", "sample_output_relpath": "derived/input_output/data/p03285/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03285/OCaml/s900072129.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s900072129", "user_id": "u406828576"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let make_no =\n  let rec one n f =\n    let i = (4 * n) + 1 in\n    if i < 21 then i :: one (n + 1) f else f\n  in\n  let rec two n f =\n    let i = (4 * n) + 2 in\n    if i < 14 then i :: two (n + 1) f else f\n  in\n  let rec three n f =\n    let i = (4 * n) + 3 in\n    if i < 7 then i :: three (n + 1) f else f\n  in\n  one 0 (two 0 (three 0 []))\n\nlet () =\n  let n = read_int () in\n  let l = make_no in\n  (match List.mem n l with true -> \"No\" | false -> \"Yes\") |> print_endline\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nLa Confiserie d'ABC sells cakes at 4 dollars each and doughnuts at 7 dollars each.\nDetermine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes.\n\nConstraints\n\nN is an integer between 1 and 100, inclusive.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there is a way to buy some cakes and some doughnuts for exactly N dollars, print Yes; otherwise, print No.\n\nSample Input 1\n\n11\n\nSample Output 1\n\nYes\n\nIf you buy one cake and one doughnut, the total will be 4 + 7 = 11 dollars.\n\nSample Input 2\n\n40\n\nSample Output 2\n\nYes\n\nIf you buy ten cakes, the total will be 4 \\times 10 = 40 dollars.\n\nSample Input 3\n\n3\n\nSample Output 3\n\nNo\n\nThe prices of cakes (4 dollars) and doughnuts (7 dollars) are both higher than 3 dollars, so there is no such way.", "sample_input": "11\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03285", "source_text": "Score : 200 points\n\nProblem Statement\n\nLa Confiserie d'ABC sells cakes at 4 dollars each and doughnuts at 7 dollars each.\nDetermine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes.\n\nConstraints\n\nN is an integer between 1 and 100, inclusive.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there is a way to buy some cakes and some doughnuts for exactly N dollars, print Yes; otherwise, print No.\n\nSample Input 1\n\n11\n\nSample Output 1\n\nYes\n\nIf you buy one cake and one doughnut, the total will be 4 + 7 = 11 dollars.\n\nSample Input 2\n\n40\n\nSample Output 2\n\nYes\n\nIf you buy ten cakes, the total will be 4 \\times 10 = 40 dollars.\n\nSample Input 3\n\n3\n\nSample Output 3\n\nNo\n\nThe prices of cakes (4 dollars) and doughnuts (7 dollars) are both higher than 3 dollars, so there is no such way.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 468, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s216616512", "group_id": "codeNet:p03285", "input_text": "let () = Scanf.scanf \"%d\" @@ fun n ->\n  print_endline @@\n    (function true -> \"Yes\" | false -> \"No\") @@ \n      Array.fold_left (Array.fold_left ( || )) false @@\n        Array.init (n + 1) @@ fun i ->\n          Array.init (n + 1) @@ fun j -> 4 * i + 7 * j = n\n", "language": "OCaml", "metadata": {"date": 1534076113, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03285.html", "problem_id": "p03285", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03285/input.txt", "sample_output_relpath": "derived/input_output/data/p03285/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03285/OCaml/s216616512.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s216616512", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\" @@ fun n ->\n  print_endline @@\n    (function true -> \"Yes\" | false -> \"No\") @@ \n      Array.fold_left (Array.fold_left ( || )) false @@\n        Array.init (n + 1) @@ fun i ->\n          Array.init (n + 1) @@ fun j -> 4 * i + 7 * j = n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nLa Confiserie d'ABC sells cakes at 4 dollars each and doughnuts at 7 dollars each.\nDetermine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes.\n\nConstraints\n\nN is an integer between 1 and 100, inclusive.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there is a way to buy some cakes and some doughnuts for exactly N dollars, print Yes; otherwise, print No.\n\nSample Input 1\n\n11\n\nSample Output 1\n\nYes\n\nIf you buy one cake and one doughnut, the total will be 4 + 7 = 11 dollars.\n\nSample Input 2\n\n40\n\nSample Output 2\n\nYes\n\nIf you buy ten cakes, the total will be 4 \\times 10 = 40 dollars.\n\nSample Input 3\n\n3\n\nSample Output 3\n\nNo\n\nThe prices of cakes (4 dollars) and doughnuts (7 dollars) are both higher than 3 dollars, so there is no such way.", "sample_input": "11\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03285", "source_text": "Score : 200 points\n\nProblem Statement\n\nLa Confiserie d'ABC sells cakes at 4 dollars each and doughnuts at 7 dollars each.\nDetermine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes.\n\nConstraints\n\nN is an integer between 1 and 100, inclusive.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there is a way to buy some cakes and some doughnuts for exactly N dollars, print Yes; otherwise, print No.\n\nSample Input 1\n\n11\n\nSample Output 1\n\nYes\n\nIf you buy one cake and one doughnut, the total will be 4 + 7 = 11 dollars.\n\nSample Input 2\n\n40\n\nSample Output 2\n\nYes\n\nIf you buy ten cakes, the total will be 4 \\times 10 = 40 dollars.\n\nSample Input 3\n\n3\n\nSample Output 3\n\nNo\n\nThe prices of cakes (4 dollars) and doughnuts (7 dollars) are both higher than 3 dollars, so there is no such way.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 260, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s781144256", "group_id": "codeNet:p03285", "input_text": "open Batteries\nopen Printf\nlet () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n\n  let rec aux i =\n    if i*7 > n then \"No\" else\n      (\n        if (n - i*7) mod 4 = 0 then \"Yes\" else \n          aux (i+1)\n      )\n  in\n  Printf.printf \"%s\\n\" @@\n  aux 0\n\n", "language": "OCaml", "metadata": {"date": 1534035927, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03285.html", "problem_id": "p03285", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03285/input.txt", "sample_output_relpath": "derived/input_output/data/p03285/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03285/OCaml/s781144256.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s781144256", "user_id": "u139013163"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Batteries\nopen Printf\nlet () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n\n  let rec aux i =\n    if i*7 > n then \"No\" else\n      (\n        if (n - i*7) mod 4 = 0 then \"Yes\" else \n          aux (i+1)\n      )\n  in\n  Printf.printf \"%s\\n\" @@\n  aux 0\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nLa Confiserie d'ABC sells cakes at 4 dollars each and doughnuts at 7 dollars each.\nDetermine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes.\n\nConstraints\n\nN is an integer between 1 and 100, inclusive.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there is a way to buy some cakes and some doughnuts for exactly N dollars, print Yes; otherwise, print No.\n\nSample Input 1\n\n11\n\nSample Output 1\n\nYes\n\nIf you buy one cake and one doughnut, the total will be 4 + 7 = 11 dollars.\n\nSample Input 2\n\n40\n\nSample Output 2\n\nYes\n\nIf you buy ten cakes, the total will be 4 \\times 10 = 40 dollars.\n\nSample Input 3\n\n3\n\nSample Output 3\n\nNo\n\nThe prices of cakes (4 dollars) and doughnuts (7 dollars) are both higher than 3 dollars, so there is no such way.", "sample_input": "11\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03285", "source_text": "Score : 200 points\n\nProblem Statement\n\nLa Confiserie d'ABC sells cakes at 4 dollars each and doughnuts at 7 dollars each.\nDetermine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes.\n\nConstraints\n\nN is an integer between 1 and 100, inclusive.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there is a way to buy some cakes and some doughnuts for exactly N dollars, print Yes; otherwise, print No.\n\nSample Input 1\n\n11\n\nSample Output 1\n\nYes\n\nIf you buy one cake and one doughnut, the total will be 4 + 7 = 11 dollars.\n\nSample Input 2\n\n40\n\nSample Output 2\n\nYes\n\nIf you buy ten cakes, the total will be 4 \\times 10 = 40 dollars.\n\nSample Input 3\n\n3\n\nSample Output 3\n\nNo\n\nThe prices of cakes (4 dollars) and doughnuts (7 dollars) are both higher than 3 dollars, so there is no such way.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 253, "cpu_time_ms": 2, "memory_kb": 1152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s084431161", "group_id": "codeNet:p03288", "input_text": "let f a = if a < 1200 then \"ABC\" else (if a < 2800 then \"ARC\" else \"AGC\");;\nlet () = Scanf.scanf \"%d\" f\n|> Printf.printf \"%s\\n\"", "language": "OCaml", "metadata": {"date": 1561268035, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s084431161.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s084431161", "user_id": "u635974378"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "let f a = if a < 1200 then \"ABC\" else (if a < 2800 then \"ARC\" else \"AGC\");;\nlet () = Scanf.scanf \"%d\" f\n|> Printf.printf \"%s\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA programming competition site AtCode regularly holds programming contests.\n\nThe next contest on AtCode is called ABC, which is rated for contestants with ratings less than 1200.\n\nThe contest after the ABC is called ARC, which is rated for contestants with ratings less than 2800.\n\nThe contest after the ARC is called AGC, which is rated for all contestants.\n\nTakahashi's rating on AtCode is R. What is the next contest rated for him?\n\nConstraints\n\n0 ≤ R ≤ 4208\n\nR is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the name of the next contest rated for Takahashi (ABC, ARC or AGC).\n\nSample Input 1\n\n1199\n\nSample Output 1\n\nABC\n\n1199 is less than 1200, so ABC will be rated.\n\nSample Input 2\n\n1200\n\nSample Output 2\n\nARC\n\n1200 is not less than 1200 and ABC will be unrated, but it is less than 2800 and ARC will be rated.\n\nSample Input 3\n\n4208\n\nSample Output 3\n\nAGC", "sample_input": "1199\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03288", "source_text": "Score : 100 points\n\nProblem Statement\n\nA programming competition site AtCode regularly holds programming contests.\n\nThe next contest on AtCode is called ABC, which is rated for contestants with ratings less than 1200.\n\nThe contest after the ABC is called ARC, which is rated for contestants with ratings less than 2800.\n\nThe contest after the ARC is called AGC, which is rated for all contestants.\n\nTakahashi's rating on AtCode is R. What is the next contest rated for him?\n\nConstraints\n\n0 ≤ R ≤ 4208\n\nR is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the name of the next contest rated for Takahashi (ABC, ARC or AGC).\n\nSample Input 1\n\n1199\n\nSample Output 1\n\nABC\n\n1199 is less than 1200, so ABC will be rated.\n\nSample Input 2\n\n1200\n\nSample Output 2\n\nARC\n\n1200 is not less than 1200 and ABC will be unrated, but it is less than 2800 and ARC will be rated.\n\nSample Input 3\n\n4208\n\nSample Output 3\n\nAGC", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 127, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s961878596", "group_id": "codeNet:p03288", "input_text": "let ratingChangedContest rating = \n  if rating < 1200 then\n    \"ABC\"\n  else if rating < 2800 then\n    \"ARC\"\n  else\n    \"AGC\";;\n\nread_int() |> ratingChangedContest |> print_endline\n", "language": "OCaml", "metadata": {"date": 1533984931, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s961878596.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s961878596", "user_id": "u140135665"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "let ratingChangedContest rating = \n  if rating < 1200 then\n    \"ABC\"\n  else if rating < 2800 then\n    \"ARC\"\n  else\n    \"AGC\";;\n\nread_int() |> ratingChangedContest |> print_endline\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA programming competition site AtCode regularly holds programming contests.\n\nThe next contest on AtCode is called ABC, which is rated for contestants with ratings less than 1200.\n\nThe contest after the ABC is called ARC, which is rated for contestants with ratings less than 2800.\n\nThe contest after the ARC is called AGC, which is rated for all contestants.\n\nTakahashi's rating on AtCode is R. What is the next contest rated for him?\n\nConstraints\n\n0 ≤ R ≤ 4208\n\nR is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the name of the next contest rated for Takahashi (ABC, ARC or AGC).\n\nSample Input 1\n\n1199\n\nSample Output 1\n\nABC\n\n1199 is less than 1200, so ABC will be rated.\n\nSample Input 2\n\n1200\n\nSample Output 2\n\nARC\n\n1200 is not less than 1200 and ABC will be unrated, but it is less than 2800 and ARC will be rated.\n\nSample Input 3\n\n4208\n\nSample Output 3\n\nAGC", "sample_input": "1199\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03288", "source_text": "Score : 100 points\n\nProblem Statement\n\nA programming competition site AtCode regularly holds programming contests.\n\nThe next contest on AtCode is called ABC, which is rated for contestants with ratings less than 1200.\n\nThe contest after the ABC is called ARC, which is rated for contestants with ratings less than 2800.\n\nThe contest after the ARC is called AGC, which is rated for all contestants.\n\nTakahashi's rating on AtCode is R. What is the next contest rated for him?\n\nConstraints\n\n0 ≤ R ≤ 4208\n\nR is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the name of the next contest rated for Takahashi (ABC, ARC or AGC).\n\nSample Input 1\n\n1199\n\nSample Output 1\n\nABC\n\n1199 is less than 1200, so ABC will be rated.\n\nSample Input 2\n\n1200\n\nSample Output 2\n\nARC\n\n1200 is not less than 1200 and ABC will be unrated, but it is less than 2800 and ARC will be rated.\n\nSample Input 3\n\n4208\n\nSample Output 3\n\nAGC", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 180, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s818952279", "group_id": "codeNet:p03288", "input_text": "let () =\n  print_endline @@ Scanf.scanf \"%d\" @@ fun r ->\n    if r < 1200 then \"ABC\" else if r < 2800 then \"ARC\" else \"AGC\"", "language": "OCaml", "metadata": {"date": 1533517281, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s818952279.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s818952279", "user_id": "u798181098"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "let () =\n  print_endline @@ Scanf.scanf \"%d\" @@ fun r ->\n    if r < 1200 then \"ABC\" else if r < 2800 then \"ARC\" else \"AGC\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA programming competition site AtCode regularly holds programming contests.\n\nThe next contest on AtCode is called ABC, which is rated for contestants with ratings less than 1200.\n\nThe contest after the ABC is called ARC, which is rated for contestants with ratings less than 2800.\n\nThe contest after the ARC is called AGC, which is rated for all contestants.\n\nTakahashi's rating on AtCode is R. What is the next contest rated for him?\n\nConstraints\n\n0 ≤ R ≤ 4208\n\nR is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the name of the next contest rated for Takahashi (ABC, ARC or AGC).\n\nSample Input 1\n\n1199\n\nSample Output 1\n\nABC\n\n1199 is less than 1200, so ABC will be rated.\n\nSample Input 2\n\n1200\n\nSample Output 2\n\nARC\n\n1200 is not less than 1200 and ABC will be unrated, but it is less than 2800 and ARC will be rated.\n\nSample Input 3\n\n4208\n\nSample Output 3\n\nAGC", "sample_input": "1199\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03288", "source_text": "Score : 100 points\n\nProblem Statement\n\nA programming competition site AtCode regularly holds programming contests.\n\nThe next contest on AtCode is called ABC, which is rated for contestants with ratings less than 1200.\n\nThe contest after the ABC is called ARC, which is rated for contestants with ratings less than 2800.\n\nThe contest after the ARC is called AGC, which is rated for all contestants.\n\nTakahashi's rating on AtCode is R. What is the next contest rated for him?\n\nConstraints\n\n0 ≤ R ≤ 4208\n\nR is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\n\nOutput\n\nPrint the name of the next contest rated for Takahashi (ABC, ARC or AGC).\n\nSample Input 1\n\n1199\n\nSample Output 1\n\nABC\n\n1199 is less than 1200, so ABC will be rated.\n\nSample Input 2\n\n1200\n\nSample Output 2\n\nARC\n\n1200 is not less than 1200 and ABC will be unrated, but it is less than 2800 and ARC will be rated.\n\nSample Input 3\n\n4208\n\nSample Output 3\n\nAGC", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 122, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s025228636", "group_id": "codeNet:p03289", "input_text": "let s = read_line ()\nlet n = String.length s\nlet cs = Array.init n @@ fun i -> if Char.uppercase s.[i] = s.[i] then 1 else 0\nlet _ = print_endline @@ if s.[0] = 'A' && String.contains (String.sub s 2 (n - 3)) 'C' && Array.fold_left (+) 0 cs = 2 then \"AC\" else \"WA\"", "language": "OCaml", "metadata": {"date": 1564317107, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s025228636.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s025228636", "user_id": "u732304692"}, "prompt_components": {"gold_output": "AC\n", "input_to_evaluate": "let s = read_line ()\nlet n = String.length s\nlet cs = Array.init n @@ fun i -> if Char.uppercase s.[i] = s.[i] then 1 else 0\nlet _ = print_endline @@ if s.[0] = 'A' && String.contains (String.sub s 2 (n - 3)) 'C' && Array.fold_left (+) 0 cs = 2 then \"AC\" else \"WA\"", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 264, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s188423283", "group_id": "codeNet:p03289", "input_text": "type at = A | C | N | E;;\n\nlet is_lowercase = function\n  | 'a' | 'b' | 'c' | 'd' | 'e' | 'f' | 'g' | 'h'\n  | 'i' | 'j' | 'k' | 'l' | 'm' | 'n' | 'o' | 'p'\n  | 'q' | 'r' | 's' | 't' | 'u' | 'v' | 'w' | 'x'\n  | 'y' | 'z' -> true\n  | _ -> false;;\n\nlet on string index =\n  if String.length string == index + 1 then E\n  else if index == 0 then A\n  else if index >= 2 && ((String.length string) - index) >= 2 then C\n  else N\n\nlet valid string =\n  let rec validate string index c_state =\n    match (on string index, string.[index], c_state) with\n    | (E, _, true) -> \"AC\"\n    | (A, 'A', _) -> validate string (index + 1) c_state\n    | (C, 'C', false) -> validate string (index + 1) true\n    | (C, c, true) when c != 'C' -> validate string (index + 1) true\n    | (N, 'C', _) -> \"WA\"\n    | (N, c, _) when is_lowercase c -> validate string (index + 1) c_state\n    | (_, _, _) -> \"WA\"\n  in validate string 0 false;;\n\nread_line() |> valid |> print_endline\n", "language": "OCaml", "metadata": {"date": 1533993285, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s188423283.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s188423283", "user_id": "u140135665"}, "prompt_components": {"gold_output": "AC\n", "input_to_evaluate": "type at = A | C | N | E;;\n\nlet is_lowercase = function\n  | 'a' | 'b' | 'c' | 'd' | 'e' | 'f' | 'g' | 'h'\n  | 'i' | 'j' | 'k' | 'l' | 'm' | 'n' | 'o' | 'p'\n  | 'q' | 'r' | 's' | 't' | 'u' | 'v' | 'w' | 'x'\n  | 'y' | 'z' -> true\n  | _ -> false;;\n\nlet on string index =\n  if String.length string == index + 1 then E\n  else if index == 0 then A\n  else if index >= 2 && ((String.length string) - index) >= 2 then C\n  else N\n\nlet valid string =\n  let rec validate string index c_state =\n    match (on string index, string.[index], c_state) with\n    | (E, _, true) -> \"AC\"\n    | (A, 'A', _) -> validate string (index + 1) c_state\n    | (C, 'C', false) -> validate string (index + 1) true\n    | (C, c, true) when c != 'C' -> validate string (index + 1) true\n    | (N, 'C', _) -> \"WA\"\n    | (N, c, _) when is_lowercase c -> validate string (index + 1) c_state\n    | (_, _, _) -> \"WA\"\n  in validate string 0 false;;\n\nread_line() |> valid |> print_endline\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 945, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s582743552", "group_id": "codeNet:p03290", "input_text": "Scanf.scanf \"%d %d\" (fun d g ->\n    let pc = Array.init d (fun _ -> Scanf.scanf \" %d %d\" (fun p c -> p, c)) in\n\n    let rec loop bits mi =\n        let rec loop2 j bits score count =\n            if bits = 0 then score, count else\n                let p,c = pc.(j) in\n                if bits land 1 = 1 then loop2 (j + 1) (bits lsr 1) (score + 100 * (j + 1) * p + c) (count + p)\n                                   else loop2 (j + 1) (bits lsr 1) score count\n        in\n        let rec find_bits i =\n            if i < 0 then i else\n                if (1 lsl i) land bits = 0 then i else find_bits (i - 1)\n        in\n        if bits < 0 then mi else\n            let score, count = loop2 0 bits 0 0 in\n            let mi = if score >= g then min mi count else\n                let k = find_bits (d - 1) in\n                if k < 0 then mi else\n                    let p, _ = pc.(k) in\n                    let kk = (k + 1) * 100 in\n                    let q = (g - score + kk - 1) / kk in\n                    if q < p then min mi (count + q) else mi\n            in\n            loop (bits - 1) mi\n    in\n    loop ((1 lsl d) - 1) max_int |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1586661169, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03290.html", "problem_id": "p03290", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03290/input.txt", "sample_output_relpath": "derived/input_output/data/p03290/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03290/OCaml/s582743552.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s582743552", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun d g ->\n    let pc = Array.init d (fun _ -> Scanf.scanf \" %d %d\" (fun p c -> p, c)) in\n\n    let rec loop bits mi =\n        let rec loop2 j bits score count =\n            if bits = 0 then score, count else\n                let p,c = pc.(j) in\n                if bits land 1 = 1 then loop2 (j + 1) (bits lsr 1) (score + 100 * (j + 1) * p + c) (count + p)\n                                   else loop2 (j + 1) (bits lsr 1) score count\n        in\n        let rec find_bits i =\n            if i < 0 then i else\n                if (1 lsl i) land bits = 0 then i else find_bits (i - 1)\n        in\n        if bits < 0 then mi else\n            let score, count = loop2 0 bits 0 0 in\n            let mi = if score >= g then min mi count else\n                let k = find_bits (d - 1) in\n                if k < 0 then mi else\n                    let p, _ = pc.(k) in\n                    let kk = (k + 1) * 100 in\n                    let q = (g - score + kk - 1) / kk in\n                    if q < p then min mi (count + q) else mi\n            in\n            loop (bits - 1) mi\n    in\n    loop ((1 lsl d) - 1) max_int |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA programming competition site AtCode provides algorithmic problems.\nEach problem is allocated a score based on its difficulty.\nCurrently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points.\nThese p_1 + … + p_D problems are all of the problems available on AtCode.\n\nA user of AtCode has a value called total score.\nThe total score of a user is the sum of the following two elements:\n\nBase score: the sum of the scores of all problems solved by the user.\n\nPerfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).\n\nTakahashi, who is the new user of AtCode, has not solved any problem.\nHis objective is to have a total score of G or more points.\nAt least how many problems does he need to solve for this objective?\n\nConstraints\n\n1 ≤ D ≤ 10\n\n1 ≤ p_i ≤ 100\n\n100 ≤ c_i ≤ 10^6\n\n100 ≤ G\n\nAll values in input are integers.\n\nc_i and G are all multiples of 100.\n\nIt is possible to have a total score of G or more points.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD G\np_1 c_1\n:\np_D c_D\n\nOutput\n\nPrint the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).\n\nSample Input 1\n\n2 700\n3 500\n5 800\n\nSample Output 1\n\n3\n\nIn this case, there are three problems each with 100 points and five problems each with 200 points. The perfect bonus for solving all the 100-point problems is 500 points, and the perfect bonus for solving all the 200-point problems is 800 points. Takahashi's objective is to have a total score of 700 points or more.\n\nOne way to achieve this objective is to solve four 200-point problems and earn a base score of 800 points. However, if we solve three 100-point problems, we can earn the perfect bonus of 500 points in addition to the base score of 300 points, for a total score of 800 points, and we can achieve the objective with fewer problems.\n\nSample Input 2\n\n2 2000\n3 500\n5 800\n\nSample Output 2\n\n7\n\nThis case is similar to Sample Input 1, but the Takahashi's objective this time is 2000 points or more. In this case, we inevitably need to solve all five 200-point problems, and by solving two 100-point problems additionally we have the total score of 2000 points.\n\nSample Input 3\n\n2 400\n3 500\n5 800\n\nSample Output 3\n\n2\n\nThis case is again similar to Sample Input 1, but the Takahashi's objective this time is 400 points or more. In this case, we only need to solve two 200-point problems to achieve the objective.\n\nSample Input 4\n\n5 25000\n20 1000\n40 1000\n50 1000\n30 1000\n1 1000\n\nSample Output 4\n\n66\n\nThere is only one 500-point problem, but the perfect bonus can be earned even in such a case.", "sample_input": "2 700\n3 500\n5 800\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03290", "source_text": "Score : 300 points\n\nProblem Statement\n\nA programming competition site AtCode provides algorithmic problems.\nEach problem is allocated a score based on its difficulty.\nCurrently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points.\nThese p_1 + … + p_D problems are all of the problems available on AtCode.\n\nA user of AtCode has a value called total score.\nThe total score of a user is the sum of the following two elements:\n\nBase score: the sum of the scores of all problems solved by the user.\n\nPerfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).\n\nTakahashi, who is the new user of AtCode, has not solved any problem.\nHis objective is to have a total score of G or more points.\nAt least how many problems does he need to solve for this objective?\n\nConstraints\n\n1 ≤ D ≤ 10\n\n1 ≤ p_i ≤ 100\n\n100 ≤ c_i ≤ 10^6\n\n100 ≤ G\n\nAll values in input are integers.\n\nc_i and G are all multiples of 100.\n\nIt is possible to have a total score of G or more points.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD G\np_1 c_1\n:\np_D c_D\n\nOutput\n\nPrint the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).\n\nSample Input 1\n\n2 700\n3 500\n5 800\n\nSample Output 1\n\n3\n\nIn this case, there are three problems each with 100 points and five problems each with 200 points. The perfect bonus for solving all the 100-point problems is 500 points, and the perfect bonus for solving all the 200-point problems is 800 points. Takahashi's objective is to have a total score of 700 points or more.\n\nOne way to achieve this objective is to solve four 200-point problems and earn a base score of 800 points. However, if we solve three 100-point problems, we can earn the perfect bonus of 500 points in addition to the base score of 300 points, for a total score of 800 points, and we can achieve the objective with fewer problems.\n\nSample Input 2\n\n2 2000\n3 500\n5 800\n\nSample Output 2\n\n7\n\nThis case is similar to Sample Input 1, but the Takahashi's objective this time is 2000 points or more. In this case, we inevitably need to solve all five 200-point problems, and by solving two 100-point problems additionally we have the total score of 2000 points.\n\nSample Input 3\n\n2 400\n3 500\n5 800\n\nSample Output 3\n\n2\n\nThis case is again similar to Sample Input 1, but the Takahashi's objective this time is 400 points or more. In this case, we only need to solve two 200-point problems to achieve the objective.\n\nSample Input 4\n\n5 25000\n20 1000\n40 1000\n50 1000\n30 1000\n1 1000\n\nSample Output 4\n\n66\n\nThere is only one 500-point problem, but the perfect bonus can be earned even in such a case.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1154, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s735886055", "group_id": "codeNet:p03290", "input_text": "open Printf\nopen Scanf\n\nlet (d,g) = sscanf (read_line ()) \"%d %d\" (fun d g -> (d,g));;\nlet rec input_list num l =\nif num = 0 then l\nelse \n    let (p,c) = sscanf (read_line ()) \"%d %d\" (fun d g -> (d,g)) in\n    input_list (num-1) ((100 * (d-num+1), p, c) :: l);;\n\nlet list = input_list d [];;\nlet inf = 10000000000;;\n\nlet solve list g =\n    let rec loop l q_num sum tl =\n    match l with\n    | [] -> \n        (match tl with\n        | [] ->  if sum >= g then q_num else inf\n        | x::rest -> \n            let diff = g - sum in\n            if diff <= 0 then q_num \n            else \n                let (i1,p1,c1) = List.hd (List.sort (fun (a,_,_) (b,_,_) -> -compare a b) tl) in\n                if i1*(p1-1)+sum < g then inf\n                else q_num (*+ truncate ((float_of_int diff) /. (float_of_int i1))*)\n        )\n    | (i1,p1,c1)::rest -> \n        let used_value = loop rest (q_num + p1) (sum + p1*i1 + c1) tl in\n        let non_used_value = loop rest q_num sum ((i1,p1,c1) :: tl) in\n        min used_value non_used_value\n    in loop list 0 0 [];;\n\nlet ans = solve list g;;\n\nlet _ = printf \"%d\\n\" ans;;", "language": "OCaml", "metadata": {"date": 1564810747, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03290.html", "problem_id": "p03290", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03290/input.txt", "sample_output_relpath": "derived/input_output/data/p03290/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03290/OCaml/s735886055.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s735886055", "user_id": "u947517859"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet (d,g) = sscanf (read_line ()) \"%d %d\" (fun d g -> (d,g));;\nlet rec input_list num l =\nif num = 0 then l\nelse \n    let (p,c) = sscanf (read_line ()) \"%d %d\" (fun d g -> (d,g)) in\n    input_list (num-1) ((100 * (d-num+1), p, c) :: l);;\n\nlet list = input_list d [];;\nlet inf = 10000000000;;\n\nlet solve list g =\n    let rec loop l q_num sum tl =\n    match l with\n    | [] -> \n        (match tl with\n        | [] ->  if sum >= g then q_num else inf\n        | x::rest -> \n            let diff = g - sum in\n            if diff <= 0 then q_num \n            else \n                let (i1,p1,c1) = List.hd (List.sort (fun (a,_,_) (b,_,_) -> -compare a b) tl) in\n                if i1*(p1-1)+sum < g then inf\n                else q_num (*+ truncate ((float_of_int diff) /. (float_of_int i1))*)\n        )\n    | (i1,p1,c1)::rest -> \n        let used_value = loop rest (q_num + p1) (sum + p1*i1 + c1) tl in\n        let non_used_value = loop rest q_num sum ((i1,p1,c1) :: tl) in\n        min used_value non_used_value\n    in loop list 0 0 [];;\n\nlet ans = solve list g;;\n\nlet _ = printf \"%d\\n\" ans;;", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA programming competition site AtCode provides algorithmic problems.\nEach problem is allocated a score based on its difficulty.\nCurrently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points.\nThese p_1 + … + p_D problems are all of the problems available on AtCode.\n\nA user of AtCode has a value called total score.\nThe total score of a user is the sum of the following two elements:\n\nBase score: the sum of the scores of all problems solved by the user.\n\nPerfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).\n\nTakahashi, who is the new user of AtCode, has not solved any problem.\nHis objective is to have a total score of G or more points.\nAt least how many problems does he need to solve for this objective?\n\nConstraints\n\n1 ≤ D ≤ 10\n\n1 ≤ p_i ≤ 100\n\n100 ≤ c_i ≤ 10^6\n\n100 ≤ G\n\nAll values in input are integers.\n\nc_i and G are all multiples of 100.\n\nIt is possible to have a total score of G or more points.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD G\np_1 c_1\n:\np_D c_D\n\nOutput\n\nPrint the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).\n\nSample Input 1\n\n2 700\n3 500\n5 800\n\nSample Output 1\n\n3\n\nIn this case, there are three problems each with 100 points and five problems each with 200 points. The perfect bonus for solving all the 100-point problems is 500 points, and the perfect bonus for solving all the 200-point problems is 800 points. Takahashi's objective is to have a total score of 700 points or more.\n\nOne way to achieve this objective is to solve four 200-point problems and earn a base score of 800 points. However, if we solve three 100-point problems, we can earn the perfect bonus of 500 points in addition to the base score of 300 points, for a total score of 800 points, and we can achieve the objective with fewer problems.\n\nSample Input 2\n\n2 2000\n3 500\n5 800\n\nSample Output 2\n\n7\n\nThis case is similar to Sample Input 1, but the Takahashi's objective this time is 2000 points or more. In this case, we inevitably need to solve all five 200-point problems, and by solving two 100-point problems additionally we have the total score of 2000 points.\n\nSample Input 3\n\n2 400\n3 500\n5 800\n\nSample Output 3\n\n2\n\nThis case is again similar to Sample Input 1, but the Takahashi's objective this time is 400 points or more. In this case, we only need to solve two 200-point problems to achieve the objective.\n\nSample Input 4\n\n5 25000\n20 1000\n40 1000\n50 1000\n30 1000\n1 1000\n\nSample Output 4\n\n66\n\nThere is only one 500-point problem, but the perfect bonus can be earned even in such a case.", "sample_input": "2 700\n3 500\n5 800\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03290", "source_text": "Score : 300 points\n\nProblem Statement\n\nA programming competition site AtCode provides algorithmic problems.\nEach problem is allocated a score based on its difficulty.\nCurrently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points.\nThese p_1 + … + p_D problems are all of the problems available on AtCode.\n\nA user of AtCode has a value called total score.\nThe total score of a user is the sum of the following two elements:\n\nBase score: the sum of the scores of all problems solved by the user.\n\nPerfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).\n\nTakahashi, who is the new user of AtCode, has not solved any problem.\nHis objective is to have a total score of G or more points.\nAt least how many problems does he need to solve for this objective?\n\nConstraints\n\n1 ≤ D ≤ 10\n\n1 ≤ p_i ≤ 100\n\n100 ≤ c_i ≤ 10^6\n\n100 ≤ G\n\nAll values in input are integers.\n\nc_i and G are all multiples of 100.\n\nIt is possible to have a total score of G or more points.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD G\np_1 c_1\n:\np_D c_D\n\nOutput\n\nPrint the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).\n\nSample Input 1\n\n2 700\n3 500\n5 800\n\nSample Output 1\n\n3\n\nIn this case, there are three problems each with 100 points and five problems each with 200 points. The perfect bonus for solving all the 100-point problems is 500 points, and the perfect bonus for solving all the 200-point problems is 800 points. Takahashi's objective is to have a total score of 700 points or more.\n\nOne way to achieve this objective is to solve four 200-point problems and earn a base score of 800 points. However, if we solve three 100-point problems, we can earn the perfect bonus of 500 points in addition to the base score of 300 points, for a total score of 800 points, and we can achieve the objective with fewer problems.\n\nSample Input 2\n\n2 2000\n3 500\n5 800\n\nSample Output 2\n\n7\n\nThis case is similar to Sample Input 1, but the Takahashi's objective this time is 2000 points or more. In this case, we inevitably need to solve all five 200-point problems, and by solving two 100-point problems additionally we have the total score of 2000 points.\n\nSample Input 3\n\n2 400\n3 500\n5 800\n\nSample Output 3\n\n2\n\nThis case is again similar to Sample Input 1, but the Takahashi's objective this time is 400 points or more. In this case, we only need to solve two 200-point problems to achieve the objective.\n\nSample Input 4\n\n5 25000\n20 1000\n40 1000\n50 1000\n30 1000\n1 1000\n\nSample Output 4\n\n66\n\nThere is only one 500-point problem, but the perfect bonus can be earned even in such a case.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1110, "cpu_time_ms": 2, "memory_kb": 2688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s001650408", "group_id": "codeNet:p03290", "input_text": "(* O(2^d d) *)\nScanf.scanf \" %d %d\" @@ fun d g ->\n  let pcs = Array.init d @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun p c -> p, c in\n  let ans = ref max_int in\n  let rec find acc rest i bits =\n    if rest <= 0 then acc\n    else if i < 0 then max_int\n    else if bits lsr i land 1 = 1 then find acc rest (i - 1) bits\n    else\n      let p, _ = pcs.(i) in\n      let m = (i + 1) * 100 in\n      let n = min (p - 1) @@ (rest + m - 1) / m in\n      find (acc + n) (rest - n * m) (i - 1) bits in\n  let points = Array.init d @@ fun i -> let p, c = pcs.(i) in i, p, p * (i + 1) * 100 + c in\n  let f bits =\n    let g (c, sum) (i, p, s) = if bits lsr i land 1 = 1 then c + p, sum + s else c, sum in\n    Array.fold_left g (0, 0) points in\n  for i = 0 to 1 lsl d - 1 do\n    let c, s = f i in\n    ans := min !ans @@ find c (g - s) (d - 1) i\n  done;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1559376637, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03290.html", "problem_id": "p03290", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03290/input.txt", "sample_output_relpath": "derived/input_output/data/p03290/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03290/OCaml/s001650408.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s001650408", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(* O(2^d d) *)\nScanf.scanf \" %d %d\" @@ fun d g ->\n  let pcs = Array.init d @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun p c -> p, c in\n  let ans = ref max_int in\n  let rec find acc rest i bits =\n    if rest <= 0 then acc\n    else if i < 0 then max_int\n    else if bits lsr i land 1 = 1 then find acc rest (i - 1) bits\n    else\n      let p, _ = pcs.(i) in\n      let m = (i + 1) * 100 in\n      let n = min (p - 1) @@ (rest + m - 1) / m in\n      find (acc + n) (rest - n * m) (i - 1) bits in\n  let points = Array.init d @@ fun i -> let p, c = pcs.(i) in i, p, p * (i + 1) * 100 + c in\n  let f bits =\n    let g (c, sum) (i, p, s) = if bits lsr i land 1 = 1 then c + p, sum + s else c, sum in\n    Array.fold_left g (0, 0) points in\n  for i = 0 to 1 lsl d - 1 do\n    let c, s = f i in\n    ans := min !ans @@ find c (g - s) (d - 1) i\n  done;\n  Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA programming competition site AtCode provides algorithmic problems.\nEach problem is allocated a score based on its difficulty.\nCurrently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points.\nThese p_1 + … + p_D problems are all of the problems available on AtCode.\n\nA user of AtCode has a value called total score.\nThe total score of a user is the sum of the following two elements:\n\nBase score: the sum of the scores of all problems solved by the user.\n\nPerfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).\n\nTakahashi, who is the new user of AtCode, has not solved any problem.\nHis objective is to have a total score of G or more points.\nAt least how many problems does he need to solve for this objective?\n\nConstraints\n\n1 ≤ D ≤ 10\n\n1 ≤ p_i ≤ 100\n\n100 ≤ c_i ≤ 10^6\n\n100 ≤ G\n\nAll values in input are integers.\n\nc_i and G are all multiples of 100.\n\nIt is possible to have a total score of G or more points.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD G\np_1 c_1\n:\np_D c_D\n\nOutput\n\nPrint the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).\n\nSample Input 1\n\n2 700\n3 500\n5 800\n\nSample Output 1\n\n3\n\nIn this case, there are three problems each with 100 points and five problems each with 200 points. The perfect bonus for solving all the 100-point problems is 500 points, and the perfect bonus for solving all the 200-point problems is 800 points. Takahashi's objective is to have a total score of 700 points or more.\n\nOne way to achieve this objective is to solve four 200-point problems and earn a base score of 800 points. However, if we solve three 100-point problems, we can earn the perfect bonus of 500 points in addition to the base score of 300 points, for a total score of 800 points, and we can achieve the objective with fewer problems.\n\nSample Input 2\n\n2 2000\n3 500\n5 800\n\nSample Output 2\n\n7\n\nThis case is similar to Sample Input 1, but the Takahashi's objective this time is 2000 points or more. In this case, we inevitably need to solve all five 200-point problems, and by solving two 100-point problems additionally we have the total score of 2000 points.\n\nSample Input 3\n\n2 400\n3 500\n5 800\n\nSample Output 3\n\n2\n\nThis case is again similar to Sample Input 1, but the Takahashi's objective this time is 400 points or more. In this case, we only need to solve two 200-point problems to achieve the objective.\n\nSample Input 4\n\n5 25000\n20 1000\n40 1000\n50 1000\n30 1000\n1 1000\n\nSample Output 4\n\n66\n\nThere is only one 500-point problem, but the perfect bonus can be earned even in such a case.", "sample_input": "2 700\n3 500\n5 800\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03290", "source_text": "Score : 300 points\n\nProblem Statement\n\nA programming competition site AtCode provides algorithmic problems.\nEach problem is allocated a score based on its difficulty.\nCurrently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points.\nThese p_1 + … + p_D problems are all of the problems available on AtCode.\n\nA user of AtCode has a value called total score.\nThe total score of a user is the sum of the following two elements:\n\nBase score: the sum of the scores of all problems solved by the user.\n\nPerfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).\n\nTakahashi, who is the new user of AtCode, has not solved any problem.\nHis objective is to have a total score of G or more points.\nAt least how many problems does he need to solve for this objective?\n\nConstraints\n\n1 ≤ D ≤ 10\n\n1 ≤ p_i ≤ 100\n\n100 ≤ c_i ≤ 10^6\n\n100 ≤ G\n\nAll values in input are integers.\n\nc_i and G are all multiples of 100.\n\nIt is possible to have a total score of G or more points.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD G\np_1 c_1\n:\np_D c_D\n\nOutput\n\nPrint the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).\n\nSample Input 1\n\n2 700\n3 500\n5 800\n\nSample Output 1\n\n3\n\nIn this case, there are three problems each with 100 points and five problems each with 200 points. The perfect bonus for solving all the 100-point problems is 500 points, and the perfect bonus for solving all the 200-point problems is 800 points. Takahashi's objective is to have a total score of 700 points or more.\n\nOne way to achieve this objective is to solve four 200-point problems and earn a base score of 800 points. However, if we solve three 100-point problems, we can earn the perfect bonus of 500 points in addition to the base score of 300 points, for a total score of 800 points, and we can achieve the objective with fewer problems.\n\nSample Input 2\n\n2 2000\n3 500\n5 800\n\nSample Output 2\n\n7\n\nThis case is similar to Sample Input 1, but the Takahashi's objective this time is 2000 points or more. In this case, we inevitably need to solve all five 200-point problems, and by solving two 100-point problems additionally we have the total score of 2000 points.\n\nSample Input 3\n\n2 400\n3 500\n5 800\n\nSample Output 3\n\n2\n\nThis case is again similar to Sample Input 1, but the Takahashi's objective this time is 400 points or more. In this case, we only need to solve two 200-point problems to achieve the objective.\n\nSample Input 4\n\n5 25000\n20 1000\n40 1000\n50 1000\n30 1000\n1 1000\n\nSample Output 4\n\n66\n\nThere is only one 500-point problem, but the perfect bonus can be earned even in such a case.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 857, "cpu_time_ms": 1, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s330257624", "group_id": "codeNet:p03292", "input_text": "Scanf.scanf \"%d %d %d\" @@ fun a b c -> Printf.printf \"%d\\n\" @@ max a (max b c) - min a (min b c)", "language": "OCaml", "metadata": {"date": 1578237523, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s330257624.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s330257624", "user_id": "u732304692"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" @@ fun a b c -> Printf.printf \"%d\\n\" @@ max a (max b c) - min a (min b c)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have three tasks, all of which need to be completed.\n\nFirst, you can complete any one task at cost 0.\n\nThen, just after completing the i-th task, you can complete the j-th task at cost |A_j - A_i|.\n\nHere, |x| denotes the absolute value of x.\n\nFind the minimum total cost required to complete all the task.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_1, A_2, A_3 \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nPrint the minimum total cost required to complete all the task.\n\nSample Input 1\n\n1 6 3\n\nSample Output 1\n\n5\n\nWhen the tasks are completed in the following order, the total cost will be 5, which is the minimum:\n\nComplete the first task at cost 0.\n\nComplete the third task at cost 2.\n\nComplete the second task at cost 3.\n\nSample Input 2\n\n11 5 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n100 100 100\n\nSample Output 3\n\n0", "sample_input": "1 6 3\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03292", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have three tasks, all of which need to be completed.\n\nFirst, you can complete any one task at cost 0.\n\nThen, just after completing the i-th task, you can complete the j-th task at cost |A_j - A_i|.\n\nHere, |x| denotes the absolute value of x.\n\nFind the minimum total cost required to complete all the task.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_1, A_2, A_3 \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nPrint the minimum total cost required to complete all the task.\n\nSample Input 1\n\n1 6 3\n\nSample Output 1\n\n5\n\nWhen the tasks are completed in the following order, the total cost will be 5, which is the minimum:\n\nComplete the first task at cost 0.\n\nComplete the third task at cost 2.\n\nComplete the second task at cost 3.\n\nSample Input 2\n\n11 5 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n100 100 100\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 96, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s586859118", "group_id": "codeNet:p03292", "input_text": "let a_s = Array.init 3 @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet ans = ref 500\nlet f i j k = ans := min !ans @@ abs (a_s.(i) - a_s.(j)) + abs (a_s.(j) - a_s.(k))\nlet _ =\n  f 0 1 2; f 0 2 1; f 1 0 2; f 1 2 0; f 2 0 1; f 2 1 0;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1562305302, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s586859118.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s586859118", "user_id": "u732304692"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let a_s = Array.init 3 @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet ans = ref 500\nlet f i j k = ans := min !ans @@ abs (a_s.(i) - a_s.(j)) + abs (a_s.(j) - a_s.(k))\nlet _ =\n  f 0 1 2; f 0 2 1; f 1 0 2; f 1 2 0; f 2 0 1; f 2 1 0;\n  Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have three tasks, all of which need to be completed.\n\nFirst, you can complete any one task at cost 0.\n\nThen, just after completing the i-th task, you can complete the j-th task at cost |A_j - A_i|.\n\nHere, |x| denotes the absolute value of x.\n\nFind the minimum total cost required to complete all the task.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_1, A_2, A_3 \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nPrint the minimum total cost required to complete all the task.\n\nSample Input 1\n\n1 6 3\n\nSample Output 1\n\n5\n\nWhen the tasks are completed in the following order, the total cost will be 5, which is the minimum:\n\nComplete the first task at cost 0.\n\nComplete the third task at cost 2.\n\nComplete the second task at cost 3.\n\nSample Input 2\n\n11 5 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n100 100 100\n\nSample Output 3\n\n0", "sample_input": "1 6 3\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03292", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have three tasks, all of which need to be completed.\n\nFirst, you can complete any one task at cost 0.\n\nThen, just after completing the i-th task, you can complete the j-th task at cost |A_j - A_i|.\n\nHere, |x| denotes the absolute value of x.\n\nFind the minimum total cost required to complete all the task.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_1, A_2, A_3 \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nPrint the minimum total cost required to complete all the task.\n\nSample Input 1\n\n1 6 3\n\nSample Output 1\n\n5\n\nWhen the tasks are completed in the following order, the total cost will be 5, which is the minimum:\n\nComplete the first task at cost 0.\n\nComplete the third task at cost 2.\n\nComplete the second task at cost 3.\n\nSample Input 2\n\n11 5 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n100 100 100\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 251, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s239536508", "group_id": "codeNet:p03292", "input_text": "let f a b c = let aab = abs (a-b) in let abc = abs (b-c) in let aca = abs (c-a) in\naab + abc + aca - max aab (max abc aca);;\nlet () = Scanf.scanf \"%d %d %d\" f\n|> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1561513391, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s239536508.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s239536508", "user_id": "u635974378"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let f a b c = let aab = abs (a-b) in let abc = abs (b-c) in let aca = abs (c-a) in\naab + abc + aca - max aab (max abc aca);;\nlet () = Scanf.scanf \"%d %d %d\" f\n|> Printf.printf \"%d\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have three tasks, all of which need to be completed.\n\nFirst, you can complete any one task at cost 0.\n\nThen, just after completing the i-th task, you can complete the j-th task at cost |A_j - A_i|.\n\nHere, |x| denotes the absolute value of x.\n\nFind the minimum total cost required to complete all the task.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_1, A_2, A_3 \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nPrint the minimum total cost required to complete all the task.\n\nSample Input 1\n\n1 6 3\n\nSample Output 1\n\n5\n\nWhen the tasks are completed in the following order, the total cost will be 5, which is the minimum:\n\nComplete the first task at cost 0.\n\nComplete the third task at cost 2.\n\nComplete the second task at cost 3.\n\nSample Input 2\n\n11 5 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n100 100 100\n\nSample Output 3\n\n0", "sample_input": "1 6 3\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03292", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have three tasks, all of which need to be completed.\n\nFirst, you can complete any one task at cost 0.\n\nThen, just after completing the i-th task, you can complete the j-th task at cost |A_j - A_i|.\n\nHere, |x| denotes the absolute value of x.\n\nFind the minimum total cost required to complete all the task.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_1, A_2, A_3 \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nPrint the minimum total cost required to complete all the task.\n\nSample Input 1\n\n1 6 3\n\nSample Output 1\n\n5\n\nWhen the tasks are completed in the following order, the total cost will be 5, which is the minimum:\n\nComplete the first task at cost 0.\n\nComplete the third task at cost 2.\n\nComplete the second task at cost 3.\n\nSample Input 2\n\n11 5 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n100 100 100\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 182, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s338041888", "group_id": "codeNet:p03292", "input_text": "let () = Scanf.scanf \"%d %d %d\" (fun a b c -> max a (max b c) - min a (min b c))\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1532244385, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s338041888.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s338041888", "user_id": "u798181098"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" (fun a b c -> max a (max b c) - min a (min b c))\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have three tasks, all of which need to be completed.\n\nFirst, you can complete any one task at cost 0.\n\nThen, just after completing the i-th task, you can complete the j-th task at cost |A_j - A_i|.\n\nHere, |x| denotes the absolute value of x.\n\nFind the minimum total cost required to complete all the task.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_1, A_2, A_3 \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nPrint the minimum total cost required to complete all the task.\n\nSample Input 1\n\n1 6 3\n\nSample Output 1\n\n5\n\nWhen the tasks are completed in the following order, the total cost will be 5, which is the minimum:\n\nComplete the first task at cost 0.\n\nComplete the third task at cost 2.\n\nComplete the second task at cost 3.\n\nSample Input 2\n\n11 5 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n100 100 100\n\nSample Output 3\n\n0", "sample_input": "1 6 3\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03292", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have three tasks, all of which need to be completed.\n\nFirst, you can complete any one task at cost 0.\n\nThen, just after completing the i-th task, you can complete the j-th task at cost |A_j - A_i|.\n\nHere, |x| denotes the absolute value of x.\n\nFind the minimum total cost required to complete all the task.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_1, A_2, A_3 \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nPrint the minimum total cost required to complete all the task.\n\nSample Input 1\n\n1 6 3\n\nSample Output 1\n\n5\n\nWhen the tasks are completed in the following order, the total cost will be 5, which is the minimum:\n\nComplete the first task at cost 0.\n\nComplete the third task at cost 2.\n\nComplete the second task at cost 3.\n\nSample Input 2\n\n11 5 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n100 100 100\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 106, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s375324903", "group_id": "codeNet:p03292", "input_text": "let () = Scanf.scanf \"%d %d %d\" (fun x y z -> [x;y;z])\n    |> (fun l -> (List.fold_left max 0 l) - (List.fold_left min 101 l))\n    |> Printf.printf \"%d\"", "language": "OCaml", "metadata": {"date": 1532222088, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s375324903.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s375324903", "user_id": "u604818425"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" (fun x y z -> [x;y;z])\n    |> (fun l -> (List.fold_left max 0 l) - (List.fold_left min 101 l))\n    |> Printf.printf \"%d\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have three tasks, all of which need to be completed.\n\nFirst, you can complete any one task at cost 0.\n\nThen, just after completing the i-th task, you can complete the j-th task at cost |A_j - A_i|.\n\nHere, |x| denotes the absolute value of x.\n\nFind the minimum total cost required to complete all the task.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_1, A_2, A_3 \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nPrint the minimum total cost required to complete all the task.\n\nSample Input 1\n\n1 6 3\n\nSample Output 1\n\n5\n\nWhen the tasks are completed in the following order, the total cost will be 5, which is the minimum:\n\nComplete the first task at cost 0.\n\nComplete the third task at cost 2.\n\nComplete the second task at cost 3.\n\nSample Input 2\n\n11 5 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n100 100 100\n\nSample Output 3\n\n0", "sample_input": "1 6 3\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03292", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have three tasks, all of which need to be completed.\n\nFirst, you can complete any one task at cost 0.\n\nThen, just after completing the i-th task, you can complete the j-th task at cost |A_j - A_i|.\n\nHere, |x| denotes the absolute value of x.\n\nFind the minimum total cost required to complete all the task.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_1, A_2, A_3 \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nPrint the minimum total cost required to complete all the task.\n\nSample Input 1\n\n1 6 3\n\nSample Output 1\n\n5\n\nWhen the tasks are completed in the following order, the total cost will be 5, which is the minimum:\n\nComplete the first task at cost 0.\n\nComplete the third task at cost 2.\n\nComplete the second task at cost 3.\n\nSample Input 2\n\n11 5 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n100 100 100\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 152, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s780327839", "group_id": "codeNet:p03292", "input_text": "let () = Scanf.scanf \"%d %d %d\" @@ fun a1 a2 a3 ->\n  let [a1'; a2'; a3'] = List.sort compare [a1; a2; a3] in\n  Printf.printf \"%d\\n\" @@ a3' - a1'\n\n", "language": "OCaml", "metadata": {"date": 1532221381, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s780327839.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s780327839", "user_id": "u504158101"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" @@ fun a1 a2 a3 ->\n  let [a1'; a2'; a3'] = List.sort compare [a1; a2; a3] in\n  Printf.printf \"%d\\n\" @@ a3' - a1'\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have three tasks, all of which need to be completed.\n\nFirst, you can complete any one task at cost 0.\n\nThen, just after completing the i-th task, you can complete the j-th task at cost |A_j - A_i|.\n\nHere, |x| denotes the absolute value of x.\n\nFind the minimum total cost required to complete all the task.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_1, A_2, A_3 \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nPrint the minimum total cost required to complete all the task.\n\nSample Input 1\n\n1 6 3\n\nSample Output 1\n\n5\n\nWhen the tasks are completed in the following order, the total cost will be 5, which is the minimum:\n\nComplete the first task at cost 0.\n\nComplete the third task at cost 2.\n\nComplete the second task at cost 3.\n\nSample Input 2\n\n11 5 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n100 100 100\n\nSample Output 3\n\n0", "sample_input": "1 6 3\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03292", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have three tasks, all of which need to be completed.\n\nFirst, you can complete any one task at cost 0.\n\nThen, just after completing the i-th task, you can complete the j-th task at cost |A_j - A_i|.\n\nHere, |x| denotes the absolute value of x.\n\nFind the minimum total cost required to complete all the task.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_1, A_2, A_3 \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nPrint the minimum total cost required to complete all the task.\n\nSample Input 1\n\n1 6 3\n\nSample Output 1\n\n5\n\nWhen the tasks are completed in the following order, the total cost will be 5, which is the minimum:\n\nComplete the first task at cost 0.\n\nComplete the third task at cost 2.\n\nComplete the second task at cost 3.\n\nSample Input 2\n\n11 5 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n100 100 100\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 146, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s776262043", "group_id": "codeNet:p03293", "input_text": "open Scanf\nopen Printf\n\nlet rotates s = let rec f n = if n = String.length s\n                 then []\n                 else (String.sub s n (String.length s - n) ^ String.sub s 0 n) :: f (n+1)\n  in s :: (f 1)\n\nlet f s t = List.fold_left ( || ) false (List.map (fun u -> u = t) @@ rotates s)\n\nlet () = if scanf \"%s\\n%s\\n\" f\n    then printf \"Yes\\n\"\n    else printf \"No\\n\"", "language": "OCaml", "metadata": {"date": 1532222552, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s776262043.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s776262043", "user_id": "u379439911"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet rotates s = let rec f n = if n = String.length s\n                 then []\n                 else (String.sub s n (String.length s - n) ^ String.sub s 0 n) :: f (n+1)\n  in s :: (f 1)\n\nlet f s t = List.fold_left ( || ) false (List.map (fun u -> u = t) @@ rotates s)\n\nlet () = if scanf \"%s\\n%s\\n\" f\n    then printf \"Yes\\n\"\n    else printf \"No\\n\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given string S and T consisting of lowercase English letters.\n\nDetermine if S equals T after rotation.\n\nThat is, determine if S equals T after the following operation is performed some number of times:\n\nOperation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.\n\nHere, |X| denotes the length of the string X.\n\nConstraints\n\n2 \\leq |S| \\leq 100\n\n|S| = |T|\n\nS and T consist of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf S equals T after rotation, print Yes; if it does not, print No.\n\nSample Input 1\n\nkyoto\ntokyo\n\nSample Output 1\n\nYes\n\nIn the first operation, kyoto becomes okyot.\n\nIn the second operation, okyot becomes tokyo.\n\nSample Input 2\n\nabc\narc\n\nSample Output 2\n\nNo\n\nabc does not equal arc after any number of operations.\n\nSample Input 3\n\naaaaaaaaaaaaaaab\naaaaaaaaaaaaaaab\n\nSample Output 3\n\nYes", "sample_input": "kyoto\ntokyo\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03293", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given string S and T consisting of lowercase English letters.\n\nDetermine if S equals T after rotation.\n\nThat is, determine if S equals T after the following operation is performed some number of times:\n\nOperation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.\n\nHere, |X| denotes the length of the string X.\n\nConstraints\n\n2 \\leq |S| \\leq 100\n\n|S| = |T|\n\nS and T consist of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nIf S equals T after rotation, print Yes; if it does not, print No.\n\nSample Input 1\n\nkyoto\ntokyo\n\nSample Output 1\n\nYes\n\nIn the first operation, kyoto becomes okyot.\n\nIn the second operation, okyot becomes tokyo.\n\nSample Input 2\n\nabc\narc\n\nSample Output 2\n\nNo\n\nabc does not equal arc after any number of operations.\n\nSample Input 3\n\naaaaaaaaaaaaaaab\naaaaaaaaaaaaaaab\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 369, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s924254095", "group_id": "codeNet:p03294", "input_text": "\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ = Array.init n @@ fun _ ->\n    Scanf.scanf \"%d \" @@ fun a -> a in\n  Printf.printf \"%d\\n\" @@ Array.fold_left ( + ) 0 @@ Array.map (fun a -> a - 1) as_\n\n", "language": "OCaml", "metadata": {"date": 1532262954, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s924254095.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s924254095", "user_id": "u504158101"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ = Array.init n @@ fun _ ->\n    Scanf.scanf \"%d \" @@ fun a -> a in\n  Printf.printf \"%d\\n\" @@ Array.fold_left ( + ) 0 @@ Array.map (fun a -> a - 1) as_\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given N positive integers a_1, a_2, ..., a_N.\n\nFor a non-negative integer m, let f(m) = (m\\ mod\\ a_1) + (m\\ mod\\ a_2) + ... + (m\\ mod\\ a_N).\n\nHere, X\\ mod\\ Y denotes the remainder of the division of X by Y.\n\nFind the maximum value of f.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 3000\n\n2 \\leq a_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum value of f.\n\nSample Input 1\n\n3\n3 4 6\n\nSample Output 1\n\n10\n\nf(11) = (11\\ mod\\ 3) + (11\\ mod\\ 4) + (11\\ mod\\ 6) = 10 is the maximum value of f.\n\nSample Input 2\n\n5\n7 46 11 20 11\n\nSample Output 2\n\n90\n\nSample Input 3\n\n7\n994 518 941 851 647 2 581\n\nSample Output 3\n\n4527", "sample_input": "3\n3 4 6\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03294", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given N positive integers a_1, a_2, ..., a_N.\n\nFor a non-negative integer m, let f(m) = (m\\ mod\\ a_1) + (m\\ mod\\ a_2) + ... + (m\\ mod\\ a_N).\n\nHere, X\\ mod\\ Y denotes the remainder of the division of X by Y.\n\nFind the maximum value of f.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 3000\n\n2 \\leq a_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum value of f.\n\nSample Input 1\n\n3\n3 4 6\n\nSample Output 1\n\n10\n\nf(11) = (11\\ mod\\ 3) + (11\\ mod\\ 4) + (11\\ mod\\ 6) = 10 is the maximum value of f.\n\nSample Input 2\n\n5\n7 46 11 20 11\n\nSample Output 2\n\n90\n\nSample Input 3\n\n7\n994 518 941 851 647 2 581\n\nSample Output 3\n\n4527", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 202, "cpu_time_ms": 2, "memory_kb": 1152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s937724551", "group_id": "codeNet:p03294", "input_text": "open Scanf\nopen Printf\n\nlet rec scan_list = function\n  | 1 -> scanf \"%d\" (fun k -> [k])\n  | n -> scanf \"%d \" (fun k -> k :: scan_list (n-1))\n\nlet rec gcd a b = if b = 0\n  then a\n  else gcd b (a mod b)\n\nlet lcm a b = a * (b / (gcd a b))\n\nlet f a m = List.fold_left ( + ) 0 (List.map (fun x -> m mod x) a)\n\nlet rec search lst m = function\n  | 0 -> m\n  | n -> search lst (max m (f lst n)) (n-1)\n\nlet () = let lst = scanf \"%d\\n\" scan_list in\n  printf \"%d\\n\" (search lst 0 (List.fold_left lcm 1 lst))", "language": "OCaml", "metadata": {"date": 1532224375, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s937724551.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s937724551", "user_id": "u379439911"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet rec scan_list = function\n  | 1 -> scanf \"%d\" (fun k -> [k])\n  | n -> scanf \"%d \" (fun k -> k :: scan_list (n-1))\n\nlet rec gcd a b = if b = 0\n  then a\n  else gcd b (a mod b)\n\nlet lcm a b = a * (b / (gcd a b))\n\nlet f a m = List.fold_left ( + ) 0 (List.map (fun x -> m mod x) a)\n\nlet rec search lst m = function\n  | 0 -> m\n  | n -> search lst (max m (f lst n)) (n-1)\n\nlet () = let lst = scanf \"%d\\n\" scan_list in\n  printf \"%d\\n\" (search lst 0 (List.fold_left lcm 1 lst))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given N positive integers a_1, a_2, ..., a_N.\n\nFor a non-negative integer m, let f(m) = (m\\ mod\\ a_1) + (m\\ mod\\ a_2) + ... + (m\\ mod\\ a_N).\n\nHere, X\\ mod\\ Y denotes the remainder of the division of X by Y.\n\nFind the maximum value of f.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 3000\n\n2 \\leq a_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum value of f.\n\nSample Input 1\n\n3\n3 4 6\n\nSample Output 1\n\n10\n\nf(11) = (11\\ mod\\ 3) + (11\\ mod\\ 4) + (11\\ mod\\ 6) = 10 is the maximum value of f.\n\nSample Input 2\n\n5\n7 46 11 20 11\n\nSample Output 2\n\n90\n\nSample Input 3\n\n7\n994 518 941 851 647 2 581\n\nSample Output 3\n\n4527", "sample_input": "3\n3 4 6\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03294", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given N positive integers a_1, a_2, ..., a_N.\n\nFor a non-negative integer m, let f(m) = (m\\ mod\\ a_1) + (m\\ mod\\ a_2) + ... + (m\\ mod\\ a_N).\n\nHere, X\\ mod\\ Y denotes the remainder of the division of X by Y.\n\nFind the maximum value of f.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 3000\n\n2 \\leq a_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum value of f.\n\nSample Input 1\n\n3\n3 4 6\n\nSample Output 1\n\n10\n\nf(11) = (11\\ mod\\ 3) + (11\\ mod\\ 4) + (11\\ mod\\ 6) = 10 is the maximum value of f.\n\nSample Input 2\n\n5\n7 46 11 20 11\n\nSample Output 2\n\n90\n\nSample Input 3\n\n7\n994 518 941 851 647 2 581\n\nSample Output 3\n\n4527", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 495, "cpu_time_ms": 2103, "memory_kb": 5248}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s937186045", "group_id": "codeNet:p03294", "input_text": "open Scanf\nopen Printf\n\nlet rec scan_list = function\n  | 1 -> scanf \"%d\" (fun k -> [k])\n  | n -> scanf \"%d \" (fun k -> k :: scan_list (n-1))\n\nlet rec gcd a b = if b = 0\n  then a\n  else gcd b (a mod b)\n\nlet lcm a b = a * (b / (gcd a b))\n\nlet rec seq = function\n  | 0 -> []\n  | n -> n :: seq (n-1)\n\nlet f a m = List.fold_left ( + ) 0 (List.map (fun x -> m mod x) a)\n\nlet () = let lst = scanf \"%d\\n\" scan_list in\n  printf \"%d\\n\" (List.fold_left max 0 (List.map (f lst) (seq @@ List.fold_left lcm 1 lst)))", "language": "OCaml", "metadata": {"date": 1532223714, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s937186045.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s937186045", "user_id": "u379439911"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet rec scan_list = function\n  | 1 -> scanf \"%d\" (fun k -> [k])\n  | n -> scanf \"%d \" (fun k -> k :: scan_list (n-1))\n\nlet rec gcd a b = if b = 0\n  then a\n  else gcd b (a mod b)\n\nlet lcm a b = a * (b / (gcd a b))\n\nlet rec seq = function\n  | 0 -> []\n  | n -> n :: seq (n-1)\n\nlet f a m = List.fold_left ( + ) 0 (List.map (fun x -> m mod x) a)\n\nlet () = let lst = scanf \"%d\\n\" scan_list in\n  printf \"%d\\n\" (List.fold_left max 0 (List.map (f lst) (seq @@ List.fold_left lcm 1 lst)))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given N positive integers a_1, a_2, ..., a_N.\n\nFor a non-negative integer m, let f(m) = (m\\ mod\\ a_1) + (m\\ mod\\ a_2) + ... + (m\\ mod\\ a_N).\n\nHere, X\\ mod\\ Y denotes the remainder of the division of X by Y.\n\nFind the maximum value of f.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 3000\n\n2 \\leq a_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum value of f.\n\nSample Input 1\n\n3\n3 4 6\n\nSample Output 1\n\n10\n\nf(11) = (11\\ mod\\ 3) + (11\\ mod\\ 4) + (11\\ mod\\ 6) = 10 is the maximum value of f.\n\nSample Input 2\n\n5\n7 46 11 20 11\n\nSample Output 2\n\n90\n\nSample Input 3\n\n7\n994 518 941 851 647 2 581\n\nSample Output 3\n\n4527", "sample_input": "3\n3 4 6\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03294", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given N positive integers a_1, a_2, ..., a_N.\n\nFor a non-negative integer m, let f(m) = (m\\ mod\\ a_1) + (m\\ mod\\ a_2) + ... + (m\\ mod\\ a_N).\n\nHere, X\\ mod\\ Y denotes the remainder of the division of X by Y.\n\nFind the maximum value of f.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 3000\n\n2 \\leq a_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum value of f.\n\nSample Input 1\n\n3\n3 4 6\n\nSample Output 1\n\n10\n\nf(11) = (11\\ mod\\ 3) + (11\\ mod\\ 4) + (11\\ mod\\ 6) = 10 is the maximum value of f.\n\nSample Input 2\n\n5\n7 46 11 20 11\n\nSample Output 2\n\n90\n\nSample Input 3\n\n7\n994 518 941 851 647 2 581\n\nSample Output 3\n\n4527", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 501, "cpu_time_ms": 129, "memory_kb": 264576}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s476913059", "group_id": "codeNet:p03294", "input_text": "let rec gcd n m =\n  if m = 0 then n\n  else gcd m (n mod m)\n\nlet lcm n m = n / gcd n m * m\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ = Array.init n @@ fun _ ->\n    Scanf.scanf \"%d \" @@ fun a -> a in\n  let lcm = Array.fold_left lcm 1 as_ in\n  Printf.printf \"%d\\n\" @@ Array.fold_left ( + ) 0 @@ Array.map (fun a -> (lcm - 1) mod a) as_\n\n", "language": "OCaml", "metadata": {"date": 1532222115, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s476913059.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s476913059", "user_id": "u504158101"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let rec gcd n m =\n  if m = 0 then n\n  else gcd m (n mod m)\n\nlet lcm n m = n / gcd n m * m\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ = Array.init n @@ fun _ ->\n    Scanf.scanf \"%d \" @@ fun a -> a in\n  let lcm = Array.fold_left lcm 1 as_ in\n  Printf.printf \"%d\\n\" @@ Array.fold_left ( + ) 0 @@ Array.map (fun a -> (lcm - 1) mod a) as_\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given N positive integers a_1, a_2, ..., a_N.\n\nFor a non-negative integer m, let f(m) = (m\\ mod\\ a_1) + (m\\ mod\\ a_2) + ... + (m\\ mod\\ a_N).\n\nHere, X\\ mod\\ Y denotes the remainder of the division of X by Y.\n\nFind the maximum value of f.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 3000\n\n2 \\leq a_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum value of f.\n\nSample Input 1\n\n3\n3 4 6\n\nSample Output 1\n\n10\n\nf(11) = (11\\ mod\\ 3) + (11\\ mod\\ 4) + (11\\ mod\\ 6) = 10 is the maximum value of f.\n\nSample Input 2\n\n5\n7 46 11 20 11\n\nSample Output 2\n\n90\n\nSample Input 3\n\n7\n994 518 941 851 647 2 581\n\nSample Output 3\n\n4527", "sample_input": "3\n3 4 6\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03294", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given N positive integers a_1, a_2, ..., a_N.\n\nFor a non-negative integer m, let f(m) = (m\\ mod\\ a_1) + (m\\ mod\\ a_2) + ... + (m\\ mod\\ a_N).\n\nHere, X\\ mod\\ Y denotes the remainder of the division of X by Y.\n\nFind the maximum value of f.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 3000\n\n2 \\leq a_i \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum value of f.\n\nSample Input 1\n\n3\n3 4 6\n\nSample Output 1\n\n10\n\nf(11) = (11\\ mod\\ 3) + (11\\ mod\\ 4) + (11\\ mod\\ 6) = 10 is the maximum value of f.\n\nSample Input 2\n\n5\n7 46 11 20 11\n\nSample Output 2\n\n90\n\nSample Input 3\n\n7\n994 518 941 851 647 2 581\n\nSample Output 3\n\n4527", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 343, "cpu_time_ms": 3, "memory_kb": 2688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s751111818", "group_id": "codeNet:p03297", "input_text": "open Scanf\nopen Printf\n\nlet consume c b x = if x <= c\n  then x - b\n  else if (x - c) mod b = 0\n  then c\n  else c + (x - c) mod b - b\n\nlet f a b c d = let arr = Array.make (c+1) false in\n  let rec g n x = if x < 0\n    then printf \"No\\n\"\n    else if n < 0 || arr.(x)\n    then printf \"Yes\\n\"\n    else (arr.(x) <- true; g (n-1) (consume c b (x+d)))\n  in g c (consume c b a)\n\nlet () = scanf \"%d\\n\" (fun c ->\n  for i = 1 to c do\n    scanf \"%d %d %d %d\\n\" f\n  done)", "language": "OCaml", "metadata": {"date": 1532244868, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03297.html", "problem_id": "p03297", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03297/input.txt", "sample_output_relpath": "derived/input_output/data/p03297/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03297/OCaml/s751111818.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s751111818", "user_id": "u379439911"}, "prompt_components": {"gold_output": "No\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet consume c b x = if x <= c\n  then x - b\n  else if (x - c) mod b = 0\n  then c\n  else c + (x - c) mod b - b\n\nlet f a b c d = let arr = Array.make (c+1) false in\n  let rec g n x = if x < 0\n    then printf \"No\\n\"\n    else if n < 0 || arr.(x)\n    then printf \"Yes\\n\"\n    else (arr.(x) <- true; g (n-1) (consume c b (x+d)))\n  in g c (consume c b a)\n\nlet () = scanf \"%d\\n\" (fun c ->\n  for i = 1 to c do\n    scanf \"%d %d %d %d\\n\" f\n  done)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nRingo Mart, a convenience store, sells apple juice.\n\nOn the opening day of Ringo Mart, there were A cans of juice in stock in the morning.\nSnuke buys B cans of juice here every day in the daytime.\nThen, the manager checks the number of cans of juice remaining in stock every night.\nIf there are C or less cans, D new cans will be added to the stock by the next morning.\n\nDetermine if Snuke can buy juice indefinitely, that is, there is always B or more cans of juice in stock when he attempts to buy them.\nNobody besides Snuke buy juice at this store.\n\nNote that each test case in this problem consists of T queries.\n\nConstraints\n\n1 \\leq T \\leq 300\n\n1 \\leq A, B, C, D \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\nA_1 B_1 C_1 D_1\nA_2 B_2 C_2 D_2\n:\nA_T B_T C_T D_T\n\nIn the i-th query, A = A_i, B = B_i, C = C_i, D = D_i.\n\nOutput\n\nPrint T lines. The i-th line should contain Yes if Snuke can buy apple juice indefinitely in the i-th query; No otherwise.\n\nSample Input 1\n\n14\n9 7 5 9\n9 7 6 9\n14 10 7 12\n14 10 8 12\n14 10 9 12\n14 10 7 11\n14 10 8 11\n14 10 9 11\n9 10 5 10\n10 10 5 10\n11 10 5 10\n16 10 5 10\n1000000000000000000 17 14 999999999999999985\n1000000000000000000 17 15 999999999999999985\n\nSample Output 1\n\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n\nIn the first query, the number of cans of juice in stock changes as follows: (D represents daytime and N represents night.)\n\n9\n→D 2\n→N 11\n→D 4\n→N 13\n→D 6\n→N 6\n→D x\n\nIn the second query, the number of cans of juice in stock changes as follows:\n\n9\n→D 2\n→N 11\n→D 4\n→N 13\n→D 6\n→N 15\n→D 8\n→N 8\n→D 1\n→N 10\n→D 3\n→N 12\n→D 5\n→N 14\n→D 7\n→N 7\n→D 0\n→N 9\n→D 2\n→N 11\n→D …\n\nand so on, thus Snuke can buy juice indefinitely.\n\nSample Input 2\n\n24\n1 2 3 4\n1 2 4 3\n1 3 2 4\n1 3 4 2\n1 4 2 3\n1 4 3 2\n2 1 3 4\n2 1 4 3\n2 3 1 4\n2 3 4 1\n2 4 1 3\n2 4 3 1\n3 1 2 4\n3 1 4 2\n3 2 1 4\n3 2 4 1\n3 4 1 2\n3 4 2 1\n4 1 2 3\n4 1 3 2\n4 2 1 3\n4 2 3 1\n4 3 1 2\n4 3 2 1\n\nSample Output 2\n\nNo\nNo\nNo\nNo\nNo\nNo\nYes\nYes\nNo\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo", "sample_input": "14\n9 7 5 9\n9 7 6 9\n14 10 7 12\n14 10 8 12\n14 10 9 12\n14 10 7 11\n14 10 8 11\n14 10 9 11\n9 10 5 10\n10 10 5 10\n11 10 5 10\n16 10 5 10\n1000000000000000000 17 14 999999999999999985\n1000000000000000000 17 15 999999999999999985\n"}, "reference_outputs": ["No\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n"], "source_document_id": "p03297", "source_text": "Score : 600 points\n\nProblem Statement\n\nRingo Mart, a convenience store, sells apple juice.\n\nOn the opening day of Ringo Mart, there were A cans of juice in stock in the morning.\nSnuke buys B cans of juice here every day in the daytime.\nThen, the manager checks the number of cans of juice remaining in stock every night.\nIf there are C or less cans, D new cans will be added to the stock by the next morning.\n\nDetermine if Snuke can buy juice indefinitely, that is, there is always B or more cans of juice in stock when he attempts to buy them.\nNobody besides Snuke buy juice at this store.\n\nNote that each test case in this problem consists of T queries.\n\nConstraints\n\n1 \\leq T \\leq 300\n\n1 \\leq A, B, C, D \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\nA_1 B_1 C_1 D_1\nA_2 B_2 C_2 D_2\n:\nA_T B_T C_T D_T\n\nIn the i-th query, A = A_i, B = B_i, C = C_i, D = D_i.\n\nOutput\n\nPrint T lines. The i-th line should contain Yes if Snuke can buy apple juice indefinitely in the i-th query; No otherwise.\n\nSample Input 1\n\n14\n9 7 5 9\n9 7 6 9\n14 10 7 12\n14 10 8 12\n14 10 9 12\n14 10 7 11\n14 10 8 11\n14 10 9 11\n9 10 5 10\n10 10 5 10\n11 10 5 10\n16 10 5 10\n1000000000000000000 17 14 999999999999999985\n1000000000000000000 17 15 999999999999999985\n\nSample Output 1\n\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n\nIn the first query, the number of cans of juice in stock changes as follows: (D represents daytime and N represents night.)\n\n9\n→D 2\n→N 11\n→D 4\n→N 13\n→D 6\n→N 6\n→D x\n\nIn the second query, the number of cans of juice in stock changes as follows:\n\n9\n→D 2\n→N 11\n→D 4\n→N 13\n→D 6\n→N 15\n→D 8\n→N 8\n→D 1\n→N 10\n→D 3\n→N 12\n→D 5\n→N 14\n→D 7\n→N 7\n→D 0\n→N 9\n→D 2\n→N 11\n→D …\n\nand so on, thus Snuke can buy juice indefinitely.\n\nSample Input 2\n\n24\n1 2 3 4\n1 2 4 3\n1 3 2 4\n1 3 4 2\n1 4 2 3\n1 4 3 2\n2 1 3 4\n2 1 4 3\n2 3 1 4\n2 3 4 1\n2 4 1 3\n2 4 3 1\n3 1 2 4\n3 1 4 2\n3 2 1 4\n3 2 4 1\n3 4 1 2\n3 4 2 1\n4 1 2 3\n4 1 3 2\n4 2 1 3\n4 2 3 1\n4 3 1 2\n4 3 2 1\n\nSample Output 2\n\nNo\nNo\nNo\nNo\nNo\nNo\nYes\nYes\nNo\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 458, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s596548700", "group_id": "codeNet:p03297", "input_text": "module Int64Set = Set.Make (Int64)\n\nlet rec solve aset a b c d =\n  let ( + ) = Int64.add in\n  let ( - ) = Int64.sub in\n  let ( mod ) = Int64.rem in\n  if a < b then \"No\"\n  else if Int64Set.mem a aset then \"Yes\"\n  else if a - b <= c then\n    if d = b then \"Yes\"\n    else if d < b then \"No\"\n    else solve (Int64Set.add a aset) (d + c - (c + b - a) mod (d - b)) b c d\n  else\n    solve (Int64Set.add a aset) (c + if (a - c) mod b = 0L then b else (a - c) mod b) b c d\nlet solve = solve Int64Set.empty\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun t ->\n  for i = 0 to t - 1 do\n    Scanf.scanf \"%d %d %d %d\\n\" @@ fun a b c d ->\n      print_endline @@\n      solve (Int64.of_int a) (Int64.of_int b) (Int64.of_int c) (Int64.of_int d)\n  done\n\n", "language": "OCaml", "metadata": {"date": 1531625875, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03297.html", "problem_id": "p03297", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03297/input.txt", "sample_output_relpath": "derived/input_output/data/p03297/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03297/OCaml/s596548700.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s596548700", "user_id": "u504158101"}, "prompt_components": {"gold_output": "No\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n", "input_to_evaluate": "module Int64Set = Set.Make (Int64)\n\nlet rec solve aset a b c d =\n  let ( + ) = Int64.add in\n  let ( - ) = Int64.sub in\n  let ( mod ) = Int64.rem in\n  if a < b then \"No\"\n  else if Int64Set.mem a aset then \"Yes\"\n  else if a - b <= c then\n    if d = b then \"Yes\"\n    else if d < b then \"No\"\n    else solve (Int64Set.add a aset) (d + c - (c + b - a) mod (d - b)) b c d\n  else\n    solve (Int64Set.add a aset) (c + if (a - c) mod b = 0L then b else (a - c) mod b) b c d\nlet solve = solve Int64Set.empty\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun t ->\n  for i = 0 to t - 1 do\n    Scanf.scanf \"%d %d %d %d\\n\" @@ fun a b c d ->\n      print_endline @@\n      solve (Int64.of_int a) (Int64.of_int b) (Int64.of_int c) (Int64.of_int d)\n  done\n\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nRingo Mart, a convenience store, sells apple juice.\n\nOn the opening day of Ringo Mart, there were A cans of juice in stock in the morning.\nSnuke buys B cans of juice here every day in the daytime.\nThen, the manager checks the number of cans of juice remaining in stock every night.\nIf there are C or less cans, D new cans will be added to the stock by the next morning.\n\nDetermine if Snuke can buy juice indefinitely, that is, there is always B or more cans of juice in stock when he attempts to buy them.\nNobody besides Snuke buy juice at this store.\n\nNote that each test case in this problem consists of T queries.\n\nConstraints\n\n1 \\leq T \\leq 300\n\n1 \\leq A, B, C, D \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\nA_1 B_1 C_1 D_1\nA_2 B_2 C_2 D_2\n:\nA_T B_T C_T D_T\n\nIn the i-th query, A = A_i, B = B_i, C = C_i, D = D_i.\n\nOutput\n\nPrint T lines. The i-th line should contain Yes if Snuke can buy apple juice indefinitely in the i-th query; No otherwise.\n\nSample Input 1\n\n14\n9 7 5 9\n9 7 6 9\n14 10 7 12\n14 10 8 12\n14 10 9 12\n14 10 7 11\n14 10 8 11\n14 10 9 11\n9 10 5 10\n10 10 5 10\n11 10 5 10\n16 10 5 10\n1000000000000000000 17 14 999999999999999985\n1000000000000000000 17 15 999999999999999985\n\nSample Output 1\n\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n\nIn the first query, the number of cans of juice in stock changes as follows: (D represents daytime and N represents night.)\n\n9\n→D 2\n→N 11\n→D 4\n→N 13\n→D 6\n→N 6\n→D x\n\nIn the second query, the number of cans of juice in stock changes as follows:\n\n9\n→D 2\n→N 11\n→D 4\n→N 13\n→D 6\n→N 15\n→D 8\n→N 8\n→D 1\n→N 10\n→D 3\n→N 12\n→D 5\n→N 14\n→D 7\n→N 7\n→D 0\n→N 9\n→D 2\n→N 11\n→D …\n\nand so on, thus Snuke can buy juice indefinitely.\n\nSample Input 2\n\n24\n1 2 3 4\n1 2 4 3\n1 3 2 4\n1 3 4 2\n1 4 2 3\n1 4 3 2\n2 1 3 4\n2 1 4 3\n2 3 1 4\n2 3 4 1\n2 4 1 3\n2 4 3 1\n3 1 2 4\n3 1 4 2\n3 2 1 4\n3 2 4 1\n3 4 1 2\n3 4 2 1\n4 1 2 3\n4 1 3 2\n4 2 1 3\n4 2 3 1\n4 3 1 2\n4 3 2 1\n\nSample Output 2\n\nNo\nNo\nNo\nNo\nNo\nNo\nYes\nYes\nNo\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo", "sample_input": "14\n9 7 5 9\n9 7 6 9\n14 10 7 12\n14 10 8 12\n14 10 9 12\n14 10 7 11\n14 10 8 11\n14 10 9 11\n9 10 5 10\n10 10 5 10\n11 10 5 10\n16 10 5 10\n1000000000000000000 17 14 999999999999999985\n1000000000000000000 17 15 999999999999999985\n"}, "reference_outputs": ["No\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n"], "source_document_id": "p03297", "source_text": "Score : 600 points\n\nProblem Statement\n\nRingo Mart, a convenience store, sells apple juice.\n\nOn the opening day of Ringo Mart, there were A cans of juice in stock in the morning.\nSnuke buys B cans of juice here every day in the daytime.\nThen, the manager checks the number of cans of juice remaining in stock every night.\nIf there are C or less cans, D new cans will be added to the stock by the next morning.\n\nDetermine if Snuke can buy juice indefinitely, that is, there is always B or more cans of juice in stock when he attempts to buy them.\nNobody besides Snuke buy juice at this store.\n\nNote that each test case in this problem consists of T queries.\n\nConstraints\n\n1 \\leq T \\leq 300\n\n1 \\leq A, B, C, D \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nT\nA_1 B_1 C_1 D_1\nA_2 B_2 C_2 D_2\n:\nA_T B_T C_T D_T\n\nIn the i-th query, A = A_i, B = B_i, C = C_i, D = D_i.\n\nOutput\n\nPrint T lines. The i-th line should contain Yes if Snuke can buy apple juice indefinitely in the i-th query; No otherwise.\n\nSample Input 1\n\n14\n9 7 5 9\n9 7 6 9\n14 10 7 12\n14 10 8 12\n14 10 9 12\n14 10 7 11\n14 10 8 11\n14 10 9 11\n9 10 5 10\n10 10 5 10\n11 10 5 10\n16 10 5 10\n1000000000000000000 17 14 999999999999999985\n1000000000000000000 17 15 999999999999999985\n\nSample Output 1\n\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n\nIn the first query, the number of cans of juice in stock changes as follows: (D represents daytime and N represents night.)\n\n9\n→D 2\n→N 11\n→D 4\n→N 13\n→D 6\n→N 6\n→D x\n\nIn the second query, the number of cans of juice in stock changes as follows:\n\n9\n→D 2\n→N 11\n→D 4\n→N 13\n→D 6\n→N 15\n→D 8\n→N 8\n→D 1\n→N 10\n→D 3\n→N 12\n→D 5\n→N 14\n→D 7\n→N 7\n→D 0\n→N 9\n→D 2\n→N 11\n→D …\n\nand so on, thus Snuke can buy juice indefinitely.\n\nSample Input 2\n\n24\n1 2 3 4\n1 2 4 3\n1 3 2 4\n1 3 4 2\n1 4 2 3\n1 4 3 2\n2 1 3 4\n2 1 4 3\n2 3 1 4\n2 3 4 1\n2 4 1 3\n2 4 3 1\n3 1 2 4\n3 1 4 2\n3 2 1 4\n3 2 4 1\n3 4 1 2\n3 4 2 1\n4 1 2 3\n4 1 3 2\n4 2 1 3\n4 2 3 1\n4 3 1 2\n4 3 2 1\n\nSample Output 2\n\nNo\nNo\nNo\nNo\nNo\nNo\nYes\nYes\nNo\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 723, "cpu_time_ms": 2107, "memory_kb": 196680}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s077595605", "group_id": "codeNet:p03298", "input_text": "module Memo = Map.Make(struct\n  type t = string * string\n  let compare = compare\nend)\nlet str_of_list xs = List.fold_left (fun s c -> s ^ String.make 1 c) \"\" xs\nlet pow_str s f =\n  let len = String.length s in\n  let rec loop idx a b =\n    if idx >= len then [(str_of_list (f a), str_of_list (f b))]\n    else loop (idx+1) (s.[idx]::a) b @ loop (idx+1) a (s.[idx]::b)\n  in loop 0 [] []\nlet () =\n  Scanf.scanf \"%d %s\" @@ fun n s ->\n  let s0, s1 = String.(sub s 0 n, sub s n n) in\n  let memo = pow_str s0 (fun x -> x) |> List.fold_left (fun m p ->\n    try let v = Memo.find p m in Memo.add p (v+1) m\n    with Not_found -> Memo.add p 1 m) Memo.empty\n  in\n  pow_str s1 List.rev |> List.fold_left (fun s p ->\n    try let v = Memo.find p memo in s + v\n    with Not_found -> s) 0\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1531644003, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03298.html", "problem_id": "p03298", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03298/input.txt", "sample_output_relpath": "derived/input_output/data/p03298/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03298/OCaml/s077595605.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s077595605", "user_id": "u798181098"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "module Memo = Map.Make(struct\n  type t = string * string\n  let compare = compare\nend)\nlet str_of_list xs = List.fold_left (fun s c -> s ^ String.make 1 c) \"\" xs\nlet pow_str s f =\n  let len = String.length s in\n  let rec loop idx a b =\n    if idx >= len then [(str_of_list (f a), str_of_list (f b))]\n    else loop (idx+1) (s.[idx]::a) b @ loop (idx+1) a (s.[idx]::b)\n  in loop 0 [] []\nlet () =\n  Scanf.scanf \"%d %s\" @@ fun n s ->\n  let s0, s1 = String.(sub s 0 n, sub s n n) in\n  let memo = pow_str s0 (fun x -> x) |> List.fold_left (fun m p ->\n    try let v = Memo.find p m in Memo.add p (v+1) m\n    with Not_found -> Memo.add p 1 m) Memo.empty\n  in\n  pow_str s1 List.rev |> List.fold_left (fun s p ->\n    try let v = Memo.find p memo in s + v\n    with Not_found -> s) 0\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a string S of length 2N consisting of lowercase English letters.\n\nThere are 2^{2N} ways to color each character in S red or blue. Among these ways, how many satisfy the following condition?\n\nThe string obtained by reading the characters painted red from left to right is equal to the string obtained by reading the characters painted blue from right to left.\n\nConstraints\n\n1 \\leq N \\leq 18\n\nThe length of S is 2N.\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of ways to paint the string that satisfy the condition.\n\nSample Input 1\n\n4\ncabaacba\n\nSample Output 1\n\n4\n\nThere are four ways to paint the string, as follows:\n\ncabaacba\n\ncabaacba\n\ncabaacba\n\ncabaacba\n\nSample Input 2\n\n11\nmippiisssisssiipsspiim\n\nSample Output 2\n\n504\n\nSample Input 3\n\n4\nabcdefgh\n\nSample Output 3\n\n0\n\nSample Input 4\n\n18\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n\nSample Output 4\n\n9075135300\n\nThe answer may not be representable as a 32-bit integer.", "sample_input": "4\ncabaacba\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03298", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a string S of length 2N consisting of lowercase English letters.\n\nThere are 2^{2N} ways to color each character in S red or blue. Among these ways, how many satisfy the following condition?\n\nThe string obtained by reading the characters painted red from left to right is equal to the string obtained by reading the characters painted blue from right to left.\n\nConstraints\n\n1 \\leq N \\leq 18\n\nThe length of S is 2N.\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of ways to paint the string that satisfy the condition.\n\nSample Input 1\n\n4\ncabaacba\n\nSample Output 1\n\n4\n\nThere are four ways to paint the string, as follows:\n\ncabaacba\n\ncabaacba\n\ncabaacba\n\ncabaacba\n\nSample Input 2\n\n11\nmippiisssisssiipsspiim\n\nSample Output 2\n\n504\n\nSample Input 3\n\n4\nabcdefgh\n\nSample Output 3\n\n0\n\nSample Input 4\n\n18\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n\nSample Output 4\n\n9075135300\n\nThe answer may not be representable as a 32-bit integer.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 796, "cpu_time_ms": 1936, "memory_kb": 75000}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s816748811", "group_id": "codeNet:p03303", "input_text": "let s = read_line ()\nlet w = read_int ()\nlet _ = String.iteri (fun i c -> if i mod w = 0 then print_char c) s; print_newline ()", "language": "OCaml", "metadata": {"date": 1569485554, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s816748811.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s816748811", "user_id": "u732304692"}, "prompt_components": {"gold_output": "adg\n", "input_to_evaluate": "let s = read_line ()\nlet w = read_int ()\nlet _ = String.iteri (fun i c -> if i mod w = 0 then print_char c) s; print_newline ()", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nWe will write down this string, starting a new line after every w letters. Print the string obtained by concatenating the letters at the beginnings of these lines from top to bottom.\n\nConstraints\n\n1 \\leq w \\leq |S| \\leq 1000\n\nS consists of lowercase English letters.\n\nw is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nw\n\nOutput\n\nPrint the desired string in one line.\n\nSample Input 1\n\nabcdefgh\n3\n\nSample Output 1\n\nadg\n\nWhen we write down abcdefgh, starting a new line after every three letters, we get the following:\n\nabc\n\ndef\n\ngh\n\nConcatenating the letters at the beginnings of these lines, we obtain adg.\n\nSample Input 2\n\nlllll\n1\n\nSample Output 2\n\nlllll\n\nSample Input 3\n\nsouuundhound\n2\n\nSample Output 3\n\nsuudon", "sample_input": "abcdefgh\n3\n"}, "reference_outputs": ["adg\n"], "source_document_id": "p03303", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nWe will write down this string, starting a new line after every w letters. Print the string obtained by concatenating the letters at the beginnings of these lines from top to bottom.\n\nConstraints\n\n1 \\leq w \\leq |S| \\leq 1000\n\nS consists of lowercase English letters.\n\nw is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nw\n\nOutput\n\nPrint the desired string in one line.\n\nSample Input 1\n\nabcdefgh\n3\n\nSample Output 1\n\nadg\n\nWhen we write down abcdefgh, starting a new line after every three letters, we get the following:\n\nabc\n\ndef\n\ngh\n\nConcatenating the letters at the beginnings of these lines, we obtain adg.\n\nSample Input 2\n\nlllll\n1\n\nSample Output 2\n\nlllll\n\nSample Input 3\n\nsouuundhound\n2\n\nSample Output 3\n\nsuudon", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 127, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s197561158", "group_id": "codeNet:p03304", "input_text": "let () = Scanf.scanf \"%d %d %d\" @@ fun n m d ->\n  if n - d < 1 then\n    print_endline \"0.0\"\n  else if d = 0 then\n    Printf.printf \"%.10f\\n\" @@ float_of_int (n - d) /. float_of_int (n * n) *. float_of_int (m - 1)\n  else\n    Printf.printf \"%.10f\\n\" @@ 2. *. float_of_int (n - d) /. float_of_int (n * n) *. float_of_int (m - 1)\n", "language": "OCaml", "metadata": {"date": 1531015305, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s197561158.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s197561158", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1.0000000000\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" @@ fun n m d ->\n  if n - d < 1 then\n    print_endline \"0.0\"\n  else if d = 0 then\n    Printf.printf \"%.10f\\n\" @@ float_of_int (n - d) /. float_of_int (n * n) *. float_of_int (m - 1)\n  else\n    Printf.printf \"%.10f\\n\" @@ 2. *. float_of_int (n - d) /. float_of_int (n * n) *. float_of_int (m - 1)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nLet us define the beauty of a sequence (a_1,... ,a_n) as the number of pairs of two adjacent elements in it whose absolute differences are d.\nFor example, when d=1, the beauty of the sequence (3, 2, 3, 10, 9) is 3.\n\nThere are a total of n^m sequences of length m where each element is an integer between 1 and n (inclusive).\nFind the beauty of each of these n^m sequences, and print the average of those values.\n\nConstraints\n\n0 \\leq d < n \\leq 10^9\n\n2 \\leq m \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m d\n\nOutput\n\nPrint the average of the beauties of the sequences of length m where each element is an integer between 1 and n.\nThe output will be judged correct if the absolute or relative error is at most 10^{-6}.\n\nSample Input 1\n\n2 3 1\n\nSample Output 1\n\n1.0000000000\n\nThe beauty of (1,1,1) is 0.\n\nThe beauty of (1,1,2) is 1.\n\nThe beauty of (1,2,1) is 2.\n\nThe beauty of (1,2,2) is 1.\n\nThe beauty of (2,1,1) is 1.\n\nThe beauty of (2,1,2) is 2.\n\nThe beauty of (2,2,1) is 1.\n\nThe beauty of (2,2,2) is 0.\n\nThe answer is the average of these values: (0+1+2+1+1+2+1+0)/8=1.\n\nSample Input 2\n\n1000000000 180707 0\n\nSample Output 2\n\n0.0001807060", "sample_input": "2 3 1\n"}, "reference_outputs": ["1.0000000000\n"], "source_document_id": "p03304", "source_text": "Score : 300 points\n\nProblem Statement\n\nLet us define the beauty of a sequence (a_1,... ,a_n) as the number of pairs of two adjacent elements in it whose absolute differences are d.\nFor example, when d=1, the beauty of the sequence (3, 2, 3, 10, 9) is 3.\n\nThere are a total of n^m sequences of length m where each element is an integer between 1 and n (inclusive).\nFind the beauty of each of these n^m sequences, and print the average of those values.\n\nConstraints\n\n0 \\leq d < n \\leq 10^9\n\n2 \\leq m \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m d\n\nOutput\n\nPrint the average of the beauties of the sequences of length m where each element is an integer between 1 and n.\nThe output will be judged correct if the absolute or relative error is at most 10^{-6}.\n\nSample Input 1\n\n2 3 1\n\nSample Output 1\n\n1.0000000000\n\nThe beauty of (1,1,1) is 0.\n\nThe beauty of (1,1,2) is 1.\n\nThe beauty of (1,2,1) is 2.\n\nThe beauty of (1,2,2) is 1.\n\nThe beauty of (2,1,1) is 1.\n\nThe beauty of (2,1,2) is 2.\n\nThe beauty of (2,2,1) is 1.\n\nThe beauty of (2,2,2) is 0.\n\nThe answer is the average of these values: (0+1+2+1+1+2+1+0)/8=1.\n\nSample Input 2\n\n1000000000 180707 0\n\nSample Output 2\n\n0.0001807060", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s832787774", "group_id": "codeNet:p03306", "input_text": "type t = FIN | ANS of int | ILL;;\n\nScanf.scanf \"%d %d\" (fun n m ->\n    let nei = Array.make n [] in\n    for i = 1 to m do\n        Scanf.scanf \" %d %d %d\" (fun u v s ->\n            let u = u - 1 in\n            let v = v - 1 in\n            nei.(u) <- (v, s) :: nei.(u);\n            nei.(v) <- (u, s) :: nei.(v);\n        )\n    done;\n\n    let dist = Array.make n (0, 0) in\n\n    let rec loop cur =\n        let (c, v) = dist.(cur) in\n        let rec loop2 = function\n            | [] -> FIN\n            | (nn, nc) :: tl ->\n                let mc, mv = nc - c, -v in\n                if dist.(nn) = (0, 0) then (\n                    dist.(nn) <- mc, mv;\n                    let ret = loop nn in\n                    if ret = FIN then loop2 tl else ret)\n                else (\n                    if dist.(nn) = (mc, mv) then loop2 tl else (\n                        let qc, qv = dist.(nn) in\n                        if mv = qv then ILL else\n                        if (qc - mc) mod (mv - qv) = 0 &&\n                            (qc - mc) / (mv - qv) > 0 then (\n                                ANS ((qc - mc) / (mv - qv))\n                            ) else ILL\n                    )\n                )\n        in\n        loop2 nei.(cur)\n    in\n\n    let single k =\n        let dist2 = Array.make n 0 in\n        let rec loop cur =\n            let c = dist2.(cur) in\n            let rec loop2 = function\n                | [] -> 1\n                | (nn, nc) :: tl ->\n                        let mc = nc - c in\n                        if mc <= 0 then 0 else (\n                            if dist2.(nn) = 0 then (\n                                dist2.(nn) <- mc;\n                                if loop nn = 1 then loop2 tl else 0\n                            ) else (\n                                if dist2.(nn) = mc then loop2 tl else 0\n                            )\n                        )\n            in\n            loop2 nei.(cur)\n        in\n        dist2.(0) <- k;\n        loop 0\n    in\n    let check dist =\n        let rec loop i l r =\n            if i = n then max 0 (r - l + 1) else\n                let (c, v) = dist.(i) in \n                if v = 1 then loop (i + 1) (max l (-c)) r\n                         else loop (i + 1) l (min r (c - 1))\n        in\n        loop 0 1 max_int\n    in\n\n    dist.(0) <- 0, 1;\n    match loop 0 with\n    | FIN   -> Printf.printf \"%d\\n\" @@ check dist\n    | ANS k -> Printf.printf \"%d\\n\" @@ single k\n    | ILL   -> Printf.printf \"0\\n\"\n)", "language": "OCaml", "metadata": {"date": 1590288916, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03306.html", "problem_id": "p03306", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03306/input.txt", "sample_output_relpath": "derived/input_output/data/p03306/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03306/OCaml/s832787774.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s832787774", "user_id": "u342443598"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "type t = FIN | ANS of int | ILL;;\n\nScanf.scanf \"%d %d\" (fun n m ->\n    let nei = Array.make n [] in\n    for i = 1 to m do\n        Scanf.scanf \" %d %d %d\" (fun u v s ->\n            let u = u - 1 in\n            let v = v - 1 in\n            nei.(u) <- (v, s) :: nei.(u);\n            nei.(v) <- (u, s) :: nei.(v);\n        )\n    done;\n\n    let dist = Array.make n (0, 0) in\n\n    let rec loop cur =\n        let (c, v) = dist.(cur) in\n        let rec loop2 = function\n            | [] -> FIN\n            | (nn, nc) :: tl ->\n                let mc, mv = nc - c, -v in\n                if dist.(nn) = (0, 0) then (\n                    dist.(nn) <- mc, mv;\n                    let ret = loop nn in\n                    if ret = FIN then loop2 tl else ret)\n                else (\n                    if dist.(nn) = (mc, mv) then loop2 tl else (\n                        let qc, qv = dist.(nn) in\n                        if mv = qv then ILL else\n                        if (qc - mc) mod (mv - qv) = 0 &&\n                            (qc - mc) / (mv - qv) > 0 then (\n                                ANS ((qc - mc) / (mv - qv))\n                            ) else ILL\n                    )\n                )\n        in\n        loop2 nei.(cur)\n    in\n\n    let single k =\n        let dist2 = Array.make n 0 in\n        let rec loop cur =\n            let c = dist2.(cur) in\n            let rec loop2 = function\n                | [] -> 1\n                | (nn, nc) :: tl ->\n                        let mc = nc - c in\n                        if mc <= 0 then 0 else (\n                            if dist2.(nn) = 0 then (\n                                dist2.(nn) <- mc;\n                                if loop nn = 1 then loop2 tl else 0\n                            ) else (\n                                if dist2.(nn) = mc then loop2 tl else 0\n                            )\n                        )\n            in\n            loop2 nei.(cur)\n        in\n        dist2.(0) <- k;\n        loop 0\n    in\n    let check dist =\n        let rec loop i l r =\n            if i = n then max 0 (r - l + 1) else\n                let (c, v) = dist.(i) in \n                if v = 1 then loop (i + 1) (max l (-c)) r\n                         else loop (i + 1) l (min r (c - 1))\n        in\n        loop 0 1 max_int\n    in\n\n    dist.(0) <- 0, 1;\n    match loop 0 with\n    | FIN   -> Printf.printf \"%d\\n\" @@ check dist\n    | ANS k -> Printf.printf \"%d\\n\" @@ single k\n    | ILL   -> Printf.printf \"0\\n\"\n)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nKenkoooo found a simple connected graph.\nThe vertices are numbered 1 through n.\nThe i-th edge connects Vertex u_i and v_i, and has a fixed integer s_i.\n\nKenkoooo is trying to write a positive integer in each vertex so that the following condition is satisfied:\n\nFor every edge i, the sum of the positive integers written in Vertex u_i and v_i is equal to s_i.\n\nFind the number of such ways to write positive integers in the vertices.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\n1 \\leq m \\leq 10^5\n\n1 \\leq u_i < v_i \\leq n\n\n2 \\leq s_i \\leq 10^9\n\nIf i\\neq j, then u_i \\neq u_j or v_i \\neq v_j.\n\nThe graph is connected.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m\nu_1 v_1 s_1\n:\nu_m v_m s_m\n\nOutput\n\nPrint the number of ways to write positive integers in the vertices so that the condition is satisfied.\n\nSample Input 1\n\n3 3\n1 2 3\n2 3 5\n1 3 4\n\nSample Output 1\n\n1\n\nThe condition will be satisfied if we write 1,2 and 3 in vertices 1,2 and 3, respectively.\nThere is no other way to satisfy the condition, so the answer is 1.\n\nSample Input 2\n\n4 3\n1 2 6\n2 3 7\n3 4 5\n\nSample Output 2\n\n3\n\nLet a,b,c and d be the numbers to write in vertices 1,2,3 and 4, respectively.\nThere are three quadruples (a,b,c,d) that satisfy the condition:\n\n(a,b,c,d)=(1,5,2,3)\n\n(a,b,c,d)=(2,4,3,2)\n\n(a,b,c,d)=(3,3,4,1)\n\nSample Input 3\n\n8 7\n1 2 1000000000\n2 3 2\n3 4 1000000000\n4 5 2\n5 6 1000000000\n6 7 2\n7 8 1000000000\n\nSample Output 3\n\n0", "sample_input": "3 3\n1 2 3\n2 3 5\n1 3 4\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03306", "source_text": "Score : 600 points\n\nProblem Statement\n\nKenkoooo found a simple connected graph.\nThe vertices are numbered 1 through n.\nThe i-th edge connects Vertex u_i and v_i, and has a fixed integer s_i.\n\nKenkoooo is trying to write a positive integer in each vertex so that the following condition is satisfied:\n\nFor every edge i, the sum of the positive integers written in Vertex u_i and v_i is equal to s_i.\n\nFind the number of such ways to write positive integers in the vertices.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\n1 \\leq m \\leq 10^5\n\n1 \\leq u_i < v_i \\leq n\n\n2 \\leq s_i \\leq 10^9\n\nIf i\\neq j, then u_i \\neq u_j or v_i \\neq v_j.\n\nThe graph is connected.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m\nu_1 v_1 s_1\n:\nu_m v_m s_m\n\nOutput\n\nPrint the number of ways to write positive integers in the vertices so that the condition is satisfied.\n\nSample Input 1\n\n3 3\n1 2 3\n2 3 5\n1 3 4\n\nSample Output 1\n\n1\n\nThe condition will be satisfied if we write 1,2 and 3 in vertices 1,2 and 3, respectively.\nThere is no other way to satisfy the condition, so the answer is 1.\n\nSample Input 2\n\n4 3\n1 2 6\n2 3 7\n3 4 5\n\nSample Output 2\n\n3\n\nLet a,b,c and d be the numbers to write in vertices 1,2,3 and 4, respectively.\nThere are three quadruples (a,b,c,d) that satisfy the condition:\n\n(a,b,c,d)=(1,5,2,3)\n\n(a,b,c,d)=(2,4,3,2)\n\n(a,b,c,d)=(3,3,4,1)\n\nSample Input 3\n\n8 7\n1 2 1000000000\n2 3 2\n3 4 1000000000\n4 5 2\n5 6 1000000000\n6 7 2\n7 8 1000000000\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2460, "cpu_time_ms": 164, "memory_kb": 27264}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s776550141", "group_id": "codeNet:p03309", "input_text": "let input_int_array n =\n\tArray.init n (fun _ -> Scanf.scanf \"%d \" (fun v -> v))\nlet get_int () = Scanf.scanf \"%d \" (fun v -> v)\n\nlet test a b =\n\tArray.fold_left (fun (u,i) v -> \n\t\tPrintf.printf \"  %d::abs(%d-(%d+%d))=%d\\n\"\n\t\t\ti v b i (abs (v-(b+i)))\n\t\t;\n\t\t(u + (abs (v - (b+i)))), i+1) (0,1) a\n\t|> fst \nlet min_listi ls = \n\tlet rec f0 i l v vi = match l with\n\t| [] -> (v,i) | h::t -> if (h < v) then f0 (i+1) t h i else f0 (i+1) t v vi\n\tin f0 0 ls max_int (-1)\n\nlet () =\n\tlet n = get_int ()\n\tin let a = input_int_array n\n\tin let a_cal b = Array.init n (fun i -> a.(i)-b-i-1)\n\tin let (m,mi) = min_listi (a|>Array.to_list)\n\tin\n\tlet f = ref true\n\tin let b = ref m\n\tin let la = ref max_int\n\tin let a_res = a_cal !b\n\tin\n\twhile !f do\n\t\tlet r = Array.fold_left (fun u v -> u + abs v) 0 a_res\n\t\tin \n\t\t(* Printf.printf \"%d::%d\\n\" !b r; *)\n\t\tif r < !la then (\n\t\t\tla := r; b := !b - 1;\n\t\t\tfor i=0 to Array.length a - 1 do\n\t\t\t\ta_res.(i) <- a_res.(i) + 1\n\t\t\tdone\n\t\t) else (\n\t\t\tf := false\n\t\t)\n\tdone;\n\t!la |> string_of_int |> print_endline\n", "language": "OCaml", "metadata": {"date": 1530495297, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s776550141.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s776550141", "user_id": "u481480055"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let input_int_array n =\n\tArray.init n (fun _ -> Scanf.scanf \"%d \" (fun v -> v))\nlet get_int () = Scanf.scanf \"%d \" (fun v -> v)\n\nlet test a b =\n\tArray.fold_left (fun (u,i) v -> \n\t\tPrintf.printf \"  %d::abs(%d-(%d+%d))=%d\\n\"\n\t\t\ti v b i (abs (v-(b+i)))\n\t\t;\n\t\t(u + (abs (v - (b+i)))), i+1) (0,1) a\n\t|> fst \nlet min_listi ls = \n\tlet rec f0 i l v vi = match l with\n\t| [] -> (v,i) | h::t -> if (h < v) then f0 (i+1) t h i else f0 (i+1) t v vi\n\tin f0 0 ls max_int (-1)\n\nlet () =\n\tlet n = get_int ()\n\tin let a = input_int_array n\n\tin let a_cal b = Array.init n (fun i -> a.(i)-b-i-1)\n\tin let (m,mi) = min_listi (a|>Array.to_list)\n\tin\n\tlet f = ref true\n\tin let b = ref m\n\tin let la = ref max_int\n\tin let a_res = a_cal !b\n\tin\n\twhile !f do\n\t\tlet r = Array.fold_left (fun u v -> u + abs v) 0 a_res\n\t\tin \n\t\t(* Printf.printf \"%d::%d\\n\" !b r; *)\n\t\tif r < !la then (\n\t\t\tla := r; b := !b - 1;\n\t\t\tfor i=0 to Array.length a - 1 do\n\t\t\t\ta_res.(i) <- a_res.(i) + 1\n\t\t\tdone\n\t\t) else (\n\t\t\tf := false\n\t\t)\n\tdone;\n\t!la |> string_of_int |> print_endline\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "sample_input": "5\n2 2 3 5 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03309", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will freely choose an integer b.\nHere, he will get sad if A_i and b+i are far from each other.\nMore specifically, the sadness of Snuke is calculated as follows:\n\nabs(A_1 - (b+1)) + abs(A_2 - (b+2)) + ... + abs(A_N - (b+N))\n\nHere, abs(x) is a function that returns the absolute value of x.\n\nFind the minimum possible sadness of Snuke.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible sadness of Snuke.\n\nSample Input 1\n\n5\n2 2 3 5 5\n\nSample Output 1\n\n2\n\nIf we choose b=0, the sadness of Snuke would be abs(2-(0+1))+abs(2-(0+2))+abs(3-(0+3))+abs(5-(0+4))+abs(5-(0+5))=2.\nAny choice of b does not make the sadness of Snuke less than 2, so the answer is 2.\n\nSample Input 2\n\n9\n1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n6\n6 5 4 3 2 1\n\nSample Output 3\n\n18\n\nSample Input 4\n\n7\n1 1 1 1 2 3 4\n\nSample Output 4\n\n6", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1025, "cpu_time_ms": 2104, "memory_kb": 10368}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s252430021", "group_id": "codeNet:p03315", "input_text": "open Printf\nopen Scanf\n\nlet solve s =\n  let f i = if s.[i] = '+' then 1 else -1 in\n  List.fold_left (+) 0 @@ List.map f [0;1;2;3]\n\nlet () =\n  scanf \"%s\" solve |> printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1582593399, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s252430021.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s252430021", "user_id": "u388783188"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve s =\n  let f i = if s.[i] = '+' then 1 else -1 in\n  List.fold_left (+) 0 @@ List.map f [0;1;2;3]\n\nlet () =\n  scanf \"%s\" solve |> printf \"%d\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is always an integer in Takahashi's mind.\n\nInitially, the integer in Takahashi's mind is 0. Takahashi is now going to eat four symbols, each of which is + or -. When he eats +, the integer in his mind increases by 1; when he eats -, the integer in his mind decreases by 1.\n\nThe symbols Takahashi is going to eat are given to you as a string S. The i-th character in S is the i-th symbol for him to eat.\n\nFind the integer in Takahashi's mind after he eats all the symbols.\n\nConstraints\n\nThe length of S is 4.\n\nEach character in S is + or -.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the integer in Takahashi's mind after he eats all the symbols.\n\nSample Input 1\n\n+-++\n\nSample Output 1\n\n2\n\nInitially, the integer in Takahashi's mind is 0.\n\nThe first integer for him to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe second integer to eat is -. After eating it, the integer in his mind becomes 0.\n\nThe third integer to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe fourth integer to eat is +. After eating it, the integer in his mind becomes 2.\n\nThus, the integer in Takahashi's mind after he eats all the symbols is 2.\n\nSample Input 2\n\n-+--\n\nSample Output 2\n\n-2\n\nSample Input 3\n\n----\n\nSample Output 3\n\n-4", "sample_input": "+-++\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03315", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is always an integer in Takahashi's mind.\n\nInitially, the integer in Takahashi's mind is 0. Takahashi is now going to eat four symbols, each of which is + or -. When he eats +, the integer in his mind increases by 1; when he eats -, the integer in his mind decreases by 1.\n\nThe symbols Takahashi is going to eat are given to you as a string S. The i-th character in S is the i-th symbol for him to eat.\n\nFind the integer in Takahashi's mind after he eats all the symbols.\n\nConstraints\n\nThe length of S is 4.\n\nEach character in S is + or -.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the integer in Takahashi's mind after he eats all the symbols.\n\nSample Input 1\n\n+-++\n\nSample Output 1\n\n2\n\nInitially, the integer in Takahashi's mind is 0.\n\nThe first integer for him to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe second integer to eat is -. After eating it, the integer in his mind becomes 0.\n\nThe third integer to eat is +. After eating it, the integer in his mind becomes 1.\n\nThe fourth integer to eat is +. After eating it, the integer in his mind becomes 2.\n\nThus, the integer in Takahashi's mind after he eats all the symbols is 2.\n\nSample Input 2\n\n-+--\n\nSample Output 2\n\n-2\n\nSample Input 3\n\n----\n\nSample Output 3\n\n-4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 176, "cpu_time_ms": 2, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s138078326", "group_id": "codeNet:p03317", "input_text": "let n, k = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet _ = Printf.printf \"%d\\n\" @@ (n - 2) / (k - 1) + 1", "language": "OCaml", "metadata": {"date": 1570031698, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s138078326.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s138078326", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let n, k = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet _ = Printf.printf \"%d\\n\" @@ (n - 2) / (k - 1) + 1", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N.\n\nOn this sequence, Snuke can perform the following operation:\n\nChoose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen elements.\n\nSnuke would like to make all the elements in this sequence equal by repeating the operation above some number of times.\nFind the minimum number of operations required.\nIt can be proved that, Under the constraints of this problem, this objective is always achievable.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 100000\n\nA_1, A_2, ..., A_N is a permutation of 1, 2, ..., N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4 3\n2 3 1 4\n\nSample Output 1\n\n2\n\nOne optimal strategy is as follows:\n\nIn the first operation, choose the first, second and third elements. The sequence A becomes 1, 1, 1, 4.\n\nIn the second operation, choose the second, third and fourth elements. The sequence A becomes 1, 1, 1, 1.\n\nSample Input 2\n\n3 3\n1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n8 3\n7 3 1 8 4 6 2 5\n\nSample Output 3\n\n4", "sample_input": "4 3\n2 3 1 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03317", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N.\n\nOn this sequence, Snuke can perform the following operation:\n\nChoose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen elements.\n\nSnuke would like to make all the elements in this sequence equal by repeating the operation above some number of times.\nFind the minimum number of operations required.\nIt can be proved that, Under the constraints of this problem, this objective is always achievable.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 100000\n\nA_1, A_2, ..., A_N is a permutation of 1, 2, ..., N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4 3\n2 3 1 4\n\nSample Output 1\n\n2\n\nOne optimal strategy is as follows:\n\nIn the first operation, choose the first, second and third elements. The sequence A becomes 1, 1, 1, 4.\n\nIn the second operation, choose the second, third and fourth elements. The sequence A becomes 1, 1, 1, 1.\n\nSample Input 2\n\n3 3\n1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n8 3\n7 3 1 8 4 6 2 5\n\nSample Output 3\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 104, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s499536868", "group_id": "codeNet:p03317", "input_text": "let () =\n  let n, k = Scanf.scanf \"%d %d\" (fun n k -> n, k) in\n  let a =\n    Array.init n (fun _ ->\n        Scanf.scanf \" %d\" (fun x -> x)) in\n  let (_, i1) = Array.fold_left (fun (i, res) x ->\n               if x = 1 then\n                 (i+1, i)\n               else\n                 (i+1, res)\n             ) (0, 0) a in\n  Printf.printf \"%d\\n\"\n    (if i1 = 0 then\n       (n) / (k-1)\n     else if i1 < k then\n      1 + (n-i1) / (k-1)\n    else\n      1 + (i1) / (k-1) + (n-i1+1)/(k-1))\n", "language": "OCaml", "metadata": {"date": 1529807187, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s499536868.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s499536868", "user_id": "u614063956"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () =\n  let n, k = Scanf.scanf \"%d %d\" (fun n k -> n, k) in\n  let a =\n    Array.init n (fun _ ->\n        Scanf.scanf \" %d\" (fun x -> x)) in\n  let (_, i1) = Array.fold_left (fun (i, res) x ->\n               if x = 1 then\n                 (i+1, i)\n               else\n                 (i+1, res)\n             ) (0, 0) a in\n  Printf.printf \"%d\\n\"\n    (if i1 = 0 then\n       (n) / (k-1)\n     else if i1 < k then\n      1 + (n-i1) / (k-1)\n    else\n      1 + (i1) / (k-1) + (n-i1+1)/(k-1))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N.\n\nOn this sequence, Snuke can perform the following operation:\n\nChoose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen elements.\n\nSnuke would like to make all the elements in this sequence equal by repeating the operation above some number of times.\nFind the minimum number of operations required.\nIt can be proved that, Under the constraints of this problem, this objective is always achievable.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 100000\n\nA_1, A_2, ..., A_N is a permutation of 1, 2, ..., N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4 3\n2 3 1 4\n\nSample Output 1\n\n2\n\nOne optimal strategy is as follows:\n\nIn the first operation, choose the first, second and third elements. The sequence A becomes 1, 1, 1, 4.\n\nIn the second operation, choose the second, third and fourth elements. The sequence A becomes 1, 1, 1, 1.\n\nSample Input 2\n\n3 3\n1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n8 3\n7 3 1 8 4 6 2 5\n\nSample Output 3\n\n4", "sample_input": "4 3\n2 3 1 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03317", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N.\n\nOn this sequence, Snuke can perform the following operation:\n\nChoose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen elements.\n\nSnuke would like to make all the elements in this sequence equal by repeating the operation above some number of times.\nFind the minimum number of operations required.\nIt can be proved that, Under the constraints of this problem, this objective is always achievable.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 100000\n\nA_1, A_2, ..., A_N is a permutation of 1, 2, ..., N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4 3\n2 3 1 4\n\nSample Output 1\n\n2\n\nOne optimal strategy is as follows:\n\nIn the first operation, choose the first, second and third elements. The sequence A becomes 1, 1, 1, 4.\n\nIn the second operation, choose the second, third and fourth elements. The sequence A becomes 1, 1, 1, 1.\n\nSample Input 2\n\n3 3\n1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n8 3\n7 3 1 8 4 6 2 5\n\nSample Output 3\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 486, "cpu_time_ms": 26, "memory_kb": 4864}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s683140158", "group_id": "codeNet:p03319", "input_text": "let split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\nlet n, k = Scanf.sscanf (read_line ()) \"%d %d\" @@ fun n k -> (n - 1, k - 1)\nlet a = read_line () |> split_string ~pattern:\" \" |> List.map int_of_string\n\nlet () = Printf.printf \"%d\\n\" @@ (n + k - 1)/ k", "language": "OCaml", "metadata": {"date": 1593745523, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s683140158.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s683140158", "user_id": "u811309788"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let split_string ?(pattern=\"\") = Str.split @@ Str.regexp pattern\nlet n, k = Scanf.sscanf (read_line ()) \"%d %d\" @@ fun n k -> (n - 1, k - 1)\nlet a = read_line () |> split_string ~pattern:\" \" |> List.map int_of_string\n\nlet () = Printf.printf \"%d\\n\" @@ (n + k - 1)/ k", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 42, "memory_kb": 16392}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s261409284", "group_id": "codeNet:p03319", "input_text": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  Printf.printf \"%d\\n\" @@ (n + k - 3) / (k - 1)\n", "language": "OCaml", "metadata": {"date": 1529809431, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s261409284.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s261409284", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let as_ = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  Printf.printf \"%d\\n\" @@ (n + k - 3) / (k - 1)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a sequence of length N: A_1, A_2, ..., A_N. Initially, this sequence is a permutation of 1, 2, ..., N.\n\nOn this sequence, Snuke can perform the following operation:\n\nChoose K consecutive elements in the sequence. Then, replace the value of each chosen element with the minimum value among the chosen elements.\n\nSnuke would like to make all the elements in this sequence equal by repeating the operation above some number of times.\nFind the minimum number of operations required.\nIt can be proved that, Under the constraints of this problem, this objective is always achievable.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 100000\n\nA_1, A_2, ..., A_N is a permutation of 1, 2, ..., N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4 3\n2 3 1 4\n\nSample Output 1\n\n2\n\nOne optimal strategy is as follows:\n\nIn the first operation, choose the first, second and third elements. The sequence A becomes 1, 1, 1, 4.\n\nIn the second operation, choose the second, third and fourth elements. The sequence A becomes 1, 1, 1, 1.\n\nSample Input 2\n\n3 3\n1 2 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n8 3\n7 3 1 8 4 6 2 5\n\nSample Output 3\n\n4", "sample_input": "4 3\n2 3 1 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 26, "memory_kb": 5248}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s169614146", "group_id": "codeNet:p03320", "input_text": "Scanf.scanf \"%d\" (fun k ->\n    let l = [ 1,  9; 1,  9;  1,  19;  2,  29;  3,  39;  4,  49;  5, 59;\n              6, 69; 7, 79;  8,  89;  9,  99; 10, 109; 11, 109; 11, 99 ]\n    in\n\n    let proc ten s t acc =\n        let rec loop i acc =\n            if i > t then acc else\n                loop (i + 1) ((i * ten + ten - 1) :: acc)\n        in\n        loop s acc\n    in\n\n    let rec loop ten acc = function\n        | [] -> acc\n        | (s, t) :: tl ->\n                loop (ten * 10) (proc ten s t acc) tl\n    in\n    let r = Array.of_list (loop 1 [] l) in\n    Array.sort compare r;\n    for i = 0 to k - 1 do\n        Printf.printf \"%d\\n\" r.(i)\n    done\n)", "language": "OCaml", "metadata": {"date": 1598426550, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03320.html", "problem_id": "p03320", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03320/input.txt", "sample_output_relpath": "derived/input_output/data/p03320/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03320/OCaml/s169614146.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s169614146", "user_id": "u342443598"}, "prompt_components": {"gold_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun k ->\n    let l = [ 1,  9; 1,  9;  1,  19;  2,  29;  3,  39;  4,  49;  5, 59;\n              6, 69; 7, 79;  8,  89;  9,  99; 10, 109; 11, 109; 11, 99 ]\n    in\n\n    let proc ten s t acc =\n        let rec loop i acc =\n            if i > t then acc else\n                loop (i + 1) ((i * ten + ten - 1) :: acc)\n        in\n        loop s acc\n    in\n\n    let rec loop ten acc = function\n        | [] -> acc\n        | (s, t) :: tl ->\n                loop (ten * 10) (proc ten s t acc) tl\n    in\n    let r = Array.of_list (loop 1 [] l) in\n    Array.sort compare r;\n    for i = 0 to k - 1 do\n        Printf.printf \"%d\\n\" r.(i)\n    done\n)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(123) = 1 + 2 + 3 = 6.\n\nWe will call an integer n a Snuke number when, for all positive integers m such that m > n, \\frac{n}{S(n)} \\leq \\frac{m}{S(m)} holds.\n\nGiven an integer K, list the K smallest Snuke numbers.\n\nConstraints\n\n1 \\leq K\n\nThe K-th smallest Snuke number is not greater than 10^{15}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th smallest Snuke number.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n1\n2\n3\n4\n5\n6\n7\n8\n9\n19", "sample_input": "10\n"}, "reference_outputs": ["1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n"], "source_document_id": "p03320", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(123) = 1 + 2 + 3 = 6.\n\nWe will call an integer n a Snuke number when, for all positive integers m such that m > n, \\frac{n}{S(n)} \\leq \\frac{m}{S(m)} holds.\n\nGiven an integer K, list the K smallest Snuke numbers.\n\nConstraints\n\n1 \\leq K\n\nThe K-th smallest Snuke number is not greater than 10^{15}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th smallest Snuke number.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n1\n2\n3\n4\n5\n6\n7\n8\n9\n19", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 650, "cpu_time_ms": 9, "memory_kb": 3924}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s676502795", "group_id": "codeNet:p03320", "input_text": "let rec s = function\n  | 0 -> 0\n  | n -> n mod 10 + s (n / 10)\n\nlet p x y = x * s y <= y * s x\n\nlet bases = Array.to_list @@ Array.init 16 (fun d -> int_of_float (10. ** float_of_int d))\n\nlet solutions =\n  Array.init 1000 (fun i ->\n    List.filter (fun r ->\n      p ((i + 1) * r - 1) ((i - i mod 10 + 10) * r - 1) &&\n      p ((i + 1) * r - 1) ((i - i mod 100 + 100) * r - 1) &&\n      p ((i + 1) * r - 1) ((i - i mod 1000 + 1000) * r - 1)) bases\n    |> List.map (fun r -> (i + 1) * r - 1))\n  |> Array.to_list\n  |> List.concat\n  |> List.sort_uniq compare\n  |> Array.of_list\n\nlet () = Scanf.scanf \"%d\" @@ fun k ->\n  for i = 1 to k do\n    Printf.printf \"%d\\n\" solutions.(i - 1)\n  done\n\n", "language": "OCaml", "metadata": {"date": 1529808851, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03320.html", "problem_id": "p03320", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03320/input.txt", "sample_output_relpath": "derived/input_output/data/p03320/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03320/OCaml/s676502795.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s676502795", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n", "input_to_evaluate": "let rec s = function\n  | 0 -> 0\n  | n -> n mod 10 + s (n / 10)\n\nlet p x y = x * s y <= y * s x\n\nlet bases = Array.to_list @@ Array.init 16 (fun d -> int_of_float (10. ** float_of_int d))\n\nlet solutions =\n  Array.init 1000 (fun i ->\n    List.filter (fun r ->\n      p ((i + 1) * r - 1) ((i - i mod 10 + 10) * r - 1) &&\n      p ((i + 1) * r - 1) ((i - i mod 100 + 100) * r - 1) &&\n      p ((i + 1) * r - 1) ((i - i mod 1000 + 1000) * r - 1)) bases\n    |> List.map (fun r -> (i + 1) * r - 1))\n  |> Array.to_list\n  |> List.concat\n  |> List.sort_uniq compare\n  |> Array.of_list\n\nlet () = Scanf.scanf \"%d\" @@ fun k ->\n  for i = 1 to k do\n    Printf.printf \"%d\\n\" solutions.(i - 1)\n  done\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(123) = 1 + 2 + 3 = 6.\n\nWe will call an integer n a Snuke number when, for all positive integers m such that m > n, \\frac{n}{S(n)} \\leq \\frac{m}{S(m)} holds.\n\nGiven an integer K, list the K smallest Snuke numbers.\n\nConstraints\n\n1 \\leq K\n\nThe K-th smallest Snuke number is not greater than 10^{15}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th smallest Snuke number.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n1\n2\n3\n4\n5\n6\n7\n8\n9\n19", "sample_input": "10\n"}, "reference_outputs": ["1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n"], "source_document_id": "p03320", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(123) = 1 + 2 + 3 = 6.\n\nWe will call an integer n a Snuke number when, for all positive integers m such that m > n, \\frac{n}{S(n)} \\leq \\frac{m}{S(m)} holds.\n\nGiven an integer K, list the K smallest Snuke numbers.\n\nConstraints\n\n1 \\leq K\n\nThe K-th smallest Snuke number is not greater than 10^{15}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th smallest Snuke number.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n1\n2\n3\n4\n5\n6\n7\n8\n9\n19", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 682, "cpu_time_ms": 5, "memory_kb": 1536}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s924337276", "group_id": "codeNet:p03323", "input_text": "let () = Scanf.scanf \"%d %d\" (fun x y -> if x > 8 || y > 8 then Printf.printf \":(\\n\" else Printf.printf \"Yay!\\n\")", "language": "OCaml", "metadata": {"date": 1529202984, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s924337276.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s924337276", "user_id": "u620696530"}, "prompt_components": {"gold_output": "Yay!\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\" (fun x y -> if x > 8 || y > 8 then Printf.printf \":(\\n\" else Printf.printf \"Yay!\\n\")", "problem_context": "Score: 100 points\n\nProblem Statement\n\nE869120's and square1001's 16-th birthday is coming soon.\n\nTakahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan-shaped pieces.\n\nE869120 and square1001 were just about to eat A and B of those pieces, respectively,\n\nwhen they found a note attached to the cake saying that \"the same person should not take two adjacent pieces of cake\".\n\nCan both of them obey the instruction in the note and take desired numbers of pieces of cake?\n\nConstraints\n\nA and B are integers between 1 and 16 (inclusive).\n\nA+B is at most 16.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf both E869120 and square1001 can obey the instruction in the note and take desired numbers of pieces of cake, print Yay!; otherwise, print :(.\n\nSample Input 1\n\n5 4\n\nSample Output 1\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 2\n\n8 8\n\nSample Output 2\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 3\n\n11 4\n\nSample Output 3\n\n:(\n\nIn this case, there is no way for them to take desired number of pieces, unfortunately.", "sample_input": "5 4\n"}, "reference_outputs": ["Yay!\n"], "source_document_id": "p03323", "source_text": "Score: 100 points\n\nProblem Statement\n\nE869120's and square1001's 16-th birthday is coming soon.\n\nTakahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan-shaped pieces.\n\nE869120 and square1001 were just about to eat A and B of those pieces, respectively,\n\nwhen they found a note attached to the cake saying that \"the same person should not take two adjacent pieces of cake\".\n\nCan both of them obey the instruction in the note and take desired numbers of pieces of cake?\n\nConstraints\n\nA and B are integers between 1 and 16 (inclusive).\n\nA+B is at most 16.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf both E869120 and square1001 can obey the instruction in the note and take desired numbers of pieces of cake, print Yay!; otherwise, print :(.\n\nSample Input 1\n\n5 4\n\nSample Output 1\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 2\n\n8 8\n\nSample Output 2\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 3\n\n11 4\n\nSample Output 3\n\n:(\n\nIn this case, there is no way for them to take desired number of pieces, unfortunately.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 113, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s354198322", "group_id": "codeNet:p03325", "input_text": "let change a = \n\tlet rec change a n = \n    \tif a land 1 == 0 then change (a lsr 1) (n + 1) else n\n    in change a 0\nlet calc n = \n\tlet rec calc n ans = \n    \tif n = 0 then print_int ans\n        else calc (n - 1) (ans + Scanf.scanf \" %d\" change)\n    in calc n 0\nlet main = Scanf.scanf \"%d\" calc", "language": "OCaml", "metadata": {"date": 1529449671, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s354198322.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s354198322", "user_id": "u550314572"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let change a = \n\tlet rec change a n = \n    \tif a land 1 == 0 then change (a lsr 1) (n + 1) else n\n    in change a 0\nlet calc n = \n\tlet rec calc n ans = \n    \tif n = 0 then print_int ans\n        else calc (n - 1) (ans + Scanf.scanf \" %d\" change)\n    in calc n 0\nlet main = Scanf.scanf \"%d\" calc", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s288372765", "group_id": "codeNet:p03327", "input_text": "let n = read_int () in\n\nprint_endline(if n < 1000 then \"ABC\" else \"ABD\")", "language": "OCaml", "metadata": {"date": 1529314948, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s288372765.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s288372765", "user_id": "u714587753"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "let n = read_int () in\n\nprint_endline(if n < 1000 then \"ABC\" else \"ABD\")", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s612205995", "group_id": "codeNet:p03329", "input_text": "let n = read_int()\nlet a = Array.make (n + 1) 0\n\nlet rec f i =\n  if i = n + 1 then a.(n)\n  else\n    let rec g i j k =\n      if j < k then j - k / i\n      else g i j (k * i) in\n    a.(i) <- 1 + min a.(g 6 i 1) a.(g 9 i 1);\n    f (i + 1)\n\nlet () = Printf.printf \"%d\\n\" (f 1)\n", "language": "OCaml", "metadata": {"date": 1599362940, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03329.html", "problem_id": "p03329", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03329/input.txt", "sample_output_relpath": "derived/input_output/data/p03329/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03329/OCaml/s612205995.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s612205995", "user_id": "u752907799"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let n = read_int()\nlet a = Array.make (n + 1) 0\n\nlet rec f i =\n  if i = n + 1 then a.(n)\n  else\n    let rec g i j k =\n      if j < k then j - k / i\n      else g i j (k * i) in\n    a.(i) <- 1 + min a.(g 6 i 1) a.(g 9 i 1);\n    f (i + 1)\n\nlet () = Printf.printf \"%d\\n\" (f 1)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTo make it difficult to withdraw money, a certain bank allows its customers to withdraw only one of the following amounts in one operation:\n\n1 yen (the currency of Japan)\n\n6 yen, 6^2(=36) yen, 6^3(=216) yen, ...\n\n9 yen, 9^2(=81) yen, 9^3(=729) yen, ...\n\nAt least how many operations are required to withdraw exactly N yen in total?\n\nIt is not allowed to re-deposit the money you withdrew.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf at least x operations are required to withdraw exactly N yen in total, print x.\n\nSample Input 1\n\n127\n\nSample Output 1\n\n4\n\nBy withdrawing 1 yen, 9 yen, 36(=6^2) yen and 81(=9^2) yen, we can withdraw 127 yen in four operations.\n\nSample Input 2\n\n3\n\nSample Output 2\n\n3\n\nBy withdrawing 1 yen three times, we can withdraw 3 yen in three operations.\n\nSample Input 3\n\n44852\n\nSample Output 3\n\n16", "sample_input": "127\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03329", "source_text": "Score : 300 points\n\nProblem Statement\n\nTo make it difficult to withdraw money, a certain bank allows its customers to withdraw only one of the following amounts in one operation:\n\n1 yen (the currency of Japan)\n\n6 yen, 6^2(=36) yen, 6^3(=216) yen, ...\n\n9 yen, 9^2(=81) yen, 9^3(=729) yen, ...\n\nAt least how many operations are required to withdraw exactly N yen in total?\n\nIt is not allowed to re-deposit the money you withdrew.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf at least x operations are required to withdraw exactly N yen in total, print x.\n\nSample Input 1\n\n127\n\nSample Output 1\n\n4\n\nBy withdrawing 1 yen, 9 yen, 36(=6^2) yen and 81(=9^2) yen, we can withdraw 127 yen in four operations.\n\nSample Input 2\n\n3\n\nSample Output 2\n\n3\n\nBy withdrawing 1 yen three times, we can withdraw 3 yen in three operations.\n\nSample Input 3\n\n44852\n\nSample Output 3\n\n16", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 273, "cpu_time_ms": 18, "memory_kb": 4368}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s970293271", "group_id": "codeNet:p03330", "input_text": "let rec seq a b = if a >= b then [] else a :: seq (a+1) b\nlet (>>=) x f = List.map f x |> List.concat\nlet () =\n  Scanf.scanf \"%d %d\" @@ fun n c ->\n  let d =\n    Array.init c (fun i ->\n      Array.init c (fun j -> Scanf.scanf \" %d\" ((+) 0)))\n  in\n  let b =\n    Array.init n (fun i ->\n      Array.init n (fun j -> Scanf.scanf \" %d\" ((+) 0)))\n  in\n\n  let sc = Array.init 3 (fun _ -> Array.make c 0) in\n  let _ =\n    seq 0 n >>= fun x ->\n    seq 0 n >>= fun y ->\n      let i = (x + y) mod 3 in\n      seq 0 c |> List.iter (fun j -> sc.(i).(j) <- sc.(i).(j) + d.(b.(x).(y)-1).(j));\n      []\n  in\n\n  (seq 0 c >>= fun i ->\n   seq 0 c >>= fun j ->\n   seq 0 c >>= fun k ->\n     if i = j || j = k || k = i then []\n     else [ sc.(0).(i) + sc.(1).(j) + sc.(2).(k) ])\n  |> List.fold_left min 10101010101010 \n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1541102924, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03330.html", "problem_id": "p03330", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03330/input.txt", "sample_output_relpath": "derived/input_output/data/p03330/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03330/OCaml/s970293271.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s970293271", "user_id": "u798181098"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let rec seq a b = if a >= b then [] else a :: seq (a+1) b\nlet (>>=) x f = List.map f x |> List.concat\nlet () =\n  Scanf.scanf \"%d %d\" @@ fun n c ->\n  let d =\n    Array.init c (fun i ->\n      Array.init c (fun j -> Scanf.scanf \" %d\" ((+) 0)))\n  in\n  let b =\n    Array.init n (fun i ->\n      Array.init n (fun j -> Scanf.scanf \" %d\" ((+) 0)))\n  in\n\n  let sc = Array.init 3 (fun _ -> Array.make c 0) in\n  let _ =\n    seq 0 n >>= fun x ->\n    seq 0 n >>= fun y ->\n      let i = (x + y) mod 3 in\n      seq 0 c |> List.iter (fun j -> sc.(i).(j) <- sc.(i).(j) + d.(b.(x).(y)-1).(j));\n      []\n  in\n\n  (seq 0 c >>= fun i ->\n   seq 0 c >>= fun j ->\n   seq 0 c >>= fun k ->\n     if i = j || j = k || k = i then []\n     else [ sc.(0).(i) + sc.(1).(j) + sc.(2).(k) ])\n  |> List.fold_left min 10101010101010 \n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 400 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\nThese squares have to be painted in one of the C colors from Color 1 to Color C. Initially, (i,j) is painted in Color c_{i,j}.\n\nWe say the grid is a good grid when the following condition is met for all i,j,x,y satisfying 1 \\leq i,j,x,y \\leq N:\n\nIf (i+j) \\% 3=(x+y) \\% 3, the color of (i,j) and the color of (x,y) are the same.\n\nIf (i+j) \\% 3 \\neq (x+y) \\% 3, the color of (i,j) and the color of (x,y) are different.\n\nHere, X \\% Y represents X modulo Y.\n\nWe will repaint zero or more squares so that the grid will be a good grid.\n\nFor a square, the wrongness when the color of the square is X before repainting and Y after repainting, is D_{X,Y}.\n\nFind the minimum possible sum of the wrongness of all the squares.\n\nConstraints\n\n1 \\leq N \\leq 500\n\n3 \\leq C \\leq 30\n\n1 \\leq D_{i,j} \\leq 1000 (i \\neq j),D_{i,j}=0 (i=j)\n\n1 \\leq c_{i,j} \\leq C\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN C\nD_{1,1} ... D_{1,C}\n:\nD_{C,1} ... D_{C,C}\nc_{1,1} ... c_{1,N}\n:\nc_{N,1} ... c_{N,N}\n\nOutput\n\nIf the minimum possible sum of the wrongness of all the squares is x, print x.\n\nSample Input 1\n\n2 3\n0 1 1\n1 0 1\n1 4 0\n1 2\n3 3\n\nSample Output 1\n\n3\n\nRepaint (1,1) to Color 2. The wrongness of (1,1) becomes D_{1,2}=1.\n\nRepaint (1,2) to Color 3. The wrongness of (1,2) becomes D_{2,3}=1.\n\nRepaint (2,2) to Color 1. The wrongness of (2,2) becomes D_{3,1}=1.\n\nIn this case, the sum of the wrongness of all the squares is 3.\n\nNote that D_{i,j} \\neq D_{j,i} is possible.\n\nSample Input 2\n\n4 3\n0 12 71\n81 0 53\n14 92 0\n1 1 2 1\n2 1 1 2\n2 2 1 3\n1 1 2 2\n\nSample Output 2\n\n428", "sample_input": "2 3\n0 1 1\n1 0 1\n1 4 0\n1 2\n3 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03330", "source_text": "Score : 400 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\nThese squares have to be painted in one of the C colors from Color 1 to Color C. Initially, (i,j) is painted in Color c_{i,j}.\n\nWe say the grid is a good grid when the following condition is met for all i,j,x,y satisfying 1 \\leq i,j,x,y \\leq N:\n\nIf (i+j) \\% 3=(x+y) \\% 3, the color of (i,j) and the color of (x,y) are the same.\n\nIf (i+j) \\% 3 \\neq (x+y) \\% 3, the color of (i,j) and the color of (x,y) are different.\n\nHere, X \\% Y represents X modulo Y.\n\nWe will repaint zero or more squares so that the grid will be a good grid.\n\nFor a square, the wrongness when the color of the square is X before repainting and Y after repainting, is D_{X,Y}.\n\nFind the minimum possible sum of the wrongness of all the squares.\n\nConstraints\n\n1 \\leq N \\leq 500\n\n3 \\leq C \\leq 30\n\n1 \\leq D_{i,j} \\leq 1000 (i \\neq j),D_{i,j}=0 (i=j)\n\n1 \\leq c_{i,j} \\leq C\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN C\nD_{1,1} ... D_{1,C}\n:\nD_{C,1} ... D_{C,C}\nc_{1,1} ... c_{1,N}\n:\nc_{N,1} ... c_{N,N}\n\nOutput\n\nIf the minimum possible sum of the wrongness of all the squares is x, print x.\n\nSample Input 1\n\n2 3\n0 1 1\n1 0 1\n1 4 0\n1 2\n3 3\n\nSample Output 1\n\n3\n\nRepaint (1,1) to Color 2. The wrongness of (1,1) becomes D_{1,2}=1.\n\nRepaint (1,2) to Color 3. The wrongness of (1,2) becomes D_{2,3}=1.\n\nRepaint (2,2) to Color 1. The wrongness of (2,2) becomes D_{3,1}=1.\n\nIn this case, the sum of the wrongness of all the squares is 3.\n\nNote that D_{i,j} \\neq D_{j,i} is possible.\n\nSample Input 2\n\n4 3\n0 12 71\n81 0 53\n14 92 0\n1 1 2 1\n2 1 1 2\n2 2 1 3\n1 1 2 2\n\nSample Output 2\n\n428", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 820, "cpu_time_ms": 135, "memory_kb": 5888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s920665460", "group_id": "codeNet:p03331", "input_text": "let rec fact n =\n  if n = 0 then 1 else n * fact (n - 1)\n;;\nlet bi_c  n k =\n  fact n / ((fact k) * (fact (n - k)))\n;;\n\nlet rec rgb a b n k x sum  =\n  if x <= 0 then sum\n  else\n    let y = (k - a * x) / b in\n    if a * x + b * y = k && 0 <= y && y <= n then\n      rgb a b n k (x - 1) (sum +  (bi_c n x) * (bi_c n y))\n    else\n      rgb a b n k (x - 1) (sum)\n  \nlet () =\n  let n, a, b, k = Scanf.scanf \"%d %d %d %d\"\n                     (fun n a b k -> n, a, b, k) in\n  (rgb a b n k n 0) mod 998244353 \n|> print_int \n", "language": "OCaml", "metadata": {"date": 1528382660, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s920665460.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s920665460", "user_id": "u614063956"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let rec fact n =\n  if n = 0 then 1 else n * fact (n - 1)\n;;\nlet bi_c  n k =\n  fact n / ((fact k) * (fact (n - k)))\n;;\n\nlet rec rgb a b n k x sum  =\n  if x <= 0 then sum\n  else\n    let y = (k - a * x) / b in\n    if a * x + b * y = k && 0 <= y && y <= n then\n      rgb a b n k (x - 1) (sum +  (bi_c n x) * (bi_c n y))\n    else\n      rgb a b n k (x - 1) (sum)\n  \nlet () =\n  let n, a, b, k = Scanf.scanf \"%d %d %d %d\"\n                     (fun n a b k -> n, a, b, k) in\n  (rgb a b n k n 0) mod 998244353 \n|> print_int \n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has two positive integers A and B.\n\nIt is known that A plus B equals N.\nFind the minimum possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\" (in base 10).\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\".\n\nSample Input 1\n\n15\n\nSample Output 1\n\n6\n\nWhen A=2 and B=13, the sums of their digits are 2 and 4, which minimizes the value in question.\n\nSample Input 2\n\n100000\n\nSample Output 2\n\n10", "sample_input": "15\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03331", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has two positive integers A and B.\n\nIt is known that A plus B equals N.\nFind the minimum possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\" (in base 10).\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\".\n\nSample Input 1\n\n15\n\nSample Output 1\n\n6\n\nWhen A=2 and B=13, the sums of their digits are 2 and 4, which minimizes the value in question.\n\nSample Input 2\n\n100000\n\nSample Output 2\n\n10", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 515, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s295687839", "group_id": "codeNet:p03332", "input_text": "(* nCr = {(n-r+1)/r}nCr-1 *)\nlet const = 998244353\nlet ( *$ ) x y = x * y mod const\nlet ( +$ ) x y = x + y mod const\nlet rec power x n =\n  if n <= 0 then 1\n  else if n mod 2 = 0 then\n    power (x *$ x) (n/2)\n  else\n    x *$ power x (n - 1)\nlet mod_inv x =\n  power x (const - 2)\n  \nlet () =\n  let n, a, b, k = Scanf.scanf \"%d %d %d %d\"\n                     (fun n a b k -> n, a, b, k) in\n  let binomial = Array.make (n + 1) 1 in\n  for i = 1 to n do\n    binomial.(i) <- binomial.(i-1)  *$ (n+1-i) *$ mod_inv i\n  done;\n  Array.init (n+1) (fun x ->\n      let y = (k - a * x) / b in\n      if a * x + b * y = k && 0 <= y && y <= n then\n        binomial.(x) *$ binomial.(y)\n      else\n        0)\n  |> Array.fold_left (fun x y -> x +$ y) 0\n  |> Printf.printf \"%d\\n\"\n\n", "language": "OCaml", "metadata": {"date": 1528444071, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03332.html", "problem_id": "p03332", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03332/input.txt", "sample_output_relpath": "derived/input_output/data/p03332/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03332/OCaml/s295687839.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s295687839", "user_id": "u614063956"}, "prompt_components": {"gold_output": "40\n", "input_to_evaluate": "(* nCr = {(n-r+1)/r}nCr-1 *)\nlet const = 998244353\nlet ( *$ ) x y = x * y mod const\nlet ( +$ ) x y = x + y mod const\nlet rec power x n =\n  if n <= 0 then 1\n  else if n mod 2 = 0 then\n    power (x *$ x) (n/2)\n  else\n    x *$ power x (n - 1)\nlet mod_inv x =\n  power x (const - 2)\n  \nlet () =\n  let n, a, b, k = Scanf.scanf \"%d %d %d %d\"\n                     (fun n a b k -> n, a, b, k) in\n  let binomial = Array.make (n + 1) 1 in\n  for i = 1 to n do\n    binomial.(i) <- binomial.(i-1)  *$ (n+1-i) *$ mod_inv i\n  done;\n  Array.init (n+1) (fun x ->\n      let y = (k - a * x) / b in\n      if a * x + b * y = k && 0 <= y && y <= n then\n        binomial.(x) *$ binomial.(y)\n      else\n        0)\n  |> Array.fold_left (fun x y -> x +$ y) 0\n  |> Printf.printf \"%d\\n\"\n\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nTakahashi has a tower which is divided into N layers.\nInitially, all the layers are uncolored. Takahashi is going to paint some of the layers in red, green or blue to make a beautiful tower.\nHe defines the beauty of the tower as follows:\n\nThe beauty of the tower is the sum of the scores of the N layers, where the score of a layer is A if the layer is painted red, A+B if the layer is painted green, B if the layer is painted blue, and 0 if the layer is uncolored.\n\nHere, A and B are positive integer constants given beforehand. Also note that a layer may not be painted in two or more colors.\n\nTakahashi is planning to paint the tower so that the beauty of the tower becomes exactly K.\nHow many such ways are there to paint the tower? Find the count modulo 998244353.\nTwo ways to paint the tower are considered different when there exists a layer that is painted in different colors, or a layer that is painted in some color in one of the ways and not in the other.\n\nConstraints\n\n1 ≤ N ≤ 3×10^5\n\n1 ≤ A,B ≤ 3×10^5\n\n0 ≤ K ≤ 18×10^{10}\n\nAll values in the input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B K\n\nOutput\n\nPrint the number of the ways to paint tiles, modulo 998244353.\n\nSample Input 1\n\n4 1 2 5\n\nSample Output 1\n\n40\n\nIn this case, a red layer worth 1 points, a green layer worth 3 points and the blue layer worth 2 points. The beauty of the tower is 5 when we have one of the following sets of painted layers:\n\n1 green, 1 blue\n\n1 red, 2 blues\n\n2 reds, 1 green\n\n3 reds, 1 blue\n\nThe total number of the ways to produce them is 40.\n\nSample Input 2\n\n2 5 6 0\n\nSample Output 2\n\n1\n\nThe beauty of the tower is 0 only when all the layers are uncolored. Thus, the answer is 1.\n\nSample Input 3\n\n90081 33447 90629 6391049189\n\nSample Output 3\n\n577742975", "sample_input": "4 1 2 5\n"}, "reference_outputs": ["40\n"], "source_document_id": "p03332", "source_text": "Score : 700 points\n\nProblem Statement\n\nTakahashi has a tower which is divided into N layers.\nInitially, all the layers are uncolored. Takahashi is going to paint some of the layers in red, green or blue to make a beautiful tower.\nHe defines the beauty of the tower as follows:\n\nThe beauty of the tower is the sum of the scores of the N layers, where the score of a layer is A if the layer is painted red, A+B if the layer is painted green, B if the layer is painted blue, and 0 if the layer is uncolored.\n\nHere, A and B are positive integer constants given beforehand. Also note that a layer may not be painted in two or more colors.\n\nTakahashi is planning to paint the tower so that the beauty of the tower becomes exactly K.\nHow many such ways are there to paint the tower? Find the count modulo 998244353.\nTwo ways to paint the tower are considered different when there exists a layer that is painted in different colors, or a layer that is painted in some color in one of the ways and not in the other.\n\nConstraints\n\n1 ≤ N ≤ 3×10^5\n\n1 ≤ A,B ≤ 3×10^5\n\n0 ≤ K ≤ 18×10^{10}\n\nAll values in the input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B K\n\nOutput\n\nPrint the number of the ways to paint tiles, modulo 998244353.\n\nSample Input 1\n\n4 1 2 5\n\nSample Output 1\n\n40\n\nIn this case, a red layer worth 1 points, a green layer worth 3 points and the blue layer worth 2 points. The beauty of the tower is 5 when we have one of the following sets of painted layers:\n\n1 green, 1 blue\n\n1 red, 2 blues\n\n2 reds, 1 green\n\n3 reds, 1 blue\n\nThe total number of the ways to produce them is 40.\n\nSample Input 2\n\n2 5 6 0\n\nSample Output 2\n\n1\n\nThe beauty of the tower is 0 only when all the layers are uncolored. Thus, the answer is 1.\n\nSample Input 3\n\n90081 33447 90629 6391049189\n\nSample Output 3\n\n577742975", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 759, "cpu_time_ms": 123, "memory_kb": 8448}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s741597168", "group_id": "codeNet:p03332", "input_text": "let result = ref 0;;\nlet rec fact n = if n = 0 then 1 else n * fact (n - 1);;\n             \nlet () =\n  let n, a, b, k = Scanf.scanf \"%d %d %d %d\"\n                     (fun n a b k -> n, a, b, k) in\n  let rgb_color () =\n    for i = 0 to n do\n      let n1 = n - i in\n      for j = 0 to n1 do\n        let n2 = n1 - j in\n        for s = 0 to n2 do\n          let n3 = n2 - s in\n          for t = 0 to n3 do\n            if (i * a + j * (a+b) + s * b)  = k && i+j+s+t = n then\n              let r = if i = 0 || i = 1 then 0 else fact i in\n              let g = if  j = 0 || j = 1 then 0 else fact j in\n              let b = if  s = 0 || s = 1 then 0 else fact s in\n              let c = if  t = 0 || t = 1 then 0 else fact t in\n            result :=\n              (!result) +  (fact n / (r + g + b + c)) \n          else\n            ()\n          done\n        done\n      done\n    done\n  in\n  let _ = rgb_color () in\n  let x = (!result) mod  998244353 in\n  print_endline (string_of_int x)\n                                      \n      \n", "language": "OCaml", "metadata": {"date": 1528079981, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03332.html", "problem_id": "p03332", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03332/input.txt", "sample_output_relpath": "derived/input_output/data/p03332/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03332/OCaml/s741597168.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s741597168", "user_id": "u614063956"}, "prompt_components": {"gold_output": "40\n", "input_to_evaluate": "let result = ref 0;;\nlet rec fact n = if n = 0 then 1 else n * fact (n - 1);;\n             \nlet () =\n  let n, a, b, k = Scanf.scanf \"%d %d %d %d\"\n                     (fun n a b k -> n, a, b, k) in\n  let rgb_color () =\n    for i = 0 to n do\n      let n1 = n - i in\n      for j = 0 to n1 do\n        let n2 = n1 - j in\n        for s = 0 to n2 do\n          let n3 = n2 - s in\n          for t = 0 to n3 do\n            if (i * a + j * (a+b) + s * b)  = k && i+j+s+t = n then\n              let r = if i = 0 || i = 1 then 0 else fact i in\n              let g = if  j = 0 || j = 1 then 0 else fact j in\n              let b = if  s = 0 || s = 1 then 0 else fact s in\n              let c = if  t = 0 || t = 1 then 0 else fact t in\n            result :=\n              (!result) +  (fact n / (r + g + b + c)) \n          else\n            ()\n          done\n        done\n      done\n    done\n  in\n  let _ = rgb_color () in\n  let x = (!result) mod  998244353 in\n  print_endline (string_of_int x)\n                                      \n      \n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nTakahashi has a tower which is divided into N layers.\nInitially, all the layers are uncolored. Takahashi is going to paint some of the layers in red, green or blue to make a beautiful tower.\nHe defines the beauty of the tower as follows:\n\nThe beauty of the tower is the sum of the scores of the N layers, where the score of a layer is A if the layer is painted red, A+B if the layer is painted green, B if the layer is painted blue, and 0 if the layer is uncolored.\n\nHere, A and B are positive integer constants given beforehand. Also note that a layer may not be painted in two or more colors.\n\nTakahashi is planning to paint the tower so that the beauty of the tower becomes exactly K.\nHow many such ways are there to paint the tower? Find the count modulo 998244353.\nTwo ways to paint the tower are considered different when there exists a layer that is painted in different colors, or a layer that is painted in some color in one of the ways and not in the other.\n\nConstraints\n\n1 ≤ N ≤ 3×10^5\n\n1 ≤ A,B ≤ 3×10^5\n\n0 ≤ K ≤ 18×10^{10}\n\nAll values in the input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B K\n\nOutput\n\nPrint the number of the ways to paint tiles, modulo 998244353.\n\nSample Input 1\n\n4 1 2 5\n\nSample Output 1\n\n40\n\nIn this case, a red layer worth 1 points, a green layer worth 3 points and the blue layer worth 2 points. The beauty of the tower is 5 when we have one of the following sets of painted layers:\n\n1 green, 1 blue\n\n1 red, 2 blues\n\n2 reds, 1 green\n\n3 reds, 1 blue\n\nThe total number of the ways to produce them is 40.\n\nSample Input 2\n\n2 5 6 0\n\nSample Output 2\n\n1\n\nThe beauty of the tower is 0 only when all the layers are uncolored. Thus, the answer is 1.\n\nSample Input 3\n\n90081 33447 90629 6391049189\n\nSample Output 3\n\n577742975", "sample_input": "4 1 2 5\n"}, "reference_outputs": ["40\n"], "source_document_id": "p03332", "source_text": "Score : 700 points\n\nProblem Statement\n\nTakahashi has a tower which is divided into N layers.\nInitially, all the layers are uncolored. Takahashi is going to paint some of the layers in red, green or blue to make a beautiful tower.\nHe defines the beauty of the tower as follows:\n\nThe beauty of the tower is the sum of the scores of the N layers, where the score of a layer is A if the layer is painted red, A+B if the layer is painted green, B if the layer is painted blue, and 0 if the layer is uncolored.\n\nHere, A and B are positive integer constants given beforehand. Also note that a layer may not be painted in two or more colors.\n\nTakahashi is planning to paint the tower so that the beauty of the tower becomes exactly K.\nHow many such ways are there to paint the tower? Find the count modulo 998244353.\nTwo ways to paint the tower are considered different when there exists a layer that is painted in different colors, or a layer that is painted in some color in one of the ways and not in the other.\n\nConstraints\n\n1 ≤ N ≤ 3×10^5\n\n1 ≤ A,B ≤ 3×10^5\n\n0 ≤ K ≤ 18×10^{10}\n\nAll values in the input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B K\n\nOutput\n\nPrint the number of the ways to paint tiles, modulo 998244353.\n\nSample Input 1\n\n4 1 2 5\n\nSample Output 1\n\n40\n\nIn this case, a red layer worth 1 points, a green layer worth 3 points and the blue layer worth 2 points. The beauty of the tower is 5 when we have one of the following sets of painted layers:\n\n1 green, 1 blue\n\n1 red, 2 blues\n\n2 reds, 1 green\n\n3 reds, 1 blue\n\nThe total number of the ways to produce them is 40.\n\nSample Input 2\n\n2 5 6 0\n\nSample Output 2\n\n1\n\nThe beauty of the tower is 0 only when all the layers are uncolored. Thus, the answer is 1.\n\nSample Input 3\n\n90081 33447 90629 6391049189\n\nSample Output 3\n\n577742975", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1025, "cpu_time_ms": 2103, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s902219586", "group_id": "codeNet:p03337", "input_text": "let f a b = max (a+b) (max (a-b) (a*b));;\nlet () = Scanf.scanf \"%d %d\" f\n|> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1561267775, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s902219586.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s902219586", "user_id": "u635974378"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let f a b = max (a+b) (max (a-b) (a*b));;\nlet () = Scanf.scanf \"%d %d\" f\n|> Printf.printf \"%d\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B.\nFind the largest value among A+B, A-B and A \\times B.\n\nConstraints\n\n-1000 \\leq A,B \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest value among A+B, A-B and A \\times B.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\n4\n\n3+1=4, 3-1=2 and 3 \\times 1=3. The largest among them is 4.\n\nSample Input 2\n\n4 -2\n\nSample Output 2\n\n6\n\nThe largest is 4 - (-2) = 6.\n\nSample Input 3\n\n0 0\n\nSample Output 3\n\n0", "sample_input": "3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03337", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B.\nFind the largest value among A+B, A-B and A \\times B.\n\nConstraints\n\n-1000 \\leq A,B \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the largest value among A+B, A-B and A \\times B.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\n4\n\n3+1=4, 3-1=2 and 3 \\times 1=3. The largest among them is 4.\n\nSample Input 2\n\n4 -2\n\nSample Output 2\n\n6\n\nThe largest is 4 - (-2) = 6.\n\nSample Input 3\n\n0 0\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 96, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s651793774", "group_id": "codeNet:p03338", "input_text": "let n = read_int ()\nlet s = read_line ()\nlet ans = ref 0\nlet _ = for i = 0 to n - 1 do let c = ref 0 in\n  for j = Char.code 'a' to Char.code 'z' do if String.(contains (sub s 0 i) @@ Char.chr j && contains (sub s i @@ n - i) @@ Char.chr j) then incr c done;\n  ans := max !ans !c done; Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1566785216, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s651793774.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s651793774", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let n = read_int ()\nlet s = read_line ()\nlet ans = ref 0\nlet _ = for i = 0 to n - 1 do let c = ref 0 in\n  for j = Char.code 'a' to Char.code 'z' do if String.(contains (sub s 0 i) @@ Char.chr j && contains (sub s i @@ n - i) @@ Char.chr j) then incr c done;\n  ans := max !ans !c done; Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\nWe will cut this string at one position into two strings X and Y.\nHere, we would like to maximize the number of different letters contained in both X and Y.\nFind the largest possible number of different letters contained in both X and Y when we cut the string at the optimal position.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the largest possible number of different letters contained in both X and Y.\n\nSample Input 1\n\n6\naabbca\n\nSample Output 1\n\n2\n\nIf we cut the string between the third and fourth letters into X = aab and Y = bca, the letters contained in both X and Y are a and b.\nThere will never be three or more different letters contained in both X and Y, so the answer is 2.\n\nSample Input 2\n\n10\naaaaaaaaaa\n\nSample Output 2\n\n1\n\nHowever we divide S, only a will be contained in both X and Y.\n\nSample Input 3\n\n45\ntgxgdqkyjzhyputjjtllptdfxocrylqfqjynmfbfucbir\n\nSample Output 3\n\n9", "sample_input": "6\naabbca\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03338", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\nWe will cut this string at one position into two strings X and Y.\nHere, we would like to maximize the number of different letters contained in both X and Y.\nFind the largest possible number of different letters contained in both X and Y when we cut the string at the optimal position.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the largest possible number of different letters contained in both X and Y.\n\nSample Input 1\n\n6\naabbca\n\nSample Output 1\n\n2\n\nIf we cut the string between the third and fourth letters into X = aab and Y = bca, the letters contained in both X and Y are a and b.\nThere will never be three or more different letters contained in both X and Y, so the answer is 2.\n\nSample Input 2\n\n10\naaaaaaaaaa\n\nSample Output 2\n\n1\n\nHowever we divide S, only a will be contained in both X and Y.\n\nSample Input 3\n\n45\ntgxgdqkyjzhyputjjtllptdfxocrylqfqjynmfbfucbir\n\nSample Output 3\n\n9", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 310, "cpu_time_ms": 1, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s121890017", "group_id": "codeNet:p03338", "input_text": "(* O(n^3) *)\nlet n = read_int ()\nlet s = read_line ()\nlet ans = ref 0\nlet _ =\n  for i = 1 to n - 1 do\n    let x = String.sub s 0 i in\n    let y = String.sub s i @@ n - i in\n    let flags = Array.make 128 false in\n    let count = ref 0 in\n    let f c =\n      if not flags.(int_of_char c) then\n        (flags.(int_of_char c) <- true;\n        try (String.index y c |> ignore; incr count) with\n        | _ -> ()) in\n    String.iter f x;\n    ans := max !ans !count\n  done;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1560162692, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s121890017.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s121890017", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(* O(n^3) *)\nlet n = read_int ()\nlet s = read_line ()\nlet ans = ref 0\nlet _ =\n  for i = 1 to n - 1 do\n    let x = String.sub s 0 i in\n    let y = String.sub s i @@ n - i in\n    let flags = Array.make 128 false in\n    let count = ref 0 in\n    let f c =\n      if not flags.(int_of_char c) then\n        (flags.(int_of_char c) <- true;\n        try (String.index y c |> ignore; incr count) with\n        | _ -> ()) in\n    String.iter f x;\n    ans := max !ans !count\n  done;\n  Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\nWe will cut this string at one position into two strings X and Y.\nHere, we would like to maximize the number of different letters contained in both X and Y.\nFind the largest possible number of different letters contained in both X and Y when we cut the string at the optimal position.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the largest possible number of different letters contained in both X and Y.\n\nSample Input 1\n\n6\naabbca\n\nSample Output 1\n\n2\n\nIf we cut the string between the third and fourth letters into X = aab and Y = bca, the letters contained in both X and Y are a and b.\nThere will never be three or more different letters contained in both X and Y, so the answer is 2.\n\nSample Input 2\n\n10\naaaaaaaaaa\n\nSample Output 2\n\n1\n\nHowever we divide S, only a will be contained in both X and Y.\n\nSample Input 3\n\n45\ntgxgdqkyjzhyputjjtllptdfxocrylqfqjynmfbfucbir\n\nSample Output 3\n\n9", "sample_input": "6\naabbca\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03338", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\nWe will cut this string at one position into two strings X and Y.\nHere, we would like to maximize the number of different letters contained in both X and Y.\nFind the largest possible number of different letters contained in both X and Y when we cut the string at the optimal position.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the largest possible number of different letters contained in both X and Y.\n\nSample Input 1\n\n6\naabbca\n\nSample Output 1\n\n2\n\nIf we cut the string between the third and fourth letters into X = aab and Y = bca, the letters contained in both X and Y are a and b.\nThere will never be three or more different letters contained in both X and Y, so the answer is 2.\n\nSample Input 2\n\n10\naaaaaaaaaa\n\nSample Output 2\n\n1\n\nHowever we divide S, only a will be contained in both X and Y.\n\nSample Input 3\n\n45\ntgxgdqkyjzhyputjjtllptdfxocrylqfqjynmfbfucbir\n\nSample Output 3\n\n9", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 495, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s082011927", "group_id": "codeNet:p03339", "input_text": "let rec iter a b f = if a >= b then () else (f a; iter (a+1) b f)\nlet () =\n  Scanf.scanf \"%d %s\" @@ fun n s ->\n  let w = Array.init n (fun i -> if s.[i] = 'W' then 1 else 0) in\n  let e = Array.init n (fun i -> if s.[i] = 'E' then 1 else 0) in\n  iter 1 n (fun i -> w.(i) <- w.(i) + w.(i-1));\n  iter 1 n (fun i -> e.(n-1-i) <- e.(n-1-i) + e.(n-i));\n  Array.init n (fun i ->\n    (if i > 0 then w.(i-1) else 0) + (if i+1 < n then e.(i+1) else 0))\n  |> Array.fold_left min n |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1531254206, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03339.html", "problem_id": "p03339", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03339/input.txt", "sample_output_relpath": "derived/input_output/data/p03339/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03339/OCaml/s082011927.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s082011927", "user_id": "u798181098"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let rec iter a b f = if a >= b then () else (f a; iter (a+1) b f)\nlet () =\n  Scanf.scanf \"%d %s\" @@ fun n s ->\n  let w = Array.init n (fun i -> if s.[i] = 'W' then 1 else 0) in\n  let e = Array.init n (fun i -> if s.[i] = 'E' then 1 else 0) in\n  iter 1 n (fun i -> w.(i) <- w.(i) + w.(i-1));\n  iter 1 n (fun i -> e.(n-1-i) <- e.(n-1-i) + e.(n-i));\n  Array.init n (fun i ->\n    (if i > 0 then w.(i-1) else 0) + (if i+1 < n then e.(i+1) else 0))\n  |> Array.fold_left min n |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N people standing in a row from west to east.\nEach person is facing east or west.\nThe directions of the people is given as a string S of length N.\nThe i-th person from the west is facing east if S_i = E, and west if S_i = W.\n\nYou will appoint one of the N people as the leader, then command the rest of them to face in the direction of the leader.\nHere, we do not care which direction the leader is facing.\n\nThe people in the row hate to change their directions, so you would like to select the leader so that the number of people who have to change their directions is minimized.\nFind the minimum number of people who have to change their directions.\n\nConstraints\n\n2 \\leq N \\leq 3 \\times 10^5\n\n|S| = N\n\nS_i is E or W.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of people who have to change their directions.\n\nSample Input 1\n\n5\nWEEWW\n\nSample Output 1\n\n1\n\nAssume that we appoint the third person from the west as the leader.\nThen, the first person from the west needs to face east and has to turn around.\nThe other people do not need to change their directions, so the number of people who have to change their directions is 1 in this case.\nIt is not possible to have 0 people who have to change their directions, so the answer is 1.\n\nSample Input 2\n\n12\nWEWEWEEEWWWE\n\nSample Output 2\n\n4\n\nSample Input 3\n\n8\nWWWWWEEE\n\nSample Output 3\n\n3", "sample_input": "5\nWEEWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03339", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N people standing in a row from west to east.\nEach person is facing east or west.\nThe directions of the people is given as a string S of length N.\nThe i-th person from the west is facing east if S_i = E, and west if S_i = W.\n\nYou will appoint one of the N people as the leader, then command the rest of them to face in the direction of the leader.\nHere, we do not care which direction the leader is facing.\n\nThe people in the row hate to change their directions, so you would like to select the leader so that the number of people who have to change their directions is minimized.\nFind the minimum number of people who have to change their directions.\n\nConstraints\n\n2 \\leq N \\leq 3 \\times 10^5\n\n|S| = N\n\nS_i is E or W.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of people who have to change their directions.\n\nSample Input 1\n\n5\nWEEWW\n\nSample Output 1\n\n1\n\nAssume that we appoint the third person from the west as the leader.\nThen, the first person from the west needs to face east and has to turn around.\nThe other people do not need to change their directions, so the number of people who have to change their directions is 1 in this case.\nIt is not possible to have 0 people who have to change their directions, so the answer is 1.\n\nSample Input 2\n\n12\nWEWEWEEEWWWE\n\nSample Output 2\n\n4\n\nSample Input 3\n\n8\nWWWWWEEE\n\nSample Output 3\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 493, "cpu_time_ms": 29, "memory_kb": 12288}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s763729851", "group_id": "codeNet:p03346", "input_text": "let _ = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ps = Array.init n @@ fun _ ->\n    Scanf.scanf \"%d\\n\" @@ fun p -> p in\n  (* ps.(inv_ps.(i)) = i かつ inv_ps.(ps.(i)) = i なのを作る *)\n  let inv_ps = Array.make (n + 1) 0 in\n  Array.iteri (fun i p ->\n    (* p = ps.(i) *)\n    inv_ps.(p) <- i) ps;\n  Array.init n (( + ) 1)\n  |> Array.fold_left (fun (acc, s) p ->\n      s :: acc,\n      if inv_ps.(p - 1) <= inv_ps.(p)\n      then s + 1\n      else 1) ([], 0)\n  |> (fun (acc, s) -> List.fold_left max s acc)\n  |> (( - ) n)\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1526900966, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03346.html", "problem_id": "p03346", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03346/input.txt", "sample_output_relpath": "derived/input_output/data/p03346/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03346/OCaml/s763729851.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s763729851", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let _ = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ps = Array.init n @@ fun _ ->\n    Scanf.scanf \"%d\\n\" @@ fun p -> p in\n  (* ps.(inv_ps.(i)) = i かつ inv_ps.(ps.(i)) = i なのを作る *)\n  let inv_ps = Array.make (n + 1) 0 in\n  Array.iteri (fun i p ->\n    (* p = ps.(i) *)\n    inv_ps.(p) <- i) ps;\n  Array.init n (( + ) 1)\n  |> Array.fold_left (fun (acc, s) p ->\n      s :: acc,\n      if inv_ps.(p - 1) <= inv_ps.(p)\n      then s + 1\n      else 1) ([], 0)\n  |> (fun (acc, s) -> List.fold_left max s acc)\n  |> (( - ) n)\n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a sequence (P_1,P_2,...,P_N) which is a permutation of the integers from 1 through N.\nYou would like to sort this sequence in ascending order by repeating the following operation:\n\nChoose an element in the sequence and move it to the beginning or the end of the sequence.\n\nFind the minimum number of operations required.\nIt can be proved that it is actually possible to sort the sequence using this operation.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n(P_1,P_2,...,P_N) is a permutation of (1,2,...,N).\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1\n:\nP_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4\n1\n3\n2\n4\n\nSample Output 1\n\n2\n\nFor example, the sequence can be sorted in ascending order as follows:\n\nMove 2 to the beginning. The sequence is now (2,1,3,4).\n\nMove 1 to the beginning. The sequence is now (1,2,3,4).\n\nSample Input 2\n\n6\n3\n2\n5\n1\n4\n6\n\nSample Output 2\n\n4\n\nSample Input 3\n\n8\n6\n3\n1\n2\n7\n4\n8\n5\n\nSample Output 3\n\n5", "sample_input": "4\n1\n3\n2\n4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03346", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a sequence (P_1,P_2,...,P_N) which is a permutation of the integers from 1 through N.\nYou would like to sort this sequence in ascending order by repeating the following operation:\n\nChoose an element in the sequence and move it to the beginning or the end of the sequence.\n\nFind the minimum number of operations required.\nIt can be proved that it is actually possible to sort the sequence using this operation.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n(P_1,P_2,...,P_N) is a permutation of (1,2,...,N).\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1\n:\nP_N\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4\n1\n3\n2\n4\n\nSample Output 1\n\n2\n\nFor example, the sequence can be sorted in ascending order as follows:\n\nMove 2 to the beginning. The sequence is now (2,1,3,4).\n\nMove 1 to the beginning. The sequence is now (1,2,3,4).\n\nSample Input 2\n\n6\n3\n2\n5\n1\n4\n6\n\nSample Output 2\n\n4\n\nSample Input 3\n\n8\n6\n3\n1\n2\n7\n4\n8\n5\n\nSample Output 3\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 544, "cpu_time_ms": 68, "memory_kb": 11520}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s392965429", "group_id": "codeNet:p03347", "input_text": "let n = Scanf.sscanf (read_line ()) \"%d\" @@ fun n -> n\nlet a = Array.to_list @@ Array.init n @@ fun _ -> int_of_string @@ read_line ()\n\nlet () =\n  if List.hd a != 0 then print_endline \"-1\"\n  else\n    let (sum, _) = List.fold_left (fun (sum, before) i -> \n      (sum + (if i > before then i - before else i), i)\n    ) (0, 0) @@ List.tl a in\n    Printf.printf \"%d\\n\" sum", "language": "OCaml", "metadata": {"date": 1589417311, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s392965429.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s392965429", "user_id": "u811309788"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let n = Scanf.sscanf (read_line ()) \"%d\" @@ fun n -> n\nlet a = Array.to_list @@ Array.init n @@ fun _ -> int_of_string @@ read_line ()\n\nlet () =\n  if List.hd a != 0 then print_endline \"-1\"\n  else\n    let (sum, _) = List.fold_left (fun (sum, before) i -> \n      (sum + (if i > before then i - before else i), i)\n    ) (0, 0) @@ List.tl a in\n    Printf.printf \"%d\\n\" sum", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 368, "cpu_time_ms": 38, "memory_kb": 8960}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s942630048", "group_id": "codeNet:p03351", "input_text": "let f a b c d = [abs (a-b) <= d; abs (b-c) <= d; abs (c-a)<= d];;\nlet f2 [b1;b2;b3] = if b3 then \"Yes\" else (if b2 && b1 then \"Yes\" else \"No\");;\nlet () = Scanf.scanf \"%d %d %d %d\" f\n|> f2 |> Printf.printf \"%s\\n\"", "language": "OCaml", "metadata": {"date": 1561464696, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03351.html", "problem_id": "p03351", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03351/input.txt", "sample_output_relpath": "derived/input_output/data/p03351/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03351/OCaml/s942630048.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s942630048", "user_id": "u635974378"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let f a b c d = [abs (a-b) <= d; abs (b-c) <= d; abs (c-a)<= d];;\nlet f2 [b1;b2;b3] = if b3 then \"Yes\" else (if b2 && b1 then \"Yes\" else \"No\");;\nlet () = Scanf.scanf \"%d %d %d %d\" f\n|> f2 |> Printf.printf \"%s\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThree people, A, B and C, are trying to communicate using transceivers.\nThey are standing along a number line, and the coordinates of A, B and C are a, b and c (in meters), respectively.\nTwo people can directly communicate when the distance between them is at most d meters.\nDetermine if A and C can communicate, either directly or indirectly.\nHere, A and C can indirectly communicate when A and B can directly communicate and also B and C can directly communicate.\n\nConstraints\n\n1 ≤ a,b,c ≤ 100\n\n1 ≤ d ≤ 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c d\n\nOutput\n\nIf A and C can communicate, print Yes; if they cannot, print No.\n\nSample Input 1\n\n4 7 9 3\n\nSample Output 1\n\nYes\n\nA and B can directly communicate, and also B and C can directly communicate, so we should print Yes.\n\nSample Input 2\n\n100 10 1 2\n\nSample Output 2\n\nNo\n\nThey cannot communicate in this case.\n\nSample Input 3\n\n10 10 10 1\n\nSample Output 3\n\nYes\n\nThere can be multiple people at the same position.\n\nSample Input 4\n\n1 100 2 10\n\nSample Output 4\n\nYes", "sample_input": "4 7 9 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03351", "source_text": "Score : 100 points\n\nProblem Statement\n\nThree people, A, B and C, are trying to communicate using transceivers.\nThey are standing along a number line, and the coordinates of A, B and C are a, b and c (in meters), respectively.\nTwo people can directly communicate when the distance between them is at most d meters.\nDetermine if A and C can communicate, either directly or indirectly.\nHere, A and C can indirectly communicate when A and B can directly communicate and also B and C can directly communicate.\n\nConstraints\n\n1 ≤ a,b,c ≤ 100\n\n1 ≤ d ≤ 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c d\n\nOutput\n\nIf A and C can communicate, print Yes; if they cannot, print No.\n\nSample Input 1\n\n4 7 9 3\n\nSample Output 1\n\nYes\n\nA and B can directly communicate, and also B and C can directly communicate, so we should print Yes.\n\nSample Input 2\n\n100 10 1 2\n\nSample Output 2\n\nNo\n\nThey cannot communicate in this case.\n\nSample Input 3\n\n10 10 10 1\n\nSample Output 3\n\nYes\n\nThere can be multiple people at the same position.\n\nSample Input 4\n\n1 100 2 10\n\nSample Output 4\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 211, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s237101535", "group_id": "codeNet:p03351", "input_text": "let main () =\n  let (a, b,c ,d) = Scanf.scanf \"%d %d %d %d\" (fun a b c d -> (a, b, c, d)) in\n  if (abs @@ (-) a b <= d && abs @@ (-) b c <= d) || abs @@ (-) a c <= d then\n    print_string \"Yes\\n\"\n  else\n    print_string \"No\\n\"\n\nlet () = main ()\n", "language": "OCaml", "metadata": {"date": 1545801973, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03351.html", "problem_id": "p03351", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03351/input.txt", "sample_output_relpath": "derived/input_output/data/p03351/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03351/OCaml/s237101535.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s237101535", "user_id": "u802614675"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let main () =\n  let (a, b,c ,d) = Scanf.scanf \"%d %d %d %d\" (fun a b c d -> (a, b, c, d)) in\n  if (abs @@ (-) a b <= d && abs @@ (-) b c <= d) || abs @@ (-) a c <= d then\n    print_string \"Yes\\n\"\n  else\n    print_string \"No\\n\"\n\nlet () = main ()\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThree people, A, B and C, are trying to communicate using transceivers.\nThey are standing along a number line, and the coordinates of A, B and C are a, b and c (in meters), respectively.\nTwo people can directly communicate when the distance between them is at most d meters.\nDetermine if A and C can communicate, either directly or indirectly.\nHere, A and C can indirectly communicate when A and B can directly communicate and also B and C can directly communicate.\n\nConstraints\n\n1 ≤ a,b,c ≤ 100\n\n1 ≤ d ≤ 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c d\n\nOutput\n\nIf A and C can communicate, print Yes; if they cannot, print No.\n\nSample Input 1\n\n4 7 9 3\n\nSample Output 1\n\nYes\n\nA and B can directly communicate, and also B and C can directly communicate, so we should print Yes.\n\nSample Input 2\n\n100 10 1 2\n\nSample Output 2\n\nNo\n\nThey cannot communicate in this case.\n\nSample Input 3\n\n10 10 10 1\n\nSample Output 3\n\nYes\n\nThere can be multiple people at the same position.\n\nSample Input 4\n\n1 100 2 10\n\nSample Output 4\n\nYes", "sample_input": "4 7 9 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03351", "source_text": "Score : 100 points\n\nProblem Statement\n\nThree people, A, B and C, are trying to communicate using transceivers.\nThey are standing along a number line, and the coordinates of A, B and C are a, b and c (in meters), respectively.\nTwo people can directly communicate when the distance between them is at most d meters.\nDetermine if A and C can communicate, either directly or indirectly.\nHere, A and C can indirectly communicate when A and B can directly communicate and also B and C can directly communicate.\n\nConstraints\n\n1 ≤ a,b,c ≤ 100\n\n1 ≤ d ≤ 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c d\n\nOutput\n\nIf A and C can communicate, print Yes; if they cannot, print No.\n\nSample Input 1\n\n4 7 9 3\n\nSample Output 1\n\nYes\n\nA and B can directly communicate, and also B and C can directly communicate, so we should print Yes.\n\nSample Input 2\n\n100 10 1 2\n\nSample Output 2\n\nNo\n\nThey cannot communicate in this case.\n\nSample Input 3\n\n10 10 10 1\n\nSample Output 3\n\nYes\n\nThere can be multiple people at the same position.\n\nSample Input 4\n\n1 100 2 10\n\nSample Output 4\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 245, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s177386479", "group_id": "codeNet:p03353", "input_text": "let () =\n  let s = Scanf.scanf \"%s \" (fun a -> a) in\n  let k = Scanf.scanf \"%d \" (fun a -> a) in\n\n  let length = String.length s in\n\n  let rec f str fst fnl res = \n    if fst = length then res else (\n      let res = (String.sub str fst fnl) :: res in\n      if (fst + fnl = length || fnl - fst = k) then\n        f str (fst+1) 1 res\n      else\n        f str fst (fnl+1) res\n    )\n\n  in\n  let lst = f s 0 1 [] in\n  let lst = List.sort_uniq compare lst in\n\n  print_endline (List.nth lst (k-1))\n\n", "language": "OCaml", "metadata": {"date": 1526190823, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03353.html", "problem_id": "p03353", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03353/input.txt", "sample_output_relpath": "derived/input_output/data/p03353/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03353/OCaml/s177386479.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s177386479", "user_id": "u139013163"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "let () =\n  let s = Scanf.scanf \"%s \" (fun a -> a) in\n  let k = Scanf.scanf \"%d \" (fun a -> a) in\n\n  let length = String.length s in\n\n  let rec f str fst fnl res = \n    if fst = length then res else (\n      let res = (String.sub str fst fnl) :: res in\n      if (fst + fnl = length || fnl - fst = k) then\n        f str (fst+1) 1 res\n      else\n        f str fst (fnl+1) res\n    )\n\n  in\n  let lst = f s 0 1 [] in\n  let lst = List.sort_uniq compare lst in\n\n  print_endline (List.nth lst (k-1))\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string s.\nAmong the different substrings of s, print the K-th lexicographically smallest one.\n\nA substring of s is a string obtained by taking out a non-empty contiguous part in s.\nFor example, if s = ababc, a, bab and ababc are substrings of s, while ac, z and an empty string are not.\nAlso, we say that substrings are different when they are different as strings.\n\nLet X = x_{1}x_{2}...x_{n} and Y = y_{1}y_{2}...y_{m} be two distinct strings. X is lexicographically larger than Y if and only if Y is a prefix of X or x_{j} > y_{j} where j is the smallest integer such that x_{j} \\neq y_{j}.\n\nConstraints\n\n1 ≤ |s| ≤ 5000\n\ns consists of lowercase English letters.\n\n1 ≤ K ≤ 5\n\ns has at least K different substrings.\n\nPartial Score\n\n200 points will be awarded as a partial score for passing the test set satisfying |s| ≤ 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the K-th lexicographically smallest substring of K.\n\nSample Input 1\n\naba\n4\n\nSample Output 1\n\nb\n\ns has five substrings: a, b, ab, ba and aba.\nAmong them, we should print the fourth smallest one, b.\nNote that we do not count a twice.\n\nSample Input 2\n\natcoderandatcodeer\n5\n\nSample Output 2\n\nandat\n\nSample Input 3\n\nz\n1\n\nSample Output 3\n\nz", "sample_input": "aba\n4\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03353", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2114, "memory_kb": 1704300}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s622642232", "group_id": "codeNet:p03353", "input_text": "let () =\n  let s = Scanf.scanf \"%s \" (fun a -> a) in\n  let k = Scanf.scanf \"%d \" (fun a -> a) in\n\n  let srd l = \n    let sl = List.sort compare l in\n    let rec go l acc = match l with\n      | [] -> List.rev acc\n      | [x] -> List.rev (x::acc) \n      | (x1::x2::xs) -> \n        if x1 = x2\n        then go (x2::xs) acc\n        else go (x2::xs) (x1::acc)\n    in go sl []\n  in\n\n  let length = String.length s in\n\n  let rec f str fst fnl res = \n    if fst = length then res else (\n      let res = (String.sub str fst fnl) :: res in\n      if (fst + fnl = length || fnl - fst = k) then\n        f str (fst+1) 1 res\n      else\n        f str fst (fnl+1) res\n    )\n\n  in\n  let lst = f s 0 1 [] in\n  let lst = srd lst in\n\n  List.iter print_endline lst;\n  print_endline (List.nth lst (k-1))\n\n", "language": "OCaml", "metadata": {"date": 1526190261, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03353.html", "problem_id": "p03353", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03353/input.txt", "sample_output_relpath": "derived/input_output/data/p03353/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03353/OCaml/s622642232.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s622642232", "user_id": "u139013163"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "let () =\n  let s = Scanf.scanf \"%s \" (fun a -> a) in\n  let k = Scanf.scanf \"%d \" (fun a -> a) in\n\n  let srd l = \n    let sl = List.sort compare l in\n    let rec go l acc = match l with\n      | [] -> List.rev acc\n      | [x] -> List.rev (x::acc) \n      | (x1::x2::xs) -> \n        if x1 = x2\n        then go (x2::xs) acc\n        else go (x2::xs) (x1::acc)\n    in go sl []\n  in\n\n  let length = String.length s in\n\n  let rec f str fst fnl res = \n    if fst = length then res else (\n      let res = (String.sub str fst fnl) :: res in\n      if (fst + fnl = length || fnl - fst = k) then\n        f str (fst+1) 1 res\n      else\n        f str fst (fnl+1) res\n    )\n\n  in\n  let lst = f s 0 1 [] in\n  let lst = srd lst in\n\n  List.iter print_endline lst;\n  print_endline (List.nth lst (k-1))\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string s.\nAmong the different substrings of s, print the K-th lexicographically smallest one.\n\nA substring of s is a string obtained by taking out a non-empty contiguous part in s.\nFor example, if s = ababc, a, bab and ababc are substrings of s, while ac, z and an empty string are not.\nAlso, we say that substrings are different when they are different as strings.\n\nLet X = x_{1}x_{2}...x_{n} and Y = y_{1}y_{2}...y_{m} be two distinct strings. X is lexicographically larger than Y if and only if Y is a prefix of X or x_{j} > y_{j} where j is the smallest integer such that x_{j} \\neq y_{j}.\n\nConstraints\n\n1 ≤ |s| ≤ 5000\n\ns consists of lowercase English letters.\n\n1 ≤ K ≤ 5\n\ns has at least K different substrings.\n\nPartial Score\n\n200 points will be awarded as a partial score for passing the test set satisfying |s| ≤ 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the K-th lexicographically smallest substring of K.\n\nSample Input 1\n\naba\n4\n\nSample Output 1\n\nb\n\ns has five substrings: a, b, ab, ba and aba.\nAmong them, we should print the fourth smallest one, b.\nNote that we do not count a twice.\n\nSample Input 2\n\natcoderandatcodeer\n5\n\nSample Output 2\n\nandat\n\nSample Input 3\n\nz\n1\n\nSample Output 3\n\nz", "sample_input": "aba\n4\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03353", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2114, "memory_kb": 1702896}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s650582250", "group_id": "codeNet:p03355", "input_text": "let s = read_line ()\nlet k = Scanf.sscanf (read_line ()) \"%d\" @@ fun k -> k\n\nlet s_len = String.length s\n\nlet () =\n  let acc = \n    List.init s_len (fun i -> List.init (min 5 (s_len - i)) (fun j -> String.sub s i (j + 1)))\n    |> List.flatten \n    |> List.sort_uniq compare in\n  print_endline @@ List.nth acc (k - 1)\n  ", "language": "OCaml", "metadata": {"date": 1593870015, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03355.html", "problem_id": "p03355", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03355/input.txt", "sample_output_relpath": "derived/input_output/data/p03355/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03355/OCaml/s650582250.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s650582250", "user_id": "u811309788"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "let s = read_line ()\nlet k = Scanf.sscanf (read_line ()) \"%d\" @@ fun k -> k\n\nlet s_len = String.length s\n\nlet () =\n  let acc = \n    List.init s_len (fun i -> List.init (min 5 (s_len - i)) (fun j -> String.sub s i (j + 1)))\n    |> List.flatten \n    |> List.sort_uniq compare in\n  print_endline @@ List.nth acc (k - 1)\n  ", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string s.\nAmong the different substrings of s, print the K-th lexicographically smallest one.\n\nA substring of s is a string obtained by taking out a non-empty contiguous part in s.\nFor example, if s = ababc, a, bab and ababc are substrings of s, while ac, z and an empty string are not.\nAlso, we say that substrings are different when they are different as strings.\n\nLet X = x_{1}x_{2}...x_{n} and Y = y_{1}y_{2}...y_{m} be two distinct strings. X is lexicographically larger than Y if and only if Y is a prefix of X or x_{j} > y_{j} where j is the smallest integer such that x_{j} \\neq y_{j}.\n\nConstraints\n\n1 ≤ |s| ≤ 5000\n\ns consists of lowercase English letters.\n\n1 ≤ K ≤ 5\n\ns has at least K different substrings.\n\nPartial Score\n\n200 points will be awarded as a partial score for passing the test set satisfying |s| ≤ 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the K-th lexicographically smallest substring of K.\n\nSample Input 1\n\naba\n4\n\nSample Output 1\n\nb\n\ns has five substrings: a, b, ab, ba and aba.\nAmong them, we should print the fourth smallest one, b.\nNote that we do not count a twice.\n\nSample Input 2\n\natcoderandatcodeer\n5\n\nSample Output 2\n\nandat\n\nSample Input 3\n\nz\n1\n\nSample Output 3\n\nz", "sample_input": "aba\n4\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03355", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string s.\nAmong the different substrings of s, print the K-th lexicographically smallest one.\n\nA substring of s is a string obtained by taking out a non-empty contiguous part in s.\nFor example, if s = ababc, a, bab and ababc are substrings of s, while ac, z and an empty string are not.\nAlso, we say that substrings are different when they are different as strings.\n\nLet X = x_{1}x_{2}...x_{n} and Y = y_{1}y_{2}...y_{m} be two distinct strings. X is lexicographically larger than Y if and only if Y is a prefix of X or x_{j} > y_{j} where j is the smallest integer such that x_{j} \\neq y_{j}.\n\nConstraints\n\n1 ≤ |s| ≤ 5000\n\ns consists of lowercase English letters.\n\n1 ≤ K ≤ 5\n\ns has at least K different substrings.\n\nPartial Score\n\n200 points will be awarded as a partial score for passing the test set satisfying |s| ≤ 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the K-th lexicographically smallest substring of K.\n\nSample Input 1\n\naba\n4\n\nSample Output 1\n\nb\n\ns has five substrings: a, b, ab, ba and aba.\nAmong them, we should print the fourth smallest one, b.\nNote that we do not count a twice.\n\nSample Input 2\n\natcoderandatcodeer\n5\n\nSample Output 2\n\nandat\n\nSample Input 3\n\nz\n1\n\nSample Output 3\n\nz", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 24, "memory_kb": 7992}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s382975408", "group_id": "codeNet:p03357", "input_text": "let rec solve trace (acc, cas) (c, a) =\n  match cas with\n  | [] -> (acc, List.rev_append trace [(c, a)])\n  | (c', a') :: cas' ->\n      if c = c' && a <= a' then\n        (acc + List.length cas, List.rev_append trace ((c, a) :: cas))\n      else\n        solve ((c', a') :: trace) (acc, cas') (c, a)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let cas = Array.init (2 * n) @@ fun _ -> Scanf.scanf \"%c %d\\n\" @@ fun c a -> c, a in\n  Printf.printf \"%d\\n\" @@ fst @@ Array.fold_left (solve []) (0, []) cas\n\n", "language": "OCaml", "metadata": {"date": 1536127438, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03357.html", "problem_id": "p03357", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03357/input.txt", "sample_output_relpath": "derived/input_output/data/p03357/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03357/OCaml/s382975408.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s382975408", "user_id": "u504158101"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let rec solve trace (acc, cas) (c, a) =\n  match cas with\n  | [] -> (acc, List.rev_append trace [(c, a)])\n  | (c', a') :: cas' ->\n      if c = c' && a <= a' then\n        (acc + List.length cas, List.rev_append trace ((c, a) :: cas))\n      else\n        solve ((c', a') :: trace) (acc, cas') (c, a)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let cas = Array.init (2 * n) @@ fun _ -> Scanf.scanf \"%c %d\\n\" @@ fun c a -> c, a in\n  Printf.printf \"%d\\n\" @@ fst @@ Array.fold_left (solve []) (0, []) cas\n\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere are 2N balls, N white and N black, arranged in a row. The integers from 1 through N are written on the white balls, one on each ball, and they are also written on the black balls, one on each ball.\nThe integer written on the i-th ball from the left (1 ≤ i ≤ 2N) is a_i, and the color of this ball is represented by a letter c_i.\nc_i = W represents the ball is white; c_i = B represents the ball is black.\n\nTakahashi the human wants to achieve the following objective:\n\nFor every pair of integers (i,j) such that 1 ≤ i < j ≤ N, the white ball with i written on it is to the left of the white ball with j written on it.\n\nFor every pair of integers (i,j) such that 1 ≤ i < j ≤ N, the black ball with i written on it is to the left of the black ball with j written on it.\n\nIn order to achieve this, he can perform the following operation:\n\nSwap two adjacent balls.\n\nFind the minimum number of operations required to achieve the objective.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1 ≤ a_i ≤ N\n\nc_i = W or c_i = B.\n\nIf i ≠ j, (a_i,c_i) ≠ (a_j,c_j).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nc_1 a_1\nc_2 a_2\n:\nc_{2N} a_{2N}\n\nOutput\n\nPrint the minimum number of operations required to achieve the objective.\n\nSample Input 1\n\n3\nB 1\nW 2\nB 3\nW 1\nW 3\nB 2\n\nSample Output 1\n\n4\n\nThe objective can be achieved in four operations, for example, as follows:\n\nSwap the black 3 and white 1.\n\nSwap the white 1 and white 2.\n\nSwap the black 3 and white 3.\n\nSwap the black 3 and black 2.\n\nSample Input 2\n\n4\nB 4\nW 4\nB 3\nW 3\nB 2\nW 2\nB 1\nW 1\n\nSample Output 2\n\n18\n\nSample Input 3\n\n9\nW 3\nB 1\nB 4\nW 1\nB 5\nW 9\nW 2\nB 6\nW 5\nB 3\nW 8\nB 9\nW 7\nB 2\nB 8\nW 4\nW 6\nB 7\n\nSample Output 3\n\n41", "sample_input": "3\nB 1\nW 2\nB 3\nW 1\nW 3\nB 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03357", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere are 2N balls, N white and N black, arranged in a row. The integers from 1 through N are written on the white balls, one on each ball, and they are also written on the black balls, one on each ball.\nThe integer written on the i-th ball from the left (1 ≤ i ≤ 2N) is a_i, and the color of this ball is represented by a letter c_i.\nc_i = W represents the ball is white; c_i = B represents the ball is black.\n\nTakahashi the human wants to achieve the following objective:\n\nFor every pair of integers (i,j) such that 1 ≤ i < j ≤ N, the white ball with i written on it is to the left of the white ball with j written on it.\n\nFor every pair of integers (i,j) such that 1 ≤ i < j ≤ N, the black ball with i written on it is to the left of the black ball with j written on it.\n\nIn order to achieve this, he can perform the following operation:\n\nSwap two adjacent balls.\n\nFind the minimum number of operations required to achieve the objective.\n\nConstraints\n\n1 ≤ N ≤ 2000\n\n1 ≤ a_i ≤ N\n\nc_i = W or c_i = B.\n\nIf i ≠ j, (a_i,c_i) ≠ (a_j,c_j).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nc_1 a_1\nc_2 a_2\n:\nc_{2N} a_{2N}\n\nOutput\n\nPrint the minimum number of operations required to achieve the objective.\n\nSample Input 1\n\n3\nB 1\nW 2\nB 3\nW 1\nW 3\nB 2\n\nSample Output 1\n\n4\n\nThe objective can be achieved in four operations, for example, as follows:\n\nSwap the black 3 and white 1.\n\nSwap the white 1 and white 2.\n\nSwap the black 3 and white 3.\n\nSwap the black 3 and black 2.\n\nSample Input 2\n\n4\nB 4\nW 4\nB 3\nW 3\nB 2\nW 2\nB 1\nW 1\n\nSample Output 2\n\n18\n\nSample Input 3\n\n9\nW 3\nB 1\nB 4\nW 1\nB 5\nW 9\nW 2\nB 6\nW 5\nB 3\nW 8\nB 9\nW 7\nB 2\nB 8\nW 4\nW 6\nB 7\n\nSample Output 3\n\n41", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 330, "memory_kb": 6016}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s989429536", "group_id": "codeNet:p03359", "input_text": "Scanf.scanf \"%d %d\" @@ fun a b -> Printf.printf \"%d\\n\" @@ if a <= b then a else a - 1", "language": "OCaml", "metadata": {"date": 1562325174, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s989429536.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s989429536", "user_id": "u732304692"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" @@ fun a b -> Printf.printf \"%d\\n\" @@ if a <= b then a else a - 1", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder Kingdom, Gregorian calendar is used, and dates are written in the \"year-month-day\" order, or the \"month-day\" order without the year.\n\nFor example, May 3, 2018 is written as 2018-5-3, or 5-3 without the year.\n\nIn this country, a date is called Takahashi when the month and the day are equal as numbers. For example, 5-5 is Takahashi.\n\nHow many days from 2018-1-1 through 2018-a-b are Takahashi?\n\nConstraints\n\na is an integer between 1 and 12 (inclusive).\n\nb is an integer between 1 and 31 (inclusive).\n\n2018-a-b is a valid date in Gregorian calendar.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nPrint the number of days from 2018-1-1 through 2018-a-b that are Takahashi.\n\nSample Input 1\n\n5 5\n\nSample Output 1\n\n5\n\nThere are five days that are Takahashi: 1-1, 2-2, 3-3, 4-4 and 5-5.\n\nSample Input 2\n\n2 1\n\nSample Output 2\n\n1\n\nThere is only one day that is Takahashi: 1-1.\n\nSample Input 3\n\n11 30\n\nSample Output 3\n\n11\n\nThere are eleven days that are Takahashi: 1-1, 2-2, 3-3, 4-4, 5-5, 6-6, 7-7, 8-8, 9-9, 10-10 and 11-11.", "sample_input": "5 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03359", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder Kingdom, Gregorian calendar is used, and dates are written in the \"year-month-day\" order, or the \"month-day\" order without the year.\n\nFor example, May 3, 2018 is written as 2018-5-3, or 5-3 without the year.\n\nIn this country, a date is called Takahashi when the month and the day are equal as numbers. For example, 5-5 is Takahashi.\n\nHow many days from 2018-1-1 through 2018-a-b are Takahashi?\n\nConstraints\n\na is an integer between 1 and 12 (inclusive).\n\nb is an integer between 1 and 31 (inclusive).\n\n2018-a-b is a valid date in Gregorian calendar.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nPrint the number of days from 2018-1-1 through 2018-a-b that are Takahashi.\n\nSample Input 1\n\n5 5\n\nSample Output 1\n\n5\n\nThere are five days that are Takahashi: 1-1, 2-2, 3-3, 4-4 and 5-5.\n\nSample Input 2\n\n2 1\n\nSample Output 2\n\n1\n\nThere is only one day that is Takahashi: 1-1.\n\nSample Input 3\n\n11 30\n\nSample Output 3\n\n11\n\nThere are eleven days that are Takahashi: 1-1, 2-2, 3-3, 4-4, 5-5, 6-6, 7-7, 8-8, 9-9, 10-10 and 11-11.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 85, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s640570740", "group_id": "codeNet:p03359", "input_text": "let f a b = if a <= b then a else a-1;;\nlet () = Scanf.scanf \"%d %d\" f\n|> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1561264307, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s640570740.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s640570740", "user_id": "u635974378"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let f a b = if a <= b then a else a-1;;\nlet () = Scanf.scanf \"%d %d\" f\n|> Printf.printf \"%d\\n\"", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder Kingdom, Gregorian calendar is used, and dates are written in the \"year-month-day\" order, or the \"month-day\" order without the year.\n\nFor example, May 3, 2018 is written as 2018-5-3, or 5-3 without the year.\n\nIn this country, a date is called Takahashi when the month and the day are equal as numbers. For example, 5-5 is Takahashi.\n\nHow many days from 2018-1-1 through 2018-a-b are Takahashi?\n\nConstraints\n\na is an integer between 1 and 12 (inclusive).\n\nb is an integer between 1 and 31 (inclusive).\n\n2018-a-b is a valid date in Gregorian calendar.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nPrint the number of days from 2018-1-1 through 2018-a-b that are Takahashi.\n\nSample Input 1\n\n5 5\n\nSample Output 1\n\n5\n\nThere are five days that are Takahashi: 1-1, 2-2, 3-3, 4-4 and 5-5.\n\nSample Input 2\n\n2 1\n\nSample Output 2\n\n1\n\nThere is only one day that is Takahashi: 1-1.\n\nSample Input 3\n\n11 30\n\nSample Output 3\n\n11\n\nThere are eleven days that are Takahashi: 1-1, 2-2, 3-3, 4-4, 5-5, 6-6, 7-7, 8-8, 9-9, 10-10 and 11-11.", "sample_input": "5 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03359", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder Kingdom, Gregorian calendar is used, and dates are written in the \"year-month-day\" order, or the \"month-day\" order without the year.\n\nFor example, May 3, 2018 is written as 2018-5-3, or 5-3 without the year.\n\nIn this country, a date is called Takahashi when the month and the day are equal as numbers. For example, 5-5 is Takahashi.\n\nHow many days from 2018-1-1 through 2018-a-b are Takahashi?\n\nConstraints\n\na is an integer between 1 and 12 (inclusive).\n\nb is an integer between 1 and 31 (inclusive).\n\n2018-a-b is a valid date in Gregorian calendar.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nPrint the number of days from 2018-1-1 through 2018-a-b that are Takahashi.\n\nSample Input 1\n\n5 5\n\nSample Output 1\n\n5\n\nThere are five days that are Takahashi: 1-1, 2-2, 3-3, 4-4 and 5-5.\n\nSample Input 2\n\n2 1\n\nSample Output 2\n\n1\n\nThere is only one day that is Takahashi: 1-1.\n\nSample Input 3\n\n11 30\n\nSample Output 3\n\n11\n\nThere are eleven days that are Takahashi: 1-1, 2-2, 3-3, 4-4, 5-5, 6-6, 7-7, 8-8, 9-9, 10-10 and 11-11.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 94, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s034208385", "group_id": "codeNet:p03359", "input_text": "(* エラトステネスのふるい *)\nlet sieve :\n  (* 素数かどうかを判定する自然数の上界 *)\n  int ->\n  (* 素数ならtrueを返す関数 *)\n  (int -> bool)\n  = fun n ->\n    let a = Array.make n true in\n    a.(0) <- false;\n    a.(1) <- false;\n    for p = 2 to int_of_float @@ ceil @@ sqrt @@ float_of_int n do\n      if a.(p) then\n        for i = p to (n - 1) / p do\n          a.(p * i) <- false\n        done\n    done;\n    Array.get a\n \nlet rec take n = function\n  | [] -> []\n  | x :: xs ->\n      if n = 0 then []\n      else x :: take (n - 1) xs\n \nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let p = sieve 55555 in\n  Array.init 55555 (fun i -> i)\n  |> Array.to_list\n  (*\n   * (5i + 1) + (5j + 1) + (5k + 1) + (5l + 1) + (5m + 1) \n   * = 5 (i + j + k + l + m + 1)\n   *)\n  |> List.filter (fun n -> n mod 5 = 1 && p n)\n  |> take n\n  |> List.iter (Printf.printf \"%d \")", "language": "OCaml", "metadata": {"date": 1525577315, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s034208385.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s034208385", "user_id": "u504158101"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "(* エラトステネスのふるい *)\nlet sieve :\n  (* 素数かどうかを判定する自然数の上界 *)\n  int ->\n  (* 素数ならtrueを返す関数 *)\n  (int -> bool)\n  = fun n ->\n    let a = Array.make n true in\n    a.(0) <- false;\n    a.(1) <- false;\n    for p = 2 to int_of_float @@ ceil @@ sqrt @@ float_of_int n do\n      if a.(p) then\n        for i = p to (n - 1) / p do\n          a.(p * i) <- false\n        done\n    done;\n    Array.get a\n \nlet rec take n = function\n  | [] -> []\n  | x :: xs ->\n      if n = 0 then []\n      else x :: take (n - 1) xs\n \nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let p = sieve 55555 in\n  Array.init 55555 (fun i -> i)\n  |> Array.to_list\n  (*\n   * (5i + 1) + (5j + 1) + (5k + 1) + (5l + 1) + (5m + 1) \n   * = 5 (i + j + k + l + m + 1)\n   *)\n  |> List.filter (fun n -> n mod 5 = 1 && p n)\n  |> take n\n  |> List.iter (Printf.printf \"%d \")", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder Kingdom, Gregorian calendar is used, and dates are written in the \"year-month-day\" order, or the \"month-day\" order without the year.\n\nFor example, May 3, 2018 is written as 2018-5-3, or 5-3 without the year.\n\nIn this country, a date is called Takahashi when the month and the day are equal as numbers. For example, 5-5 is Takahashi.\n\nHow many days from 2018-1-1 through 2018-a-b are Takahashi?\n\nConstraints\n\na is an integer between 1 and 12 (inclusive).\n\nb is an integer between 1 and 31 (inclusive).\n\n2018-a-b is a valid date in Gregorian calendar.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nPrint the number of days from 2018-1-1 through 2018-a-b that are Takahashi.\n\nSample Input 1\n\n5 5\n\nSample Output 1\n\n5\n\nThere are five days that are Takahashi: 1-1, 2-2, 3-3, 4-4 and 5-5.\n\nSample Input 2\n\n2 1\n\nSample Output 2\n\n1\n\nThere is only one day that is Takahashi: 1-1.\n\nSample Input 3\n\n11 30\n\nSample Output 3\n\n11\n\nThere are eleven days that are Takahashi: 1-1, 2-2, 3-3, 4-4, 5-5, 6-6, 7-7, 8-8, 9-9, 10-10 and 11-11.", "sample_input": "5 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03359", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder Kingdom, Gregorian calendar is used, and dates are written in the \"year-month-day\" order, or the \"month-day\" order without the year.\n\nFor example, May 3, 2018 is written as 2018-5-3, or 5-3 without the year.\n\nIn this country, a date is called Takahashi when the month and the day are equal as numbers. For example, 5-5 is Takahashi.\n\nHow many days from 2018-1-1 through 2018-a-b are Takahashi?\n\nConstraints\n\na is an integer between 1 and 12 (inclusive).\n\nb is an integer between 1 and 31 (inclusive).\n\n2018-a-b is a valid date in Gregorian calendar.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nPrint the number of days from 2018-1-1 through 2018-a-b that are Takahashi.\n\nSample Input 1\n\n5 5\n\nSample Output 1\n\n5\n\nThere are five days that are Takahashi: 1-1, 2-2, 3-3, 4-4 and 5-5.\n\nSample Input 2\n\n2 1\n\nSample Output 2\n\n1\n\nThere is only one day that is Takahashi: 1-1.\n\nSample Input 3\n\n11 30\n\nSample Output 3\n\n11\n\nThere are eleven days that are Takahashi: 1-1, 2-2, 3-3, 4-4, 5-5, 6-6, 7-7, 8-8, 9-9, 10-10 and 11-11.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 881, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s155856221", "group_id": "codeNet:p03359", "input_text": "let main () =\n  let a, b, c = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> a, b, c) in\n  let k = Scanf.scanf \"%d\\n\" (fun a -> a) in\n  let rec pow i j = if j = 1 then i else pow (i * i) (j - 1) in\n  let ans1 = a * (pow 2 k) + b + c in\n  let ans2 = a + b * (pow 2 k) + c in\n  let ans3 = a + b + c * (pow 2 k) in\n  Printf.printf \"%d\\n\" (max (max ans1 ans2) ans3);;\n\nlet _ = main ()\n", "language": "OCaml", "metadata": {"date": 1525569130, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s155856221.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s155856221", "user_id": "u088955385"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let main () =\n  let a, b, c = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> a, b, c) in\n  let k = Scanf.scanf \"%d\\n\" (fun a -> a) in\n  let rec pow i j = if j = 1 then i else pow (i * i) (j - 1) in\n  let ans1 = a * (pow 2 k) + b + c in\n  let ans2 = a + b * (pow 2 k) + c in\n  let ans3 = a + b + c * (pow 2 k) in\n  Printf.printf \"%d\\n\" (max (max ans1 ans2) ans3);;\n\nlet _ = main ()\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder Kingdom, Gregorian calendar is used, and dates are written in the \"year-month-day\" order, or the \"month-day\" order without the year.\n\nFor example, May 3, 2018 is written as 2018-5-3, or 5-3 without the year.\n\nIn this country, a date is called Takahashi when the month and the day are equal as numbers. For example, 5-5 is Takahashi.\n\nHow many days from 2018-1-1 through 2018-a-b are Takahashi?\n\nConstraints\n\na is an integer between 1 and 12 (inclusive).\n\nb is an integer between 1 and 31 (inclusive).\n\n2018-a-b is a valid date in Gregorian calendar.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nPrint the number of days from 2018-1-1 through 2018-a-b that are Takahashi.\n\nSample Input 1\n\n5 5\n\nSample Output 1\n\n5\n\nThere are five days that are Takahashi: 1-1, 2-2, 3-3, 4-4 and 5-5.\n\nSample Input 2\n\n2 1\n\nSample Output 2\n\n1\n\nThere is only one day that is Takahashi: 1-1.\n\nSample Input 3\n\n11 30\n\nSample Output 3\n\n11\n\nThere are eleven days that are Takahashi: 1-1, 2-2, 3-3, 4-4, 5-5, 6-6, 7-7, 8-8, 9-9, 10-10 and 11-11.", "sample_input": "5 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03359", "source_text": "Score: 100 points\n\nProblem Statement\n\nIn AtCoder Kingdom, Gregorian calendar is used, and dates are written in the \"year-month-day\" order, or the \"month-day\" order without the year.\n\nFor example, May 3, 2018 is written as 2018-5-3, or 5-3 without the year.\n\nIn this country, a date is called Takahashi when the month and the day are equal as numbers. For example, 5-5 is Takahashi.\n\nHow many days from 2018-1-1 through 2018-a-b are Takahashi?\n\nConstraints\n\na is an integer between 1 and 12 (inclusive).\n\nb is an integer between 1 and 31 (inclusive).\n\n2018-a-b is a valid date in Gregorian calendar.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nPrint the number of days from 2018-1-1 through 2018-a-b that are Takahashi.\n\nSample Input 1\n\n5 5\n\nSample Output 1\n\n5\n\nThere are five days that are Takahashi: 1-1, 2-2, 3-3, 4-4 and 5-5.\n\nSample Input 2\n\n2 1\n\nSample Output 2\n\n1\n\nThere is only one day that is Takahashi: 1-1.\n\nSample Input 3\n\n11 30\n\nSample Output 3\n\n11\n\nThere are eleven days that are Takahashi: 1-1, 2-2, 3-3, 4-4, 5-5, 6-6, 7-7, 8-8, 9-9, 10-10 and 11-11.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 373, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s344012385", "group_id": "codeNet:p03363", "input_text": "(* O(n) *)\nopen Array\nopen Hashtbl\nlet n = Scanf.scanf \" %d\" @@ (+) 0\nlet a_s = init n @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet sums = make (n + 1) 0\nlet h = create @@ n + 1\nlet f s = try let c = find h s in replace h s @@ c + 1 with _ -> add h s 1\nlet _ =\n  iteri (fun i a -> sums.(i + 1) <- sums.(i) + a) a_s;\n  Array.iter f sums;\n  fold (fun s c acc -> acc + if c > 1 then c * (c - 1) / 2 else 0) h 0 |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1560958832, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s344012385.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s344012385", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(* O(n) *)\nopen Array\nopen Hashtbl\nlet n = Scanf.scanf \" %d\" @@ (+) 0\nlet a_s = init n @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet sums = make (n + 1) 0\nlet h = create @@ n + 1\nlet f s = try let c = find h s in replace h s @@ c + 1 with _ -> add h s 1\nlet _ =\n  iteri (fun i a -> sums.(i + 1) <- sums.(i) + a) a_s;\n  Array.iter f sums;\n  fold (fun s c acc -> acc + if c > 1 then c * (c - 1) / 2 else 0) h 0 |> Printf.printf \"%d\\n\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have an integer sequence A, whose length is N.\n\nFind the number of the non-empty contiguous subsequences of A whose sums are 0.\nNote that we are counting the ways to take out subsequences.\nThat is, even if the contents of some two subsequences are the same, they are counted individually if they are taken from different positions.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFind the number of the non-empty contiguous subsequences of A whose sum is 0.\n\nSample Input 1\n\n6\n1 3 -4 2 2 -2\n\nSample Output 1\n\n3\n\nThere are three contiguous subsequences whose sums are 0: (1,3,-4), (-4,2,2) and (2,-2).\n\nSample Input 2\n\n7\n1 -1 1 -1 1 -1 1\n\nSample Output 2\n\n12\n\nIn this case, some subsequences that have the same contents but are taken from different positions are counted individually.\nFor example, three occurrences of (1, -1) are counted.\n\nSample Input 3\n\n5\n1 -2 3 -4 5\n\nSample Output 3\n\n0\n\nThere are no contiguous subsequences whose sums are 0.", "sample_input": "6\n1 3 -4 2 2 -2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03363", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have an integer sequence A, whose length is N.\n\nFind the number of the non-empty contiguous subsequences of A whose sums are 0.\nNote that we are counting the ways to take out subsequences.\nThat is, even if the contents of some two subsequences are the same, they are counted individually if they are taken from different positions.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFind the number of the non-empty contiguous subsequences of A whose sum is 0.\n\nSample Input 1\n\n6\n1 3 -4 2 2 -2\n\nSample Output 1\n\n3\n\nThere are three contiguous subsequences whose sums are 0: (1,3,-4), (-4,2,2) and (2,-2).\n\nSample Input 2\n\n7\n1 -1 1 -1 1 -1 1\n\nSample Output 2\n\n12\n\nIn this case, some subsequences that have the same contents but are taken from different positions are counted individually.\nFor example, three occurrences of (1, -1) are counted.\n\nSample Input 3\n\n5\n1 -2 3 -4 5\n\nSample Output 3\n\n0\n\nThere are no contiguous subsequences whose sums are 0.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 429, "cpu_time_ms": 96, "memory_kb": 14464}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s683331499", "group_id": "codeNet:p03363", "input_text": "open Batteries\n\nmodule Int64map = Map.Make(Int64)\n\nlet () =\n  let a = Scanf.scanf \"%d\\n\" (fun a -> a) in\n\n  let arr = Array.make a 0L in\n  for i = 0 to a-1-1 do\n    let c = Scanf.scanf \"%Ld \" (fun c -> c) in\n    Array.set arr i c\n  done;\n  let c = Scanf.scanf \"%Ld\\n\" (fun c -> c) in\n  Array.set arr (a-1) c;\n\n  let arr2 = Array.make a 0L in\n  for i=0 to a-1 do\n    arr2.(i) <- (Int64.add arr.(i) (if i<>0 then arr2.(i-1) else 0L));\n  done;\n\n  let arr2 = Array.append arr2 [|0L|] in\n\n  let nc2 n =\n    if n < 2L then 0L else Int64.div (Int64.mul n (Int64.sub n 1L)) 2L\n  in\n\n  let m = ref Int64map.empty in\n\n  Array.iter (fun x ->\n      if Int64map.mem x !m then (\n        m := Int64map.add x (Int64.add (Int64map.find x !m) 1L) !m;\n      ) else (\n        m := Int64map.add x 1L !m;\n      );\n    ) arr2;\n\n  let mm = Int64map.map (nc2) !m in\n  let cnt = Int64map.fold (fun k v1 v2 -> Int64.add v1 v2) mm 0L in\n\n  print_endline (Int64.to_string cnt)\n", "language": "OCaml", "metadata": {"date": 1524990383, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s683331499.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s683331499", "user_id": "u139013163"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Batteries\n\nmodule Int64map = Map.Make(Int64)\n\nlet () =\n  let a = Scanf.scanf \"%d\\n\" (fun a -> a) in\n\n  let arr = Array.make a 0L in\n  for i = 0 to a-1-1 do\n    let c = Scanf.scanf \"%Ld \" (fun c -> c) in\n    Array.set arr i c\n  done;\n  let c = Scanf.scanf \"%Ld\\n\" (fun c -> c) in\n  Array.set arr (a-1) c;\n\n  let arr2 = Array.make a 0L in\n  for i=0 to a-1 do\n    arr2.(i) <- (Int64.add arr.(i) (if i<>0 then arr2.(i-1) else 0L));\n  done;\n\n  let arr2 = Array.append arr2 [|0L|] in\n\n  let nc2 n =\n    if n < 2L then 0L else Int64.div (Int64.mul n (Int64.sub n 1L)) 2L\n  in\n\n  let m = ref Int64map.empty in\n\n  Array.iter (fun x ->\n      if Int64map.mem x !m then (\n        m := Int64map.add x (Int64.add (Int64map.find x !m) 1L) !m;\n      ) else (\n        m := Int64map.add x 1L !m;\n      );\n    ) arr2;\n\n  let mm = Int64map.map (nc2) !m in\n  let cnt = Int64map.fold (fun k v1 v2 -> Int64.add v1 v2) mm 0L in\n\n  print_endline (Int64.to_string cnt)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have an integer sequence A, whose length is N.\n\nFind the number of the non-empty contiguous subsequences of A whose sums are 0.\nNote that we are counting the ways to take out subsequences.\nThat is, even if the contents of some two subsequences are the same, they are counted individually if they are taken from different positions.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFind the number of the non-empty contiguous subsequences of A whose sum is 0.\n\nSample Input 1\n\n6\n1 3 -4 2 2 -2\n\nSample Output 1\n\n3\n\nThere are three contiguous subsequences whose sums are 0: (1,3,-4), (-4,2,2) and (2,-2).\n\nSample Input 2\n\n7\n1 -1 1 -1 1 -1 1\n\nSample Output 2\n\n12\n\nIn this case, some subsequences that have the same contents but are taken from different positions are counted individually.\nFor example, three occurrences of (1, -1) are counted.\n\nSample Input 3\n\n5\n1 -2 3 -4 5\n\nSample Output 3\n\n0\n\nThere are no contiguous subsequences whose sums are 0.", "sample_input": "6\n1 3 -4 2 2 -2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03363", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have an integer sequence A, whose length is N.\n\nFind the number of the non-empty contiguous subsequences of A whose sums are 0.\nNote that we are counting the ways to take out subsequences.\nThat is, even if the contents of some two subsequences are the same, they are counted individually if they are taken from different positions.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFind the number of the non-empty contiguous subsequences of A whose sum is 0.\n\nSample Input 1\n\n6\n1 3 -4 2 2 -2\n\nSample Output 1\n\n3\n\nThere are three contiguous subsequences whose sums are 0: (1,3,-4), (-4,2,2) and (2,-2).\n\nSample Input 2\n\n7\n1 -1 1 -1 1 -1 1\n\nSample Output 2\n\n12\n\nIn this case, some subsequences that have the same contents but are taken from different positions are counted individually.\nFor example, three occurrences of (1, -1) are counted.\n\nSample Input 3\n\n5\n1 -2 3 -4 5\n\nSample Output 3\n\n0\n\nThere are no contiguous subsequences whose sums are 0.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 948, "cpu_time_ms": 302, "memory_kb": 33848}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s771177475", "group_id": "codeNet:p03364", "input_text": "let rec for_fold a b v f = if a >= b then v else for_fold (a+1) b (f v a) f\nlet () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let s = Array.init n (fun _ -> Scanf.scanf \" %s\" (fun x -> x)) in\n  let s = Array.init (2*n-1) (fun i ->\n    Array.init n (fun j -> s.(i mod n).[j mod n])) in\n  for_fold 0 n 0 (fun c i ->\n    let sym =\n      for_fold 0 (n*n) true (fun b j ->\n        b && s.(i + j/n).(j mod n) = s.(i + j mod n).(j/n))\n    in c + if sym then n else 0)\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1535128427, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03364.html", "problem_id": "p03364", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03364/input.txt", "sample_output_relpath": "derived/input_output/data/p03364/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03364/OCaml/s771177475.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s771177475", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let rec for_fold a b v f = if a >= b then v else for_fold (a+1) b (f v a) f\nlet () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let s = Array.init n (fun _ -> Scanf.scanf \" %s\" (fun x -> x)) in\n  let s = Array.init (2*n-1) (fun i ->\n    Array.init n (fun j -> s.(i mod n).[j mod n])) in\n  for_fold 0 n 0 (fun c i ->\n    let sym =\n      for_fold 0 (n*n) true (fun b j ->\n        b && s.(i + j/n).(j mod n) = s.(i + j mod n).(j/n))\n    in c + if sym then n else 0)\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 500 points\n\nProblem Statement\n\nSnuke has two boards, each divided into a grid with N rows and N columns.\nFor both of these boards, the square at the i-th row from the top and the j-th column from the left is called Square (i,j).\n\nThere is a lowercase English letter written in each square on the first board. The letter written in Square (i,j) is S_{i,j}. On the second board, nothing is written yet.\n\nSnuke will write letters on the second board, as follows:\n\nFirst, choose two integers A and B ( 0 \\leq A, B < N ).\n\nWrite one letter in each square on the second board.\nSpecifically, write the letter written in Square ( i+A, j+B ) on the first board into Square (i,j) on the second board.\nHere, the k-th row is also represented as the (N+k)-th row, and the k-th column is also represented as the (N+k)-th column.\n\nAfter this operation, the second board is called a good board when, for every i and j ( 1 \\leq i, j \\leq N ), the letter in Square (i,j) and the letter in Square (j,i) are equal.\n\nFind the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nConstraints\n\n1 \\leq N \\leq 300\n\nS_{i,j} ( 1 \\leq i, j \\leq N ) is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_{1,1}S_{1,2}..S_{1,N}\nS_{2,1}S_{2,2}..S_{2,N}\n:\nS_{N,1}S_{N,2}..S_{N,N}\n\nOutput\n\nPrint the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nSample Input 1\n\n2\nab\nca\n\nSample Output 1\n\n2\n\nFor each pair of A and B, the second board will look as shown below:\n\nThe second board is a good board when (A,B) = (0,1) or (A,B) = (1,0), thus the answer is 2.\n\nSample Input 2\n\n4\naaaa\naaaa\naaaa\naaaa\n\nSample Output 2\n\n16\n\nEvery possible choice of A and B makes the second board good.\n\nSample Input 3\n\n5\nabcde\nfghij\nklmno\npqrst\nuvwxy\n\nSample Output 3\n\n0\n\nNo possible choice of A and B makes the second board good.", "sample_input": "2\nab\nca\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03364", "source_text": "Score : 500 points\n\nProblem Statement\n\nSnuke has two boards, each divided into a grid with N rows and N columns.\nFor both of these boards, the square at the i-th row from the top and the j-th column from the left is called Square (i,j).\n\nThere is a lowercase English letter written in each square on the first board. The letter written in Square (i,j) is S_{i,j}. On the second board, nothing is written yet.\n\nSnuke will write letters on the second board, as follows:\n\nFirst, choose two integers A and B ( 0 \\leq A, B < N ).\n\nWrite one letter in each square on the second board.\nSpecifically, write the letter written in Square ( i+A, j+B ) on the first board into Square (i,j) on the second board.\nHere, the k-th row is also represented as the (N+k)-th row, and the k-th column is also represented as the (N+k)-th column.\n\nAfter this operation, the second board is called a good board when, for every i and j ( 1 \\leq i, j \\leq N ), the letter in Square (i,j) and the letter in Square (j,i) are equal.\n\nFind the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nConstraints\n\n1 \\leq N \\leq 300\n\nS_{i,j} ( 1 \\leq i, j \\leq N ) is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_{1,1}S_{1,2}..S_{1,N}\nS_{2,1}S_{2,2}..S_{2,N}\n:\nS_{N,1}S_{N,2}..S_{N,N}\n\nOutput\n\nPrint the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nSample Input 1\n\n2\nab\nca\n\nSample Output 1\n\n2\n\nFor each pair of A and B, the second board will look as shown below:\n\nThe second board is a good board when (A,B) = (0,1) or (A,B) = (1,0), thus the answer is 2.\n\nSample Input 2\n\n4\naaaa\naaaa\naaaa\naaaa\n\nSample Output 2\n\n16\n\nEvery possible choice of A and B makes the second board good.\n\nSample Input 3\n\n5\nabcde\nfghij\nklmno\npqrst\nuvwxy\n\nSample Output 3\n\n0\n\nNo possible choice of A and B makes the second board good.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1357, "memory_kb": 6016}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s773900171", "group_id": "codeNet:p03364", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ss = Array.init n @@ fun _ -> Scanf.scanf \"%s\\n\" @@ fun s -> s in\n  Printf.printf \"%d\\n\" @@\n    Array.fold_left (List.fold_left (fun acc (a, b, w) ->\n      if\n        List.for_all (fun i ->\n          List.for_all (fun j ->\n            ss.((i + a) mod n).[(j + b) mod n] = ss.((j + a) mod n).[(i + b) mod n]) @@\n            Array.to_list @@\n              Array.init i @@ fun j -> j) @@\n            Array.to_list @@\n              Array.init (n - 1) @@ fun i -> i + 1\n      then acc + w\n      else acc)) 0 @@\n    Array.init n @@ function\n      | 0 -> [(0, 0, n)]\n      | i -> [(i, 0, n - i); (0, i, n - i)]", "language": "OCaml", "metadata": {"date": 1532629192, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03364.html", "problem_id": "p03364", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03364/input.txt", "sample_output_relpath": "derived/input_output/data/p03364/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03364/OCaml/s773900171.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s773900171", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ss = Array.init n @@ fun _ -> Scanf.scanf \"%s\\n\" @@ fun s -> s in\n  Printf.printf \"%d\\n\" @@\n    Array.fold_left (List.fold_left (fun acc (a, b, w) ->\n      if\n        List.for_all (fun i ->\n          List.for_all (fun j ->\n            ss.((i + a) mod n).[(j + b) mod n] = ss.((j + a) mod n).[(i + b) mod n]) @@\n            Array.to_list @@\n              Array.init i @@ fun j -> j) @@\n            Array.to_list @@\n              Array.init (n - 1) @@ fun i -> i + 1\n      then acc + w\n      else acc)) 0 @@\n    Array.init n @@ function\n      | 0 -> [(0, 0, n)]\n      | i -> [(i, 0, n - i); (0, i, n - i)]", "problem_context": "Score : 500 points\n\nProblem Statement\n\nSnuke has two boards, each divided into a grid with N rows and N columns.\nFor both of these boards, the square at the i-th row from the top and the j-th column from the left is called Square (i,j).\n\nThere is a lowercase English letter written in each square on the first board. The letter written in Square (i,j) is S_{i,j}. On the second board, nothing is written yet.\n\nSnuke will write letters on the second board, as follows:\n\nFirst, choose two integers A and B ( 0 \\leq A, B < N ).\n\nWrite one letter in each square on the second board.\nSpecifically, write the letter written in Square ( i+A, j+B ) on the first board into Square (i,j) on the second board.\nHere, the k-th row is also represented as the (N+k)-th row, and the k-th column is also represented as the (N+k)-th column.\n\nAfter this operation, the second board is called a good board when, for every i and j ( 1 \\leq i, j \\leq N ), the letter in Square (i,j) and the letter in Square (j,i) are equal.\n\nFind the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nConstraints\n\n1 \\leq N \\leq 300\n\nS_{i,j} ( 1 \\leq i, j \\leq N ) is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_{1,1}S_{1,2}..S_{1,N}\nS_{2,1}S_{2,2}..S_{2,N}\n:\nS_{N,1}S_{N,2}..S_{N,N}\n\nOutput\n\nPrint the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nSample Input 1\n\n2\nab\nca\n\nSample Output 1\n\n2\n\nFor each pair of A and B, the second board will look as shown below:\n\nThe second board is a good board when (A,B) = (0,1) or (A,B) = (1,0), thus the answer is 2.\n\nSample Input 2\n\n4\naaaa\naaaa\naaaa\naaaa\n\nSample Output 2\n\n16\n\nEvery possible choice of A and B makes the second board good.\n\nSample Input 3\n\n5\nabcde\nfghij\nklmno\npqrst\nuvwxy\n\nSample Output 3\n\n0\n\nNo possible choice of A and B makes the second board good.", "sample_input": "2\nab\nca\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03364", "source_text": "Score : 500 points\n\nProblem Statement\n\nSnuke has two boards, each divided into a grid with N rows and N columns.\nFor both of these boards, the square at the i-th row from the top and the j-th column from the left is called Square (i,j).\n\nThere is a lowercase English letter written in each square on the first board. The letter written in Square (i,j) is S_{i,j}. On the second board, nothing is written yet.\n\nSnuke will write letters on the second board, as follows:\n\nFirst, choose two integers A and B ( 0 \\leq A, B < N ).\n\nWrite one letter in each square on the second board.\nSpecifically, write the letter written in Square ( i+A, j+B ) on the first board into Square (i,j) on the second board.\nHere, the k-th row is also represented as the (N+k)-th row, and the k-th column is also represented as the (N+k)-th column.\n\nAfter this operation, the second board is called a good board when, for every i and j ( 1 \\leq i, j \\leq N ), the letter in Square (i,j) and the letter in Square (j,i) are equal.\n\nFind the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nConstraints\n\n1 \\leq N \\leq 300\n\nS_{i,j} ( 1 \\leq i, j \\leq N ) is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_{1,1}S_{1,2}..S_{1,N}\nS_{2,1}S_{2,2}..S_{2,N}\n:\nS_{N,1}S_{N,2}..S_{N,N}\n\nOutput\n\nPrint the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nSample Input 1\n\n2\nab\nca\n\nSample Output 1\n\n2\n\nFor each pair of A and B, the second board will look as shown below:\n\nThe second board is a good board when (A,B) = (0,1) or (A,B) = (1,0), thus the answer is 2.\n\nSample Input 2\n\n4\naaaa\naaaa\naaaa\naaaa\n\nSample Output 2\n\n16\n\nEvery possible choice of A and B makes the second board good.\n\nSample Input 3\n\n5\nabcde\nfghij\nklmno\npqrst\nuvwxy\n\nSample Output 3\n\n0\n\nNo possible choice of A and B makes the second board good.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 649, "cpu_time_ms": 1662, "memory_kb": 6528}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s912610276", "group_id": "codeNet:p03364", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ss = Array.init n @@ fun _ -> Scanf.scanf \"%s\\n\" @@ fun s -> s in\n  Printf.printf \"%d\\n\" @@\n    Array.fold_left (Array.fold_left (fun acc (a, b) ->\n      if\n        List.for_all (fun i ->\n          List.for_all (fun j ->\n            ss.((i + a) mod n).[(j + b) mod n] = ss.((j + a) mod n).[(i + b) mod n]) @@\n            Array.to_list @@\n              Array.init i @@ fun j -> j) @@\n            Array.to_list @@\n              Array.init (n - 1) @@ fun i -> i + 1\n      then acc + 1\n      else acc)) 0 @@\n      Array.init n @@ fun a ->\n        Array.init n @@ fun b -> (a, b)", "language": "OCaml", "metadata": {"date": 1532628767, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03364.html", "problem_id": "p03364", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03364/input.txt", "sample_output_relpath": "derived/input_output/data/p03364/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03364/OCaml/s912610276.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s912610276", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let ss = Array.init n @@ fun _ -> Scanf.scanf \"%s\\n\" @@ fun s -> s in\n  Printf.printf \"%d\\n\" @@\n    Array.fold_left (Array.fold_left (fun acc (a, b) ->\n      if\n        List.for_all (fun i ->\n          List.for_all (fun j ->\n            ss.((i + a) mod n).[(j + b) mod n] = ss.((j + a) mod n).[(i + b) mod n]) @@\n            Array.to_list @@\n              Array.init i @@ fun j -> j) @@\n            Array.to_list @@\n              Array.init (n - 1) @@ fun i -> i + 1\n      then acc + 1\n      else acc)) 0 @@\n      Array.init n @@ fun a ->\n        Array.init n @@ fun b -> (a, b)", "problem_context": "Score : 500 points\n\nProblem Statement\n\nSnuke has two boards, each divided into a grid with N rows and N columns.\nFor both of these boards, the square at the i-th row from the top and the j-th column from the left is called Square (i,j).\n\nThere is a lowercase English letter written in each square on the first board. The letter written in Square (i,j) is S_{i,j}. On the second board, nothing is written yet.\n\nSnuke will write letters on the second board, as follows:\n\nFirst, choose two integers A and B ( 0 \\leq A, B < N ).\n\nWrite one letter in each square on the second board.\nSpecifically, write the letter written in Square ( i+A, j+B ) on the first board into Square (i,j) on the second board.\nHere, the k-th row is also represented as the (N+k)-th row, and the k-th column is also represented as the (N+k)-th column.\n\nAfter this operation, the second board is called a good board when, for every i and j ( 1 \\leq i, j \\leq N ), the letter in Square (i,j) and the letter in Square (j,i) are equal.\n\nFind the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nConstraints\n\n1 \\leq N \\leq 300\n\nS_{i,j} ( 1 \\leq i, j \\leq N ) is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_{1,1}S_{1,2}..S_{1,N}\nS_{2,1}S_{2,2}..S_{2,N}\n:\nS_{N,1}S_{N,2}..S_{N,N}\n\nOutput\n\nPrint the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nSample Input 1\n\n2\nab\nca\n\nSample Output 1\n\n2\n\nFor each pair of A and B, the second board will look as shown below:\n\nThe second board is a good board when (A,B) = (0,1) or (A,B) = (1,0), thus the answer is 2.\n\nSample Input 2\n\n4\naaaa\naaaa\naaaa\naaaa\n\nSample Output 2\n\n16\n\nEvery possible choice of A and B makes the second board good.\n\nSample Input 3\n\n5\nabcde\nfghij\nklmno\npqrst\nuvwxy\n\nSample Output 3\n\n0\n\nNo possible choice of A and B makes the second board good.", "sample_input": "2\nab\nca\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03364", "source_text": "Score : 500 points\n\nProblem Statement\n\nSnuke has two boards, each divided into a grid with N rows and N columns.\nFor both of these boards, the square at the i-th row from the top and the j-th column from the left is called Square (i,j).\n\nThere is a lowercase English letter written in each square on the first board. The letter written in Square (i,j) is S_{i,j}. On the second board, nothing is written yet.\n\nSnuke will write letters on the second board, as follows:\n\nFirst, choose two integers A and B ( 0 \\leq A, B < N ).\n\nWrite one letter in each square on the second board.\nSpecifically, write the letter written in Square ( i+A, j+B ) on the first board into Square (i,j) on the second board.\nHere, the k-th row is also represented as the (N+k)-th row, and the k-th column is also represented as the (N+k)-th column.\n\nAfter this operation, the second board is called a good board when, for every i and j ( 1 \\leq i, j \\leq N ), the letter in Square (i,j) and the letter in Square (j,i) are equal.\n\nFind the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nConstraints\n\n1 \\leq N \\leq 300\n\nS_{i,j} ( 1 \\leq i, j \\leq N ) is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_{1,1}S_{1,2}..S_{1,N}\nS_{2,1}S_{2,2}..S_{2,N}\n:\nS_{N,1}S_{N,2}..S_{N,N}\n\nOutput\n\nPrint the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nSample Input 1\n\n2\nab\nca\n\nSample Output 1\n\n2\n\nFor each pair of A and B, the second board will look as shown below:\n\nThe second board is a good board when (A,B) = (0,1) or (A,B) = (1,0), thus the answer is 2.\n\nSample Input 2\n\n4\naaaa\naaaa\naaaa\naaaa\n\nSample Output 2\n\n16\n\nEvery possible choice of A and B makes the second board good.\n\nSample Input 3\n\n5\nabcde\nfghij\nklmno\npqrst\nuvwxy\n\nSample Output 3\n\n0\n\nNo possible choice of A and B makes the second board good.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 620, "cpu_time_ms": 2107, "memory_kb": 10780}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s884201040", "group_id": "codeNet:p03364", "input_text": "open Batteries\n\nlet () =\n  let n = Scanf.scanf \"%d\\n\" (fun a -> a) in\n\n  let arr = Array.make_matrix n n '-' in\n  for i = 0 to n-1 do\n    for j = 0 to n-1-1 do\n      let c = Scanf.scanf \"%c \" (fun c -> c) in\n      Array.set (Array.get arr i) j c\n    done;\n    let c = Scanf.scanf \"%c\\n\" (fun c -> c) in\n    Array.set (Array.get arr i) (n-1) c\n  done;\n\n\n  let cnt = ref 0 in\n  let cur_char = ref '-' in\n\n  for j = 0 to n-1 do\n    for i = 0 to n-1 do\n      let j = j - i in\n      let j = if j < 0 then j + n else j in\n      let c = (Array.get (Array.get arr i) j) in\n      if (i = 0) then (\n        cur_char := c;\n      ) else (\n        if !cur_char <> c then (\n          cur_char := '-';\n        )\n      );\n    done;\n    if !cur_char <> '-' then (\n      cnt := !cnt + n\n    )\n  done;\n\n  print_endline (string_of_int !cnt)\n\n\n", "language": "OCaml", "metadata": {"date": 1524970500, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03364.html", "problem_id": "p03364", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03364/input.txt", "sample_output_relpath": "derived/input_output/data/p03364/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03364/OCaml/s884201040.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s884201040", "user_id": "u139013163"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Batteries\n\nlet () =\n  let n = Scanf.scanf \"%d\\n\" (fun a -> a) in\n\n  let arr = Array.make_matrix n n '-' in\n  for i = 0 to n-1 do\n    for j = 0 to n-1-1 do\n      let c = Scanf.scanf \"%c \" (fun c -> c) in\n      Array.set (Array.get arr i) j c\n    done;\n    let c = Scanf.scanf \"%c\\n\" (fun c -> c) in\n    Array.set (Array.get arr i) (n-1) c\n  done;\n\n\n  let cnt = ref 0 in\n  let cur_char = ref '-' in\n\n  for j = 0 to n-1 do\n    for i = 0 to n-1 do\n      let j = j - i in\n      let j = if j < 0 then j + n else j in\n      let c = (Array.get (Array.get arr i) j) in\n      if (i = 0) then (\n        cur_char := c;\n      ) else (\n        if !cur_char <> c then (\n          cur_char := '-';\n        )\n      );\n    done;\n    if !cur_char <> '-' then (\n      cnt := !cnt + n\n    )\n  done;\n\n  print_endline (string_of_int !cnt)\n\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nSnuke has two boards, each divided into a grid with N rows and N columns.\nFor both of these boards, the square at the i-th row from the top and the j-th column from the left is called Square (i,j).\n\nThere is a lowercase English letter written in each square on the first board. The letter written in Square (i,j) is S_{i,j}. On the second board, nothing is written yet.\n\nSnuke will write letters on the second board, as follows:\n\nFirst, choose two integers A and B ( 0 \\leq A, B < N ).\n\nWrite one letter in each square on the second board.\nSpecifically, write the letter written in Square ( i+A, j+B ) on the first board into Square (i,j) on the second board.\nHere, the k-th row is also represented as the (N+k)-th row, and the k-th column is also represented as the (N+k)-th column.\n\nAfter this operation, the second board is called a good board when, for every i and j ( 1 \\leq i, j \\leq N ), the letter in Square (i,j) and the letter in Square (j,i) are equal.\n\nFind the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nConstraints\n\n1 \\leq N \\leq 300\n\nS_{i,j} ( 1 \\leq i, j \\leq N ) is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_{1,1}S_{1,2}..S_{1,N}\nS_{2,1}S_{2,2}..S_{2,N}\n:\nS_{N,1}S_{N,2}..S_{N,N}\n\nOutput\n\nPrint the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nSample Input 1\n\n2\nab\nca\n\nSample Output 1\n\n2\n\nFor each pair of A and B, the second board will look as shown below:\n\nThe second board is a good board when (A,B) = (0,1) or (A,B) = (1,0), thus the answer is 2.\n\nSample Input 2\n\n4\naaaa\naaaa\naaaa\naaaa\n\nSample Output 2\n\n16\n\nEvery possible choice of A and B makes the second board good.\n\nSample Input 3\n\n5\nabcde\nfghij\nklmno\npqrst\nuvwxy\n\nSample Output 3\n\n0\n\nNo possible choice of A and B makes the second board good.", "sample_input": "2\nab\nca\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03364", "source_text": "Score : 500 points\n\nProblem Statement\n\nSnuke has two boards, each divided into a grid with N rows and N columns.\nFor both of these boards, the square at the i-th row from the top and the j-th column from the left is called Square (i,j).\n\nThere is a lowercase English letter written in each square on the first board. The letter written in Square (i,j) is S_{i,j}. On the second board, nothing is written yet.\n\nSnuke will write letters on the second board, as follows:\n\nFirst, choose two integers A and B ( 0 \\leq A, B < N ).\n\nWrite one letter in each square on the second board.\nSpecifically, write the letter written in Square ( i+A, j+B ) on the first board into Square (i,j) on the second board.\nHere, the k-th row is also represented as the (N+k)-th row, and the k-th column is also represented as the (N+k)-th column.\n\nAfter this operation, the second board is called a good board when, for every i and j ( 1 \\leq i, j \\leq N ), the letter in Square (i,j) and the letter in Square (j,i) are equal.\n\nFind the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nConstraints\n\n1 \\leq N \\leq 300\n\nS_{i,j} ( 1 \\leq i, j \\leq N ) is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_{1,1}S_{1,2}..S_{1,N}\nS_{2,1}S_{2,2}..S_{2,N}\n:\nS_{N,1}S_{N,2}..S_{N,N}\n\nOutput\n\nPrint the number of the ways to choose integers A and B ( 0 \\leq A, B < N ) such that the second board is a good board.\n\nSample Input 1\n\n2\nab\nca\n\nSample Output 1\n\n2\n\nFor each pair of A and B, the second board will look as shown below:\n\nThe second board is a good board when (A,B) = (0,1) or (A,B) = (1,0), thus the answer is 2.\n\nSample Input 2\n\n4\naaaa\naaaa\naaaa\naaaa\n\nSample Output 2\n\n16\n\nEvery possible choice of A and B makes the second board good.\n\nSample Input 3\n\n5\nabcde\nfghij\nklmno\npqrst\nuvwxy\n\nSample Output 3\n\n0\n\nNo possible choice of A and B makes the second board good.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 823, "cpu_time_ms": 12, "memory_kb": 5888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s573000719", "group_id": "codeNet:p03369", "input_text": "let f a b c = 700 + (if a='o' then 100 else 0) + (if b='o' then 100 else 0) + (if c='o' then 100 else 0);;\nlet () = Scanf.scanf \"%c %c %c\" f\n|> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1561264145, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03369.html", "problem_id": "p03369", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03369/input.txt", "sample_output_relpath": "derived/input_output/data/p03369/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03369/OCaml/s573000719.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s573000719", "user_id": "u635974378"}, "prompt_components": {"gold_output": "900\n", "input_to_evaluate": "let f a b c = 700 + (if a='o' then 100 else 0) + (if b='o' then 100 else 0) + (if c='o' then 100 else 0);;\nlet () = Scanf.scanf \"%c %c %c\" f\n|> Printf.printf \"%d\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn \"Takahashi-ya\", a ramen restaurant, a bowl of ramen costs 700 yen (the currency of Japan), plus 100 yen for each kind of topping (boiled egg, sliced pork, green onions).\n\nA customer ordered a bowl of ramen and told which toppings to put on his ramen to a clerk. The clerk took a memo of the order as a string S. S is three characters long, and if the first character in S is o, it means the ramen should be topped with boiled egg; if that character is x, it means the ramen should not be topped with boiled egg. Similarly, the second and third characters in S mean the presence or absence of sliced pork and green onions on top of the ramen.\n\nWrite a program that, when S is given, prints the price of the corresponding bowl of ramen.\n\nConstraints\n\nS is a string of length 3.\n\nEach character in S is o or x.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the price of the bowl of ramen corresponding to S.\n\nSample Input 1\n\noxo\n\nSample Output 1\n\n900\n\nThe price of a ramen topped with two kinds of toppings, boiled egg and green onions, is 700 + 100 \\times 2 = 900 yen.\n\nSample Input 2\n\nooo\n\nSample Output 2\n\n1000\n\nThe price of a ramen topped with all three kinds of toppings is 700 + 100 \\times 3 = 1000 yen.\n\nSample Input 3\n\nxxx\n\nSample Output 3\n\n700\n\nThe price of a ramen without any toppings is 700 yen.", "sample_input": "oxo\n"}, "reference_outputs": ["900\n"], "source_document_id": "p03369", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn \"Takahashi-ya\", a ramen restaurant, a bowl of ramen costs 700 yen (the currency of Japan), plus 100 yen for each kind of topping (boiled egg, sliced pork, green onions).\n\nA customer ordered a bowl of ramen and told which toppings to put on his ramen to a clerk. The clerk took a memo of the order as a string S. S is three characters long, and if the first character in S is o, it means the ramen should be topped with boiled egg; if that character is x, it means the ramen should not be topped with boiled egg. Similarly, the second and third characters in S mean the presence or absence of sliced pork and green onions on top of the ramen.\n\nWrite a program that, when S is given, prints the price of the corresponding bowl of ramen.\n\nConstraints\n\nS is a string of length 3.\n\nEach character in S is o or x.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the price of the bowl of ramen corresponding to S.\n\nSample Input 1\n\noxo\n\nSample Output 1\n\n900\n\nThe price of a ramen topped with two kinds of toppings, boiled egg and green onions, is 700 + 100 \\times 2 = 900 yen.\n\nSample Input 2\n\nooo\n\nSample Output 2\n\n1000\n\nThe price of a ramen topped with all three kinds of toppings is 700 + 100 \\times 3 = 1000 yen.\n\nSample Input 3\n\nxxx\n\nSample Output 3\n\n700\n\nThe price of a ramen without any toppings is 700 yen.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 164, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s083525347", "group_id": "codeNet:p03369", "input_text": "let () =\nlet lst = Scanf.scanf \"%1s%1s%1s\\n\" (fun a b c -> [a; b; c]) in\nPrintf.printf \"%d\\n\" (List.fold_left (fun ans x -> if x = \"o\" then ans+100 else ans) 700 lst)", "language": "OCaml", "metadata": {"date": 1559510370, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03369.html", "problem_id": "p03369", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03369/input.txt", "sample_output_relpath": "derived/input_output/data/p03369/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03369/OCaml/s083525347.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s083525347", "user_id": "u307426615"}, "prompt_components": {"gold_output": "900\n", "input_to_evaluate": "let () =\nlet lst = Scanf.scanf \"%1s%1s%1s\\n\" (fun a b c -> [a; b; c]) in\nPrintf.printf \"%d\\n\" (List.fold_left (fun ans x -> if x = \"o\" then ans+100 else ans) 700 lst)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn \"Takahashi-ya\", a ramen restaurant, a bowl of ramen costs 700 yen (the currency of Japan), plus 100 yen for each kind of topping (boiled egg, sliced pork, green onions).\n\nA customer ordered a bowl of ramen and told which toppings to put on his ramen to a clerk. The clerk took a memo of the order as a string S. S is three characters long, and if the first character in S is o, it means the ramen should be topped with boiled egg; if that character is x, it means the ramen should not be topped with boiled egg. Similarly, the second and third characters in S mean the presence or absence of sliced pork and green onions on top of the ramen.\n\nWrite a program that, when S is given, prints the price of the corresponding bowl of ramen.\n\nConstraints\n\nS is a string of length 3.\n\nEach character in S is o or x.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the price of the bowl of ramen corresponding to S.\n\nSample Input 1\n\noxo\n\nSample Output 1\n\n900\n\nThe price of a ramen topped with two kinds of toppings, boiled egg and green onions, is 700 + 100 \\times 2 = 900 yen.\n\nSample Input 2\n\nooo\n\nSample Output 2\n\n1000\n\nThe price of a ramen topped with all three kinds of toppings is 700 + 100 \\times 3 = 1000 yen.\n\nSample Input 3\n\nxxx\n\nSample Output 3\n\n700\n\nThe price of a ramen without any toppings is 700 yen.", "sample_input": "oxo\n"}, "reference_outputs": ["900\n"], "source_document_id": "p03369", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn \"Takahashi-ya\", a ramen restaurant, a bowl of ramen costs 700 yen (the currency of Japan), plus 100 yen for each kind of topping (boiled egg, sliced pork, green onions).\n\nA customer ordered a bowl of ramen and told which toppings to put on his ramen to a clerk. The clerk took a memo of the order as a string S. S is three characters long, and if the first character in S is o, it means the ramen should be topped with boiled egg; if that character is x, it means the ramen should not be topped with boiled egg. Similarly, the second and third characters in S mean the presence or absence of sliced pork and green onions on top of the ramen.\n\nWrite a program that, when S is given, prints the price of the corresponding bowl of ramen.\n\nConstraints\n\nS is a string of length 3.\n\nEach character in S is o or x.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the price of the bowl of ramen corresponding to S.\n\nSample Input 1\n\noxo\n\nSample Output 1\n\n900\n\nThe price of a ramen topped with two kinds of toppings, boiled egg and green onions, is 700 + 100 \\times 2 = 900 yen.\n\nSample Input 2\n\nooo\n\nSample Output 2\n\n1000\n\nThe price of a ramen topped with all three kinds of toppings is 700 + 100 \\times 3 = 1000 yen.\n\nSample Input 3\n\nxxx\n\nSample Output 3\n\n700\n\nThe price of a ramen without any toppings is 700 yen.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 166, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s626898692", "group_id": "codeNet:p03370", "input_text": "let list_init n f =\n  let rec aux n f l = if n >= 0 then aux (n - 1) f (f n :: l) else l in\n  aux (n - 1) f []\n\nlet () =\n  let n, x = Scanf.scanf \"%d %d\" (fun n x -> (n, x)) in\n  let ms = list_init n (fun _ -> Scanf.scanf \" %d\" (fun m -> m)) in\n  let min_m = List.fold_left min (List.hd ms) ms in\n  let sum_m = List.fold_left ( + ) 0 ms in\n  let x = x - sum_m in\n  let n = n + (x / min_m) in\n  Printf.printf \"%d\\n\" n", "language": "OCaml", "metadata": {"date": 1551046580, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03370.html", "problem_id": "p03370", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03370/input.txt", "sample_output_relpath": "derived/input_output/data/p03370/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03370/OCaml/s626898692.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s626898692", "user_id": "u406828576"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "let list_init n f =\n  let rec aux n f l = if n >= 0 then aux (n - 1) f (f n :: l) else l in\n  aux (n - 1) f []\n\nlet () =\n  let n, x = Scanf.scanf \"%d %d\" (fun n x -> (n, x)) in\n  let ms = list_init n (fun _ -> Scanf.scanf \" %d\" (fun m -> m)) in\n  let min_m = List.fold_left min (List.hd ms) ms in\n  let sum_m = List.fold_left ( + ) 0 ms in\n  let x = x - sum_m in\n  let n = n + (x / min_m) in\n  Printf.printf \"%d\\n\" n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAkaki, a patissier, can make N kinds of doughnut using only a certain powder called \"Okashi no Moto\" (literally \"material of pastry\", simply called Moto below) as ingredient. These doughnuts are called Doughnut 1, Doughnut 2, ..., Doughnut N. In order to make one Doughnut i (1 ≤ i ≤ N), she needs to consume m_i grams of Moto. She cannot make a non-integer number of doughnuts, such as 0.5 doughnuts.\n\nNow, she has X grams of Moto. She decides to make as many doughnuts as possible for a party tonight. However, since the tastes of the guests differ, she will obey the following condition:\n\nFor each of the N kinds of doughnuts, make at least one doughnut of that kind.\n\nAt most how many doughnuts can be made here? She does not necessarily need to consume all of her Moto. Also, under the constraints of this problem, it is always possible to obey the condition.\n\nConstraints\n\n2 ≤ N ≤ 100\n\n1 ≤ m_i ≤ 1000\n\nm_1 + m_2 + ... + m_N ≤ X ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nm_1\nm_2\n:\nm_N\n\nOutput\n\nPrint the maximum number of doughnuts that can be made under the condition.\n\nSample Input 1\n\n3 1000\n120\n100\n140\n\nSample Output 1\n\n9\n\nShe has 1000 grams of Moto and can make three kinds of doughnuts. If she makes one doughnut for each of the three kinds, she consumes 120 + 100 + 140 = 360 grams of Moto. From the 640 grams of Moto that remains here, she can make additional six Doughnuts 2. This is how she can made a total of nine doughnuts, which is the maximum.\n\nSample Input 2\n\n4 360\n90\n90\n90\n90\n\nSample Output 2\n\n4\n\nMaking one doughnut for each of the four kinds consumes all of her Moto.\n\nSample Input 3\n\n5 3000\n150\n130\n150\n130\n110\n\nSample Output 3\n\n26", "sample_input": "3 1000\n120\n100\n140\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03370", "source_text": "Score : 200 points\n\nProblem Statement\n\nAkaki, a patissier, can make N kinds of doughnut using only a certain powder called \"Okashi no Moto\" (literally \"material of pastry\", simply called Moto below) as ingredient. These doughnuts are called Doughnut 1, Doughnut 2, ..., Doughnut N. In order to make one Doughnut i (1 ≤ i ≤ N), she needs to consume m_i grams of Moto. She cannot make a non-integer number of doughnuts, such as 0.5 doughnuts.\n\nNow, she has X grams of Moto. She decides to make as many doughnuts as possible for a party tonight. However, since the tastes of the guests differ, she will obey the following condition:\n\nFor each of the N kinds of doughnuts, make at least one doughnut of that kind.\n\nAt most how many doughnuts can be made here? She does not necessarily need to consume all of her Moto. Also, under the constraints of this problem, it is always possible to obey the condition.\n\nConstraints\n\n2 ≤ N ≤ 100\n\n1 ≤ m_i ≤ 1000\n\nm_1 + m_2 + ... + m_N ≤ X ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nm_1\nm_2\n:\nm_N\n\nOutput\n\nPrint the maximum number of doughnuts that can be made under the condition.\n\nSample Input 1\n\n3 1000\n120\n100\n140\n\nSample Output 1\n\n9\n\nShe has 1000 grams of Moto and can make three kinds of doughnuts. If she makes one doughnut for each of the three kinds, she consumes 120 + 100 + 140 = 360 grams of Moto. From the 640 grams of Moto that remains here, she can make additional six Doughnuts 2. This is how she can made a total of nine doughnuts, which is the maximum.\n\nSample Input 2\n\n4 360\n90\n90\n90\n90\n\nSample Output 2\n\n4\n\nMaking one doughnut for each of the four kinds consumes all of her Moto.\n\nSample Input 3\n\n5 3000\n150\n130\n150\n130\n110\n\nSample Output 3\n\n26", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 416, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s147401593", "group_id": "codeNet:p03370", "input_text": "let () =\n  let a, b = Scanf.scanf \"%d %d\\n\" (fun a b -> a, b) in\n\n  let arr = Array.make a 0 in\n  for i = 1 to a do\n    let c = Scanf.scanf \"%d\\n\" (fun c -> c) in\n    Array.set arr (i-1) c\n  done;\n\n  let lst = Array.to_list arr in\n  let sum = List.fold_left (+) 0 lst in\n  let cheapest = List.hd (List.sort compare lst) in\n\n  let x = (b - sum) / cheapest in\n\n  print_endline (string_of_int (a + x))\n", "language": "OCaml", "metadata": {"date": 1524448517, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03370.html", "problem_id": "p03370", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03370/input.txt", "sample_output_relpath": "derived/input_output/data/p03370/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03370/OCaml/s147401593.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s147401593", "user_id": "u139013163"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "let () =\n  let a, b = Scanf.scanf \"%d %d\\n\" (fun a b -> a, b) in\n\n  let arr = Array.make a 0 in\n  for i = 1 to a do\n    let c = Scanf.scanf \"%d\\n\" (fun c -> c) in\n    Array.set arr (i-1) c\n  done;\n\n  let lst = Array.to_list arr in\n  let sum = List.fold_left (+) 0 lst in\n  let cheapest = List.hd (List.sort compare lst) in\n\n  let x = (b - sum) / cheapest in\n\n  print_endline (string_of_int (a + x))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAkaki, a patissier, can make N kinds of doughnut using only a certain powder called \"Okashi no Moto\" (literally \"material of pastry\", simply called Moto below) as ingredient. These doughnuts are called Doughnut 1, Doughnut 2, ..., Doughnut N. In order to make one Doughnut i (1 ≤ i ≤ N), she needs to consume m_i grams of Moto. She cannot make a non-integer number of doughnuts, such as 0.5 doughnuts.\n\nNow, she has X grams of Moto. She decides to make as many doughnuts as possible for a party tonight. However, since the tastes of the guests differ, she will obey the following condition:\n\nFor each of the N kinds of doughnuts, make at least one doughnut of that kind.\n\nAt most how many doughnuts can be made here? She does not necessarily need to consume all of her Moto. Also, under the constraints of this problem, it is always possible to obey the condition.\n\nConstraints\n\n2 ≤ N ≤ 100\n\n1 ≤ m_i ≤ 1000\n\nm_1 + m_2 + ... + m_N ≤ X ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nm_1\nm_2\n:\nm_N\n\nOutput\n\nPrint the maximum number of doughnuts that can be made under the condition.\n\nSample Input 1\n\n3 1000\n120\n100\n140\n\nSample Output 1\n\n9\n\nShe has 1000 grams of Moto and can make three kinds of doughnuts. If she makes one doughnut for each of the three kinds, she consumes 120 + 100 + 140 = 360 grams of Moto. From the 640 grams of Moto that remains here, she can make additional six Doughnuts 2. This is how she can made a total of nine doughnuts, which is the maximum.\n\nSample Input 2\n\n4 360\n90\n90\n90\n90\n\nSample Output 2\n\n4\n\nMaking one doughnut for each of the four kinds consumes all of her Moto.\n\nSample Input 3\n\n5 3000\n150\n130\n150\n130\n110\n\nSample Output 3\n\n26", "sample_input": "3 1000\n120\n100\n140\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03370", "source_text": "Score : 200 points\n\nProblem Statement\n\nAkaki, a patissier, can make N kinds of doughnut using only a certain powder called \"Okashi no Moto\" (literally \"material of pastry\", simply called Moto below) as ingredient. These doughnuts are called Doughnut 1, Doughnut 2, ..., Doughnut N. In order to make one Doughnut i (1 ≤ i ≤ N), she needs to consume m_i grams of Moto. She cannot make a non-integer number of doughnuts, such as 0.5 doughnuts.\n\nNow, she has X grams of Moto. She decides to make as many doughnuts as possible for a party tonight. However, since the tastes of the guests differ, she will obey the following condition:\n\nFor each of the N kinds of doughnuts, make at least one doughnut of that kind.\n\nAt most how many doughnuts can be made here? She does not necessarily need to consume all of her Moto. Also, under the constraints of this problem, it is always possible to obey the condition.\n\nConstraints\n\n2 ≤ N ≤ 100\n\n1 ≤ m_i ≤ 1000\n\nm_1 + m_2 + ... + m_N ≤ X ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nm_1\nm_2\n:\nm_N\n\nOutput\n\nPrint the maximum number of doughnuts that can be made under the condition.\n\nSample Input 1\n\n3 1000\n120\n100\n140\n\nSample Output 1\n\n9\n\nShe has 1000 grams of Moto and can make three kinds of doughnuts. If she makes one doughnut for each of the three kinds, she consumes 120 + 100 + 140 = 360 grams of Moto. From the 640 grams of Moto that remains here, she can make additional six Doughnuts 2. This is how she can made a total of nine doughnuts, which is the maximum.\n\nSample Input 2\n\n4 360\n90\n90\n90\n90\n\nSample Output 2\n\n4\n\nMaking one doughnut for each of the four kinds consumes all of her Moto.\n\nSample Input 3\n\n5 3000\n150\n130\n150\n130\n110\n\nSample Output 3\n\n26", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 399, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s546344279", "group_id": "codeNet:p03371", "input_text": "open Scanf\nopen Printf\n\nlet ($) f x = f x\nlet scanIntlist n = let list = ref [] in\n  for i = 1 to n do\n    list := (scanf (if i < n then \"%d \" else \"%d\") (fun x -> x))::!list\n  done; List.rev !list\n    \nlet string2charlist s = let rec proc i res =\n                          try proc (i+1) $ s.[i]::res\n                          with Invalid_argument _ -> res\n  in List.rev $ proc 0 []\n       \nlet minInt l = let rec proc l res = match l with\n      [] -> res\n    | x::xs -> if x < res then proc xs x else proc xs res\n  in if l == [] then raise $ Failure \"null list\" else proc l max_int\n\nlet maxInt l = let rec proc l res = match l with\n      [] -> res\n    | x::xs -> if x > res then proc xs x else proc xs res\n  in if l == [] then raise $ Failure \"null list\" else proc l min_int\n\nlet rec listSum = function\n    [] -> 0\n  | x::xs -> x+listSum xs;;\n\nlet rec quick_sort = function\n    ([] | [_]) as l -> l\n  | pivot :: rest ->\n     let rec partition left right = function\n\t [] -> (quick_sort left) @ (pivot :: quick_sort right)\n       | y :: ys -> if pivot < y then partition left (y :: right) ys\n                    else partition (y :: left) right ys\n     in partition [] [] rest\n\n\nlet calc a b c x y = let p1 = a*x + b*y in\n  let p2 = if x < y then c*2*x + b*(y-x) else c*2*y + a*(x-y) in\n  let p3 = if x < y then c*2*y else c*2*x in\n  minInt [p1;p2;p3];;\n\nscanf \"%d %d %d %d %d\" $ fun a b c x y -> print_int $ calc a b c x y;;\n", "language": "OCaml", "metadata": {"date": 1524951028, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s546344279.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s546344279", "user_id": "u470717435"}, "prompt_components": {"gold_output": "7900\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet ($) f x = f x\nlet scanIntlist n = let list = ref [] in\n  for i = 1 to n do\n    list := (scanf (if i < n then \"%d \" else \"%d\") (fun x -> x))::!list\n  done; List.rev !list\n    \nlet string2charlist s = let rec proc i res =\n                          try proc (i+1) $ s.[i]::res\n                          with Invalid_argument _ -> res\n  in List.rev $ proc 0 []\n       \nlet minInt l = let rec proc l res = match l with\n      [] -> res\n    | x::xs -> if x < res then proc xs x else proc xs res\n  in if l == [] then raise $ Failure \"null list\" else proc l max_int\n\nlet maxInt l = let rec proc l res = match l with\n      [] -> res\n    | x::xs -> if x > res then proc xs x else proc xs res\n  in if l == [] then raise $ Failure \"null list\" else proc l min_int\n\nlet rec listSum = function\n    [] -> 0\n  | x::xs -> x+listSum xs;;\n\nlet rec quick_sort = function\n    ([] | [_]) as l -> l\n  | pivot :: rest ->\n     let rec partition left right = function\n\t [] -> (quick_sort left) @ (pivot :: quick_sort right)\n       | y :: ys -> if pivot < y then partition left (y :: right) ys\n                    else partition (y :: left) right ys\n     in partition [] [] rest\n\n\nlet calc a b c x y = let p1 = a*x + b*y in\n  let p2 = if x < y then c*2*x + b*(y-x) else c*2*y + a*(x-y) in\n  let p3 = if x < y then c*2*y else c*2*x in\n  minInt [p1;p2;p3];;\n\nscanf \"%d %d %d %d %d\" $ fun a b c x y -> print_int $ calc a b c x y;;\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\n\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n1 ≤ A, B, C ≤ 5000\n\n1 ≤ X, Y ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C X Y\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nSample Input 1\n\n1500 2000 1600 3 2\n\nSample Output 1\n\n7900\n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.\n\nSample Input 2\n\n1500 2000 1900 3 2\n\nSample Output 2\n\n8500\n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\nSample Input 3\n\n1500 2000 500 90000 100000\n\nSample Output 3\n\n100000000\n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.", "sample_input": "1500 2000 1600 3 2\n"}, "reference_outputs": ["7900\n"], "source_document_id": "p03371", "source_text": "Score : 300 points\n\nProblem Statement\n\n\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n1 ≤ A, B, C ≤ 5000\n\n1 ≤ X, Y ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C X Y\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nSample Input 1\n\n1500 2000 1600 3 2\n\nSample Output 1\n\n7900\n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.\n\nSample Input 2\n\n1500 2000 1900 3 2\n\nSample Output 2\n\n8500\n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\nSample Input 3\n\n1500 2000 500 90000 100000\n\nSample Output 3\n\n100000000\n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1427, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s919924800", "group_id": "codeNet:p03372", "input_text": "let () =\n  let open Int64 in\n  let len, b = Scanf.scanf \"%d %Ld\\n\" (fun a b -> a, b) in\n\n  let arr = Array.make len (0L,0L) in\n  for i = 0 to (len-1) do\n    let c = Scanf.scanf \"%Ld %Ld\\n\" (fun a b -> a, b) in\n    Array.set arr i c\n  done;\n\n  let arr_l = Array.make len (0L,0L) in\n  let arr_r = Array.make len (0L,0L) in\n  let arr_l2 = Array.make len (0L,0L) in\n  let arr_r2 = Array.make len (0L,0L) in\n\n  let t = ref (0L,0L) in\n  for i = 0 to (len-1) do\n    let distance = fst (Array.get arr i) in\n\n    let cal = Int64.add (snd (Array.get arr i)) \n        ( if (i=0) then 0L else (snd (Array.get arr_l (i-1)))) in\n\n    let d_sub = if (i=0) then 0L else (fst (Array.get arr_l (i-1))) in\n    let d_sub = Int64.sub distance d_sub in\n    let cal = Int64.sub cal d_sub in\n\n    let tt = (distance, cal) in\n    if (cal > (snd !t))\n    then (\n      t := tt\n    )\n    else ();\n    Array.set arr_l i tt;\n    Array.set arr_l2 i !t;\n  done;\n\n  let t = ref (0L,0L) in\n  for i = 0 to (len-1) do\n    let i = len-1-i in\n    let distance = Int64.sub b (fst (Array.get arr i)) in\n    let cal = Int64.add (snd (Array.get arr i))\n        (if (i=len-1) then 0L else (snd (Array.get arr_r (i+1))) ) in\n\n    let d_sub = if (i=len-1) then 0L else (fst (Array.get arr_r (i+1))) in\n    let d_sub = Int64.sub distance d_sub in\n    let cal = Int64.sub cal d_sub in\n\n    let tt = (distance, cal) in\n    if (cal > (snd !t))\n    then (\n      t := tt\n    )\n    else ();\n    Array.set arr_r i tt;\n    Array.set arr_r2 i !t;\n  done;\n\n  let t = ref (0L,0L) in\n  for i = 0 to (len-1) do\n    let j = if (i=len-1) then 0 else i+1 in\n\n    let d_l = fst (Array.get arr_l2 i) in\n    let d_r = \n      if (j = 0) then\n        0L\n      else\n        fst (Array.get arr_r2 j) in\n    let d_sub = if d_l > d_r then d_r else d_l in\n\n    let cal_l = snd (Array.get arr_l2 i) in\n    let cal_r = \n      if (j = 0) then\n        0L\n      else\n        snd (Array.get arr_r2 j) in\n    let cal = Int64.sub (Int64.add cal_l cal_r) d_sub in\n\n    if (cal > (snd !t))\n    then (\n      let tt = (0L, cal) in\n      t := tt\n    )\n    else ();\n  done;\n\n  Printf.printf \"%Ld\" (snd !t);\n\n", "language": "OCaml", "metadata": {"date": 1524465894, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s919924800.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s919924800", "user_id": "u139013163"}, "prompt_components": {"gold_output": "191\n", "input_to_evaluate": "let () =\n  let open Int64 in\n  let len, b = Scanf.scanf \"%d %Ld\\n\" (fun a b -> a, b) in\n\n  let arr = Array.make len (0L,0L) in\n  for i = 0 to (len-1) do\n    let c = Scanf.scanf \"%Ld %Ld\\n\" (fun a b -> a, b) in\n    Array.set arr i c\n  done;\n\n  let arr_l = Array.make len (0L,0L) in\n  let arr_r = Array.make len (0L,0L) in\n  let arr_l2 = Array.make len (0L,0L) in\n  let arr_r2 = Array.make len (0L,0L) in\n\n  let t = ref (0L,0L) in\n  for i = 0 to (len-1) do\n    let distance = fst (Array.get arr i) in\n\n    let cal = Int64.add (snd (Array.get arr i)) \n        ( if (i=0) then 0L else (snd (Array.get arr_l (i-1)))) in\n\n    let d_sub = if (i=0) then 0L else (fst (Array.get arr_l (i-1))) in\n    let d_sub = Int64.sub distance d_sub in\n    let cal = Int64.sub cal d_sub in\n\n    let tt = (distance, cal) in\n    if (cal > (snd !t))\n    then (\n      t := tt\n    )\n    else ();\n    Array.set arr_l i tt;\n    Array.set arr_l2 i !t;\n  done;\n\n  let t = ref (0L,0L) in\n  for i = 0 to (len-1) do\n    let i = len-1-i in\n    let distance = Int64.sub b (fst (Array.get arr i)) in\n    let cal = Int64.add (snd (Array.get arr i))\n        (if (i=len-1) then 0L else (snd (Array.get arr_r (i+1))) ) in\n\n    let d_sub = if (i=len-1) then 0L else (fst (Array.get arr_r (i+1))) in\n    let d_sub = Int64.sub distance d_sub in\n    let cal = Int64.sub cal d_sub in\n\n    let tt = (distance, cal) in\n    if (cal > (snd !t))\n    then (\n      t := tt\n    )\n    else ();\n    Array.set arr_r i tt;\n    Array.set arr_r2 i !t;\n  done;\n\n  let t = ref (0L,0L) in\n  for i = 0 to (len-1) do\n    let j = if (i=len-1) then 0 else i+1 in\n\n    let d_l = fst (Array.get arr_l2 i) in\n    let d_r = \n      if (j = 0) then\n        0L\n      else\n        fst (Array.get arr_r2 j) in\n    let d_sub = if d_l > d_r then d_r else d_l in\n\n    let cal_l = snd (Array.get arr_l2 i) in\n    let cal_r = \n      if (j = 0) then\n        0L\n      else\n        snd (Array.get arr_r2 j) in\n    let cal = Int64.sub (Int64.add cal_l cal_r) d_sub in\n\n    if (cal > (snd !t))\n    then (\n      let tt = (0L, cal) in\n      t := tt\n    )\n    else ();\n  done;\n\n  Printf.printf \"%Ld\" (snd !t);\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\n\"Teishi-zushi\", a Japanese restaurant, is a plain restaurant with only one round counter. The outer circumference of the counter is C meters. Customers cannot go inside the counter.\n\nNakahashi entered Teishi-zushi, and he was guided to the counter. Now, there are N pieces of sushi (vinegared rice with seafood and so on) on the counter. The distance measured clockwise from the point where Nakahashi is standing to the point where the i-th sushi is placed, is x_i meters. Also, the i-th sushi has a nutritive value of v_i kilocalories.\n\nNakahashi can freely walk around the circumference of the counter. When he reach a point where a sushi is placed, he can eat that sushi and take in its nutrition (naturally, the sushi disappears). However, while walking, he consumes 1 kilocalories per meter.\n\nWhenever he is satisfied, he can leave the restaurant from any place (he does not have to return to the initial place). On balance, at most how much nutrition can he take in before he leaves? That is, what is the maximum possible value of the total nutrition taken in minus the total energy consumed? Assume that there are no other customers, and no new sushi will be added to the counter. Also, since Nakahashi has plenty of nutrition in his body, assume that no matter how much he walks and consumes energy, he never dies from hunger.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n2 ≤ C ≤ 10^{14}\n\n1 ≤ x_1 < x_2 < ... < x_N < C\n\n1 ≤ v_i ≤ 10^9\n\nAll values in input are integers.\n\nSubscores\n\n300 points will be awarded for passing the test set satisfying N ≤ 100.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN C\nx_1 v_1\nx_2 v_2\n:\nx_N v_N\n\nOutput\n\nIf Nakahashi can take in at most c kilocalories on balance before he leaves the restaurant, print c.\n\nSample Input 1\n\n3 20\n2 80\n9 120\n16 1\n\nSample Output 1\n\n191\n\nThere are three sushi on the counter with a circumference of 20 meters. If he walks two meters clockwise from the initial place, he can eat a sushi of 80 kilocalories. If he walks seven more meters clockwise, he can eat a sushi of 120 kilocalories. If he leaves now, the total nutrition taken in is 200 kilocalories, and the total energy consumed is 9 kilocalories, thus he can take in 191 kilocalories on balance, which is the largest possible value.\n\nSample Input 2\n\n3 20\n2 80\n9 1\n16 120\n\nSample Output 2\n\n192\n\nThe second and third sushi have been swapped. Again, if he walks two meters clockwise from the initial place, he can eat a sushi of 80 kilocalories. If he walks six more meters counterclockwise this time, he can eat a sushi of 120 kilocalories. If he leaves now, the total nutrition taken in is 200 kilocalories, and the total energy consumed is 8 kilocalories, thus he can take in 192 kilocalories on balance, which is the largest possible value.\n\nSample Input 3\n\n1 100000000000000\n50000000000000 1\n\nSample Output 3\n\n0\n\nEven though the only sushi is so far that it does not fit into a 32-bit integer, its nutritive value is low, thus he should immediately leave without doing anything.\n\nSample Input 4\n\n15 10000000000\n400000000 1000000000\n800000000 1000000000\n1900000000 1000000000\n2400000000 1000000000\n2900000000 1000000000\n3300000000 1000000000\n3700000000 1000000000\n3800000000 1000000000\n4000000000 1000000000\n4100000000 1000000000\n5200000000 1000000000\n6600000000 1000000000\n8000000000 1000000000\n9300000000 1000000000\n9700000000 1000000000\n\nSample Output 4\n\n6500000000\n\nAll these sample inputs above are included in the test set for the partial score.", "sample_input": "3 20\n2 80\n9 120\n16 1\n"}, "reference_outputs": ["191\n"], "source_document_id": "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2122, "cpu_time_ms": 129, "memory_kb": 27776}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s314986716", "group_id": "codeNet:p03377", "input_text": "open Scanf\nopen Printf\n\nlet cats_and_dogs a b x =\n  if a > x then \"NO\"\n  else if a + b < x then \"NO\"\n  else \"YES\"\n\nlet () = scanf \"%d %d %d\" cats_and_dogs |> printf \"%s\\n\"", "language": "OCaml", "metadata": {"date": 1595887317, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s314986716.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s314986716", "user_id": "u272377260"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet cats_and_dogs a b x =\n  if a > x then \"NO\"\n  else if a + b < x then \"NO\"\n  else \"YES\"\n\nlet () = scanf \"%d %d %d\" cats_and_dogs |> printf \"%s\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are a total of A + B cats and dogs.\nAmong them, A are known to be cats, but the remaining B are not known to be either cats or dogs.\n\nDetermine if it is possible that there are exactly X cats among these A + B animals.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\n1 \\leq X \\leq 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B X\n\nOutput\n\nIf it is possible that there are exactly X cats, print YES; if it is impossible, print NO.\n\nSample Input 1\n\n3 5 4\n\nSample Output 1\n\nYES\n\nIf there are one cat and four dogs among the B = 5 animals, there are X = 4 cats in total.\n\nSample Input 2\n\n2 2 6\n\nSample Output 2\n\nNO\n\nEven if all of the B = 2 animals are cats, there are less than X = 6 cats in total.\n\nSample Input 3\n\n5 3 2\n\nSample Output 3\n\nNO\n\nEven if all of the B = 3 animals are dogs, there are more than X = 2 cats in total.", "sample_input": "3 5 4\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03377", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are a total of A + B cats and dogs.\nAmong them, A are known to be cats, but the remaining B are not known to be either cats or dogs.\n\nDetermine if it is possible that there are exactly X cats among these A + B animals.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\n1 \\leq X \\leq 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B X\n\nOutput\n\nIf it is possible that there are exactly X cats, print YES; if it is impossible, print NO.\n\nSample Input 1\n\n3 5 4\n\nSample Output 1\n\nYES\n\nIf there are one cat and four dogs among the B = 5 animals, there are X = 4 cats in total.\n\nSample Input 2\n\n2 2 6\n\nSample Output 2\n\nNO\n\nEven if all of the B = 2 animals are cats, there are less than X = 6 cats in total.\n\nSample Input 3\n\n5 3 2\n\nSample Output 3\n\nNO\n\nEven if all of the B = 3 animals are dogs, there are more than X = 2 cats in total.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 171, "cpu_time_ms": 9, "memory_kb": 3664}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s914123214", "group_id": "codeNet:p03377", "input_text": "open Printf\nopen Scanf\n\nlet solve a b x =\n  if a <= x && x <= a + b then \"YES\" else \"NO\"\n\nlet () =\n  scanf \"%d %d %d \" solve |> printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1582658458, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s914123214.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s914123214", "user_id": "u388783188"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve a b x =\n  if a <= x && x <= a + b then \"YES\" else \"NO\"\n\nlet () =\n  scanf \"%d %d %d \" solve |> printf \"%s\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are a total of A + B cats and dogs.\nAmong them, A are known to be cats, but the remaining B are not known to be either cats or dogs.\n\nDetermine if it is possible that there are exactly X cats among these A + B animals.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\n1 \\leq X \\leq 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B X\n\nOutput\n\nIf it is possible that there are exactly X cats, print YES; if it is impossible, print NO.\n\nSample Input 1\n\n3 5 4\n\nSample Output 1\n\nYES\n\nIf there are one cat and four dogs among the B = 5 animals, there are X = 4 cats in total.\n\nSample Input 2\n\n2 2 6\n\nSample Output 2\n\nNO\n\nEven if all of the B = 2 animals are cats, there are less than X = 6 cats in total.\n\nSample Input 3\n\n5 3 2\n\nSample Output 3\n\nNO\n\nEven if all of the B = 3 animals are dogs, there are more than X = 2 cats in total.", "sample_input": "3 5 4\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03377", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are a total of A + B cats and dogs.\nAmong them, A are known to be cats, but the remaining B are not known to be either cats or dogs.\n\nDetermine if it is possible that there are exactly X cats among these A + B animals.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\n1 \\leq X \\leq 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B X\n\nOutput\n\nIf it is possible that there are exactly X cats, print YES; if it is impossible, print NO.\n\nSample Input 1\n\n3 5 4\n\nSample Output 1\n\nYES\n\nIf there are one cat and four dogs among the B = 5 animals, there are X = 4 cats in total.\n\nSample Input 2\n\n2 2 6\n\nSample Output 2\n\nNO\n\nEven if all of the B = 2 animals are cats, there are less than X = 6 cats in total.\n\nSample Input 3\n\n5 3 2\n\nSample Output 3\n\nNO\n\nEven if all of the B = 3 animals are dogs, there are more than X = 2 cats in total.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 142, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s659481643", "group_id": "codeNet:p03377", "input_text": "let () =\n  Scanf.scanf \"%d %d %d\" (fun a b x -> if a <= x && x <= a+b then \"YES\" else \"NO\")\n  |> print_endline", "language": "OCaml", "metadata": {"date": 1531253967, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s659481643.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s659481643", "user_id": "u798181098"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d %d\" (fun a b x -> if a <= x && x <= a+b then \"YES\" else \"NO\")\n  |> print_endline", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are a total of A + B cats and dogs.\nAmong them, A are known to be cats, but the remaining B are not known to be either cats or dogs.\n\nDetermine if it is possible that there are exactly X cats among these A + B animals.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\n1 \\leq X \\leq 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B X\n\nOutput\n\nIf it is possible that there are exactly X cats, print YES; if it is impossible, print NO.\n\nSample Input 1\n\n3 5 4\n\nSample Output 1\n\nYES\n\nIf there are one cat and four dogs among the B = 5 animals, there are X = 4 cats in total.\n\nSample Input 2\n\n2 2 6\n\nSample Output 2\n\nNO\n\nEven if all of the B = 2 animals are cats, there are less than X = 6 cats in total.\n\nSample Input 3\n\n5 3 2\n\nSample Output 3\n\nNO\n\nEven if all of the B = 3 animals are dogs, there are more than X = 2 cats in total.", "sample_input": "3 5 4\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03377", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are a total of A + B cats and dogs.\nAmong them, A are known to be cats, but the remaining B are not known to be either cats or dogs.\n\nDetermine if it is possible that there are exactly X cats among these A + B animals.\n\nConstraints\n\n1 \\leq A \\leq 100\n\n1 \\leq B \\leq 100\n\n1 \\leq X \\leq 200\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B X\n\nOutput\n\nIf it is possible that there are exactly X cats, print YES; if it is impossible, print NO.\n\nSample Input 1\n\n3 5 4\n\nSample Output 1\n\nYES\n\nIf there are one cat and four dogs among the B = 5 animals, there are X = 4 cats in total.\n\nSample Input 2\n\n2 2 6\n\nSample Output 2\n\nNO\n\nEven if all of the B = 2 animals are cats, there are less than X = 6 cats in total.\n\nSample Input 3\n\n5 3 2\n\nSample Output 3\n\nNO\n\nEven if all of the B = 3 animals are dogs, there are more than X = 2 cats in total.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 110, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s125958151", "group_id": "codeNet:p03378", "input_text": "Scanf.(Array.(scanf\" %d %d %d\"@@fun n m x->\n\tlet l,r = init m (fun _->scanf\" %d\"@@fun v->v)\n\t|> fold_left(fun (l,r) v->if v<x then (l+1,r) else (l,r+1))(0,0)\n\tin print_int @@ min l r));;", "language": "OCaml", "metadata": {"date": 1541158864, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s125958151.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s125958151", "user_id": "u481480055"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "Scanf.(Array.(scanf\" %d %d %d\"@@fun n m x->\n\tlet l,r = init m (fun _->scanf\" %d\"@@fun v->v)\n\t|> fold_left(fun (l,r) v->if v<x then (l+1,r) else (l,r+1))(0,0)\n\tin print_int @@ min l r));;", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 186, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s100093862", "group_id": "codeNet:p03379", "input_text": "let n = Scanf.scanf \" %d\" (+) 0\nlet xs = Array.init n @@ fun i -> Scanf.scanf \" %d\" @@ fun x -> x, i\nlet rs = Array.make n 0\nlet _ = Array.(sort compare xs; iteri (fun j (_, i) -> rs.(i) <- j) xs; iter (fun j -> Printf.printf \"%d\\n\" @@ fst @@ if n / 2 - 1 < j then xs.(n / 2 - 1) else xs.(n / 2)) rs)", "language": "OCaml", "metadata": {"date": 1568312200, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03379.html", "problem_id": "p03379", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03379/input.txt", "sample_output_relpath": "derived/input_output/data/p03379/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03379/OCaml/s100093862.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s100093862", "user_id": "u732304692"}, "prompt_components": {"gold_output": "4\n3\n3\n4\n", "input_to_evaluate": "let n = Scanf.scanf \" %d\" (+) 0\nlet xs = Array.init n @@ fun i -> Scanf.scanf \" %d\" @@ fun x -> x, i\nlet rs = Array.make n 0\nlet _ = Array.(sort compare xs; iteri (fun j (_, i) -> rs.(i) <- j) xs; iter (fun j -> Printf.printf \"%d\\n\" @@ fst @@ if n / 2 - 1 < j then xs.(n / 2 - 1) else xs.(n / 2)) rs)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWhen l is an odd number, the median of l numbers a_1, a_2, ..., a_l is the (\\frac{l+1}{2})-th largest value among a_1, a_2, ..., a_l.\n\nYou are given N numbers X_1, X_2, ..., X_N, where N is an even number.\nFor each i = 1, 2, ..., N, let the median of X_1, X_2, ..., X_N excluding X_i, that is, the median of X_1, X_2, ..., X_{i-1}, X_{i+1}, ..., X_N be B_i.\n\nFind B_i for each i = 1, 2, ..., N.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\nN is even.\n\n1 \\leq X_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 X_2 ... X_N\n\nOutput\n\nPrint N lines.\nThe i-th line should contain B_i.\n\nSample Input 1\n\n4\n2 4 4 3\n\nSample Output 1\n\n4\n3\n3\n4\n\nSince the median of X_2, X_3, X_4 is 4, B_1 = 4.\n\nSince the median of X_1, X_3, X_4 is 3, B_2 = 3.\n\nSince the median of X_1, X_2, X_4 is 3, B_3 = 3.\n\nSince the median of X_1, X_2, X_3 is 4, B_4 = 4.\n\nSample Input 2\n\n2\n1 2\n\nSample Output 2\n\n2\n1\n\nSample Input 3\n\n6\n5 5 4 4 3 3\n\nSample Output 3\n\n4\n4\n4\n4\n4\n4", "sample_input": "4\n2 4 4 3\n"}, "reference_outputs": ["4\n3\n3\n4\n"], "source_document_id": "p03379", "source_text": "Score : 300 points\n\nProblem Statement\n\nWhen l is an odd number, the median of l numbers a_1, a_2, ..., a_l is the (\\frac{l+1}{2})-th largest value among a_1, a_2, ..., a_l.\n\nYou are given N numbers X_1, X_2, ..., X_N, where N is an even number.\nFor each i = 1, 2, ..., N, let the median of X_1, X_2, ..., X_N excluding X_i, that is, the median of X_1, X_2, ..., X_{i-1}, X_{i+1}, ..., X_N be B_i.\n\nFind B_i for each i = 1, 2, ..., N.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\nN is even.\n\n1 \\leq X_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 X_2 ... X_N\n\nOutput\n\nPrint N lines.\nThe i-th line should contain B_i.\n\nSample Input 1\n\n4\n2 4 4 3\n\nSample Output 1\n\n4\n3\n3\n4\n\nSince the median of X_2, X_3, X_4 is 4, B_1 = 4.\n\nSince the median of X_1, X_3, X_4 is 3, B_2 = 3.\n\nSince the median of X_1, X_2, X_4 is 3, B_3 = 3.\n\nSince the median of X_1, X_2, X_3 is 4, B_4 = 4.\n\nSample Input 2\n\n2\n1 2\n\nSample Output 2\n\n2\n1\n\nSample Input 3\n\n6\n5 5 4 4 3 3\n\nSample Output 3\n\n4\n4\n4\n4\n4\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 338, "memory_kb": 14336}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s018723871", "group_id": "codeNet:p03385", "input_text": "let s = Array.init 3 @@ fun _ -> Scanf.scanf \" %c\" @@ fun c -> c\nlet _ =\n  Array.sort compare s;\n  print_endline @@ if s = [|'a'; 'b'; 'c'|] then \"Yes\" else \"No\"", "language": "OCaml", "metadata": {"date": 1562325751, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s018723871.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s018723871", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let s = Array.init 3 @@ fun _ -> Scanf.scanf \" %c\" @@ fun c -> c\nlet _ =\n  Array.sort compare s;\n  print_endline @@ if s = [|'a'; 'b'; 'c'|] then \"Yes\" else \"No\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S of length 3 consisting of a, b and c. Determine if S can be obtained by permuting abc.\n\nConstraints\n\n|S|=3\n\nS consists of a, b and c.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S can be obtained by permuting abc, print Yes; otherwise, print No.\n\nSample Input 1\n\nbac\n\nSample Output 1\n\nYes\n\nSwapping the first and second characters in bac results in abc.\n\nSample Input 2\n\nbab\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nabc\n\nSample Output 3\n\nYes\n\nSample Input 4\n\naaa\n\nSample Output 4\n\nNo", "sample_input": "bac\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03385", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S of length 3 consisting of a, b and c. Determine if S can be obtained by permuting abc.\n\nConstraints\n\n|S|=3\n\nS consists of a, b and c.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S can be obtained by permuting abc, print Yes; otherwise, print No.\n\nSample Input 1\n\nbac\n\nSample Output 1\n\nYes\n\nSwapping the first and second characters in bac results in abc.\n\nSample Input 2\n\nbab\n\nSample Output 2\n\nNo\n\nSample Input 3\n\nabc\n\nSample Output 3\n\nYes\n\nSample Input 4\n\naaa\n\nSample Output 4\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 161, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s883363787", "group_id": "codeNet:p03386", "input_text": "let a, b, k = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet l, r = max a @@ b - k + 1, min b @@ a + k - 1\nlet _ =\n  if l <= r then for i = a to b do Printf.printf \"%d\\n\" i done\n  else\n    (for i = a to r do Printf.printf \"%d\\n\" i done;\n    for i = l to b do Printf.printf \"%d\\n\" i done)", "language": "OCaml", "metadata": {"date": 1561954386, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s883363787.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s883363787", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3\n4\n7\n8\n", "input_to_evaluate": "let a, b, k = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet l, r = max a @@ b - k + 1, min b @@ a + k - 1\nlet _ =\n  if l <= r then for i = a to b do Printf.printf \"%d\\n\" i done\n  else\n    (for i = a to r do Printf.printf \"%d\\n\" i done;\n    for i = l to b do Printf.printf \"%d\\n\" i done)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nPrint all the integers that satisfies the following in ascending order:\n\nAmong the integers between A and B (inclusive), it is either within the K smallest integers or within the K largest integers.\n\nConstraints\n\n1 \\leq A \\leq B \\leq 10^9\n\n1 \\leq K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint all the integers that satisfies the condition above in ascending order.\n\nSample Input 1\n\n3 8 2\n\nSample Output 1\n\n3\n4\n7\n8\n\n3 is the first smallest integer among the integers between 3 and 8.\n\n4 is the second smallest integer among the integers between 3 and 8.\n\n7 is the second largest integer among the integers between 3 and 8.\n\n8 is the first largest integer among the integers between 3 and 8.\n\nSample Input 2\n\n4 8 3\n\nSample Output 2\n\n4\n5\n6\n7\n8\n\nSample Input 3\n\n2 9 100\n\nSample Output 3\n\n2\n3\n4\n5\n6\n7\n8\n9", "sample_input": "3 8 2\n"}, "reference_outputs": ["3\n4\n7\n8\n"], "source_document_id": "p03386", "source_text": "Score : 200 points\n\nProblem Statement\n\nPrint all the integers that satisfies the following in ascending order:\n\nAmong the integers between A and B (inclusive), it is either within the K smallest integers or within the K largest integers.\n\nConstraints\n\n1 \\leq A \\leq B \\leq 10^9\n\n1 \\leq K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint all the integers that satisfies the condition above in ascending order.\n\nSample Input 1\n\n3 8 2\n\nSample Output 1\n\n3\n4\n7\n8\n\n3 is the first smallest integer among the integers between 3 and 8.\n\n4 is the second smallest integer among the integers between 3 and 8.\n\n7 is the second largest integer among the integers between 3 and 8.\n\n8 is the first largest integer among the integers between 3 and 8.\n\nSample Input 2\n\n4 8 3\n\nSample Output 2\n\n4\n5\n6\n7\n8\n\nSample Input 3\n\n2 9 100\n\nSample Output 3\n\n2\n3\n4\n5\n6\n7\n8\n9", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 292, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s550423378", "group_id": "codeNet:p03386", "input_text": "let () = Scanf.scanf \"%d %d %d\" @@ fun a b k ->\n  if b - a <= 2 * k - 2 then\n    for i = a to b do\n      Printf.printf \"%d\\n\" i\n    done\n  else begin\n    for i = a to a + k - 1 do\n      Printf.printf \"%d\\n\" i\n    done;\n    for i = b - k + 1 to b do\n      Printf.printf \"%d\\n\" i\n    done\n  end\n", "language": "OCaml", "metadata": {"date": 1530510238, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s550423378.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s550423378", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3\n4\n7\n8\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" @@ fun a b k ->\n  if b - a <= 2 * k - 2 then\n    for i = a to b do\n      Printf.printf \"%d\\n\" i\n    done\n  else begin\n    for i = a to a + k - 1 do\n      Printf.printf \"%d\\n\" i\n    done;\n    for i = b - k + 1 to b do\n      Printf.printf \"%d\\n\" i\n    done\n  end\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nPrint all the integers that satisfies the following in ascending order:\n\nAmong the integers between A and B (inclusive), it is either within the K smallest integers or within the K largest integers.\n\nConstraints\n\n1 \\leq A \\leq B \\leq 10^9\n\n1 \\leq K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint all the integers that satisfies the condition above in ascending order.\n\nSample Input 1\n\n3 8 2\n\nSample Output 1\n\n3\n4\n7\n8\n\n3 is the first smallest integer among the integers between 3 and 8.\n\n4 is the second smallest integer among the integers between 3 and 8.\n\n7 is the second largest integer among the integers between 3 and 8.\n\n8 is the first largest integer among the integers between 3 and 8.\n\nSample Input 2\n\n4 8 3\n\nSample Output 2\n\n4\n5\n6\n7\n8\n\nSample Input 3\n\n2 9 100\n\nSample Output 3\n\n2\n3\n4\n5\n6\n7\n8\n9", "sample_input": "3 8 2\n"}, "reference_outputs": ["3\n4\n7\n8\n"], "source_document_id": "p03386", "source_text": "Score : 200 points\n\nProblem Statement\n\nPrint all the integers that satisfies the following in ascending order:\n\nAmong the integers between A and B (inclusive), it is either within the K smallest integers or within the K largest integers.\n\nConstraints\n\n1 \\leq A \\leq B \\leq 10^9\n\n1 \\leq K \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint all the integers that satisfies the condition above in ascending order.\n\nSample Input 1\n\n3 8 2\n\nSample Output 1\n\n3\n4\n7\n8\n\n3 is the first smallest integer among the integers between 3 and 8.\n\n4 is the second smallest integer among the integers between 3 and 8.\n\n7 is the second largest integer among the integers between 3 and 8.\n\n8 is the first largest integer among the integers between 3 and 8.\n\nSample Input 2\n\n4 8 3\n\nSample Output 2\n\n4\n5\n6\n7\n8\n\nSample Input 3\n\n2 9 100\n\nSample Output 3\n\n2\n3\n4\n5\n6\n7\n8\n9", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 293, "cpu_time_ms": 2, "memory_kb": 4480}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s958287546", "group_id": "codeNet:p03387", "input_text": "(* O(1) *)\nlet a, b, c = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet m = max a @@ max b c\nlet ec = List.filter (fun n -> n mod 2 = 0) [a; b; c] |> List.length\nlet x = m + if (ec = 1 || ec = 2) && m mod 2 = 2 - ec then 1 else 0\nlet _ = Printf.printf \"%d\\n\" @@ (3 * x - (a + b + c)) / 2", "language": "OCaml", "metadata": {"date": 1560527568, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03387.html", "problem_id": "p03387", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03387/input.txt", "sample_output_relpath": "derived/input_output/data/p03387/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03387/OCaml/s958287546.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s958287546", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "(* O(1) *)\nlet a, b, c = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet m = max a @@ max b c\nlet ec = List.filter (fun n -> n mod 2 = 0) [a; b; c] |> List.length\nlet x = m + if (ec = 1 || ec = 2) && m mod 2 = 2 - ec then 1 else 0\nlet _ = Printf.printf \"%d\\n\" @@ (3 * x - (a + b + c)) / 2", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given three integers A, B and C. Find the minimum number of operations required to make A, B and C all equal by repeatedly performing the following two kinds of operations in any order:\n\nChoose two among A, B and C, then increase both by 1.\n\nChoose one among A, B and C, then increase it by 2.\n\nIt can be proved that we can always make A, B and C all equal by repeatedly performing these operations.\n\nConstraints\n\n0 \\leq A,B,C \\leq 50\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum number of operations required to make A, B and C all equal.\n\nSample Input 1\n\n2 5 4\n\nSample Output 1\n\n2\n\nWe can make A, B and C all equal by the following operations:\n\nIncrease A and C by 1. Now, A, B, C are 3, 5, 5, respectively.\n\nIncrease A by 2. Now, A, B, C are 5, 5, 5, respectively.\n\nSample Input 2\n\n2 6 3\n\nSample Output 2\n\n5\n\nSample Input 3\n\n31 41 5\n\nSample Output 3\n\n23", "sample_input": "2 5 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03387", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given three integers A, B and C. Find the minimum number of operations required to make A, B and C all equal by repeatedly performing the following two kinds of operations in any order:\n\nChoose two among A, B and C, then increase both by 1.\n\nChoose one among A, B and C, then increase it by 2.\n\nIt can be proved that we can always make A, B and C all equal by repeatedly performing these operations.\n\nConstraints\n\n0 \\leq A,B,C \\leq 50\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum number of operations required to make A, B and C all equal.\n\nSample Input 1\n\n2 5 4\n\nSample Output 1\n\n2\n\nWe can make A, B and C all equal by the following operations:\n\nIncrease A and C by 1. Now, A, B, C are 3, 5, 5, respectively.\n\nIncrease A by 2. Now, A, B, C are 5, 5, 5, respectively.\n\nSample Input 2\n\n2 6 3\n\nSample Output 2\n\n5\n\nSample Input 3\n\n31 41 5\n\nSample Output 3\n\n23", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 292, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s922537886", "group_id": "codeNet:p03388", "input_text": "let sqrt_int x = int_of_float (sqrt (float_of_int x))\n\nlet () =\n  Scanf.scanf \"%d\" @@ fun q ->\n  Array.init q begin fun _ -> Scanf.scanf \" %d %d\" @@ fun a b ->\n    let a, b = min a b, max a b in\n    let mul, hmul = a * b - 1, sqrt_int (a * b - 1) in\n    let rec search l r =\n      if l+1 >= r then l else\n      let m = (l + r) / 2 in\n      if mul / m > hmul then search m r else search l m\n    in\n    let c = search a (a*b+1) - a |> max 0 in\n    (a-1) + min (b-1) (if hmul <> 0 && mul/hmul = a then hmul-1 else hmul) + c\n  end |> Array.iter (Printf.printf \"%d\\n\")\n", "language": "OCaml", "metadata": {"date": 1529353649, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03388.html", "problem_id": "p03388", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03388/input.txt", "sample_output_relpath": "derived/input_output/data/p03388/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03388/OCaml/s922537886.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s922537886", "user_id": "u798181098"}, "prompt_components": {"gold_output": "1\n12\n4\n11\n14\n57\n31\n671644785\n", "input_to_evaluate": "let sqrt_int x = int_of_float (sqrt (float_of_int x))\n\nlet () =\n  Scanf.scanf \"%d\" @@ fun q ->\n  Array.init q begin fun _ -> Scanf.scanf \" %d %d\" @@ fun a b ->\n    let a, b = min a b, max a b in\n    let mul, hmul = a * b - 1, sqrt_int (a * b - 1) in\n    let rec search l r =\n      if l+1 >= r then l else\n      let m = (l + r) / 2 in\n      if mul / m > hmul then search m r else search l m\n    in\n    let c = search a (a*b+1) - a |> max 0 in\n    (a-1) + min (b-1) (if hmul <> 0 && mul/hmul = a then hmul-1 else hmul) + c\n  end |> Array.iter (Printf.printf \"%d\\n\")\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\n10^{10^{10}} participants, including Takahashi, competed in two programming contests.\nIn each contest, all participants had distinct ranks from first through 10^{10^{10}}-th.\n\nThe score of a participant is the product of his/her ranks in the two contests.\n\nProcess the following Q queries:\n\nIn the i-th query, you are given two positive integers A_i and B_i. Assuming that Takahashi was ranked A_i-th in the first contest and B_i-th in the second contest, find the maximum possible number of participants whose scores are smaller than Takahashi's.\n\nConstraints\n\n1 \\leq Q \\leq 100\n\n1\\leq A_i,B_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\nQ\nA_1 B_1\n:\nA_Q B_Q\n\nOutput\n\nFor each query, print the maximum possible number of participants whose scores are smaller than Takahashi's.\n\nSample Input 1\n\n8\n1 4\n10 5\n3 3\n4 11\n8 9\n22 40\n8 36\n314159265 358979323\n\nSample Output 1\n\n1\n12\n4\n11\n14\n57\n31\n671644785\n\nLet us denote a participant who was ranked x-th in the first contest and y-th in the second contest as (x,y).\n\nIn the first query, (2,1) is a possible candidate of a participant whose score is smaller than Takahashi's. There are never two or more participants whose scores are smaller than Takahashi's, so we should print 1.", "sample_input": "8\n1 4\n10 5\n3 3\n4 11\n8 9\n22 40\n8 36\n314159265 358979323\n"}, "reference_outputs": ["1\n12\n4\n11\n14\n57\n31\n671644785\n"], "source_document_id": "p03388", "source_text": "Score : 700 points\n\nProblem Statement\n\n10^{10^{10}} participants, including Takahashi, competed in two programming contests.\nIn each contest, all participants had distinct ranks from first through 10^{10^{10}}-th.\n\nThe score of a participant is the product of his/her ranks in the two contests.\n\nProcess the following Q queries:\n\nIn the i-th query, you are given two positive integers A_i and B_i. Assuming that Takahashi was ranked A_i-th in the first contest and B_i-th in the second contest, find the maximum possible number of participants whose scores are smaller than Takahashi's.\n\nConstraints\n\n1 \\leq Q \\leq 100\n\n1\\leq A_i,B_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\nQ\nA_1 B_1\n:\nA_Q B_Q\n\nOutput\n\nFor each query, print the maximum possible number of participants whose scores are smaller than Takahashi's.\n\nSample Input 1\n\n8\n1 4\n10 5\n3 3\n4 11\n8 9\n22 40\n8 36\n314159265 358979323\n\nSample Output 1\n\n1\n12\n4\n11\n14\n57\n31\n671644785\n\nLet us denote a participant who was ranked x-th in the first contest and y-th in the second contest as (x,y).\n\nIn the first query, (2,1) is a possible candidate of a participant whose score is smaller than Takahashi's. There are never two or more participants whose scores are smaller than Takahashi's, so we should print 1.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 564, "cpu_time_ms": 2, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s321799476", "group_id": "codeNet:p03391", "input_text": "\nlet () =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let abs = Array.init n (fun _ -> Scanf.scanf \"%d %d\\n\" (fun a b -> a, b)) in\n  Printf.printf \"%d\\n\" @@\n  if List.for_all (fun (a, b) -> a = b) (Array.to_list abs) then 0\n  else \n  Array.fold_left (fun acc (a, b) ->\n    if b < a then acc + a - b\n    else acc + a) 0 abs", "language": "OCaml", "metadata": {"date": 1523152122, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03391.html", "problem_id": "p03391", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03391/input.txt", "sample_output_relpath": "derived/input_output/data/p03391/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03391/OCaml/s321799476.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s321799476", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "\nlet () =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let abs = Array.init n (fun _ -> Scanf.scanf \"%d %d\\n\" (fun a b -> a, b)) in\n  Printf.printf \"%d\\n\" @@\n  if List.for_all (fun (a, b) -> a = b) (Array.to_list abs) then 0\n  else \n  Array.fold_left (fun acc (a, b) ->\n    if b < a then acc + a - b\n    else acc + a) 0 abs", "problem_context": "Score : 700 points\n\nProblem Statement\n\nYou are given sequences A and B consisting of non-negative integers.\nThe lengths of both A and B are N, and the sums of the elements in A and B are equal.\nThe i-th element in A is A_i, and the i-th element in B is B_i.\n\nTozan and Gezan repeats the following sequence of operations:\n\nIf A and B are equal sequences, terminate the process.\n\nOtherwise, first Tozan chooses a positive element in A and decrease it by 1.\n\nThen, Gezan chooses a positive element in B and decrease it by 1.\n\nThen, give one candy to Takahashi, their pet.\n\nTozan wants the number of candies given to Takahashi until the process is terminated to be as large as possible, while Gezan wants it to be as small as possible.\nFind the number of candies given to Takahashi when both of them perform the operations optimally.\n\nConstraints\n\n1 \\leq N \\leq 2 × 10^5\n\n0 \\leq A_i,B_i \\leq 10^9(1\\leq i\\leq N)\n\nThe sums of the elements in A and B are equal.\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 number of candies given to Takahashi when both Tozan and Gezan perform the operations optimally.\n\nSample Input 1\n\n2\n1 2\n3 2\n\nSample Output 1\n\n2\n\nWhen both Tozan and Gezan perform the operations optimally, the process will proceed as follows:\n\nTozan decreases A_1 by 1.\n\nGezan decreases B_1 by 1.\n\nOne candy is given to Takahashi.\n\nTozan decreases A_2 by 1.\n\nGezan decreases B_1 by 1.\n\nOne candy is given to Takahashi.\n\nAs A and B are equal, the process is terminated.\n\nSample Input 2\n\n3\n8 3\n0 1\n4 8\n\nSample Output 2\n\n9\n\nSample Input 3\n\n1\n1 1\n\nSample Output 3\n\n0", "sample_input": "2\n1 2\n3 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03391", "source_text": "Score : 700 points\n\nProblem Statement\n\nYou are given sequences A and B consisting of non-negative integers.\nThe lengths of both A and B are N, and the sums of the elements in A and B are equal.\nThe i-th element in A is A_i, and the i-th element in B is B_i.\n\nTozan and Gezan repeats the following sequence of operations:\n\nIf A and B are equal sequences, terminate the process.\n\nOtherwise, first Tozan chooses a positive element in A and decrease it by 1.\n\nThen, Gezan chooses a positive element in B and decrease it by 1.\n\nThen, give one candy to Takahashi, their pet.\n\nTozan wants the number of candies given to Takahashi until the process is terminated to be as large as possible, while Gezan wants it to be as small as possible.\nFind the number of candies given to Takahashi when both of them perform the operations optimally.\n\nConstraints\n\n1 \\leq N \\leq 2 × 10^5\n\n0 \\leq A_i,B_i \\leq 10^9(1\\leq i\\leq N)\n\nThe sums of the elements in A and B are equal.\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 number of candies given to Takahashi when both Tozan and Gezan perform the operations optimally.\n\nSample Input 1\n\n2\n1 2\n3 2\n\nSample Output 1\n\n2\n\nWhen both Tozan and Gezan perform the operations optimally, the process will proceed as follows:\n\nTozan decreases A_1 by 1.\n\nGezan decreases B_1 by 1.\n\nOne candy is given to Takahashi.\n\nTozan decreases A_2 by 1.\n\nGezan decreases B_1 by 1.\n\nOne candy is given to Takahashi.\n\nAs A and B are equal, the process is terminated.\n\nSample Input 2\n\n3\n8 3\n0 1\n4 8\n\nSample Output 2\n\n9\n\nSample Input 3\n\n1\n1 1\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 325, "cpu_time_ms": 15, "memory_kb": 5504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s429712577", "group_id": "codeNet:p03393", "input_text": "let s, f = read_line (), Printf.printf \"%s%c\\n\"\nlet n = String.length s\nlet _ = String.(if n < 26 then Char.(for i = code 'a' to code 'z' do try index s (chr i) |> ignore with _ -> f s (chr i); exit 0 done) else let j = ref ~-1 in iteri (fun i c -> if i > 0 && s.[i - 1] < c then j := i - 1) s; if !j < 0 then print_endline \"-1\" else let m = ref 'z' in for i = !j + 1 to n - 1 do if s.[i] > s.[!j] then m := min !m s.[i] done; f (sub s 0 !j) !m)", "language": "OCaml", "metadata": {"date": 1579963732, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s429712577.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s429712577", "user_id": "u732304692"}, "prompt_components": {"gold_output": "atcoderb\n", "input_to_evaluate": "let s, f = read_line (), Printf.printf \"%s%c\\n\"\nlet n = String.length s\nlet _ = String.(if n < 26 then Char.(for i = code 'a' to code 'z' do try index s (chr i) |> ignore with _ -> f s (chr i); exit 0 done) else let j = ref ~-1 in iteri (fun i c -> if i > 0 && s.[i - 1] < c then j := i - 1) s; if !j < 0 then print_endline \"-1\" else let m = ref 'z' in for i = !j + 1 to n - 1 do if s.[i] > s.[!j] then m := min !m s.[i] done; f (sub s 0 !j) !m)", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 445, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s334251414", "group_id": "codeNet:p03393", "input_text": "let s = read_line ()\nlet n, fs, i = Array.(String.length s, make 128 false, ref 97)\nlet f s n = Printf.printf \"%s%c\\n\" s (Char.chr n); exit 0\nlet _ = String.(Char.(iter (fun c -> fs.(code c) <- true) s; if n < 26 then (while fs.(!i) do incr i done; f s !i);\n  for j = n - 1 downto 0 do i := code s.[j]; while !i < 123 && fs.(!i) do incr i done; if !i < 123 then f (sub s 0 j) !i; fs.(code s.[j]) <- false done; print_endline \"-1\"))", "language": "OCaml", "metadata": {"date": 1577338464, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s334251414.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s334251414", "user_id": "u732304692"}, "prompt_components": {"gold_output": "atcoderb\n", "input_to_evaluate": "let s = read_line ()\nlet n, fs, i = Array.(String.length s, make 128 false, ref 97)\nlet f s n = Printf.printf \"%s%c\\n\" s (Char.chr n); exit 0\nlet _ = String.(Char.(iter (fun c -> fs.(code c) <- true) s; if n < 26 then (while fs.(!i) do incr i done; f s !i);\n  for j = n - 1 downto 0 do i := code s.[j]; while !i < 123 && fs.(!i) do incr i done; if !i < 123 then f (sub s 0 j) !i; fs.(code s.[j]) <- false done; print_endline \"-1\"))", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 431, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s402066851", "group_id": "codeNet:p03393", "input_text": "let s = read_line ()\nlet n, fs, is, i = Array.(String.length s, make 26 false, make 26 0, ref 0)\nlet f s n = Printf.printf \"%s%c\\n\" s (Char.chr (n + 97)); exit 0\nlet _ = String.(Char.(iter (fun c -> let n = code c - 97 in fs.(n) <- true; is.(!i) <- n; incr i) s;\n  if n < 26 then (i := 0; while fs.(!i) do incr i done; f s !i);\n  for j = n - 1 downto 0 do i := code s.[j] - 96; while !i < 26 && fs.(!i) do incr i done; if !i < 26 then f (sub s 0 j) !i; fs.(is.(j)) <- false done; print_endline \"-1\"))", "language": "OCaml", "metadata": {"date": 1577319867, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s402066851.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s402066851", "user_id": "u732304692"}, "prompt_components": {"gold_output": "atcoderb\n", "input_to_evaluate": "let s = read_line ()\nlet n, fs, is, i = Array.(String.length s, make 26 false, make 26 0, ref 0)\nlet f s n = Printf.printf \"%s%c\\n\" s (Char.chr (n + 97)); exit 0\nlet _ = String.(Char.(iter (fun c -> let n = code c - 97 in fs.(n) <- true; is.(!i) <- n; incr i) s;\n  if n < 26 then (i := 0; while fs.(!i) do incr i done; f s !i);\n  for j = n - 1 downto 0 do i := code s.[j] - 96; while !i < 26 && fs.(!i) do incr i done; if !i < 26 then f (sub s 0 j) !i; fs.(is.(j)) <- false done; print_endline \"-1\"))", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 500, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s039329047", "group_id": "codeNet:p03393", "input_text": "let () =\n  let s = read_line () in\n  print_endline @@\n  if s = \"zyxwvutsrqponmlkjihgfedcba\" then \"-1\"\n  else if String.length s = 26 then\n    Array.init 26 (fun i -> i)\n    |> Array.to_list\n    |> List.rev\n    |> List.find (fun i ->\n        s.[i] <> 'z' &&\n        Array.init i (fun j -> j)\n        |> Array.to_list\n        |> List.for_all (fun j ->\n            Char.code s.[i] + 1 <> Char.code s.[j]))\n    |> (fun i -> String.sub s 0 i ^ String.make 1 (Char.chr (1 + Char.code s.[i])))\n  else\n    Array.init 26 (fun i -> Char.chr (Char.code 'a' + i))\n    |> Array.to_list\n    |> List.find (fun c ->\n        Array.init (String.length s) (fun i -> s.[i])\n        |> Array.to_list\n        |> List.for_all (( <> ) c))\n    |> String.make 1\n    |> ( ^ ) s", "language": "OCaml", "metadata": {"date": 1531413784, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s039329047.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s039329047", "user_id": "u504158101"}, "prompt_components": {"gold_output": "atcoderb\n", "input_to_evaluate": "let () =\n  let s = read_line () in\n  print_endline @@\n  if s = \"zyxwvutsrqponmlkjihgfedcba\" then \"-1\"\n  else if String.length s = 26 then\n    Array.init 26 (fun i -> i)\n    |> Array.to_list\n    |> List.rev\n    |> List.find (fun i ->\n        s.[i] <> 'z' &&\n        Array.init i (fun j -> j)\n        |> Array.to_list\n        |> List.for_all (fun j ->\n            Char.code s.[i] + 1 <> Char.code s.[j]))\n    |> (fun i -> String.sub s 0 i ^ String.make 1 (Char.chr (1 + Char.code s.[i])))\n  else\n    Array.init 26 (fun i -> Char.chr (Char.code 'a' + i))\n    |> Array.to_list\n    |> List.find (fun c ->\n        Array.init (String.length s) (fun i -> s.[i])\n        |> Array.to_list\n        |> List.for_all (( <> ) c))\n    |> String.make 1\n    |> ( ^ ) s", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s493951881", "group_id": "codeNet:p03394", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let rec gcd a b = if b = 0 then a else gcd b (a mod b) in\n\n    let rec check2 prev i sum =\n        if i > 30000 then true else\n            if (i + sum) mod 2 = 0 &&\n               (i + sum) mod 3 = 0 &&\n               gcd i sum <> 1 then (Printf.printf \"%d %d\\n\" prev i; false)\n            else check2 prev (i + 1) sum\n    in\n\n    let rec check i sum =\n        if i mod 6 = 5 then check (i + 1) sum else\n            if check2 i (i + 1) (sum + i) then check (i + 1) sum\n    in\n\n    let rec loop i acc sum =\n        if acc = n - 2 then check i sum else\n        if i mod 2 = 0 || i mod 3 = 0 then (\n            let () = Printf.printf \"%d \" i in\n            let acc = acc + 1 in\n            let sum = sum + i in\n            loop (i + 1) acc sum\n        ) else loop (i + 1) acc sum\n    in\n    loop 2 0 0\n)", "language": "OCaml", "metadata": {"date": 1590737315, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03394.html", "problem_id": "p03394", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03394/input.txt", "sample_output_relpath": "derived/input_output/data/p03394/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03394/OCaml/s493951881.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s493951881", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2 5 63\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let rec gcd a b = if b = 0 then a else gcd b (a mod b) in\n\n    let rec check2 prev i sum =\n        if i > 30000 then true else\n            if (i + sum) mod 2 = 0 &&\n               (i + sum) mod 3 = 0 &&\n               gcd i sum <> 1 then (Printf.printf \"%d %d\\n\" prev i; false)\n            else check2 prev (i + 1) sum\n    in\n\n    let rec check i sum =\n        if i mod 6 = 5 then check (i + 1) sum else\n            if check2 i (i + 1) (sum + i) then check (i + 1) sum\n    in\n\n    let rec loop i acc sum =\n        if acc = n - 2 then check i sum else\n        if i mod 2 = 0 || i mod 3 = 0 then (\n            let () = Printf.printf \"%d \" i in\n            let acc = acc + 1 in\n            let sum = sum + i in\n            loop (i + 1) acc sum\n        ) else loop (i + 1) acc sum\n    in\n    loop 2 0 0\n)", "problem_context": "Score : 600 points\n\nProblem Statement\n\nNagase is a top student in high school. One day, she's analyzing some properties of special sets of positive integers.\n\nShe thinks that a set S = \\{a_{1}, a_{2}, ..., a_{N}\\} of distinct positive integers is called special if for all 1 \\leq i \\leq N, the gcd (greatest common divisor) of a_{i} and the sum of the remaining elements of S is not 1.\n\nNagase wants to find a special set of size N. However, this task is too easy, so she decided to ramp up the difficulty. Nagase challenges you to find a special set of size N such that the gcd of all elements are 1 and the elements of the set does not exceed 30000.\n\nConstraints\n\n3 \\leq N \\leq 20000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nOutput N space-separated integers, denoting the elements of the set S. S must satisfy the following conditions :\n\nThe elements must be distinct positive integers not exceeding 30000.\n\nThe gcd of all elements of S is 1, i.e. there does not exist an integer d > 1 that divides all elements of S.\n\nS is a special set.\n\nIf there are multiple solutions, you may output any of them. The elements of S may be printed in any order. It is guaranteed that at least one solution exist under the given contraints.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2 5 63\n\n\\{2, 5, 63\\} is special because gcd(2, 5 + 63) = 2, gcd(5, 2 + 63) = 5, gcd(63, 2 + 5) = 7. Also, gcd(2, 5, 63) = 1. Thus, this set satisfies all the criteria.\n\nNote that \\{2, 4, 6\\} is not a valid solution because gcd(2, 4, 6) = 2 > 1.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n2 5 20 63\n\n\\{2, 5, 20, 63\\} is special because gcd(2, 5 + 20 + 63) = 2, gcd(5, 2 + 20 + 63) = 5, gcd(20, 2 + 5 + 63) = 10, gcd(63, 2 + 5 + 20) = 9. Also, gcd(2, 5, 20, 63) = 1. Thus, this set satisfies all the criteria.", "sample_input": "3\n"}, "reference_outputs": ["2 5 63\n"], "source_document_id": "p03394", "source_text": "Score : 600 points\n\nProblem Statement\n\nNagase is a top student in high school. One day, she's analyzing some properties of special sets of positive integers.\n\nShe thinks that a set S = \\{a_{1}, a_{2}, ..., a_{N}\\} of distinct positive integers is called special if for all 1 \\leq i \\leq N, the gcd (greatest common divisor) of a_{i} and the sum of the remaining elements of S is not 1.\n\nNagase wants to find a special set of size N. However, this task is too easy, so she decided to ramp up the difficulty. Nagase challenges you to find a special set of size N such that the gcd of all elements are 1 and the elements of the set does not exceed 30000.\n\nConstraints\n\n3 \\leq N \\leq 20000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nOutput N space-separated integers, denoting the elements of the set S. S must satisfy the following conditions :\n\nThe elements must be distinct positive integers not exceeding 30000.\n\nThe gcd of all elements of S is 1, i.e. there does not exist an integer d > 1 that divides all elements of S.\n\nS is a special set.\n\nIf there are multiple solutions, you may output any of them. The elements of S may be printed in any order. It is guaranteed that at least one solution exist under the given contraints.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2 5 63\n\n\\{2, 5, 63\\} is special because gcd(2, 5 + 63) = 2, gcd(5, 2 + 63) = 5, gcd(63, 2 + 5) = 7. Also, gcd(2, 5, 63) = 1. Thus, this set satisfies all the criteria.\n\nNote that \\{2, 4, 6\\} is not a valid solution because gcd(2, 4, 6) = 2 > 1.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n2 5 20 63\n\n\\{2, 5, 20, 63\\} is special because gcd(2, 5 + 20 + 63) = 2, gcd(5, 2 + 20 + 63) = 5, gcd(20, 2 + 5 + 63) = 10, gcd(63, 2 + 5 + 20) = 9. Also, gcd(2, 5, 20, 63) = 1. Thus, this set satisfies all the criteria.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 831, "cpu_time_ms": 6, "memory_kb": 2688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s963285217", "group_id": "codeNet:p03394", "input_text": "module IntSet = Set.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet () = Scanf.scanf \"%d\" @@ function\n  | 3 -> print_endline \"2 5 63\\n\"\n  | 4 -> print_endline \"2 5 20 63\\n\"\n  | 5 -> print_endline \"2 5 20 30 63\\n\"\n  | n ->\n      let s =\n        IntSet.of_list @@\n        Array.to_list @@\n        Array.init n @@ fun i ->\n          i / 4 * 6 + [| 2; 3; 4; 6 |].(i mod 4) in\n      let maximum = IntSet.max_elt s in\n      IntSet.iter (Printf.printf \"%d \")\n        begin match IntSet.fold (fun x y -> (x + y) mod 6) s 0 with\n        | 0 -> s\n        | 2 -> IntSet.add (maximum - maximum mod 6 + 6) @@ IntSet.remove 8 s\n        | 3 -> IntSet.add (maximum - maximum mod 6 + 6) @@ IntSet.remove 9 s\n        | 5 -> IntSet.add (maximum - maximum mod 6 + if maximum mod 6 < 4 then 4 else 10) @@ IntSet.remove 9 s\n        end;\n      print_newline ()", "language": "OCaml", "metadata": {"date": 1536712863, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03394.html", "problem_id": "p03394", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03394/input.txt", "sample_output_relpath": "derived/input_output/data/p03394/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03394/OCaml/s963285217.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s963285217", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2 5 63\n", "input_to_evaluate": "module IntSet = Set.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet () = Scanf.scanf \"%d\" @@ function\n  | 3 -> print_endline \"2 5 63\\n\"\n  | 4 -> print_endline \"2 5 20 63\\n\"\n  | 5 -> print_endline \"2 5 20 30 63\\n\"\n  | n ->\n      let s =\n        IntSet.of_list @@\n        Array.to_list @@\n        Array.init n @@ fun i ->\n          i / 4 * 6 + [| 2; 3; 4; 6 |].(i mod 4) in\n      let maximum = IntSet.max_elt s in\n      IntSet.iter (Printf.printf \"%d \")\n        begin match IntSet.fold (fun x y -> (x + y) mod 6) s 0 with\n        | 0 -> s\n        | 2 -> IntSet.add (maximum - maximum mod 6 + 6) @@ IntSet.remove 8 s\n        | 3 -> IntSet.add (maximum - maximum mod 6 + 6) @@ IntSet.remove 9 s\n        | 5 -> IntSet.add (maximum - maximum mod 6 + if maximum mod 6 < 4 then 4 else 10) @@ IntSet.remove 9 s\n        end;\n      print_newline ()", "problem_context": "Score : 600 points\n\nProblem Statement\n\nNagase is a top student in high school. One day, she's analyzing some properties of special sets of positive integers.\n\nShe thinks that a set S = \\{a_{1}, a_{2}, ..., a_{N}\\} of distinct positive integers is called special if for all 1 \\leq i \\leq N, the gcd (greatest common divisor) of a_{i} and the sum of the remaining elements of S is not 1.\n\nNagase wants to find a special set of size N. However, this task is too easy, so she decided to ramp up the difficulty. Nagase challenges you to find a special set of size N such that the gcd of all elements are 1 and the elements of the set does not exceed 30000.\n\nConstraints\n\n3 \\leq N \\leq 20000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nOutput N space-separated integers, denoting the elements of the set S. S must satisfy the following conditions :\n\nThe elements must be distinct positive integers not exceeding 30000.\n\nThe gcd of all elements of S is 1, i.e. there does not exist an integer d > 1 that divides all elements of S.\n\nS is a special set.\n\nIf there are multiple solutions, you may output any of them. The elements of S may be printed in any order. It is guaranteed that at least one solution exist under the given contraints.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2 5 63\n\n\\{2, 5, 63\\} is special because gcd(2, 5 + 63) = 2, gcd(5, 2 + 63) = 5, gcd(63, 2 + 5) = 7. Also, gcd(2, 5, 63) = 1. Thus, this set satisfies all the criteria.\n\nNote that \\{2, 4, 6\\} is not a valid solution because gcd(2, 4, 6) = 2 > 1.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n2 5 20 63\n\n\\{2, 5, 20, 63\\} is special because gcd(2, 5 + 20 + 63) = 2, gcd(5, 2 + 20 + 63) = 5, gcd(20, 2 + 5 + 63) = 10, gcd(63, 2 + 5 + 20) = 9. Also, gcd(2, 5, 20, 63) = 1. Thus, this set satisfies all the criteria.", "sample_input": "3\n"}, "reference_outputs": ["2 5 63\n"], "source_document_id": "p03394", "source_text": "Score : 600 points\n\nProblem Statement\n\nNagase is a top student in high school. One day, she's analyzing some properties of special sets of positive integers.\n\nShe thinks that a set S = \\{a_{1}, a_{2}, ..., a_{N}\\} of distinct positive integers is called special if for all 1 \\leq i \\leq N, the gcd (greatest common divisor) of a_{i} and the sum of the remaining elements of S is not 1.\n\nNagase wants to find a special set of size N. However, this task is too easy, so she decided to ramp up the difficulty. Nagase challenges you to find a special set of size N such that the gcd of all elements are 1 and the elements of the set does not exceed 30000.\n\nConstraints\n\n3 \\leq N \\leq 20000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nOutput N space-separated integers, denoting the elements of the set S. S must satisfy the following conditions :\n\nThe elements must be distinct positive integers not exceeding 30000.\n\nThe gcd of all elements of S is 1, i.e. there does not exist an integer d > 1 that divides all elements of S.\n\nS is a special set.\n\nIf there are multiple solutions, you may output any of them. The elements of S may be printed in any order. It is guaranteed that at least one solution exist under the given contraints.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2 5 63\n\n\\{2, 5, 63\\} is special because gcd(2, 5 + 63) = 2, gcd(5, 2 + 63) = 5, gcd(63, 2 + 5) = 7. Also, gcd(2, 5, 63) = 1. Thus, this set satisfies all the criteria.\n\nNote that \\{2, 4, 6\\} is not a valid solution because gcd(2, 4, 6) = 2 > 1.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n2 5 20 63\n\n\\{2, 5, 20, 63\\} is special because gcd(2, 5 + 20 + 63) = 2, gcd(5, 2 + 20 + 63) = 5, gcd(20, 2 + 5 + 63) = 10, gcd(63, 2 + 5 + 20) = 9. Also, gcd(2, 5, 20, 63) = 1. Thus, this set satisfies all the criteria.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 851, "cpu_time_ms": 12, "memory_kb": 6016}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s082825617", "group_id": "codeNet:p03400", "input_text": "let () =\n  let rec makelst k x d =\n    if k * x + 1 > d then [] else k * x + 1 :: makelst (k+1) x d in\n  Scanf.scanf \"%d\\n%d %d\\n\" @@ fun n d x ->\n  let arr = Array.init n @@ fun _ -> \n  \tScanf.scanf \"%d\\n\" @@ fun a -> List.length (makelst 0 a d) in\n  let num = Array.fold_left (+) 0 arr in\n  Printf.printf \"%d\\n\" (x+num)", "language": "OCaml", "metadata": {"date": 1600885427, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03400.html", "problem_id": "p03400", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03400/input.txt", "sample_output_relpath": "derived/input_output/data/p03400/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03400/OCaml/s082825617.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s082825617", "user_id": "u307426615"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "let () =\n  let rec makelst k x d =\n    if k * x + 1 > d then [] else k * x + 1 :: makelst (k+1) x d in\n  Scanf.scanf \"%d\\n%d %d\\n\" @@ fun n d x ->\n  let arr = Array.init n @@ fun _ -> \n  \tScanf.scanf \"%d\\n\" @@ fun a -> List.length (makelst 0 a d) in\n  let num = Array.fold_left (+) 0 arr in\n  Printf.printf \"%d\\n\" (x+num)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSome number of chocolate pieces were prepared for a training camp.\nThe camp had N participants and lasted for D days.\nThe i-th participant (1 \\leq i \\leq N) ate one chocolate piece on each of the following days in the camp: the 1-st day, the (A_i + 1)-th day, the (2A_i + 1)-th day, and so on.\nAs a result, there were X chocolate pieces remaining at the end of the camp. During the camp, nobody except the participants ate chocolate pieces.\n\nFind the number of chocolate pieces prepared at the beginning of the camp.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq D \\leq 100\n\n1 \\leq X \\leq 100\n\n1 \\leq A_i \\leq 100 (1 \\leq i \\leq N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD X\nA_1\nA_2\n:\nA_N\n\nOutput\n\nFind the number of chocolate pieces prepared at the beginning of the camp.\n\nSample Input 1\n\n3\n7 1\n2\n5\n10\n\nSample Output 1\n\n8\n\nThe camp has 3 participants and lasts for 7 days.\nEach participant eats chocolate pieces as follows:\n\nThe first participant eats one chocolate piece on Day 1, 3, 5 and 7, for a total of four.\n\nThe second participant eats one chocolate piece on Day 1 and 6, for a total of two.\n\nThe third participant eats one chocolate piece only on Day 1, for a total of one.\n\nSince the number of pieces remaining at the end of the camp is one, the number of pieces prepared at the beginning of the camp is 1 + 4 + 2 + 1 = 8.\n\nSample Input 2\n\n2\n8 20\n1\n10\n\nSample Output 2\n\n29\n\nSample Input 3\n\n5\n30 44\n26\n18\n81\n18\n6\n\nSample Output 3\n\n56", "sample_input": "3\n7 1\n2\n5\n10\n"}, "reference_outputs": ["8\n"], "source_document_id": "p03400", "source_text": "Score : 200 points\n\nProblem Statement\n\nSome number of chocolate pieces were prepared for a training camp.\nThe camp had N participants and lasted for D days.\nThe i-th participant (1 \\leq i \\leq N) ate one chocolate piece on each of the following days in the camp: the 1-st day, the (A_i + 1)-th day, the (2A_i + 1)-th day, and so on.\nAs a result, there were X chocolate pieces remaining at the end of the camp. During the camp, nobody except the participants ate chocolate pieces.\n\nFind the number of chocolate pieces prepared at the beginning of the camp.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq D \\leq 100\n\n1 \\leq X \\leq 100\n\n1 \\leq A_i \\leq 100 (1 \\leq i \\leq N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD X\nA_1\nA_2\n:\nA_N\n\nOutput\n\nFind the number of chocolate pieces prepared at the beginning of the camp.\n\nSample Input 1\n\n3\n7 1\n2\n5\n10\n\nSample Output 1\n\n8\n\nThe camp has 3 participants and lasts for 7 days.\nEach participant eats chocolate pieces as follows:\n\nThe first participant eats one chocolate piece on Day 1, 3, 5 and 7, for a total of four.\n\nThe second participant eats one chocolate piece on Day 1 and 6, for a total of two.\n\nThe third participant eats one chocolate piece only on Day 1, for a total of one.\n\nSince the number of pieces remaining at the end of the camp is one, the number of pieces prepared at the beginning of the camp is 1 + 4 + 2 + 1 = 8.\n\nSample Input 2\n\n2\n8 20\n1\n10\n\nSample Output 2\n\n29\n\nSample Input 3\n\n5\n30 44\n26\n18\n81\n18\n6\n\nSample Output 3\n\n56", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 3848}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s457285684", "group_id": "codeNet:p03401", "input_text": "let () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  let arr = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun a -> a)) in\n  let arr = Array.append arr [|0|] in\n  let a_l = Array.to_list arr in\n\n  let cum f init l =\n    let rec aux prev res = function\n      | [] -> res\n      | hd :: tl -> \n        let acc = f prev hd in\n        aux hd (acc::res) tl\n    in\n    aux init [] l\n  in\n\n  let l = cum (fun x y -> abs (y-x)) 0 a_l in\n  let ans = List.fold_left (+) 0 l in\n\n  let rec aux res = function\n    | [] -> res\n    | hd1 :: hd2 :: hd3 :: tl -> \n      let acc = abs (hd3-hd1) - (abs (hd3-hd2) + abs(hd2-hd1)) in\n      aux (acc::res) (hd2::hd3::tl)\n    | _ -> res\n  in\n\n  let l = aux [] (0::a_l) in\n  let l = List.rev l in\n  List.iter (fun x -> Printf.printf \"%d\\n\" @@ ans+x) l;\n", "language": "OCaml", "metadata": {"date": 1529577849, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03401.html", "problem_id": "p03401", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03401/input.txt", "sample_output_relpath": "derived/input_output/data/p03401/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03401/OCaml/s457285684.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s457285684", "user_id": "u139013163"}, "prompt_components": {"gold_output": "12\n8\n10\n", "input_to_evaluate": "let () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  let arr = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun a -> a)) in\n  let arr = Array.append arr [|0|] in\n  let a_l = Array.to_list arr in\n\n  let cum f init l =\n    let rec aux prev res = function\n      | [] -> res\n      | hd :: tl -> \n        let acc = f prev hd in\n        aux hd (acc::res) tl\n    in\n    aux init [] l\n  in\n\n  let l = cum (fun x y -> abs (y-x)) 0 a_l in\n  let ans = List.fold_left (+) 0 l in\n\n  let rec aux res = function\n    | [] -> res\n    | hd1 :: hd2 :: hd3 :: tl -> \n      let acc = abs (hd3-hd1) - (abs (hd3-hd2) + abs(hd2-hd1)) in\n      aux (acc::res) (hd2::hd3::tl)\n    | _ -> res\n  in\n\n  let l = aux [] (0::a_l) in\n  let l = List.rev l in\n  List.iter (fun x -> Printf.printf \"%d\\n\" @@ ans+x) l;\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N sightseeing spots on the x-axis, numbered 1, 2, ..., N.\nSpot i is at the point with coordinate A_i.\nIt costs |a - b| yen (the currency of Japan) to travel from a point with coordinate a to another point with coordinate b along the axis.\n\nYou planned a trip along the axis.\nIn this plan, you first depart from the point with coordinate 0, then visit the N spots in the order they are numbered, and finally return to the point with coordinate 0.\n\nHowever, something came up just before the trip, and you no longer have enough time to visit all the N spots, so you decided to choose some i and cancel the visit to Spot i.\nYou will visit the remaining spots as planned in the order they are numbered.\nYou will also depart from and return to the point with coordinate 0 at the beginning and the end, as planned.\n\nFor each i = 1, 2, ..., N, find the total cost of travel during the trip when the visit to Spot i is canceled.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-5000 \\leq A_i \\leq 5000 (1 \\leq i \\leq N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint N lines.\nIn the i-th line, print the total cost of travel during the trip when the visit to Spot i is canceled.\n\nSample Input 1\n\n3\n3 5 -1\n\nSample Output 1\n\n12\n8\n10\n\nSpot 1, 2 and 3 are at the points with coordinates 3, 5 and -1, respectively.\nFor each i, the course of the trip and the total cost of travel when the visit to Spot i is canceled, are as follows:\n\nFor i = 1, the course of the trip is 0 \\rightarrow 5 \\rightarrow -1 \\rightarrow 0 and the total cost of travel is 5 + 6 + 1 = 12 yen.\n\nFor i = 2, the course of the trip is 0 \\rightarrow 3 \\rightarrow -1 \\rightarrow 0 and the total cost of travel is 3 + 4 + 1 = 8 yen.\n\nFor i = 3, the course of the trip is 0 \\rightarrow 3 \\rightarrow 5 \\rightarrow 0 and the total cost of travel is 3 + 2 + 5 = 10 yen.\n\nSample Input 2\n\n5\n1 1 1 2 0\n\nSample Output 2\n\n4\n4\n4\n2\n4\n\nSample Input 3\n\n6\n-679 -2409 -3258 3095 -3291 -4462\n\nSample Output 3\n\n21630\n21630\n19932\n8924\n21630\n19288", "sample_input": "3\n3 5 -1\n"}, "reference_outputs": ["12\n8\n10\n"], "source_document_id": "p03401", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N sightseeing spots on the x-axis, numbered 1, 2, ..., N.\nSpot i is at the point with coordinate A_i.\nIt costs |a - b| yen (the currency of Japan) to travel from a point with coordinate a to another point with coordinate b along the axis.\n\nYou planned a trip along the axis.\nIn this plan, you first depart from the point with coordinate 0, then visit the N spots in the order they are numbered, and finally return to the point with coordinate 0.\n\nHowever, something came up just before the trip, and you no longer have enough time to visit all the N spots, so you decided to choose some i and cancel the visit to Spot i.\nYou will visit the remaining spots as planned in the order they are numbered.\nYou will also depart from and return to the point with coordinate 0 at the beginning and the end, as planned.\n\nFor each i = 1, 2, ..., N, find the total cost of travel during the trip when the visit to Spot i is canceled.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-5000 \\leq A_i \\leq 5000 (1 \\leq i \\leq N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint N lines.\nIn the i-th line, print the total cost of travel during the trip when the visit to Spot i is canceled.\n\nSample Input 1\n\n3\n3 5 -1\n\nSample Output 1\n\n12\n8\n10\n\nSpot 1, 2 and 3 are at the points with coordinates 3, 5 and -1, respectively.\nFor each i, the course of the trip and the total cost of travel when the visit to Spot i is canceled, are as follows:\n\nFor i = 1, the course of the trip is 0 \\rightarrow 5 \\rightarrow -1 \\rightarrow 0 and the total cost of travel is 5 + 6 + 1 = 12 yen.\n\nFor i = 2, the course of the trip is 0 \\rightarrow 3 \\rightarrow -1 \\rightarrow 0 and the total cost of travel is 3 + 4 + 1 = 8 yen.\n\nFor i = 3, the course of the trip is 0 \\rightarrow 3 \\rightarrow 5 \\rightarrow 0 and the total cost of travel is 3 + 2 + 5 = 10 yen.\n\nSample Input 2\n\n5\n1 1 1 2 0\n\nSample Output 2\n\n4\n4\n4\n2\n4\n\nSample Input 3\n\n6\n-679 -2409 -3258 3095 -3291 -4462\n\nSample Output 3\n\n21630\n21630\n19932\n8924\n21630\n19288", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 778, "cpu_time_ms": 70, "memory_kb": 9472}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s832077137", "group_id": "codeNet:p03407", "input_text": "let () =\nlet a, b, c = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> a, b, c) in\nPrintf.printf \"%s\\n\" (if a + b >= c then \"Yes\" else \"No\")", "language": "OCaml", "metadata": {"date": 1559783464, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03407.html", "problem_id": "p03407", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03407/input.txt", "sample_output_relpath": "derived/input_output/data/p03407/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03407/OCaml/s832077137.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s832077137", "user_id": "u307426615"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\nlet a, b, c = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> a, b, c) in\nPrintf.printf \"%s\\n\" (if a + b >= c then \"Yes\" else \"No\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAn elementary school student Takahashi has come to a variety store.\n\nHe has two coins, A-yen and B-yen coins (yen is the currency of Japan), and wants to buy a toy that costs C yen. Can he buy it?\n\nNote that he lives in Takahashi Kingdom, and may have coins that do not exist in Japan.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq A, B \\leq 500\n\n1 \\leq C \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf Takahashi can buy the toy, print Yes; if he cannot, print No.\n\nSample Input 1\n\n50 100 120\n\nSample Output 1\n\nYes\n\nHe has 50 + 100 = 150 yen, so he can buy the 120-yen toy.\n\nSample Input 2\n\n500 100 1000\n\nSample Output 2\n\nNo\n\nHe has 500 + 100 = 600 yen, but he cannot buy the 1000-yen toy.\n\nSample Input 3\n\n19 123 143\n\nSample Output 3\n\nNo\n\nThere are 19-yen and 123-yen coins in Takahashi Kingdom, which are rather hard to use.\n\nSample Input 4\n\n19 123 142\n\nSample Output 4\n\nYes", "sample_input": "50 100 120\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03407", "source_text": "Score : 100 points\n\nProblem Statement\n\nAn elementary school student Takahashi has come to a variety store.\n\nHe has two coins, A-yen and B-yen coins (yen is the currency of Japan), and wants to buy a toy that costs C yen. Can he buy it?\n\nNote that he lives in Takahashi Kingdom, and may have coins that do not exist in Japan.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq A, B \\leq 500\n\n1 \\leq C \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf Takahashi can buy the toy, print Yes; if he cannot, print No.\n\nSample Input 1\n\n50 100 120\n\nSample Output 1\n\nYes\n\nHe has 50 + 100 = 150 yen, so he can buy the 120-yen toy.\n\nSample Input 2\n\n500 100 1000\n\nSample Output 2\n\nNo\n\nHe has 500 + 100 = 600 yen, but he cannot buy the 1000-yen toy.\n\nSample Input 3\n\n19 123 143\n\nSample Output 3\n\nNo\n\nThere are 19-yen and 123-yen coins in Takahashi Kingdom, which are rather hard to use.\n\nSample Input 4\n\n19 123 142\n\nSample Output 4\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 131, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s527511316", "group_id": "codeNet:p03407", "input_text": "let () = Scanf.scanf \"%d %d %d\" (fun a b c -> if a + b >= c then \"Yes\" else \"No\") |> print_endline", "language": "OCaml", "metadata": {"date": 1529300481, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03407.html", "problem_id": "p03407", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03407/input.txt", "sample_output_relpath": "derived/input_output/data/p03407/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03407/OCaml/s527511316.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s527511316", "user_id": "u082861376"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" (fun a b c -> if a + b >= c then \"Yes\" else \"No\") |> print_endline", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAn elementary school student Takahashi has come to a variety store.\n\nHe has two coins, A-yen and B-yen coins (yen is the currency of Japan), and wants to buy a toy that costs C yen. Can he buy it?\n\nNote that he lives in Takahashi Kingdom, and may have coins that do not exist in Japan.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq A, B \\leq 500\n\n1 \\leq C \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf Takahashi can buy the toy, print Yes; if he cannot, print No.\n\nSample Input 1\n\n50 100 120\n\nSample Output 1\n\nYes\n\nHe has 50 + 100 = 150 yen, so he can buy the 120-yen toy.\n\nSample Input 2\n\n500 100 1000\n\nSample Output 2\n\nNo\n\nHe has 500 + 100 = 600 yen, but he cannot buy the 1000-yen toy.\n\nSample Input 3\n\n19 123 143\n\nSample Output 3\n\nNo\n\nThere are 19-yen and 123-yen coins in Takahashi Kingdom, which are rather hard to use.\n\nSample Input 4\n\n19 123 142\n\nSample Output 4\n\nYes", "sample_input": "50 100 120\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03407", "source_text": "Score : 100 points\n\nProblem Statement\n\nAn elementary school student Takahashi has come to a variety store.\n\nHe has two coins, A-yen and B-yen coins (yen is the currency of Japan), and wants to buy a toy that costs C yen. Can he buy it?\n\nNote that he lives in Takahashi Kingdom, and may have coins that do not exist in Japan.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq A, B \\leq 500\n\n1 \\leq C \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf Takahashi can buy the toy, print Yes; if he cannot, print No.\n\nSample Input 1\n\n50 100 120\n\nSample Output 1\n\nYes\n\nHe has 50 + 100 = 150 yen, so he can buy the 120-yen toy.\n\nSample Input 2\n\n500 100 1000\n\nSample Output 2\n\nNo\n\nHe has 500 + 100 = 600 yen, but he cannot buy the 1000-yen toy.\n\nSample Input 3\n\n19 123 143\n\nSample Output 3\n\nNo\n\nThere are 19-yen and 123-yen coins in Takahashi Kingdom, which are rather hard to use.\n\nSample Input 4\n\n19 123 142\n\nSample Output 4\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 98, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s380537252", "group_id": "codeNet:p03407", "input_text": "let () =\n  Scanf.scanf \"%d %d %d\" (fun a b c ->\n      if a + b > c then \"Yes\" else \"No\") |> print_endline", "language": "OCaml", "metadata": {"date": 1523165984, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03407.html", "problem_id": "p03407", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03407/input.txt", "sample_output_relpath": "derived/input_output/data/p03407/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03407/OCaml/s380537252.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s380537252", "user_id": "u987869509"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d %d\" (fun a b c ->\n      if a + b > c then \"Yes\" else \"No\") |> print_endline", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAn elementary school student Takahashi has come to a variety store.\n\nHe has two coins, A-yen and B-yen coins (yen is the currency of Japan), and wants to buy a toy that costs C yen. Can he buy it?\n\nNote that he lives in Takahashi Kingdom, and may have coins that do not exist in Japan.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq A, B \\leq 500\n\n1 \\leq C \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf Takahashi can buy the toy, print Yes; if he cannot, print No.\n\nSample Input 1\n\n50 100 120\n\nSample Output 1\n\nYes\n\nHe has 50 + 100 = 150 yen, so he can buy the 120-yen toy.\n\nSample Input 2\n\n500 100 1000\n\nSample Output 2\n\nNo\n\nHe has 500 + 100 = 600 yen, but he cannot buy the 1000-yen toy.\n\nSample Input 3\n\n19 123 143\n\nSample Output 3\n\nNo\n\nThere are 19-yen and 123-yen coins in Takahashi Kingdom, which are rather hard to use.\n\nSample Input 4\n\n19 123 142\n\nSample Output 4\n\nYes", "sample_input": "50 100 120\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03407", "source_text": "Score : 100 points\n\nProblem Statement\n\nAn elementary school student Takahashi has come to a variety store.\n\nHe has two coins, A-yen and B-yen coins (yen is the currency of Japan), and wants to buy a toy that costs C yen. Can he buy it?\n\nNote that he lives in Takahashi Kingdom, and may have coins that do not exist in Japan.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq A, B \\leq 500\n\n1 \\leq C \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf Takahashi can buy the toy, print Yes; if he cannot, print No.\n\nSample Input 1\n\n50 100 120\n\nSample Output 1\n\nYes\n\nHe has 50 + 100 = 150 yen, so he can buy the 120-yen toy.\n\nSample Input 2\n\n500 100 1000\n\nSample Output 2\n\nNo\n\nHe has 500 + 100 = 600 yen, but he cannot buy the 1000-yen toy.\n\nSample Input 3\n\n19 123 143\n\nSample Output 3\n\nNo\n\nThere are 19-yen and 123-yen coins in Takahashi Kingdom, which are rather hard to use.\n\nSample Input 4\n\n19 123 142\n\nSample Output 4\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 105, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s920621693", "group_id": "codeNet:p03409", "input_text": "let rec list_init n f = if n <= 0 then [] else let x = f () in x :: list_init (n-1) f\nlet rec remove x = function [] -> [] | (y::ys') -> if x = y then ys' else y :: remove x ys'\nlet step (acc, zs) (x,y) =\n  match List.filter (fun (a,b) -> a < x && b < y) zs with\n  | []     -> (acc,   zs)\n  | (z::_) -> (acc+1, remove z zs)\nlet () =\n  Scanf.scanf \"%d\" (fun n ->\n  let a = list_init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x, y))\n  |> List.sort (fun (_,b) (_,d) -> d - b) in\n  list_init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x, y))\n  |> List.sort compare |> List.fold_left step (0, a)) |> fst |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1521683434, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03409.html", "problem_id": "p03409", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03409/input.txt", "sample_output_relpath": "derived/input_output/data/p03409/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03409/OCaml/s920621693.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s920621693", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let rec list_init n f = if n <= 0 then [] else let x = f () in x :: list_init (n-1) f\nlet rec remove x = function [] -> [] | (y::ys') -> if x = y then ys' else y :: remove x ys'\nlet step (acc, zs) (x,y) =\n  match List.filter (fun (a,b) -> a < x && b < y) zs with\n  | []     -> (acc,   zs)\n  | (z::_) -> (acc+1, remove z zs)\nlet () =\n  Scanf.scanf \"%d\" (fun n ->\n  let a = list_init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x, y))\n  |> List.sort (fun (_,b) (_,d) -> d - b) in\n  list_init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x, y))\n  |> List.sort compare |> List.fold_left step (0, a)) |> fst |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nOn a two-dimensional plane, there are N red points and N blue points.\nThe coordinates of the i-th red point are (a_i, b_i), and the coordinates of the i-th blue point are (c_i, d_i).\n\nA red point and a blue point can form a friendly pair when, the x-coordinate of the red point is smaller than that of the blue point, and the y-coordinate of the red point is also smaller than that of the blue point.\n\nAt most how many friendly pairs can you form? Note that a point cannot belong to multiple pairs.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 100\n\n0 \\leq a_i, b_i, c_i, d_i < 2N\n\na_1, a_2, ..., a_N, c_1, c_2, ..., c_N are all different.\n\nb_1, b_2, ..., b_N, d_1, d_2, ..., d_N are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\na_2 b_2\n:\na_N b_N\nc_1 d_1\nc_2 d_2\n:\nc_N d_N\n\nOutput\n\nPrint the maximum number of friendly pairs.\n\nSample Input 1\n\n3\n2 0\n3 1\n1 3\n4 2\n0 4\n5 5\n\nSample Output 1\n\n2\n\nFor example, you can pair (2, 0) and (4, 2), then (3, 1) and (5, 5).\n\nSample Input 2\n\n3\n0 0\n1 1\n5 2\n2 3\n3 4\n4 5\n\nSample Output 2\n\n2\n\nFor example, you can pair (0, 0) and (2, 3), then (1, 1) and (3, 4).\n\nSample Input 3\n\n2\n2 2\n3 3\n0 0\n1 1\n\nSample Output 3\n\n0\n\nIt is possible that no pair can be formed.\n\nSample Input 4\n\n5\n0 0\n7 3\n2 2\n4 8\n1 6\n8 5\n6 9\n5 4\n9 1\n3 7\n\nSample Output 4\n\n5\n\nSample Input 5\n\n5\n0 0\n1 1\n5 5\n6 6\n7 7\n2 2\n3 3\n4 4\n8 8\n9 9\n\nSample Output 5\n\n4", "sample_input": "3\n2 0\n3 1\n1 3\n4 2\n0 4\n5 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03409", "source_text": "Score : 400 points\n\nProblem Statement\n\nOn a two-dimensional plane, there are N red points and N blue points.\nThe coordinates of the i-th red point are (a_i, b_i), and the coordinates of the i-th blue point are (c_i, d_i).\n\nA red point and a blue point can form a friendly pair when, the x-coordinate of the red point is smaller than that of the blue point, and the y-coordinate of the red point is also smaller than that of the blue point.\n\nAt most how many friendly pairs can you form? Note that a point cannot belong to multiple pairs.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 100\n\n0 \\leq a_i, b_i, c_i, d_i < 2N\n\na_1, a_2, ..., a_N, c_1, c_2, ..., c_N are all different.\n\nb_1, b_2, ..., b_N, d_1, d_2, ..., d_N are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\na_2 b_2\n:\na_N b_N\nc_1 d_1\nc_2 d_2\n:\nc_N d_N\n\nOutput\n\nPrint the maximum number of friendly pairs.\n\nSample Input 1\n\n3\n2 0\n3 1\n1 3\n4 2\n0 4\n5 5\n\nSample Output 1\n\n2\n\nFor example, you can pair (2, 0) and (4, 2), then (3, 1) and (5, 5).\n\nSample Input 2\n\n3\n0 0\n1 1\n5 2\n2 3\n3 4\n4 5\n\nSample Output 2\n\n2\n\nFor example, you can pair (0, 0) and (2, 3), then (1, 1) and (3, 4).\n\nSample Input 3\n\n2\n2 2\n3 3\n0 0\n1 1\n\nSample Output 3\n\n0\n\nIt is possible that no pair can be formed.\n\nSample Input 4\n\n5\n0 0\n7 3\n2 2\n4 8\n1 6\n8 5\n6 9\n5 4\n9 1\n3 7\n\nSample Output 4\n\n5\n\nSample Input 5\n\n5\n0 0\n1 1\n5 5\n6 6\n7 7\n2 2\n3 3\n4 4\n8 8\n9 9\n\nSample Output 5\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 628, "cpu_time_ms": 1, "memory_kb": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s331550967", "group_id": "codeNet:p03411", "input_text": "let n = Scanf.sscanf (read_line ()) \"%d\" @@ fun n -> n\nlet ab = Array.to_list @@ Array.init n @@ fun _ -> Scanf.sscanf (read_line ()) \"%d %d\" @@ fun a b -> (b, a)\nlet cd = Array.to_list @@ Array.init n @@ fun _ -> Scanf.sscanf (read_line ()) \"%d %d\" @@ fun c d -> (c, d)\n\nlet rec loop ans reds = function\n  | [] -> ans\n  | (c, d) :: bs ->\n      let ts = List.filter (fun (b, a)-> a < c && b < d) reds in\n      if List.length ts > 0 then\n        let red = ts |> List.sort compare |> List.rev |> List.hd in\n        loop (ans + 1) (List.filter ((<>) red) reds) bs\n      else \n        loop ans reds bs\n\nlet () = Printf.printf \"%d\\n\" @@ loop 0 ab (cd |> List.sort compare)", "language": "OCaml", "metadata": {"date": 1593893252, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03411.html", "problem_id": "p03411", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03411/input.txt", "sample_output_relpath": "derived/input_output/data/p03411/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03411/OCaml/s331550967.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s331550967", "user_id": "u811309788"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let n = Scanf.sscanf (read_line ()) \"%d\" @@ fun n -> n\nlet ab = Array.to_list @@ Array.init n @@ fun _ -> Scanf.sscanf (read_line ()) \"%d %d\" @@ fun a b -> (b, a)\nlet cd = Array.to_list @@ Array.init n @@ fun _ -> Scanf.sscanf (read_line ()) \"%d %d\" @@ fun c d -> (c, d)\n\nlet rec loop ans reds = function\n  | [] -> ans\n  | (c, d) :: bs ->\n      let ts = List.filter (fun (b, a)-> a < c && b < d) reds in\n      if List.length ts > 0 then\n        let red = ts |> List.sort compare |> List.rev |> List.hd in\n        loop (ans + 1) (List.filter ((<>) red) reds) bs\n      else \n        loop ans reds bs\n\nlet () = Printf.printf \"%d\\n\" @@ loop 0 ab (cd |> List.sort compare)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nOn a two-dimensional plane, there are N red points and N blue points.\nThe coordinates of the i-th red point are (a_i, b_i), and the coordinates of the i-th blue point are (c_i, d_i).\n\nA red point and a blue point can form a friendly pair when, the x-coordinate of the red point is smaller than that of the blue point, and the y-coordinate of the red point is also smaller than that of the blue point.\n\nAt most how many friendly pairs can you form? Note that a point cannot belong to multiple pairs.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 100\n\n0 \\leq a_i, b_i, c_i, d_i < 2N\n\na_1, a_2, ..., a_N, c_1, c_2, ..., c_N are all different.\n\nb_1, b_2, ..., b_N, d_1, d_2, ..., d_N are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\na_2 b_2\n:\na_N b_N\nc_1 d_1\nc_2 d_2\n:\nc_N d_N\n\nOutput\n\nPrint the maximum number of friendly pairs.\n\nSample Input 1\n\n3\n2 0\n3 1\n1 3\n4 2\n0 4\n5 5\n\nSample Output 1\n\n2\n\nFor example, you can pair (2, 0) and (4, 2), then (3, 1) and (5, 5).\n\nSample Input 2\n\n3\n0 0\n1 1\n5 2\n2 3\n3 4\n4 5\n\nSample Output 2\n\n2\n\nFor example, you can pair (0, 0) and (2, 3), then (1, 1) and (3, 4).\n\nSample Input 3\n\n2\n2 2\n3 3\n0 0\n1 1\n\nSample Output 3\n\n0\n\nIt is possible that no pair can be formed.\n\nSample Input 4\n\n5\n0 0\n7 3\n2 2\n4 8\n1 6\n8 5\n6 9\n5 4\n9 1\n3 7\n\nSample Output 4\n\n5\n\nSample Input 5\n\n5\n0 0\n1 1\n5 5\n6 6\n7 7\n2 2\n3 3\n4 4\n8 8\n9 9\n\nSample Output 5\n\n4", "sample_input": "3\n2 0\n3 1\n1 3\n4 2\n0 4\n5 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03411", "source_text": "Score : 400 points\n\nProblem Statement\n\nOn a two-dimensional plane, there are N red points and N blue points.\nThe coordinates of the i-th red point are (a_i, b_i), and the coordinates of the i-th blue point are (c_i, d_i).\n\nA red point and a blue point can form a friendly pair when, the x-coordinate of the red point is smaller than that of the blue point, and the y-coordinate of the red point is also smaller than that of the blue point.\n\nAt most how many friendly pairs can you form? Note that a point cannot belong to multiple pairs.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 100\n\n0 \\leq a_i, b_i, c_i, d_i < 2N\n\na_1, a_2, ..., a_N, c_1, c_2, ..., c_N are all different.\n\nb_1, b_2, ..., b_N, d_1, d_2, ..., d_N are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\na_2 b_2\n:\na_N b_N\nc_1 d_1\nc_2 d_2\n:\nc_N d_N\n\nOutput\n\nPrint the maximum number of friendly pairs.\n\nSample Input 1\n\n3\n2 0\n3 1\n1 3\n4 2\n0 4\n5 5\n\nSample Output 1\n\n2\n\nFor example, you can pair (2, 0) and (4, 2), then (3, 1) and (5, 5).\n\nSample Input 2\n\n3\n0 0\n1 1\n5 2\n2 3\n3 4\n4 5\n\nSample Output 2\n\n2\n\nFor example, you can pair (0, 0) and (2, 3), then (1, 1) and (3, 4).\n\nSample Input 3\n\n2\n2 2\n3 3\n0 0\n1 1\n\nSample Output 3\n\n0\n\nIt is possible that no pair can be formed.\n\nSample Input 4\n\n5\n0 0\n7 3\n2 2\n4 8\n1 6\n8 5\n6 9\n5 4\n9 1\n3 7\n\nSample Output 4\n\n5\n\nSample Input 5\n\n5\n0 0\n1 1\n5 5\n6 6\n7 7\n2 2\n3 3\n4 4\n8 8\n9 9\n\nSample Output 5\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 667, "cpu_time_ms": 8, "memory_kb": 4472}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s802833943", "group_id": "codeNet:p03415", "input_text": "open Batteries\nopen Char\nlet arr = String.explode (read_line ())\nlet brr = String.explode (read_line ())\nlet crr = String.explode (read_line ())\nlet ans = escaped (List.nth arr 0) ^ escaped (List.nth brr 1) ^ escaped (List.nth crr 2)\nlet () = print_endline ans", "language": "OCaml", "metadata": {"date": 1588433066, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s802833943.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s802833943", "user_id": "u307426615"}, "prompt_components": {"gold_output": "abc\n", "input_to_evaluate": "open Batteries\nopen Char\nlet arr = String.explode (read_line ())\nlet brr = String.explode (read_line ())\nlet crr = String.explode (read_line ())\nlet ans = escaped (List.nth arr 0) ^ escaped (List.nth brr 1) ^ escaped (List.nth crr 2)\nlet () = print_endline ans", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have a 3×3 square grid, where each square contains a lowercase English letters.\nThe letter in the square at the i-th row from the top and j-th column from the left is c_{ij}.\n\nPrint the string of length 3 that can be obtained by concatenating the letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nConstraints\n\nInput consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nc_{11}c_{12}c_{13}\nc_{21}c_{22}c_{23}\nc_{31}c_{32}c_{33}\n\nOutput\n\nPrint the string of length 3 that can be obtained by concatenating the letters on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nSample Input 1\n\nant\nobe\nrec\n\nSample Output 1\n\nabc\n\nThe letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid are a, b and c from top-right to bottom-left. Concatenate these letters and print abc.\n\nSample Input 2\n\nedu\ncat\nion\n\nSample Output 2\n\nean", "sample_input": "ant\nobe\nrec\n"}, "reference_outputs": ["abc\n"], "source_document_id": "p03415", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have a 3×3 square grid, where each square contains a lowercase English letters.\nThe letter in the square at the i-th row from the top and j-th column from the left is c_{ij}.\n\nPrint the string of length 3 that can be obtained by concatenating the letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nConstraints\n\nInput consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nc_{11}c_{12}c_{13}\nc_{21}c_{22}c_{23}\nc_{31}c_{32}c_{33}\n\nOutput\n\nPrint the string of length 3 that can be obtained by concatenating the letters on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nSample Input 1\n\nant\nobe\nrec\n\nSample Output 1\n\nabc\n\nThe letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid are a, b and c from top-right to bottom-left. Concatenate these letters and print abc.\n\nSample Input 2\n\nedu\ncat\nion\n\nSample Output 2\n\nean", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 260, "cpu_time_ms": 2, "memory_kb": 1152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s926813257", "group_id": "codeNet:p03417", "input_text": "let n, m = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet _ = Printf.printf \"%d\\n\" @@ if n * m = 1 then 1 else if n = 1 || m = 1 then n * m - 2 else (n - 2) * (m - 2)", "language": "OCaml", "metadata": {"date": 1569581754, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s926813257.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s926813257", "user_id": "u732304692"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "let n, m = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet _ = Printf.printf \"%d\\n\" @@ if n * m = 1 then 1 else if n = 1 || m = 1 then n * m - 2 else (n - 2) * (m - 2)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with infinitely many rows and columns. In this grid, there is a rectangular region with consecutive N rows and M columns, and a card is placed in each square in this region.\nThe front and back sides of these cards can be distinguished, and initially every card faces up.\n\nWe will perform the following operation once for each square contains a card:\n\nFor each of the following nine squares, flip the card in it if it exists: the target square itself and the eight squares that shares a corner or a side with the target square.\n\nIt can be proved that, whether each card faces up or down after all the operations does not depend on the order the operations are performed.\nFind the number of cards that face down after all the operations.\n\nConstraints\n\n1 \\leq N,M \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of cards that face down after all the operations.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n0\n\nWe will flip every card in any of the four operations. Thus, after all the operations, all cards face up.\n\nSample Input 2\n\n1 7\n\nSample Output 2\n\n5\n\nAfter all the operations, all cards except at both ends face down.\n\nSample Input 3\n\n314 1592\n\nSample Output 3\n\n496080", "sample_input": "2 2\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03417", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with infinitely many rows and columns. In this grid, there is a rectangular region with consecutive N rows and M columns, and a card is placed in each square in this region.\nThe front and back sides of these cards can be distinguished, and initially every card faces up.\n\nWe will perform the following operation once for each square contains a card:\n\nFor each of the following nine squares, flip the card in it if it exists: the target square itself and the eight squares that shares a corner or a side with the target square.\n\nIt can be proved that, whether each card faces up or down after all the operations does not depend on the order the operations are performed.\nFind the number of cards that face down after all the operations.\n\nConstraints\n\n1 \\leq N,M \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of cards that face down after all the operations.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n0\n\nWe will flip every card in any of the four operations. Thus, after all the operations, all cards face up.\n\nSample Input 2\n\n1 7\n\nSample Output 2\n\n5\n\nAfter all the operations, all cards except at both ends face down.\n\nSample Input 3\n\n314 1592\n\nSample Output 3\n\n496080", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 163, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s319241369", "group_id": "codeNet:p03417", "input_text": "let n, m = Scanf.scanf \"%d %d\" (fun x y -> x, y)\nlet () =\n  abs((n * m) - (2 * n) - (2 * m) + 4)\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1521448003, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s319241369.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s319241369", "user_id": "u987869509"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "let n, m = Scanf.scanf \"%d %d\" (fun x y -> x, y)\nlet () =\n  abs((n * m) - (2 * n) - (2 * m) + 4)\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with infinitely many rows and columns. In this grid, there is a rectangular region with consecutive N rows and M columns, and a card is placed in each square in this region.\nThe front and back sides of these cards can be distinguished, and initially every card faces up.\n\nWe will perform the following operation once for each square contains a card:\n\nFor each of the following nine squares, flip the card in it if it exists: the target square itself and the eight squares that shares a corner or a side with the target square.\n\nIt can be proved that, whether each card faces up or down after all the operations does not depend on the order the operations are performed.\nFind the number of cards that face down after all the operations.\n\nConstraints\n\n1 \\leq N,M \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of cards that face down after all the operations.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n0\n\nWe will flip every card in any of the four operations. Thus, after all the operations, all cards face up.\n\nSample Input 2\n\n1 7\n\nSample Output 2\n\n5\n\nAfter all the operations, all cards except at both ends face down.\n\nSample Input 3\n\n314 1592\n\nSample Output 3\n\n496080", "sample_input": "2 2\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03417", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a grid with infinitely many rows and columns. In this grid, there is a rectangular region with consecutive N rows and M columns, and a card is placed in each square in this region.\nThe front and back sides of these cards can be distinguished, and initially every card faces up.\n\nWe will perform the following operation once for each square contains a card:\n\nFor each of the following nine squares, flip the card in it if it exists: the target square itself and the eight squares that shares a corner or a side with the target square.\n\nIt can be proved that, whether each card faces up or down after all the operations does not depend on the order the operations are performed.\nFind the number of cards that face down after all the operations.\n\nConstraints\n\n1 \\leq N,M \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of cards that face down after all the operations.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n0\n\nWe will flip every card in any of the four operations. Thus, after all the operations, all cards face up.\n\nSample Input 2\n\n1 7\n\nSample Output 2\n\n5\n\nAfter all the operations, all cards except at both ends face down.\n\nSample Input 3\n\n314 1592\n\nSample Output 3\n\n496080", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 122, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s053995229", "group_id": "codeNet:p03423", "input_text": "let n = read_int ()\nlet () = print_int (n / 3)", "language": "OCaml", "metadata": {"date": 1588182789, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s053995229.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s053995229", "user_id": "u307426615"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let n = read_int ()\nlet () = print_int (n / 3)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N students in a school.\n\nWe will divide these students into some groups, and in each group they will discuss some themes.\n\nYou think that groups consisting of two or less students cannot have an effective discussion, so you want to have as many groups consisting of three or more students as possible.\n\nDivide the students so that the number of groups consisting of three or more students is maximized.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf you can form at most x groups consisting of three or more students, print x.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n2\n\nFor example, you can form a group of three students and another of five students.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n0\n\nSometimes you cannot form any group consisting of three or more students, regardless of how you divide the students.\n\nSample Input 3\n\n9\n\nSample Output 3\n\n3", "sample_input": "8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03423", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N students in a school.\n\nWe will divide these students into some groups, and in each group they will discuss some themes.\n\nYou think that groups consisting of two or less students cannot have an effective discussion, so you want to have as many groups consisting of three or more students as possible.\n\nDivide the students so that the number of groups consisting of three or more students is maximized.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf you can form at most x groups consisting of three or more students, print x.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n2\n\nFor example, you can form a group of three students and another of five students.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n0\n\nSometimes you cannot form any group consisting of three or more students, regardless of how you divide the students.\n\nSample Input 3\n\n9\n\nSample Output 3\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s786411442", "group_id": "codeNet:p03424", "input_text": "let id x = x\n\ntype v = T | F\n\nlet rec slv = function\n\t| 0 -> T\n\t| n -> if (Scanf.scanf \"%c\" id) = 'Y' then F else slv (n-1)\n\nlet () =\n\tlet n = Scanf.scanf \"%d\\n\" id in\n\tmatch slv n with\n\t| F -> print_string \"Four\"\n\t| T -> print_string \"Three\"\n", "language": "OCaml", "metadata": {"date": 1520752701, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s786411442.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s786411442", "user_id": "u604818425"}, "prompt_components": {"gold_output": "Four\n", "input_to_evaluate": "let id x = x\n\ntype v = T | F\n\nlet rec slv = function\n\t| 0 -> T\n\t| n -> if (Scanf.scanf \"%c\" id) = 'Y' then F else slv (n-1)\n\nlet () =\n\tlet n = Scanf.scanf \"%d\\n\" id in\n\tmatch slv n with\n\t| F -> print_string \"Four\"\n\t| T -> print_string \"Three\"\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "sample_input": "6\nG W Y P Y W\n"}, "reference_outputs": ["Four\n"], "source_document_id": "p03424", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 243, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s828700506", "group_id": "codeNet:p03424", "input_text": "let () =\n  let chk = Array.make 4 0 in\n  Scanf.scanf \"%d\" (fun n -> Array.init n (fun _ -> Scanf.scanf \" %c\" (String.index \"PWGY\")))\n  |> Array.iter (fun x -> chk.(x) <- 1);\n  Array.fold_left (+) 0 chk |> (fun x -> if x = 3 then \"Three\" else \"Four\")\n  |> print_endline", "language": "OCaml", "metadata": {"date": 1520219046, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s828700506.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s828700506", "user_id": "u798181098"}, "prompt_components": {"gold_output": "Four\n", "input_to_evaluate": "let () =\n  let chk = Array.make 4 0 in\n  Scanf.scanf \"%d\" (fun n -> Array.init n (fun _ -> Scanf.scanf \" %c\" (String.index \"PWGY\")))\n  |> Array.iter (fun x -> chk.(x) <- 1);\n  Array.fold_left (+) 0 chk |> (fun x -> if x = 3 then \"Three\" else \"Four\")\n  |> print_endline", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "sample_input": "6\nG W Y P Y W\n"}, "reference_outputs": ["Four\n"], "source_document_id": "p03424", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 268, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s064731863", "group_id": "codeNet:p03424", "input_text": "\nopen Scanf\nopen Printf\n\nlet flip f x y = f y x\n\nlet rec range a b = if a >= b then [] else a :: range (a+1) b\n\nlet read_int () = scanf \" %d\" (fun x -> x)\nlet rec read_ints n = if n = 0 then [] else let i = read_int () in i :: read_ints (n-1)\n\nlet rec for_iter a b f = if a >= b then [] else let x = f a in x :: for_iter (a+1) b f\nlet rec for_iter_ a b f = if a >= b then () else (f a; for_iter_ (a+1) b f)\n\nlet list_of_string str = range 0 (String.length str) |> List.map (fun i -> str.[i])\nlet array_of_string str = Array.init (String.length str) (fun i -> str.[i])\n\nlet z c = if c = 'P' then 0 else if c = 'W' then 1 else if c = 'G' then 2 else 3\n\nlet () =\n  let chk = Array.make 4 0 in\n  scanf \"%d\" (fun n -> Array.init n (fun _ -> scanf \" %c\" z))\n  |> Array.iter (fun x -> chk.(x) <- 1);\n  Array.fold_left (+) 0 chk |> (fun x -> if x <= 3 then \"Three\" else \"Four\")\n  |> print_endline\n\n", "language": "OCaml", "metadata": {"date": 1520215425, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s064731863.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s064731863", "user_id": "u798181098"}, "prompt_components": {"gold_output": "Four\n", "input_to_evaluate": "\nopen Scanf\nopen Printf\n\nlet flip f x y = f y x\n\nlet rec range a b = if a >= b then [] else a :: range (a+1) b\n\nlet read_int () = scanf \" %d\" (fun x -> x)\nlet rec read_ints n = if n = 0 then [] else let i = read_int () in i :: read_ints (n-1)\n\nlet rec for_iter a b f = if a >= b then [] else let x = f a in x :: for_iter (a+1) b f\nlet rec for_iter_ a b f = if a >= b then () else (f a; for_iter_ (a+1) b f)\n\nlet list_of_string str = range 0 (String.length str) |> List.map (fun i -> str.[i])\nlet array_of_string str = Array.init (String.length str) (fun i -> str.[i])\n\nlet z c = if c = 'P' then 0 else if c = 'W' then 1 else if c = 'G' then 2 else 3\n\nlet () =\n  let chk = Array.make 4 0 in\n  scanf \"%d\" (fun n -> Array.init n (fun _ -> scanf \" %c\" z))\n  |> Array.iter (fun x -> chk.(x) <- 1);\n  Array.fold_left (+) 0 chk |> (fun x -> if x <= 3 then \"Three\" else \"Four\")\n  |> print_endline\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "sample_input": "6\nG W Y P Y W\n"}, "reference_outputs": ["Four\n"], "source_document_id": "p03424", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 890, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s739397015", "group_id": "codeNet:p03426", "input_text": "let h, w, d, ps, ts = Array.(Scanf.scanf \"%d %d %d\" @@ fun h w d -> h, w, d, make (h * w) (0, 0), make (h * w) 0)\nlet lrs = Scanf.(for i = 0 to h - 1 do for j = 0 to w - 1 do ps.(scanf \" %d\" pred) <- i, j done done; scanf \" %d\" @@ fun q -> Array.init q @@ fun _ -> scanf \" %d %d\" @@ fun a b -> a - 1, b - 1)\nlet f a b = let (i, j), (k, l) = ps.(a), ps.(b) in abs (i - k) + abs (j - l)\nlet _ = for i = d to h * w - 1 do ts.(i) <- ts.(i - d) + f (i - d) i done; Array.iter (fun (l, r) -> Printf.printf \"%d\\n\" @@ ts.(r) - ts.(l)) lrs", "language": "OCaml", "metadata": {"date": 1581226616, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03426.html", "problem_id": "p03426", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03426/input.txt", "sample_output_relpath": "derived/input_output/data/p03426/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03426/OCaml/s739397015.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s739397015", "user_id": "u732304692"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let h, w, d, ps, ts = Array.(Scanf.scanf \"%d %d %d\" @@ fun h w d -> h, w, d, make (h * w) (0, 0), make (h * w) 0)\nlet lrs = Scanf.(for i = 0 to h - 1 do for j = 0 to w - 1 do ps.(scanf \" %d\" pred) <- i, j done done; scanf \" %d\" @@ fun q -> Array.init q @@ fun _ -> scanf \" %d %d\" @@ fun a b -> a - 1, b - 1)\nlet f a b = let (i, j), (k, l) = ps.(a), ps.(b) in abs (i - k) + abs (j - l)\nlet _ = for i = d to h * w - 1 do ts.(i) <- ts.(i - d) + f (i - d) i done; Array.iter (fun (l, r) -> Printf.printf \"%d\\n\" @@ ts.(r) - ts.(l)) lrs", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns. The square at the i-th row and the j-th column will be called Square (i,j).\n\nThe integers from 1 through H×W are written throughout the grid, and the integer written in Square (i,j) is A_{i,j}.\n\nYou, a magical girl, can teleport a piece placed on Square (i,j) to Square (x,y) by consuming |x-i|+|y-j| magic points.\n\nYou now have to take Q practical tests of your ability as a magical girl.\n\nThe i-th test will be conducted as follows:\n\nInitially, a piece is placed on the square where the integer L_i is written.\n\nLet x be the integer written in the square occupied by the piece. Repeatedly move the piece to the square where the integer x+D is written, as long as x is not R_i. The test ends when x=R_i.\n\nHere, it is guaranteed that R_i-L_i is a multiple of D.\n\nFor each test, find the sum of magic points consumed during that test.\n\nConstraints\n\n1 \\leq H,W \\leq 300\n\n1 \\leq D \\leq H×W\n\n1 \\leq A_{i,j} \\leq H×W\n\nA_{i,j} \\neq A_{x,y} ((i,j) \\neq (x,y))\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq H×W\n\n(R_i-L_i) is a multiple of D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W D\nA_{1,1} A_{1,2} ... A_{1,W}\n:\nA_{H,1} A_{H,2} ... A_{H,W}\nQ\nL_1 R_1\n:\nL_Q R_Q\n\nOutput\n\nFor each test, print the sum of magic points consumed during that test.\n\nOutput should be in the order the tests are conducted.\n\nSample Input 1\n\n3 3 2\n1 4 3\n2 5 7\n8 9 6\n1\n4 8\n\nSample Output 1\n\n5\n\n4 is written in Square (1,2).\n\n6 is written in Square (3,3).\n\n8 is written in Square (3,1).\n\nThus, the sum of magic points consumed during the first test is (|3-1|+|3-2|)+(|3-3|+|1-3|)=5.\n\nSample Input 2\n\n4 2 3\n3 7\n1 4\n5 2\n6 8\n2\n2 2\n2 2\n\nSample Output 2\n\n0\n0\n\nNote that there may be a test where the piece is not moved at all, and there may be multiple identical tests.\n\nSample Input 3\n\n5 5 4\n13 25 7 15 17\n16 22 20 2 9\n14 11 12 1 19\n10 6 23 8 18\n3 21 5 24 4\n3\n13 13\n2 10\n13 13\n\nSample Output 3\n\n0\n5\n0", "sample_input": "3 3 2\n1 4 3\n2 5 7\n8 9 6\n1\n4 8\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03426", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns. The square at the i-th row and the j-th column will be called Square (i,j).\n\nThe integers from 1 through H×W are written throughout the grid, and the integer written in Square (i,j) is A_{i,j}.\n\nYou, a magical girl, can teleport a piece placed on Square (i,j) to Square (x,y) by consuming |x-i|+|y-j| magic points.\n\nYou now have to take Q practical tests of your ability as a magical girl.\n\nThe i-th test will be conducted as follows:\n\nInitially, a piece is placed on the square where the integer L_i is written.\n\nLet x be the integer written in the square occupied by the piece. Repeatedly move the piece to the square where the integer x+D is written, as long as x is not R_i. The test ends when x=R_i.\n\nHere, it is guaranteed that R_i-L_i is a multiple of D.\n\nFor each test, find the sum of magic points consumed during that test.\n\nConstraints\n\n1 \\leq H,W \\leq 300\n\n1 \\leq D \\leq H×W\n\n1 \\leq A_{i,j} \\leq H×W\n\nA_{i,j} \\neq A_{x,y} ((i,j) \\neq (x,y))\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq H×W\n\n(R_i-L_i) is a multiple of D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W D\nA_{1,1} A_{1,2} ... A_{1,W}\n:\nA_{H,1} A_{H,2} ... A_{H,W}\nQ\nL_1 R_1\n:\nL_Q R_Q\n\nOutput\n\nFor each test, print the sum of magic points consumed during that test.\n\nOutput should be in the order the tests are conducted.\n\nSample Input 1\n\n3 3 2\n1 4 3\n2 5 7\n8 9 6\n1\n4 8\n\nSample Output 1\n\n5\n\n4 is written in Square (1,2).\n\n6 is written in Square (3,3).\n\n8 is written in Square (3,1).\n\nThus, the sum of magic points consumed during the first test is (|3-1|+|3-2|)+(|3-3|+|1-3|)=5.\n\nSample Input 2\n\n4 2 3\n3 7\n1 4\n5 2\n6 8\n2\n2 2\n2 2\n\nSample Output 2\n\n0\n0\n\nNote that there may be a test where the piece is not moved at all, and there may be multiple identical tests.\n\nSample Input 3\n\n5 5 4\n13 25 7 15 17\n16 22 20 2 9\n14 11 12 1 19\n10 6 23 8 18\n3 21 5 24 4\n3\n13 13\n2 10\n13 13\n\nSample Output 3\n\n0\n5\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 530, "cpu_time_ms": 110, "memory_kb": 10880}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s002156669", "group_id": "codeNet:p03427", "input_text": "Printf.printf \"%d\\n\" @@ Scanf.scanf \"%s\" @@ fun s ->\n  (int_of_char s.[0] - 49) + (9 * (String.length s - 1))", "language": "OCaml", "metadata": {"date": 1534487004, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s002156669.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s002156669", "user_id": "u798181098"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "Printf.printf \"%d\\n\" @@ Scanf.scanf \"%s\" @@ fun s ->\n  (int_of_char s.[0] - 49) + (9 * (String.length s - 1))", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s357856848", "group_id": "codeNet:p03428", "input_text": "let init = function\n  | [] -> raise (Failure \"init\")\n  | x :: xs ->\n      List.rev @@\n      fst @@\n      List.fold_left (fun (tr, x) y -> (x :: tr, y)) ([], x) xs\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let xys = Array.init n @@ fun i ->\n    Scanf.scanf \"%d %d\\n\" @@ fun x y -> x, y, i in\n  Array.sort compare xys;\n  let rec drop_until_ccw x y = function\n    | ([] | [_]) as stack -> stack\n    | ((x1, y1, _) :: (((x2, y2, _) :: _) as rest)) as stack ->\n        if 0 < (x1 - x2) * (y - y1) - (y1 - y2) * (x - x1)\n        then stack\n        else drop_until_ccw x y rest in\n  let convex =\n    Array.of_list @@\n    init @@\n    let h, t =\n      match\n        Array.fold_left (fun stack (x, y, i) ->\n          (x, y, i) :: drop_until_ccw x y stack) [] xys\n      with\n      | [] -> [], []\n      | h :: t -> [h], t in\n    Array.fold_right (fun (x, y, i) stack ->\n      (x, y, i) :: drop_until_ccw x y stack) (Array.sub xys 0 (n - 1)) h @ t in\n  let ps = Array.make n 0. in\n  for i = 0 to Array.length convex - 1 do\n    let (x1, y1, _) = convex.(i) in\n    let (x2, y2, j) = convex.((i + 1) mod Array.length convex) in\n    let (x3, y3, _) = convex.((i + 2) mod Array.length convex) in\n    ps.(j) <-\n      0.5 -. acos\n        (float_of_int ((x1 - x2) * (x3 - x2) + (y1 - y2) * (y3 - y2)) /.\n         sqrt\n           ((float_of_int (x1 - x2) ** 2. +. float_of_int (y1 - y2) ** 2.) *.\n            (float_of_int (x3 - x2) ** 2. +. float_of_int (y3 - y2) ** 2.)))\n      /. (8. *. atan 1.)\n  done;\n  Array.iter (Printf.printf \"%.20f\\n\") ps\n", "language": "OCaml", "metadata": {"date": 1537335445, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03428.html", "problem_id": "p03428", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03428/input.txt", "sample_output_relpath": "derived/input_output/data/p03428/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03428/OCaml/s357856848.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s357856848", "user_id": "u504158101"}, "prompt_components": {"gold_output": "0.5\n0.5\n", "input_to_evaluate": "let init = function\n  | [] -> raise (Failure \"init\")\n  | x :: xs ->\n      List.rev @@\n      fst @@\n      List.fold_left (fun (tr, x) y -> (x :: tr, y)) ([], x) xs\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let xys = Array.init n @@ fun i ->\n    Scanf.scanf \"%d %d\\n\" @@ fun x y -> x, y, i in\n  Array.sort compare xys;\n  let rec drop_until_ccw x y = function\n    | ([] | [_]) as stack -> stack\n    | ((x1, y1, _) :: (((x2, y2, _) :: _) as rest)) as stack ->\n        if 0 < (x1 - x2) * (y - y1) - (y1 - y2) * (x - x1)\n        then stack\n        else drop_until_ccw x y rest in\n  let convex =\n    Array.of_list @@\n    init @@\n    let h, t =\n      match\n        Array.fold_left (fun stack (x, y, i) ->\n          (x, y, i) :: drop_until_ccw x y stack) [] xys\n      with\n      | [] -> [], []\n      | h :: t -> [h], t in\n    Array.fold_right (fun (x, y, i) stack ->\n      (x, y, i) :: drop_until_ccw x y stack) (Array.sub xys 0 (n - 1)) h @ t in\n  let ps = Array.make n 0. in\n  for i = 0 to Array.length convex - 1 do\n    let (x1, y1, _) = convex.(i) in\n    let (x2, y2, j) = convex.((i + 1) mod Array.length convex) in\n    let (x3, y3, _) = convex.((i + 2) mod Array.length convex) in\n    ps.(j) <-\n      0.5 -. acos\n        (float_of_int ((x1 - x2) * (x3 - x2) + (y1 - y2) * (y3 - y2)) /.\n         sqrt\n           ((float_of_int (x1 - x2) ** 2. +. float_of_int (y1 - y2) ** 2.) *.\n            (float_of_int (x3 - x2) ** 2. +. float_of_int (y3 - y2) ** 2.)))\n      /. (8. *. atan 1.)\n  done;\n  Array.iter (Printf.printf \"%.20f\\n\") ps\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere are N holes in a two-dimensional plane. The coordinates of the i-th hole are (x_i,y_i).\n\nLet R=10^{10^{10^{10}}}. Ringo performs the following operation:\n\nRandomly choose a point from the interior of a circle of radius R centered at the origin, and put Snuke there. Snuke will move to the hole with the smallest Euclidean distance from the point, and fall into that hole. If there are multiple such holes, the hole with the smallest index will be chosen.\n\nFor every i (1 \\leq i \\leq N), find the probability that Snuke falls into the i-th hole.\n\nHere, the operation of randomly choosing a point from the interior of a circle of radius R is defined as follows:\n\nPick two real numbers x and y independently according to uniform distribution on [-R,R].\n\nIf x^2+y^2\\leq R^2, the point (x,y) is chosen. Otherwise, repeat picking the real numbers x,y until the condition is met.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n|x_i|,|y_i| \\leq 10^6(1\\leq i\\leq N)\n\nAll given points are pairwise distinct.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint N real numbers. The i-th real number must represent the probability that Snuke falls into the i-th hole.\n\nThe output will be judged correct when, for all output values, the absolute or relative error is at most 10^{-5}.\n\nSample Input 1\n\n2\n0 0\n1 1\n\nSample Output 1\n\n0.5\n0.5\n\nIf Ringo put Snuke in the region x+y\\leq 1, Snuke will fall into the first hole. The probability of this happening is very close to 0.5.\nOtherwise, Snuke will fall into the second hole, the probability of which happening is also very close to 0.5.\n\nSample Input 2\n\n5\n0 0\n2 8\n4 5\n2 6\n3 10\n\nSample Output 2\n\n0.43160120892732328768\n0.03480224363653196956\n0.13880483535586193855\n0.00000000000000000000\n0.39479171208028279727", "sample_input": "2\n0 0\n1 1\n"}, "reference_outputs": ["0.5\n0.5\n"], "source_document_id": "p03428", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere are N holes in a two-dimensional plane. The coordinates of the i-th hole are (x_i,y_i).\n\nLet R=10^{10^{10^{10}}}. Ringo performs the following operation:\n\nRandomly choose a point from the interior of a circle of radius R centered at the origin, and put Snuke there. Snuke will move to the hole with the smallest Euclidean distance from the point, and fall into that hole. If there are multiple such holes, the hole with the smallest index will be chosen.\n\nFor every i (1 \\leq i \\leq N), find the probability that Snuke falls into the i-th hole.\n\nHere, the operation of randomly choosing a point from the interior of a circle of radius R is defined as follows:\n\nPick two real numbers x and y independently according to uniform distribution on [-R,R].\n\nIf x^2+y^2\\leq R^2, the point (x,y) is chosen. Otherwise, repeat picking the real numbers x,y until the condition is met.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n|x_i|,|y_i| \\leq 10^6(1\\leq i\\leq N)\n\nAll given points are pairwise distinct.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint N real numbers. The i-th real number must represent the probability that Snuke falls into the i-th hole.\n\nThe output will be judged correct when, for all output values, the absolute or relative error is at most 10^{-5}.\n\nSample Input 1\n\n2\n0 0\n1 1\n\nSample Output 1\n\n0.5\n0.5\n\nIf Ringo put Snuke in the region x+y\\leq 1, Snuke will fall into the first hole. The probability of this happening is very close to 0.5.\nOtherwise, Snuke will fall into the second hole, the probability of which happening is also very close to 0.5.\n\nSample Input 2\n\n5\n0 0\n2 8\n4 5\n2 6\n3 10\n\nSample Output 2\n\n0.43160120892732328768\n0.03480224363653196956\n0.13880483535586193855\n0.00000000000000000000\n0.39479171208028279727", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1528, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s560069548", "group_id": "codeNet:p03428", "input_text": "let pi x = 2.0 *. acos 0.0 *. x\nlet () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let a = Array.init n (fun i -> Scanf.scanf \" %f %f\" (fun x y -> i,x,y)) in\n  Array.init n (fun i ->\n    let _, x, y = a.(i) in\n    let f o pr = Array.fold_left (fun (l, u) (j, x', y') ->\n      if i = j then l, u else\n      let rad = mod_float (o +. pi 1.0 +. atan2 (y' -. y) (x' -. x)) (pi 2.0) in\n      max l (rad -. pi 0.5), min u (rad +. pi 0.5)\n    ) pr a in\n    let l0, u0 = f 0.0 (pi 0.5, pi 1.5) in\n    let l1, u1 = f (pi 1.0) (pi 0.5, pi 1.5) in\n    ( max 0.0 (u0-.l0) +. max 0.0 (u1-.l1) ) /. pi 2.0\n  ) |> Array.iter (Printf.printf \"%.10f\\n\")\n", "language": "OCaml", "metadata": {"date": 1535095207, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03428.html", "problem_id": "p03428", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03428/input.txt", "sample_output_relpath": "derived/input_output/data/p03428/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03428/OCaml/s560069548.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s560069548", "user_id": "u798181098"}, "prompt_components": {"gold_output": "0.5\n0.5\n", "input_to_evaluate": "let pi x = 2.0 *. acos 0.0 *. x\nlet () =\n  Scanf.scanf \"%d\" @@ fun n ->\n  let a = Array.init n (fun i -> Scanf.scanf \" %f %f\" (fun x y -> i,x,y)) in\n  Array.init n (fun i ->\n    let _, x, y = a.(i) in\n    let f o pr = Array.fold_left (fun (l, u) (j, x', y') ->\n      if i = j then l, u else\n      let rad = mod_float (o +. pi 1.0 +. atan2 (y' -. y) (x' -. x)) (pi 2.0) in\n      max l (rad -. pi 0.5), min u (rad +. pi 0.5)\n    ) pr a in\n    let l0, u0 = f 0.0 (pi 0.5, pi 1.5) in\n    let l1, u1 = f (pi 1.0) (pi 0.5, pi 1.5) in\n    ( max 0.0 (u0-.l0) +. max 0.0 (u1-.l1) ) /. pi 2.0\n  ) |> Array.iter (Printf.printf \"%.10f\\n\")\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere are N holes in a two-dimensional plane. The coordinates of the i-th hole are (x_i,y_i).\n\nLet R=10^{10^{10^{10}}}. Ringo performs the following operation:\n\nRandomly choose a point from the interior of a circle of radius R centered at the origin, and put Snuke there. Snuke will move to the hole with the smallest Euclidean distance from the point, and fall into that hole. If there are multiple such holes, the hole with the smallest index will be chosen.\n\nFor every i (1 \\leq i \\leq N), find the probability that Snuke falls into the i-th hole.\n\nHere, the operation of randomly choosing a point from the interior of a circle of radius R is defined as follows:\n\nPick two real numbers x and y independently according to uniform distribution on [-R,R].\n\nIf x^2+y^2\\leq R^2, the point (x,y) is chosen. Otherwise, repeat picking the real numbers x,y until the condition is met.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n|x_i|,|y_i| \\leq 10^6(1\\leq i\\leq N)\n\nAll given points are pairwise distinct.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint N real numbers. The i-th real number must represent the probability that Snuke falls into the i-th hole.\n\nThe output will be judged correct when, for all output values, the absolute or relative error is at most 10^{-5}.\n\nSample Input 1\n\n2\n0 0\n1 1\n\nSample Output 1\n\n0.5\n0.5\n\nIf Ringo put Snuke in the region x+y\\leq 1, Snuke will fall into the first hole. The probability of this happening is very close to 0.5.\nOtherwise, Snuke will fall into the second hole, the probability of which happening is also very close to 0.5.\n\nSample Input 2\n\n5\n0 0\n2 8\n4 5\n2 6\n3 10\n\nSample Output 2\n\n0.43160120892732328768\n0.03480224363653196956\n0.13880483535586193855\n0.00000000000000000000\n0.39479171208028279727", "sample_input": "2\n0 0\n1 1\n"}, "reference_outputs": ["0.5\n0.5\n"], "source_document_id": "p03428", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere are N holes in a two-dimensional plane. The coordinates of the i-th hole are (x_i,y_i).\n\nLet R=10^{10^{10^{10}}}. Ringo performs the following operation:\n\nRandomly choose a point from the interior of a circle of radius R centered at the origin, and put Snuke there. Snuke will move to the hole with the smallest Euclidean distance from the point, and fall into that hole. If there are multiple such holes, the hole with the smallest index will be chosen.\n\nFor every i (1 \\leq i \\leq N), find the probability that Snuke falls into the i-th hole.\n\nHere, the operation of randomly choosing a point from the interior of a circle of radius R is defined as follows:\n\nPick two real numbers x and y independently according to uniform distribution on [-R,R].\n\nIf x^2+y^2\\leq R^2, the point (x,y) is chosen. Otherwise, repeat picking the real numbers x,y until the condition is met.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n|x_i|,|y_i| \\leq 10^6(1\\leq i\\leq N)\n\nAll given points are pairwise distinct.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\n:\nx_N y_N\n\nOutput\n\nPrint N real numbers. The i-th real number must represent the probability that Snuke falls into the i-th hole.\n\nThe output will be judged correct when, for all output values, the absolute or relative error is at most 10^{-5}.\n\nSample Input 1\n\n2\n0 0\n1 1\n\nSample Output 1\n\n0.5\n0.5\n\nIf Ringo put Snuke in the region x+y\\leq 1, Snuke will fall into the first hole. The probability of this happening is very close to 0.5.\nOtherwise, Snuke will fall into the second hole, the probability of which happening is also very close to 0.5.\n\nSample Input 2\n\n5\n0 0\n2 8\n4 5\n2 6\n3 10\n\nSample Output 2\n\n0.43160120892732328768\n0.03480224363653196956\n0.13880483535586193855\n0.00000000000000000000\n0.39479171208028279727", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 2816}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s096781974", "group_id": "codeNet:p03433", "input_text": "open Scanf\nopen Printf\n\nlet coin n a = if n mod 500 <= a then \"Yes\" else \"No\"\n\nlet a, n = (read_int (), read_int ())\nlet () = printf \"%s\\n\" @@ coin n a\n", "language": "OCaml", "metadata": {"date": 1595900631, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s096781974.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s096781974", "user_id": "u272377260"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet coin n a = if n mod 500 <= a then \"Yes\" else \"No\"\n\nlet a, n = (read_int (), read_int ())\nlet () = printf \"%s\\n\" @@ coin n a\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 152, "cpu_time_ms": 6, "memory_kb": 3604}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s184093333", "group_id": "codeNet:p03433", "input_text": "let n = read_int ()\nlet a = read_int ()\n \nlet result = if a >= (n mod 500) then \"Yes\" else \"No\"\n \nlet () = print_string result", "language": "OCaml", "metadata": {"date": 1581224609, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s184093333.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s184093333", "user_id": "u818201294"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let n = read_int ()\nlet a = read_int ()\n \nlet result = if a >= (n mod 500) then \"Yes\" else \"No\"\n \nlet () = print_string result", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 126, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s256248131", "group_id": "codeNet:p03433", "input_text": "let solve n a = if n mod 500 <= a then \"Yes\" else \"No\"\n\nlet _ =\n  let n = read_int () in\n  let a = read_int () in\n  solve n a |> print_endline", "language": "OCaml", "metadata": {"date": 1557160155, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s256248131.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s256248131", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let solve n a = if n mod 500 <= a then \"Yes\" else \"No\"\n\nlet _ =\n  let n = read_int () in\n  let a = read_int () in\n  solve n a |> print_endline", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s658282317", "group_id": "codeNet:p03433", "input_text": "(*ABC 088 A *)\nlet () =\n  Scanf.scanf \"%d\" (fun n ->\n      Scanf.scanf \" %d\" (fun a ->\n          match n mod 500 <= a with true -> \"Yes\" | false -> \"No\" )\n      |> print_endline )\n", "language": "OCaml", "metadata": {"date": 1550712526, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s658282317.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s658282317", "user_id": "u406828576"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(*ABC 088 A *)\nlet () =\n  Scanf.scanf \"%d\" (fun n ->\n      Scanf.scanf \" %d\" (fun a ->\n          match n mod 500 <= a with true -> \"Yes\" | false -> \"No\" )\n      |> print_endline )\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 180, "cpu_time_ms": 2, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s881865670", "group_id": "codeNet:p03433", "input_text": "let () = Scanf.scanf \"%d %d\" (fun n a -> if n mod 500 <= a then \"Yes\" else \"No\") |> print_endline\n", "language": "OCaml", "metadata": {"date": 1519667649, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s881865670.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s881865670", "user_id": "u798181098"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\" (fun n a -> if n mod 500 <= a then \"Yes\" else \"No\") |> print_endline\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 98, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s584535874", "group_id": "codeNet:p03433", "input_text": "\nopen Scanf\nopen Printf\n\nlet read_int () = scanf \"%d\\n\" (fun x -> x)\n\nlet () =\n  let n = read_int ()\n  and a = read_int () in\n  printf (if n mod 500 <= a then \"Yes\\n\" else \"No\\n\")\n", "language": "OCaml", "metadata": {"date": 1519007067, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s584535874.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s584535874", "user_id": "u798181098"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "\nopen Scanf\nopen Printf\n\nlet read_int () = scanf \"%d\\n\" (fun x -> x)\n\nlet () =\n  let n = read_int ()\n  and a = read_int () in\n  printf (if n mod 500 <= a then \"Yes\\n\" else \"No\\n\")\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s213722560", "group_id": "codeNet:p03435", "input_text": "let read_int_list () =\n\tread_line ()\n\t|> Str.split (Str.regexp \" \")\n\t|> List.map int_of_string\n\nlet is_const_list l =\n\tmatch l with\n\t\t| [] -> false\n\t\t| e :: es -> List.for_all ((=) e) es\n\nlet diff l1 l2 = List.map2 (-) l1 l2\n\nlet () =\n\tlet row1 = read_int_list () in\n\tlet row2 = read_int_list () in\n\tlet row3 = read_int_list () in\n\tif is_const_list (diff row1 row2) && is_const_list (diff row2 row3) then\n\t\tprint_endline \"Yes\"\n\telse\n\t\tprint_endline \"No\"\n", "language": "OCaml", "metadata": {"date": 1519417708, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s213722560.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s213722560", "user_id": "u420267469"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let read_int_list () =\n\tread_line ()\n\t|> Str.split (Str.regexp \" \")\n\t|> List.map int_of_string\n\nlet is_const_list l =\n\tmatch l with\n\t\t| [] -> false\n\t\t| e :: es -> List.for_all ((=) e) es\n\nlet diff l1 l2 = List.map2 (-) l1 l2\n\nlet () =\n\tlet row1 = read_int_list () in\n\tlet row2 = read_int_list () in\n\tlet row3 = read_int_list () in\n\tif is_const_list (diff row1 row2) && is_const_list (diff row2 row3) then\n\t\tprint_endline \"Yes\"\n\telse\n\t\tprint_endline \"No\"\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 454, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s363819459", "group_id": "codeNet:p03436", "input_text": "\nopen Scanf\nopen Printf\nopen List\n\nlet step = [(1, 0); (0, 1); (-1, 0); (0, -1)]\n\nlet flip f x y = f y x\n\nlet inf = 101010101010\n\nlet read_int () = scanf \" %d\" (fun x -> x)\n\nlet rec read_ints n =\n  if n = 0 then []\n  else\n    let a = scanf \" %d\" (fun x -> x) in\n    a :: read_ints (n-1)\n\nlet () =\n  let (h :: w :: _) = read_ints 2 in\n  let num_white = ref 0 in\n  let field = Array.init h (fun _ ->\n    let row = scanf \" %s\" (fun s -> s) in\n    flip String.iter row (\n      fun c -> if c = '.' then num_white := !num_white + 1 else ()\n    );\n    row) in\n\n  let min_dist = Array.init h (fun _ -> Array.init w (fun _ -> ref inf)) in\n  min_dist.(0).(0) := 0;\n\n  let queue = Queue.create () in\n  Queue.push (0, 0) queue;\n  while not (Queue.is_empty queue) do\n    let x, y = Queue.pop queue in\n    flip List.iter step (fun (dx, dy) ->\n      let nx, ny = x + dx, y + dy in\n      if nx < 0 || h <= nx || ny < 0 || w <= ny || String.get (field.(nx)) ny = '#'\n      then ()\n      else if !(min_dist.(nx).(ny)) = inf then (\n        min_dist.(nx).(ny) := !(min_dist.(x).(y)) + 1;\n        Queue.push (nx, ny) queue\n      )\n    )\n  done;\n  let ans = !(min_dist.(h-1).(w-1)) in\n  printf \"%d\\n\" (if ans = inf then -1 else !num_white - ans - 1)\n\n", "language": "OCaml", "metadata": {"date": 1519011330, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s363819459.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s363819459", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "\nopen Scanf\nopen Printf\nopen List\n\nlet step = [(1, 0); (0, 1); (-1, 0); (0, -1)]\n\nlet flip f x y = f y x\n\nlet inf = 101010101010\n\nlet read_int () = scanf \" %d\" (fun x -> x)\n\nlet rec read_ints n =\n  if n = 0 then []\n  else\n    let a = scanf \" %d\" (fun x -> x) in\n    a :: read_ints (n-1)\n\nlet () =\n  let (h :: w :: _) = read_ints 2 in\n  let num_white = ref 0 in\n  let field = Array.init h (fun _ ->\n    let row = scanf \" %s\" (fun s -> s) in\n    flip String.iter row (\n      fun c -> if c = '.' then num_white := !num_white + 1 else ()\n    );\n    row) in\n\n  let min_dist = Array.init h (fun _ -> Array.init w (fun _ -> ref inf)) in\n  min_dist.(0).(0) := 0;\n\n  let queue = Queue.create () in\n  Queue.push (0, 0) queue;\n  while not (Queue.is_empty queue) do\n    let x, y = Queue.pop queue in\n    flip List.iter step (fun (dx, dy) ->\n      let nx, ny = x + dx, y + dy in\n      if nx < 0 || h <= nx || ny < 0 || w <= ny || String.get (field.(nx)) ny = '#'\n      then ()\n      else if !(min_dist.(nx).(ny)) = inf then (\n        min_dist.(nx).(ny) := !(min_dist.(x).(y)) + 1;\n        Queue.push (nx, ny) queue\n      )\n    )\n  done;\n  let ans = !(min_dist.(h-1).(w-1)) in\n  printf \"%d\\n\" (if ans = inf then -1 else !num_white - ans - 1)\n\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1229, "cpu_time_ms": 2, "memory_kb": 1024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s290903966", "group_id": "codeNet:p03437", "input_text": "let () =\n  let (x,y) = Scanf.scanf \"%d %d\\n\" (fun x y -> x,y) in\n  let y'=int_of_float (sqrt (float_of_int y)) in\n  let rec min_yp i =\n    if i > x || i > y' then 2\n    else if y mod i <> 0 then i\n    else min_yp i+1\n  in\n  let check  =\n    if x mod y = 0 then -1\n    else if x>y then x\n    else x * (min_yp 2)\n  in\n  let ans = check in\n  print_int ans;\n  \n;;", "language": "OCaml", "metadata": {"date": 1517724199, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s290903966.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Memory Limit Exceeded", "submission_id": "s290903966", "user_id": "u161156777"}, "prompt_components": {"gold_output": "16\n", "input_to_evaluate": "let () =\n  let (x,y) = Scanf.scanf \"%d %d\\n\" (fun x y -> x,y) in\n  let y'=int_of_float (sqrt (float_of_int y)) in\n  let rec min_yp i =\n    if i > x || i > y' then 2\n    else if y mod i <> 0 then i\n    else min_yp i+1\n  in\n  let check  =\n    if x mod y = 0 then -1\n    else if x>y then x\n    else x * (min_yp 2)\n  in\n  let ans = check in\n  print_int ans;\n  \n;;", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given positive integers X and Y.\nIf there exists a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, choose one such integer and print it.\nIf it does not exist, print -1.\n\nConstraints\n\n1 ≤ X,Y ≤ 10^9\n\nX and Y are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, or print -1 if it does not exist.\n\nSample Input 1\n\n8 6\n\nSample Output 1\n\n16\n\nFor example, 16 is a multiple of 8 but not a multiple of 6.\n\nSample Input 2\n\n3 3\n\nSample Output 2\n\n-1\n\nA multiple of 3 is a multiple of 3.", "sample_input": "8 6\n"}, "reference_outputs": ["16\n"], "source_document_id": "p03437", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given positive integers X and Y.\nIf there exists a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, choose one such integer and print it.\nIf it does not exist, print -1.\n\nConstraints\n\n1 ≤ X,Y ≤ 10^9\n\nX and Y are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, or print -1 if it does not exist.\n\nSample Input 1\n\n8 6\n\nSample Output 1\n\n16\n\nFor example, 16 is a multiple of 8 but not a multiple of 6.\n\nSample Input 2\n\n3 3\n\nSample Output 2\n\n-1\n\nA multiple of 3 is a multiple of 3.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 303, "memory_kb": 262528}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s655074737", "group_id": "codeNet:p03438", "input_text": "open Batteries;;\n  \nlet () =\n  let _ = read_line () in\n  let la = read_line () |> String.split_on_char ' ' |> List.map int_of_string in\n  let lb = read_line () |> String.split_on_char ' ' |> List.map int_of_string in\n  let rec diff la lb =\n    match la, lb with\n    | [], [] -> []\n    | hda :: resta, hdb :: restb ->\n       (hda - hdb) :: diff resta restb\n    | _ -> []\n  in\n  let l = diff la lb in\n  let sum = List.fold_left (+) 0 l in\n  let ans = if sum < 0 then \"No\"\n            else \"Yes\" in\n  (* let rec check l ac bc  = *)\n  (*   match l with *)\n  (*   | [] -> ac,bc *)\n  (*   | e :: rest -> *)\n  (*      if e<0 then check rest ac (bc+e) *)\n  (*      else check rest (ac+e) bc *)\n  (* in *)\n  (* let b,a= check l 0 0 in *)\n  (* let ans = *)\n  (*   if a mod b = 0 then \"Yes\" *)\n  (*   else \"No\" in *)\n  print_string ans\n;;\n        \n  ", "language": "OCaml", "metadata": {"date": 1517734744, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s655074737.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s655074737", "user_id": "u161156777"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Batteries;;\n  \nlet () =\n  let _ = read_line () in\n  let la = read_line () |> String.split_on_char ' ' |> List.map int_of_string in\n  let lb = read_line () |> String.split_on_char ' ' |> List.map int_of_string in\n  let rec diff la lb =\n    match la, lb with\n    | [], [] -> []\n    | hda :: resta, hdb :: restb ->\n       (hda - hdb) :: diff resta restb\n    | _ -> []\n  in\n  let l = diff la lb in\n  let sum = List.fold_left (+) 0 l in\n  let ans = if sum < 0 then \"No\"\n            else \"Yes\" in\n  (* let rec check l ac bc  = *)\n  (*   match l with *)\n  (*   | [] -> ac,bc *)\n  (*   | e :: rest -> *)\n  (*      if e<0 then check rest ac (bc+e) *)\n  (*      else check rest (ac+e) bc *)\n  (* in *)\n  (* let b,a= check l 0 0 in *)\n  (* let ans = *)\n  (*   if a mod b = 0 then \"Yes\" *)\n  (*   else \"No\" in *)\n  print_string ans\n;;\n        \n  ", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two integer sequences of length N: a_1,a_2,..,a_N and b_1,b_2,..,b_N.\nDetermine if we can repeat the following operation zero or more times so that the sequences a and b become equal.\n\nOperation: Choose two integers i and j (possibly the same) between 1 and N (inclusive), then perform the following two actions simultaneously:\n\nAdd 2 to a_i.\n\nAdd 1 to b_j.\n\nConstraints\n\n1 ≤ N ≤ 10 000\n\n0 ≤ a_i,b_i ≤ 10^9 (1 ≤ i ≤ N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 .. a_N\nb_1 b_2 .. b_N\n\nOutput\n\nIf we can repeat the operation zero or more times so that the sequences a and b become equal, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 2 3\n5 2 2\n\nSample Output 1\n\nYes\n\nFor example, we can perform three operations as follows to do our job:\n\nFirst operation: i=1 and j=2. Now we have a = \\{3,2,3\\}, b = \\{5,3,2\\}.\n\nSecond operation: i=1 and j=2. Now we have a = \\{5,2,3\\}, b = \\{5,4,2\\}.\n\nThird operation: i=2 and j=3. Now we have a = \\{5,4,3\\}, b = \\{5,4,3\\}.\n\nSample Input 2\n\n5\n3 1 4 1 5\n2 7 1 8 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n2 7 1 8 2\n3 1 4 1 5\n\nSample Output 3\n\nNo", "sample_input": "3\n1 2 3\n5 2 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03438", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two integer sequences of length N: a_1,a_2,..,a_N and b_1,b_2,..,b_N.\nDetermine if we can repeat the following operation zero or more times so that the sequences a and b become equal.\n\nOperation: Choose two integers i and j (possibly the same) between 1 and N (inclusive), then perform the following two actions simultaneously:\n\nAdd 2 to a_i.\n\nAdd 1 to b_j.\n\nConstraints\n\n1 ≤ N ≤ 10 000\n\n0 ≤ a_i,b_i ≤ 10^9 (1 ≤ i ≤ N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 .. a_N\nb_1 b_2 .. b_N\n\nOutput\n\nIf we can repeat the operation zero or more times so that the sequences a and b become equal, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 2 3\n5 2 2\n\nSample Output 1\n\nYes\n\nFor example, we can perform three operations as follows to do our job:\n\nFirst operation: i=1 and j=2. Now we have a = \\{3,2,3\\}, b = \\{5,3,2\\}.\n\nSecond operation: i=1 and j=2. Now we have a = \\{5,2,3\\}, b = \\{5,4,2\\}.\n\nThird operation: i=2 and j=3. Now we have a = \\{5,4,3\\}, b = \\{5,4,3\\}.\n\nSample Input 2\n\n5\n3 1 4 1 5\n2 7 1 8 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n2 7 1 8 2\n3 1 4 1 5\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 839, "cpu_time_ms": 6, "memory_kb": 5504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s735217683", "group_id": "codeNet:p03447", "input_text": "open Printf\nopen Scanf\n\nlet solve x a b = (x - a) mod b\n  \nlet () =\n  scanf \"%d %d %d \" solve |> printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1582747716, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s735217683.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s735217683", "user_id": "u388783188"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve x a b = (x - a) mod b\n  \nlet () =\n  scanf \"%d %d %d \" solve |> printf \"%d\\n\"\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 111, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s834999847", "group_id": "codeNet:p03447", "input_text": "let f x a b = (mod) (x-a) b;;\nlet () = Scanf.scanf \"%d %d %d\" f\n|> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1561261971, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s834999847.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s834999847", "user_id": "u635974378"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "let f x a b = (mod) (x-a) b;;\nlet () = Scanf.scanf \"%d %d %d\" f\n|> Printf.printf \"%d\\n\"", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 87, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s229138626", "group_id": "codeNet:p03447", "input_text": "let () =\n  let x = Scanf.scanf \"%d \" (fun a -> a) in\n  let a = Scanf.scanf \"%d \" (fun a -> a) in\n  let b = Scanf.scanf \"%d \" (fun a -> a) in\n  \n  Printf.printf \"%d\\n\" @@ (x - a) mod b\n", "language": "OCaml", "metadata": {"date": 1528701287, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s229138626.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s229138626", "user_id": "u139013163"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "let () =\n  let x = Scanf.scanf \"%d \" (fun a -> a) in\n  let a = Scanf.scanf \"%d \" (fun a -> a) in\n  let b = Scanf.scanf \"%d \" (fun a -> a) in\n  \n  Printf.printf \"%d\\n\" @@ (x - a) mod b\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 184, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s270694032", "group_id": "codeNet:p03447", "input_text": "let () =\n  Scanf.scanf \"%d\\n%d\\n%d\" (fun x a b -> (x - a) mod b)\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1523327614, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s270694032.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s270694032", "user_id": "u987869509"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d\\n%d\\n%d\" (fun x a b -> (x - a) mod b)\n  |> Printf.printf \"%d\\n\"", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 90, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s960934951", "group_id": "codeNet:p03456", "input_text": "let a, b = Scanf.scanf \" %s %s\" @@ fun a b -> a, b\nlet n = int_of_string @@ a ^ b\nlet i = ref 1\nlet _ = while !i * !i <= 100100 do if !i * !i = n then (print_endline \"Yes\"; exit 0); incr i done; print_endline \"No\"", "language": "OCaml", "metadata": {"date": 1563849012, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s960934951.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s960934951", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let a, b = Scanf.scanf \" %s %s\" @@ fun a b -> a, b\nlet n = int_of_string @@ a ^ b\nlet i = ref 1\nlet _ = while !i * !i <= 100100 do if !i * !i = n then (print_endline \"Yes\"; exit 0); incr i done; print_endline \"No\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer has found two positive integers, a and b.\nDetermine whether the concatenation of a and b in this order is a square number.\n\nConstraints\n\n1 ≤ a,b ≤ 100\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the concatenation of a and b in this order is a square number, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 21\n\nSample Output 1\n\nYes\n\nAs 121 = 11 × 11, it is a square number.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\nNo\n\n100100 is not a square number.\n\nSample Input 3\n\n12 10\n\nSample Output 3\n\nNo", "sample_input": "1 21\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03456", "source_text": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer has found two positive integers, a and b.\nDetermine whether the concatenation of a and b in this order is a square number.\n\nConstraints\n\n1 ≤ a,b ≤ 100\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the concatenation of a and b in this order is a square number, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 21\n\nSample Output 1\n\nYes\n\nAs 121 = 11 × 11, it is a square number.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\nNo\n\n100100 is not a square number.\n\nSample Input 3\n\n12 10\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 213, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s797973002", "group_id": "codeNet:p03456", "input_text": "(* O(n) (n = max {a, b}) *)\nScanf.scanf \"%s %s\" @@ fun a b ->\n  let m = a ^ b |> int_of_string in\n  let rec find i =\n    if i * i = m then \"Yes\"\n    else if i * i > m then \"No\"\n    else find (i + 1) in\n  find 1 |> print_endline", "language": "OCaml", "metadata": {"date": 1558378477, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s797973002.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s797973002", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(* O(n) (n = max {a, b}) *)\nScanf.scanf \"%s %s\" @@ fun a b ->\n  let m = a ^ b |> int_of_string in\n  let rec find i =\n    if i * i = m then \"Yes\"\n    else if i * i > m then \"No\"\n    else find (i + 1) in\n  find 1 |> print_endline", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer has found two positive integers, a and b.\nDetermine whether the concatenation of a and b in this order is a square number.\n\nConstraints\n\n1 ≤ a,b ≤ 100\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the concatenation of a and b in this order is a square number, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 21\n\nSample Output 1\n\nYes\n\nAs 121 = 11 × 11, it is a square number.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\nNo\n\n100100 is not a square number.\n\nSample Input 3\n\n12 10\n\nSample Output 3\n\nNo", "sample_input": "1 21\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03456", "source_text": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer has found two positive integers, a and b.\nDetermine whether the concatenation of a and b in this order is a square number.\n\nConstraints\n\n1 ≤ a,b ≤ 100\n\na and b are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the concatenation of a and b in this order is a square number, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 21\n\nSample Output 1\n\nYes\n\nAs 121 = 11 × 11, it is a square number.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\nNo\n\n100100 is not a square number.\n\nSample Input 3\n\n12 10\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 227, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s078946639", "group_id": "codeNet:p03457", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  Array.init n (fun _ ->\n    Scanf.scanf \"%d %d %d\\n\" @@ fun t x y -> t, x, y)\n  |> Array.fold_left (fun (acc, txy') txy -> ((txy', txy) :: acc, txy)) ([], (0, 0, 0))\n  |> fst\n  |> List.for_all (fun ((t, x, y), (t', x', y')) ->\n      let d = abs (x - x') + abs (y - y') in\n      let dt = t' - t in\n      d <= dt && (d - dt) mod 2 = 0)\n  |> (function true -> \"Yes\" | false -> \"No\")\n  |> print_endline", "language": "OCaml", "metadata": {"date": 1532634740, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s078946639.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s078946639", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  Array.init n (fun _ ->\n    Scanf.scanf \"%d %d %d\\n\" @@ fun t x y -> t, x, y)\n  |> Array.fold_left (fun (acc, txy') txy -> ((txy', txy) :: acc, txy)) ([], (0, 0, 0))\n  |> fst\n  |> List.for_all (fun ((t, x, y), (t', x', y')) ->\n      let d = abs (x - x') + abs (y - y') in\n      let dt = t' - t in\n      d <= dt && (d - dt) mod 2 = 0)\n  |> (function true -> \"Yes\" | false -> \"No\")\n  |> print_endline", "problem_context": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is going on a trip in a two-dimensional plane.\nIn his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.\n\nIf AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1).\nNote that he cannot stay at his place.\nDetermine whether he can carry out his plan.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n0 ≤ x_i ≤ 10^5\n\n0 ≤ y_i ≤ 10^5\n\n1 ≤ t_i ≤ 10^5\n\nt_i < t_{i+1} (1 ≤ i ≤ N-1)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nt_1 x_1 y_1\nt_2 x_2 y_2\n:\nt_N x_N y_N\n\nOutput\n\nIf AtCoDeer can carry out his plan, print Yes; if he cannot, print No.\n\nSample Input 1\n\n2\n3 1 2\n6 1 1\n\nSample Output 1\n\nYes\n\nFor example, he can travel as follows: (0,0), (0,1), (1,1), (1,2), (1,1), (1,0), then (1,1).\n\nSample Input 2\n\n1\n2 100 100\n\nSample Output 2\n\nNo\n\nIt is impossible to be at (100,100) two seconds after being at (0,0).\n\nSample Input 3\n\n2\n5 1 1\n100 1 1\n\nSample Output 3\n\nNo", "sample_input": "2\n3 1 2\n6 1 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03457", "source_text": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is going on a trip in a two-dimensional plane.\nIn his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.\n\nIf AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1).\nNote that he cannot stay at his place.\nDetermine whether he can carry out his plan.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n0 ≤ x_i ≤ 10^5\n\n0 ≤ y_i ≤ 10^5\n\n1 ≤ t_i ≤ 10^5\n\nt_i < t_{i+1} (1 ≤ i ≤ N-1)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nt_1 x_1 y_1\nt_2 x_2 y_2\n:\nt_N x_N y_N\n\nOutput\n\nIf AtCoDeer can carry out his plan, print Yes; if he cannot, print No.\n\nSample Input 1\n\n2\n3 1 2\n6 1 1\n\nSample Output 1\n\nYes\n\nFor example, he can travel as follows: (0,0), (0,1), (1,1), (1,2), (1,1), (1,0), then (1,1).\n\nSample Input 2\n\n1\n2 100 100\n\nSample Output 2\n\nNo\n\nIt is impossible to be at (100,100) two seconds after being at (0,0).\n\nSample Input 3\n\n2\n5 1 1\n100 1 1\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 439, "cpu_time_ms": 79, "memory_kb": 11008}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s017443793", "group_id": "codeNet:p03469", "input_text": "let s = read_line ()\nlet _ = Printf.printf \"2018/01/%c%c\\n\" s.[8] s.[9]", "language": "OCaml", "metadata": {"date": 1562871412, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03469.html", "problem_id": "p03469", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03469/input.txt", "sample_output_relpath": "derived/input_output/data/p03469/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03469/OCaml/s017443793.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s017443793", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2018/01/07\n", "input_to_evaluate": "let s = read_line ()\nlet _ = Printf.printf \"2018/01/%c%c\\n\" s.[8] s.[9]", "problem_context": "Score : 100 points\n\nProblem Statement\n\nOn some day in January 2018, Takaki is writing a document. The document has a column where the current date is written in yyyy/mm/dd format. For example, January 23, 2018 should be written as 2018/01/23.\n\nAfter finishing the document, she noticed that she had mistakenly wrote 2017 at the beginning of the date column. Write a program that, when the string that Takaki wrote in the date column, S, is given as input, modifies the first four characters in S to 2018 and prints it.\n\nConstraints\n\nS is a string of length 10.\n\nThe first eight characters in S are 2017/01/.\n\nThe last two characters in S are digits and represent an integer between 1 and 31 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nReplace the first four characters in S with 2018 and print it.\n\nSample Input 1\n\n2017/01/07\n\nSample Output 1\n\n2018/01/07\n\nSample Input 2\n\n2017/01/31\n\nSample Output 2\n\n2018/01/31", "sample_input": "2017/01/07\n"}, "reference_outputs": ["2018/01/07\n"], "source_document_id": "p03469", "source_text": "Score : 100 points\n\nProblem Statement\n\nOn some day in January 2018, Takaki is writing a document. The document has a column where the current date is written in yyyy/mm/dd format. For example, January 23, 2018 should be written as 2018/01/23.\n\nAfter finishing the document, she noticed that she had mistakenly wrote 2017 at the beginning of the date column. Write a program that, when the string that Takaki wrote in the date column, S, is given as input, modifies the first four characters in S to 2018 and prints it.\n\nConstraints\n\nS is a string of length 10.\n\nThe first eight characters in S are 2017/01/.\n\nThe last two characters in S are digits and represent an integer between 1 and 31 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nReplace the first four characters in S with 2018 and print it.\n\nSample Input 1\n\n2017/01/07\n\nSample Output 1\n\n2018/01/07\n\nSample Input 2\n\n2017/01/31\n\nSample Output 2\n\n2018/01/31", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 71, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s228443112", "group_id": "codeNet:p03470", "input_text": "let input () =\n    let n  = int_of_string (read_line ())\n    in let rec ds i result = if i >= n\n        then result\n        else let input = int_of_string (read_line ())\n             in  ds (i+1) (input::result)\n    in List.rev (ds 0 [])\n\nlet remove_duplicate (x::xs) = \n    let rec remove_duplicate' prev l = \n        match l with\n        | []    -> []\n        | x::xs -> if x == prev \n            then remove_duplicate' x xs\n            else x :: (remove_duplicate' x xs)\n    in x :: (remove_duplicate' x xs)\n\nlet _ = List.sort (Pervasives.compare) (input ())\n     |> remove_duplicate\n     |> List.fold_left (+) 0\n     |> print_int \n     |> print_newline", "language": "OCaml", "metadata": {"date": 1519076220, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03470.html", "problem_id": "p03470", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03470/input.txt", "sample_output_relpath": "derived/input_output/data/p03470/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03470/OCaml/s228443112.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s228443112", "user_id": "u219949952"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let input () =\n    let n  = int_of_string (read_line ())\n    in let rec ds i result = if i >= n\n        then result\n        else let input = int_of_string (read_line ())\n             in  ds (i+1) (input::result)\n    in List.rev (ds 0 [])\n\nlet remove_duplicate (x::xs) = \n    let rec remove_duplicate' prev l = \n        match l with\n        | []    -> []\n        | x::xs -> if x == prev \n            then remove_duplicate' x xs\n            else x :: (remove_duplicate' x xs)\n    in x :: (remove_duplicate' x xs)\n\nlet _ = List.sort (Pervasives.compare) (input ())\n     |> remove_duplicate\n     |> List.fold_left (+) 0\n     |> print_int \n     |> print_newline", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAn X-layered kagami mochi (X ≥ 1) is a pile of X round mochi (rice cake) stacked vertically where each mochi (except the bottom one) has a smaller diameter than that of the mochi directly below it. For example, if you stack three mochi with diameters of 10, 8 and 6 centimeters from bottom to top in this order, you have a 3-layered kagami mochi; if you put just one mochi, you have a 1-layered kagami mochi.\n\nLunlun the dachshund has N round mochi, and the diameter of the i-th mochi is d_i centimeters. When we make a kagami mochi using some or all of them, at most how many layers can our kagami mochi have?\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ d_i ≤ 100\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1\n:\nd_N\n\nOutput\n\nPrint the maximum number of layers in a kagami mochi that can be made.\n\nSample Input 1\n\n4\n10\n8\n8\n6\n\nSample Output 1\n\n3\n\nIf we stack the mochi with diameters of 10, 8 and 6 centimeters from bottom to top in this order, we have a 3-layered kagami mochi, which is the maximum number of layers.\n\nSample Input 2\n\n3\n15\n15\n15\n\nSample Output 2\n\n1\n\nWhen all the mochi have the same diameter, we can only have a 1-layered kagami mochi.\n\nSample Input 3\n\n7\n50\n30\n50\n100\n50\n80\n30\n\nSample Output 3\n\n4", "sample_input": "4\n10\n8\n8\n6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03470", "source_text": "Score : 200 points\n\nProblem Statement\n\nAn X-layered kagami mochi (X ≥ 1) is a pile of X round mochi (rice cake) stacked vertically where each mochi (except the bottom one) has a smaller diameter than that of the mochi directly below it. For example, if you stack three mochi with diameters of 10, 8 and 6 centimeters from bottom to top in this order, you have a 3-layered kagami mochi; if you put just one mochi, you have a 1-layered kagami mochi.\n\nLunlun the dachshund has N round mochi, and the diameter of the i-th mochi is d_i centimeters. When we make a kagami mochi using some or all of them, at most how many layers can our kagami mochi have?\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ d_i ≤ 100\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1\n:\nd_N\n\nOutput\n\nPrint the maximum number of layers in a kagami mochi that can be made.\n\nSample Input 1\n\n4\n10\n8\n8\n6\n\nSample Output 1\n\n3\n\nIf we stack the mochi with diameters of 10, 8 and 6 centimeters from bottom to top in this order, we have a 3-layered kagami mochi, which is the maximum number of layers.\n\nSample Input 2\n\n3\n15\n15\n15\n\nSample Output 2\n\n1\n\nWhen all the mochi have the same diameter, we can only have a 1-layered kagami mochi.\n\nSample Input 3\n\n7\n50\n30\n50\n100\n50\n80\n30\n\nSample Output 3\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 656, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s461298637", "group_id": "codeNet:p03473", "input_text": "Scanf.scanf \"%d\" (fun m -> Printf.printf \"%d\\n\" @@ 48 - m)", "language": "OCaml", "metadata": {"date": 1601351048, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s461298637.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s461298637", "user_id": "u342443598"}, "prompt_components": {"gold_output": "27\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun m -> Printf.printf \"%d\\n\" @@ 48 - m)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHow many hours do we have until New Year at M o'clock (24-hour notation) on 30th, December?\n\nConstraints\n\n1≤M≤23\n\nM is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM\n\nOutput\n\nIf we have x hours until New Year at M o'clock on 30th, December, print x.\n\nSample Input 1\n\n21\n\nSample Output 1\n\n27\n\nWe have 27 hours until New Year at 21 o'clock on 30th, December.\n\nSample Input 2\n\n12\n\nSample Output 2\n\n36", "sample_input": "21\n"}, "reference_outputs": ["27\n"], "source_document_id": "p03473", "source_text": "Score : 100 points\n\nProblem Statement\n\nHow many hours do we have until New Year at M o'clock (24-hour notation) on 30th, December?\n\nConstraints\n\n1≤M≤23\n\nM is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM\n\nOutput\n\nIf we have x hours until New Year at M o'clock on 30th, December, print x.\n\nSample Input 1\n\n21\n\nSample Output 1\n\n27\n\nWe have 27 hours until New Year at 21 o'clock on 30th, December.\n\nSample Input 2\n\n12\n\nSample Output 2\n\n36", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 58, "cpu_time_ms": 7, "memory_kb": 3808}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s093815698", "group_id": "codeNet:p03473", "input_text": "let m = read_int ()\nlet _ = (24 - m) + 24 |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1584307144, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s093815698.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s093815698", "user_id": "u511870776"}, "prompt_components": {"gold_output": "27\n", "input_to_evaluate": "let m = read_int ()\nlet _ = (24 - m) + 24 |> Printf.printf \"%d\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHow many hours do we have until New Year at M o'clock (24-hour notation) on 30th, December?\n\nConstraints\n\n1≤M≤23\n\nM is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM\n\nOutput\n\nIf we have x hours until New Year at M o'clock on 30th, December, print x.\n\nSample Input 1\n\n21\n\nSample Output 1\n\n27\n\nWe have 27 hours until New Year at 21 o'clock on 30th, December.\n\nSample Input 2\n\n12\n\nSample Output 2\n\n36", "sample_input": "21\n"}, "reference_outputs": ["27\n"], "source_document_id": "p03473", "source_text": "Score : 100 points\n\nProblem Statement\n\nHow many hours do we have until New Year at M o'clock (24-hour notation) on 30th, December?\n\nConstraints\n\n1≤M≤23\n\nM is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM\n\nOutput\n\nIf we have x hours until New Year at M o'clock on 30th, December, print x.\n\nSample Input 1\n\n21\n\nSample Output 1\n\n27\n\nWe have 27 hours until New Year at 21 o'clock on 30th, December.\n\nSample Input 2\n\n12\n\nSample Output 2\n\n36", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 65, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s502761846", "group_id": "codeNet:p03473", "input_text": "open Int64;;\n\nlet n = read_int () in\n\nprint_endline(to_string (of_int (48-n)))", "language": "OCaml", "metadata": {"date": 1529314899, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s502761846.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s502761846", "user_id": "u714587753"}, "prompt_components": {"gold_output": "27\n", "input_to_evaluate": "open Int64;;\n\nlet n = read_int () in\n\nprint_endline(to_string (of_int (48-n)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nHow many hours do we have until New Year at M o'clock (24-hour notation) on 30th, December?\n\nConstraints\n\n1≤M≤23\n\nM is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM\n\nOutput\n\nIf we have x hours until New Year at M o'clock on 30th, December, print x.\n\nSample Input 1\n\n21\n\nSample Output 1\n\n27\n\nWe have 27 hours until New Year at 21 o'clock on 30th, December.\n\nSample Input 2\n\n12\n\nSample Output 2\n\n36", "sample_input": "21\n"}, "reference_outputs": ["27\n"], "source_document_id": "p03473", "source_text": "Score : 100 points\n\nProblem Statement\n\nHow many hours do we have until New Year at M o'clock (24-hour notation) on 30th, December?\n\nConstraints\n\n1≤M≤23\n\nM is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM\n\nOutput\n\nIf we have x hours until New Year at M o'clock on 30th, December, print x.\n\nSample Input 1\n\n21\n\nSample Output 1\n\n27\n\nWe have 27 hours until New Year at 21 o'clock on 30th, December.\n\nSample Input 2\n\n12\n\nSample Output 2\n\n36", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 78, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s903934764", "group_id": "codeNet:p03474", "input_text": "let calc_ a b s =\n    match BatString.split_on_char '-' s with\n    | [x; y] -> String.length x = a && String.length y = b\n    | _ -> false\n\nlet calc a b s =\n    let f v i c = v && (if i = a then c = '-' else c <> '-') in\n    BatString.fold_lefti f true s\n\nlet main =\n    let [a; b] = read_line () |> BatString.split_on_char ' ' |> List.map int_of_string in\n    let s = read_line () in\n    let v = (calc a b s) in\n    print_endline (if v then \"Yes\" else \"No\")\n", "language": "OCaml", "metadata": {"date": 1577379500, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s903934764.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s903934764", "user_id": "u912845774"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let calc_ a b s =\n    match BatString.split_on_char '-' s with\n    | [x; y] -> String.length x = a && String.length y = b\n    | _ -> false\n\nlet calc a b s =\n    let f v i c = v && (if i = a then c = '-' else c <> '-') in\n    BatString.fold_lefti f true s\n\nlet main =\n    let [a; b] = read_line () |> BatString.split_on_char ' ' |> List.map int_of_string in\n    let s = read_line () in\n    let v = (calc a b s) in\n    print_endline (if v then \"Yes\" else \"No\")\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThe postal code in Atcoder Kingdom is A+B+1 characters long, its (A+1)-th character is a hyphen -, and the other characters are digits from 0 through 9.\n\nYou are given a string S. Determine whether it follows the postal code format in Atcoder Kingdom.\n\nConstraints\n\n1≤A,B≤5\n\n|S|=A+B+1\n\nS consists of - and digits from 0 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\nS\n\nOutput\n\nPrint Yes if S follows the postal code format in AtCoder Kingdom; print No otherwise.\n\nSample Input 1\n\n3 4\n269-6650\n\nSample Output 1\n\nYes\n\nThe (A+1)-th character of S is -, and the other characters are digits from 0 through 9, so it follows the format.\n\nSample Input 2\n\n1 1\n---\n\nSample Output 2\n\nNo\n\nS contains unnecessary -s other than the (A+1)-th character, so it does not follow the format.\n\nSample Input 3\n\n1 2\n7444\n\nSample Output 3\n\nNo", "sample_input": "3 4\n269-6650\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03474", "source_text": "Score : 200 points\n\nProblem Statement\n\nThe postal code in Atcoder Kingdom is A+B+1 characters long, its (A+1)-th character is a hyphen -, and the other characters are digits from 0 through 9.\n\nYou are given a string S. Determine whether it follows the postal code format in Atcoder Kingdom.\n\nConstraints\n\n1≤A,B≤5\n\n|S|=A+B+1\n\nS consists of - and digits from 0 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\nS\n\nOutput\n\nPrint Yes if S follows the postal code format in AtCoder Kingdom; print No otherwise.\n\nSample Input 1\n\n3 4\n269-6650\n\nSample Output 1\n\nYes\n\nThe (A+1)-th character of S is -, and the other characters are digits from 0 through 9, so it follows the format.\n\nSample Input 2\n\n1 1\n---\n\nSample Output 2\n\nNo\n\nS contains unnecessary -s other than the (A+1)-th character, so it does not follow the format.\n\nSample Input 3\n\n1 2\n7444\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 459, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s417320211", "group_id": "codeNet:p03474", "input_text": "\nopen Scanf\nopen Printf\n\nlet read_int () = scanf \" %d\" (fun x -> x)\nlet rec read_ints n = if n = 0 then [] else let i = read_int () in i :: read_ints (n-1)\n\nlet rec for_all_iter a b f = if a >= b then true else f a && for_all_iter (a+1) b f\n\nlet () =\n  let a = read_int () in let b = read_int () in\n  let s = scanf \" %s\" (fun s -> s) in\n  let check1 = for_all_iter 0 a (fun i -> '0' <= s.[i] && s.[i] <= '9') in\n  let check2 = s.[a] = '-' in\n  let check3 = for_all_iter (a+1) (a+b+1) (fun i -> '0' <= s.[i] && s.[i] <= '9') in\n  printf \"%s\\n\" (if check1 && check2 && check3 then \"Yes\" else \"No\")\n", "language": "OCaml", "metadata": {"date": 1519103536, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s417320211.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s417320211", "user_id": "u798181098"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "\nopen Scanf\nopen Printf\n\nlet read_int () = scanf \" %d\" (fun x -> x)\nlet rec read_ints n = if n = 0 then [] else let i = read_int () in i :: read_ints (n-1)\n\nlet rec for_all_iter a b f = if a >= b then true else f a && for_all_iter (a+1) b f\n\nlet () =\n  let a = read_int () in let b = read_int () in\n  let s = scanf \" %s\" (fun s -> s) in\n  let check1 = for_all_iter 0 a (fun i -> '0' <= s.[i] && s.[i] <= '9') in\n  let check2 = s.[a] = '-' in\n  let check3 = for_all_iter (a+1) (a+b+1) (fun i -> '0' <= s.[i] && s.[i] <= '9') in\n  printf \"%s\\n\" (if check1 && check2 && check3 then \"Yes\" else \"No\")\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThe postal code in Atcoder Kingdom is A+B+1 characters long, its (A+1)-th character is a hyphen -, and the other characters are digits from 0 through 9.\n\nYou are given a string S. Determine whether it follows the postal code format in Atcoder Kingdom.\n\nConstraints\n\n1≤A,B≤5\n\n|S|=A+B+1\n\nS consists of - and digits from 0 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\nS\n\nOutput\n\nPrint Yes if S follows the postal code format in AtCoder Kingdom; print No otherwise.\n\nSample Input 1\n\n3 4\n269-6650\n\nSample Output 1\n\nYes\n\nThe (A+1)-th character of S is -, and the other characters are digits from 0 through 9, so it follows the format.\n\nSample Input 2\n\n1 1\n---\n\nSample Output 2\n\nNo\n\nS contains unnecessary -s other than the (A+1)-th character, so it does not follow the format.\n\nSample Input 3\n\n1 2\n7444\n\nSample Output 3\n\nNo", "sample_input": "3 4\n269-6650\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03474", "source_text": "Score : 200 points\n\nProblem Statement\n\nThe postal code in Atcoder Kingdom is A+B+1 characters long, its (A+1)-th character is a hyphen -, and the other characters are digits from 0 through 9.\n\nYou are given a string S. Determine whether it follows the postal code format in Atcoder Kingdom.\n\nConstraints\n\n1≤A,B≤5\n\n|S|=A+B+1\n\nS consists of - and digits from 0 through 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\nS\n\nOutput\n\nPrint Yes if S follows the postal code format in AtCoder Kingdom; print No otherwise.\n\nSample Input 1\n\n3 4\n269-6650\n\nSample Output 1\n\nYes\n\nThe (A+1)-th character of S is -, and the other characters are digits from 0 through 9, so it follows the format.\n\nSample Input 2\n\n1 1\n---\n\nSample Output 2\n\nNo\n\nS contains unnecessary -s other than the (A+1)-th character, so it does not follow the format.\n\nSample Input 3\n\n1 2\n7444\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 596, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s500895680", "group_id": "codeNet:p03476", "input_text": "let q = Scanf.scanf \" %d\" @@ (+) 0\nlet rmax = ref 0\nlet lrs = Array.init q @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun a b ->\n  rmax := max !rmax b; a, b\nlet primes n =\n  if n <= 1 then [|false; false|]\n  else\n    let flags = Array.make (n + 1) true in\n    flags.(0) <- false; flags.(1) <- false;\n    let i = ref 2 in\n    while !i * !i <= n do\n      if flags.(!i) then\n        (let j = ref @@ !i + !i in\n        while !j <= n do flags.(!j) <- false; j := !j + !i done);\n      incr i\n    done;\n    flags\nlet sums = Array.make (!rmax + 1) 0\nlet ps = primes !rmax\nlet f n = if n mod 2 = 1 && ps.(n) && ps.((n + 1) / 2) then 1 else 0\nlet _ =\n  for i = 0 to !rmax - 1 do sums.(i + 1) <- sums.(i) + f (i + 1) done;\n  let g (l, r) = Printf.printf \"%d\\n\" @@ sums.(r) - sums.(l - 1) in\n  Array.iter g lrs", "language": "OCaml", "metadata": {"date": 1560600502, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s500895680.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s500895680", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let q = Scanf.scanf \" %d\" @@ (+) 0\nlet rmax = ref 0\nlet lrs = Array.init q @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun a b ->\n  rmax := max !rmax b; a, b\nlet primes n =\n  if n <= 1 then [|false; false|]\n  else\n    let flags = Array.make (n + 1) true in\n    flags.(0) <- false; flags.(1) <- false;\n    let i = ref 2 in\n    while !i * !i <= n do\n      if flags.(!i) then\n        (let j = ref @@ !i + !i in\n        while !j <= n do flags.(!j) <- false; j := !j + !i done);\n      incr i\n    done;\n    flags\nlet sums = Array.make (!rmax + 1) 0\nlet ps = primes !rmax\nlet f n = if n mod 2 = 1 && ps.(n) && ps.((n + 1) / 2) then 1 else 0\nlet _ =\n  for i = 0 to !rmax - 1 do sums.(i + 1) <- sums.(i) + f (i + 1) done;\n  let g (l, r) = Printf.printf \"%d\\n\" @@ sums.(r) - sums.(l - 1) in\n  Array.iter g lrs", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe say that a odd number N is similar to 2017 when both N and (N+1)/2 are prime.\n\nYou are given Q queries.\n\nIn the i-th query, given two odd numbers l_i and r_i, find the number of odd numbers x similar to 2017 such that l_i ≤ x ≤ r_i.\n\nConstraints\n\n1≤Q≤10^5\n\n1≤l_i≤r_i≤10^5\n\nl_i and r_i are odd.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nl_1 r_1\n:\nl_Q r_Q\n\nOutput\n\nPrint Q lines. The i-th line (1≤i≤Q) should contain the response to the i-th query.\n\nSample Input 1\n\n1\n3 7\n\nSample Output 1\n\n2\n\n3 is similar to 2017, since both 3 and (3+1)/2=2 are prime.\n\n5 is similar to 2017, since both 5 and (5+1)/2=3 are prime.\n\n7 is not similar to 2017, since (7+1)/2=4 is not prime, although 7 is prime.\n\nThus, the response to the first query should be 2.\n\nSample Input 2\n\n4\n13 13\n7 11\n7 11\n2017 2017\n\nSample Output 2\n\n1\n0\n0\n1\n\nNote that 2017 is also similar to 2017.\n\nSample Input 3\n\n6\n1 53\n13 91\n37 55\n19 51\n73 91\n13 49\n\nSample Output 3\n\n4\n4\n1\n1\n1\n2", "sample_input": "1\n3 7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03476", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe say that a odd number N is similar to 2017 when both N and (N+1)/2 are prime.\n\nYou are given Q queries.\n\nIn the i-th query, given two odd numbers l_i and r_i, find the number of odd numbers x similar to 2017 such that l_i ≤ x ≤ r_i.\n\nConstraints\n\n1≤Q≤10^5\n\n1≤l_i≤r_i≤10^5\n\nl_i and r_i are odd.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nl_1 r_1\n:\nl_Q r_Q\n\nOutput\n\nPrint Q lines. The i-th line (1≤i≤Q) should contain the response to the i-th query.\n\nSample Input 1\n\n1\n3 7\n\nSample Output 1\n\n2\n\n3 is similar to 2017, since both 3 and (3+1)/2=2 are prime.\n\n5 is similar to 2017, since both 5 and (5+1)/2=3 are prime.\n\n7 is not similar to 2017, since (7+1)/2=4 is not prime, although 7 is prime.\n\nThus, the response to the first query should be 2.\n\nSample Input 2\n\n4\n13 13\n7 11\n7 11\n2017 2017\n\nSample Output 2\n\n1\n0\n0\n1\n\nNote that 2017 is also similar to 2017.\n\nSample Input 3\n\n6\n1 53\n13 91\n37 55\n19 51\n73 91\n13 49\n\nSample Output 3\n\n4\n4\n1\n1\n1\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 791, "cpu_time_ms": 79, "memory_kb": 8960}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s690814140", "group_id": "codeNet:p03477", "input_text": "let a, b, c, d = Scanf.scanf \"%d %d %d %d\\n\" @@ fun a b c d -> a, b, c, d\nlet ans = \n\tif a + b > c + d then \"Left\" else if a + b = c + d then \"Balanced\"\n\telse \"Right\"\nlet () = print_endline ans", "language": "OCaml", "metadata": {"date": 1588182248, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s690814140.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s690814140", "user_id": "u307426615"}, "prompt_components": {"gold_output": "Left\n", "input_to_evaluate": "let a, b, c, d = Scanf.scanf \"%d %d %d %d\\n\" @@ fun a b c d -> a, b, c, d\nlet ans = \n\tif a + b > c + d then \"Left\" else if a + b = c + d then \"Balanced\"\n\telse \"Right\"\nlet () = print_endline ans", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA balance scale tips to the left if L>R, where L is the total weight of the masses on the left pan and R is the total weight of the masses on the right pan. Similarly, it balances if L=R, and tips to the right if L<R.\n\nTakahashi placed a mass of weight A and a mass of weight B on the left pan of a balance scale, and placed a mass of weight C and a mass of weight D on the right pan.\n\nPrint Left if the balance scale tips to the left; print Balanced if it balances; print Right if it tips to the right.\n\nConstraints\n\n1\\leq A,B,C,D \\leq 10\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint Left if the balance scale tips to the left; print Balanced if it balances; print Right if it tips to the right.\n\nSample Input 1\n\n3 8 7 1\n\nSample Output 1\n\nLeft\n\nThe total weight of the masses on the left pan is 11, and the total weight of the masses on the right pan is 8. Since 11>8, we should print Left.\n\nSample Input 2\n\n3 4 5 2\n\nSample Output 2\n\nBalanced\n\nThe total weight of the masses on the left pan is 7, and the total weight of the masses on the right pan is 7. Since 7=7, we should print Balanced.\n\nSample Input 3\n\n1 7 6 4\n\nSample Output 3\n\nRight\n\nThe total weight of the masses on the left pan is 8, and the total weight of the masses on the right pan is 10. Since 8<10, we should print Right.", "sample_input": "3 8 7 1\n"}, "reference_outputs": ["Left\n"], "source_document_id": "p03477", "source_text": "Score : 100 points\n\nProblem Statement\n\nA balance scale tips to the left if L>R, where L is the total weight of the masses on the left pan and R is the total weight of the masses on the right pan. Similarly, it balances if L=R, and tips to the right if L<R.\n\nTakahashi placed a mass of weight A and a mass of weight B on the left pan of a balance scale, and placed a mass of weight C and a mass of weight D on the right pan.\n\nPrint Left if the balance scale tips to the left; print Balanced if it balances; print Right if it tips to the right.\n\nConstraints\n\n1\\leq A,B,C,D \\leq 10\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint Left if the balance scale tips to the left; print Balanced if it balances; print Right if it tips to the right.\n\nSample Input 1\n\n3 8 7 1\n\nSample Output 1\n\nLeft\n\nThe total weight of the masses on the left pan is 11, and the total weight of the masses on the right pan is 8. Since 11>8, we should print Left.\n\nSample Input 2\n\n3 4 5 2\n\nSample Output 2\n\nBalanced\n\nThe total weight of the masses on the left pan is 7, and the total weight of the masses on the right pan is 7. Since 7=7, we should print Balanced.\n\nSample Input 3\n\n1 7 6 4\n\nSample Output 3\n\nRight\n\nThe total weight of the masses on the left pan is 8, and the total weight of the masses on the right pan is 10. Since 8<10, we should print Right.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 193, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s715922442", "group_id": "codeNet:p03477", "input_text": "let () =\n  let a,b,c,d= Scanf.scanf \"%d %d %d %d \" (fun a b c d -> a,b,c,d) in\n  Printf.printf \"%s\\n\" \n    (if a+b>c+d then \n       \"Left\"\n     else (\n       if a+b=c+d then\n         \"Balanced\"\n       else\n         \"Right\"\n     )\n    );\n", "language": "OCaml", "metadata": {"date": 1528729881, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s715922442.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s715922442", "user_id": "u139013163"}, "prompt_components": {"gold_output": "Left\n", "input_to_evaluate": "let () =\n  let a,b,c,d= Scanf.scanf \"%d %d %d %d \" (fun a b c d -> a,b,c,d) in\n  Printf.printf \"%s\\n\" \n    (if a+b>c+d then \n       \"Left\"\n     else (\n       if a+b=c+d then\n         \"Balanced\"\n       else\n         \"Right\"\n     )\n    );\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA balance scale tips to the left if L>R, where L is the total weight of the masses on the left pan and R is the total weight of the masses on the right pan. Similarly, it balances if L=R, and tips to the right if L<R.\n\nTakahashi placed a mass of weight A and a mass of weight B on the left pan of a balance scale, and placed a mass of weight C and a mass of weight D on the right pan.\n\nPrint Left if the balance scale tips to the left; print Balanced if it balances; print Right if it tips to the right.\n\nConstraints\n\n1\\leq A,B,C,D \\leq 10\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint Left if the balance scale tips to the left; print Balanced if it balances; print Right if it tips to the right.\n\nSample Input 1\n\n3 8 7 1\n\nSample Output 1\n\nLeft\n\nThe total weight of the masses on the left pan is 11, and the total weight of the masses on the right pan is 8. Since 11>8, we should print Left.\n\nSample Input 2\n\n3 4 5 2\n\nSample Output 2\n\nBalanced\n\nThe total weight of the masses on the left pan is 7, and the total weight of the masses on the right pan is 7. Since 7=7, we should print Balanced.\n\nSample Input 3\n\n1 7 6 4\n\nSample Output 3\n\nRight\n\nThe total weight of the masses on the left pan is 8, and the total weight of the masses on the right pan is 10. Since 8<10, we should print Right.", "sample_input": "3 8 7 1\n"}, "reference_outputs": ["Left\n"], "source_document_id": "p03477", "source_text": "Score : 100 points\n\nProblem Statement\n\nA balance scale tips to the left if L>R, where L is the total weight of the masses on the left pan and R is the total weight of the masses on the right pan. Similarly, it balances if L=R, and tips to the right if L<R.\n\nTakahashi placed a mass of weight A and a mass of weight B on the left pan of a balance scale, and placed a mass of weight C and a mass of weight D on the right pan.\n\nPrint Left if the balance scale tips to the left; print Balanced if it balances; print Right if it tips to the right.\n\nConstraints\n\n1\\leq A,B,C,D \\leq 10\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint Left if the balance scale tips to the left; print Balanced if it balances; print Right if it tips to the right.\n\nSample Input 1\n\n3 8 7 1\n\nSample Output 1\n\nLeft\n\nThe total weight of the masses on the left pan is 11, and the total weight of the masses on the right pan is 8. Since 11>8, we should print Left.\n\nSample Input 2\n\n3 4 5 2\n\nSample Output 2\n\nBalanced\n\nThe total weight of the masses on the left pan is 7, and the total weight of the masses on the right pan is 7. Since 7=7, we should print Balanced.\n\nSample Input 3\n\n1 7 6 4\n\nSample Output 3\n\nRight\n\nThe total weight of the masses on the left pan is 8, and the total weight of the masses on the right pan is 10. Since 8<10, we should print Right.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 237, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s261808450", "group_id": "codeNet:p03479", "input_text": "let solve x y =\n  let rec aux x' c = if x' > y then c else aux (x' * 2) (c + 1) in\n  aux x 0\n\nlet () = Scanf.scanf \"%d %d\" solve |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1523609458, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s261808450.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s261808450", "user_id": "u987869509"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let solve x y =\n  let rec aux x' c = if x' > y then c else aux (x' * 2) (c + 1) in\n  aux x 0\n\nlet () = Scanf.scanf \"%d %d\" solve |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nAs a token of his gratitude, Takahashi has decided to give his mother an integer sequence.\nThe sequence A needs to satisfy the conditions below:\n\nA consists of integers between X and Y (inclusive).\n\nFor each 1\\leq i \\leq |A|-1, A_{i+1} is a multiple of A_i and strictly greater than A_i.\n\nFind the maximum possible length of the sequence.\n\nConstraints\n\n1 \\leq X \\leq Y \\leq 10^{18}\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the maximum possible length of the sequence.\n\nSample Input 1\n\n3 20\n\nSample Output 1\n\n3\n\nThe sequence 3,6,18 satisfies the conditions.\n\nSample Input 2\n\n25 100\n\nSample Output 2\n\n3\n\nSample Input 3\n\n314159265 358979323846264338\n\nSample Output 3\n\n31", "sample_input": "3 20\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03479", "source_text": "Score : 300 points\n\nProblem Statement\n\nAs a token of his gratitude, Takahashi has decided to give his mother an integer sequence.\nThe sequence A needs to satisfy the conditions below:\n\nA consists of integers between X and Y (inclusive).\n\nFor each 1\\leq i \\leq |A|-1, A_{i+1} is a multiple of A_i and strictly greater than A_i.\n\nFind the maximum possible length of the sequence.\n\nConstraints\n\n1 \\leq X \\leq Y \\leq 10^{18}\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the maximum possible length of the sequence.\n\nSample Input 1\n\n3 20\n\nSample Output 1\n\n3\n\nThe sequence 3,6,18 satisfies the conditions.\n\nSample Input 2\n\n25 100\n\nSample Output 2\n\n3\n\nSample Input 3\n\n314159265 358979323846264338\n\nSample Output 3\n\n31", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 152, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s501567647", "group_id": "codeNet:p03480", "input_text": "\nopen Scanf\nopen Printf\n\nlet id x = x\n\nlet rec for_iter a b f = if a >= b then [] else let x = f a in x :: for_iter (a+1) b f\n\nlet () =\n  let s = scanf \" %s\" id in\n  let s_len = String.length s in\n  for_iter 0 s_len (fun i ->\n    if s.[i] = '1' then max (min (i+1) (s_len-i)) (max i (s_len-1-i))\n    else s_len)\n  |> List.fold_left min s_len\n  |> printf \"%d\\n\"\n\n", "language": "OCaml", "metadata": {"date": 1519112962, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03480.html", "problem_id": "p03480", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03480/input.txt", "sample_output_relpath": "derived/input_output/data/p03480/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03480/OCaml/s501567647.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s501567647", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "\nopen Scanf\nopen Printf\n\nlet id x = x\n\nlet rec for_iter a b f = if a >= b then [] else let x = f a in x :: for_iter (a+1) b f\n\nlet () =\n  let s = scanf \" %s\" id in\n  let s_len = String.length s in\n  for_iter 0 s_len (fun i ->\n    if s.[i] = '1' then max (min (i+1) (s_len-i)) (max i (s_len-1-i))\n    else s_len)\n  |> List.fold_left min s_len\n  |> printf \"%d\\n\"\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S consisting of 0 and 1.\nFind the maximum integer K not greater than |S| such that we can turn all the characters of S into 0 by repeating the following operation some number of times.\n\nChoose a contiguous segment [l,r] in S whose length is at least K (that is, r-l+1\\geq K must be satisfied). For each integer i such that l\\leq i\\leq r, do the following: if S_i is 0, replace it with 1; if S_i is 1, replace it with 0.\n\nConstraints\n\n1\\leq |S|\\leq 10^5\n\nS_i(1\\leq i\\leq N) is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum integer K such that we can turn all the characters of S into 0 by repeating the operation some number of times.\n\nSample Input 1\n\n010\n\nSample Output 1\n\n2\n\nWe can turn all the characters of S into 0 by the following operations:\n\nPerform the operation on the segment S[1,3] with length 3. S is now 101.\n\nPerform the operation on the segment S[1,2] with length 2. S is now 011.\n\nPerform the operation on the segment S[2,3] with length 2. S is now 000.\n\nSample Input 2\n\n100000000\n\nSample Output 2\n\n8\n\nSample Input 3\n\n00001111\n\nSample Output 3\n\n4", "sample_input": "010\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03480", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S consisting of 0 and 1.\nFind the maximum integer K not greater than |S| such that we can turn all the characters of S into 0 by repeating the following operation some number of times.\n\nChoose a contiguous segment [l,r] in S whose length is at least K (that is, r-l+1\\geq K must be satisfied). For each integer i such that l\\leq i\\leq r, do the following: if S_i is 0, replace it with 1; if S_i is 1, replace it with 0.\n\nConstraints\n\n1\\leq |S|\\leq 10^5\n\nS_i(1\\leq i\\leq N) is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum integer K such that we can turn all the characters of S into 0 by repeating the operation some number of times.\n\nSample Input 1\n\n010\n\nSample Output 1\n\n2\n\nWe can turn all the characters of S into 0 by the following operations:\n\nPerform the operation on the segment S[1,3] with length 3. S is now 101.\n\nPerform the operation on the segment S[1,2] with length 2. S is now 011.\n\nPerform the operation on the segment S[2,3] with length 2. S is now 000.\n\nSample Input 2\n\n100000000\n\nSample Output 2\n\n8\n\nSample Input 3\n\n00001111\n\nSample Output 3\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 15, "memory_kb": 11136}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s669792858", "group_id": "codeNet:p03480", "input_text": "let pr x = print_endline @@ string_of_int x\n\nlet max (a : int) (b : int) =\n  if a > b then a else b\n\nlet min (a : int) (b : int) =\n  if a < b then a else b\n\nlet fold f init s =\n  let rec iter i res =\n    if i < 0 then res else iter (i - 1) (f res s.[i]) in\n  iter (String.length s - 1) init\n\nlet solve seq =\n  let len = String.length seq in\n  let (_,_,res) = fold\n                    (fun (cnt,pre,mv) x ->\n                      if x != pre then\n                        (cnt+1,x,min mv (max cnt (len - cnt)))\n                      else (cnt+1,x,mv))\n                    (0,seq.[0],len) seq in res\n\nlet () = input_line stdin\n         |> solve\n         |> pr", "language": "OCaml", "metadata": {"date": 1514135093, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03480.html", "problem_id": "p03480", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03480/input.txt", "sample_output_relpath": "derived/input_output/data/p03480/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03480/OCaml/s669792858.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s669792858", "user_id": "u459801769"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let pr x = print_endline @@ string_of_int x\n\nlet max (a : int) (b : int) =\n  if a > b then a else b\n\nlet min (a : int) (b : int) =\n  if a < b then a else b\n\nlet fold f init s =\n  let rec iter i res =\n    if i < 0 then res else iter (i - 1) (f res s.[i]) in\n  iter (String.length s - 1) init\n\nlet solve seq =\n  let len = String.length seq in\n  let (_,_,res) = fold\n                    (fun (cnt,pre,mv) x ->\n                      if x != pre then\n                        (cnt+1,x,min mv (max cnt (len - cnt)))\n                      else (cnt+1,x,mv))\n                    (0,seq.[0],len) seq in res\n\nlet () = input_line stdin\n         |> solve\n         |> pr", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S consisting of 0 and 1.\nFind the maximum integer K not greater than |S| such that we can turn all the characters of S into 0 by repeating the following operation some number of times.\n\nChoose a contiguous segment [l,r] in S whose length is at least K (that is, r-l+1\\geq K must be satisfied). For each integer i such that l\\leq i\\leq r, do the following: if S_i is 0, replace it with 1; if S_i is 1, replace it with 0.\n\nConstraints\n\n1\\leq |S|\\leq 10^5\n\nS_i(1\\leq i\\leq N) is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum integer K such that we can turn all the characters of S into 0 by repeating the operation some number of times.\n\nSample Input 1\n\n010\n\nSample Output 1\n\n2\n\nWe can turn all the characters of S into 0 by the following operations:\n\nPerform the operation on the segment S[1,3] with length 3. S is now 101.\n\nPerform the operation on the segment S[1,2] with length 2. S is now 011.\n\nPerform the operation on the segment S[2,3] with length 2. S is now 000.\n\nSample Input 2\n\n100000000\n\nSample Output 2\n\n8\n\nSample Input 3\n\n00001111\n\nSample Output 3\n\n4", "sample_input": "010\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03480", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S consisting of 0 and 1.\nFind the maximum integer K not greater than |S| such that we can turn all the characters of S into 0 by repeating the following operation some number of times.\n\nChoose a contiguous segment [l,r] in S whose length is at least K (that is, r-l+1\\geq K must be satisfied). For each integer i such that l\\leq i\\leq r, do the following: if S_i is 0, replace it with 1; if S_i is 1, replace it with 0.\n\nConstraints\n\n1\\leq |S|\\leq 10^5\n\nS_i(1\\leq i\\leq N) is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum integer K such that we can turn all the characters of S into 0 by repeating the operation some number of times.\n\nSample Input 1\n\n010\n\nSample Output 1\n\n2\n\nWe can turn all the characters of S into 0 by the following operations:\n\nPerform the operation on the segment S[1,3] with length 3. S is now 101.\n\nPerform the operation on the segment S[1,2] with length 2. S is now 011.\n\nPerform the operation on the segment S[2,3] with length 2. S is now 000.\n\nSample Input 2\n\n100000000\n\nSample Output 2\n\n8\n\nSample Input 3\n\n00001111\n\nSample Output 3\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 656, "cpu_time_ms": 4, "memory_kb": 4736}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s988680635", "group_id": "codeNet:p03485", "input_text": "open Core\n\ntype input = {a: int; b: int}\n\nlet i = Scanf.scanf \"%d %d\" (fun a b -> {a; b})\n\nlet mean = (i.a + i.b) / 2 + (i.a + i.b) mod 2\n\nlet () = Printf.printf \"%d\\n\" mean\n", "language": "OCaml", "metadata": {"date": 1592654709, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03485.html", "problem_id": "p03485", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03485/input.txt", "sample_output_relpath": "derived/input_output/data/p03485/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03485/OCaml/s988680635.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s988680635", "user_id": "u573744781"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Core\n\ntype input = {a: int; b: int}\n\nlet i = Scanf.scanf \"%d %d\" (fun a b -> {a; b})\n\nlet mean = (i.a + i.b) / 2 + (i.a + i.b) mod 2\n\nlet () = Printf.printf \"%d\\n\" mean\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two positive integers a and b.\nLet x be the average of a and b.\nPrint x rounded up to the nearest integer.\n\nConstraints\n\na and b are integers.\n\n1 \\leq a, b \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nPrint x rounded up to the nearest integer.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n2\n\nThe average of 1 and 3 is 2.0, and it will be rounded up to the nearest integer, 2.\n\nSample Input 2\n\n7 4\n\nSample Output 2\n\n6\n\nThe average of 7 and 4 is 5.5, and it will be rounded up to the nearest integer, 6.\n\nSample Input 3\n\n5 5\n\nSample Output 3\n\n5", "sample_input": "1 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03485", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two positive integers a and b.\nLet x be the average of a and b.\nPrint x rounded up to the nearest integer.\n\nConstraints\n\na and b are integers.\n\n1 \\leq a, b \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nPrint x rounded up to the nearest integer.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n2\n\nThe average of 1 and 3 is 2.0, and it will be rounded up to the nearest integer, 2.\n\nSample Input 2\n\n7 4\n\nSample Output 2\n\n6\n\nThe average of 7 and 4 is 5.5, and it will be rounded up to the nearest integer, 6.\n\nSample Input 3\n\n5 5\n\nSample Output 3\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 174, "cpu_time_ms": 8, "memory_kb": 5856}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s642113785", "group_id": "codeNet:p03485", "input_text": "let () =\n  Scanf.scanf \"%d %d\" (fun a b ->\n      let m = (a + b) / 2 in\n      (match (a + b) mod 2 with 0 -> m | 1 -> m + 1) |> Printf.printf \"%d\\n\" )\n", "language": "OCaml", "metadata": {"date": 1550712998, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03485.html", "problem_id": "p03485", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03485/input.txt", "sample_output_relpath": "derived/input_output/data/p03485/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03485/OCaml/s642113785.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s642113785", "user_id": "u406828576"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d\" (fun a b ->\n      let m = (a + b) / 2 in\n      (match (a + b) mod 2 with 0 -> m | 1 -> m + 1) |> Printf.printf \"%d\\n\" )\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two positive integers a and b.\nLet x be the average of a and b.\nPrint x rounded up to the nearest integer.\n\nConstraints\n\na and b are integers.\n\n1 \\leq a, b \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nPrint x rounded up to the nearest integer.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n2\n\nThe average of 1 and 3 is 2.0, and it will be rounded up to the nearest integer, 2.\n\nSample Input 2\n\n7 4\n\nSample Output 2\n\n6\n\nThe average of 7 and 4 is 5.5, and it will be rounded up to the nearest integer, 6.\n\nSample Input 3\n\n5 5\n\nSample Output 3\n\n5", "sample_input": "1 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03485", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two positive integers a and b.\nLet x be the average of a and b.\nPrint x rounded up to the nearest integer.\n\nConstraints\n\na and b are integers.\n\n1 \\leq a, b \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nPrint x rounded up to the nearest integer.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n2\n\nThe average of 1 and 3 is 2.0, and it will be rounded up to the nearest integer, 2.\n\nSample Input 2\n\n7 4\n\nSample Output 2\n\n6\n\nThe average of 7 and 4 is 5.5, and it will be rounded up to the nearest integer, 6.\n\nSample Input 3\n\n5 5\n\nSample Output 3\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 151, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s920503449", "group_id": "codeNet:p03486", "input_text": "let f g s = let a = String.(Array.init (length s) @@ get s) in Array.(sort g a; String.init (length a) @@ get a)\nlet s = f compare @@ read_line ()\nlet t = f (fun x y -> compare y x) @@ read_line ()\nlet _ = print_endline @@ if s < t then \"Yes\" else \"No\"", "language": "OCaml", "metadata": {"date": 1566955498, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03486.html", "problem_id": "p03486", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03486/input.txt", "sample_output_relpath": "derived/input_output/data/p03486/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03486/OCaml/s920503449.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s920503449", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let f g s = let a = String.(Array.init (length s) @@ get s) in Array.(sort g a; String.init (length a) @@ get a)\nlet s = f compare @@ read_line ()\nlet t = f (fun x y -> compare y x) @@ read_line ()\nlet _ = print_endline @@ if s < t then \"Yes\" else \"No\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given strings s and t, consisting of lowercase English letters.\nYou will create a string s' by freely rearranging the characters in s.\nYou will also create a string t' by freely rearranging the characters in t.\nDetermine whether it is possible to satisfy s' < t' for the lexicographic order.\n\nNotes\n\nFor a string a = a_1 a_2 ... a_N of length N and a string b = b_1 b_2 ... b_M of length M, we say a < b for the lexicographic order if either one of the following two conditions holds true:\n\nN < M and a_1 = b_1, a_2 = b_2, ..., a_N = b_N.\n\nThere exists i (1 \\leq i \\leq N, M) such that a_1 = b_1, a_2 = b_2, ..., a_{i - 1} = b_{i - 1} and a_i < b_i. Here, letters are compared using alphabetical order.\n\nFor example, xy < xya and atcoder < atlas.\n\nConstraints\n\nThe lengths of s and t are between 1 and 100 (inclusive).\n\ns and t consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nIf it is possible to satisfy s' < t', print Yes; if it is not, print No.\n\nSample Input 1\n\nyx\naxy\n\nSample Output 1\n\nYes\n\nWe can, for example, rearrange yx into xy and axy into yxa. Then, xy < yxa.\n\nSample Input 2\n\nratcode\natlas\n\nSample Output 2\n\nYes\n\nWe can, for example, rearrange ratcode into acdeort and atlas into tslaa. Then, acdeort < tslaa.\n\nSample Input 3\n\ncd\nabc\n\nSample Output 3\n\nNo\n\nNo matter how we rearrange cd and abc, we cannot achieve our objective.\n\nSample Input 4\n\nw\nww\n\nSample Output 4\n\nYes\n\nSample Input 5\n\nzzz\nzzz\n\nSample Output 5\n\nNo", "sample_input": "yx\naxy\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03486", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given strings s and t, consisting of lowercase English letters.\nYou will create a string s' by freely rearranging the characters in s.\nYou will also create a string t' by freely rearranging the characters in t.\nDetermine whether it is possible to satisfy s' < t' for the lexicographic order.\n\nNotes\n\nFor a string a = a_1 a_2 ... a_N of length N and a string b = b_1 b_2 ... b_M of length M, we say a < b for the lexicographic order if either one of the following two conditions holds true:\n\nN < M and a_1 = b_1, a_2 = b_2, ..., a_N = b_N.\n\nThere exists i (1 \\leq i \\leq N, M) such that a_1 = b_1, a_2 = b_2, ..., a_{i - 1} = b_{i - 1} and a_i < b_i. Here, letters are compared using alphabetical order.\n\nFor example, xy < xya and atcoder < atlas.\n\nConstraints\n\nThe lengths of s and t are between 1 and 100 (inclusive).\n\ns and t consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nIf it is possible to satisfy s' < t', print Yes; if it is not, print No.\n\nSample Input 1\n\nyx\naxy\n\nSample Output 1\n\nYes\n\nWe can, for example, rearrange yx into xy and axy into yxa. Then, xy < yxa.\n\nSample Input 2\n\nratcode\natlas\n\nSample Output 2\n\nYes\n\nWe can, for example, rearrange ratcode into acdeort and atlas into tslaa. Then, acdeort < tslaa.\n\nSample Input 3\n\ncd\nabc\n\nSample Output 3\n\nNo\n\nNo matter how we rearrange cd and abc, we cannot achieve our objective.\n\nSample Input 4\n\nw\nww\n\nSample Output 4\n\nYes\n\nSample Input 5\n\nzzz\nzzz\n\nSample Output 5\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 252, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s755080841", "group_id": "codeNet:p03486", "input_text": "let rec chars_of_string = function\n  | \"\" -> []\n  | str ->\n      String.get str 0 :: chars_of_string (String.sub str 1 (String.length str - 1))\n\nlet rec string_of_chars = function\n  | [] -> \"\"\n  | c :: tail -> String.make 1 (Char.chr c) ^ string_of_chars tail\n\n(* 比較関数を元に文字列中の文字を並び替える *)\nlet sort_chars f s =\n  string_of_chars @@\n    List.sort f @@\n      List.map Char.code @@ chars_of_string s\n\n(* 辞書順で最小の文字列に変換 *)\nlet to_min = sort_chars (-)\n\n(* 辞書順で最大の文字列に変換 *)\nlet to_max = sort_chars (fun a b -> b - a)\n\nlet () =\n  let (s, t) = Scanf.scanf \"%s\\n%s\" (fun s t -> (to_min s, to_max t)) in\n    print_string @@ if String.compare s t < 0 then \"Yes\" else \"No\"\n", "language": "OCaml", "metadata": {"date": 1559771833, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03486.html", "problem_id": "p03486", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03486/input.txt", "sample_output_relpath": "derived/input_output/data/p03486/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03486/OCaml/s755080841.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s755080841", "user_id": "u262569757"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let rec chars_of_string = function\n  | \"\" -> []\n  | str ->\n      String.get str 0 :: chars_of_string (String.sub str 1 (String.length str - 1))\n\nlet rec string_of_chars = function\n  | [] -> \"\"\n  | c :: tail -> String.make 1 (Char.chr c) ^ string_of_chars tail\n\n(* 比較関数を元に文字列中の文字を並び替える *)\nlet sort_chars f s =\n  string_of_chars @@\n    List.sort f @@\n      List.map Char.code @@ chars_of_string s\n\n(* 辞書順で最小の文字列に変換 *)\nlet to_min = sort_chars (-)\n\n(* 辞書順で最大の文字列に変換 *)\nlet to_max = sort_chars (fun a b -> b - a)\n\nlet () =\n  let (s, t) = Scanf.scanf \"%s\\n%s\" (fun s t -> (to_min s, to_max t)) in\n    print_string @@ if String.compare s t < 0 then \"Yes\" else \"No\"\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given strings s and t, consisting of lowercase English letters.\nYou will create a string s' by freely rearranging the characters in s.\nYou will also create a string t' by freely rearranging the characters in t.\nDetermine whether it is possible to satisfy s' < t' for the lexicographic order.\n\nNotes\n\nFor a string a = a_1 a_2 ... a_N of length N and a string b = b_1 b_2 ... b_M of length M, we say a < b for the lexicographic order if either one of the following two conditions holds true:\n\nN < M and a_1 = b_1, a_2 = b_2, ..., a_N = b_N.\n\nThere exists i (1 \\leq i \\leq N, M) such that a_1 = b_1, a_2 = b_2, ..., a_{i - 1} = b_{i - 1} and a_i < b_i. Here, letters are compared using alphabetical order.\n\nFor example, xy < xya and atcoder < atlas.\n\nConstraints\n\nThe lengths of s and t are between 1 and 100 (inclusive).\n\ns and t consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nIf it is possible to satisfy s' < t', print Yes; if it is not, print No.\n\nSample Input 1\n\nyx\naxy\n\nSample Output 1\n\nYes\n\nWe can, for example, rearrange yx into xy and axy into yxa. Then, xy < yxa.\n\nSample Input 2\n\nratcode\natlas\n\nSample Output 2\n\nYes\n\nWe can, for example, rearrange ratcode into acdeort and atlas into tslaa. Then, acdeort < tslaa.\n\nSample Input 3\n\ncd\nabc\n\nSample Output 3\n\nNo\n\nNo matter how we rearrange cd and abc, we cannot achieve our objective.\n\nSample Input 4\n\nw\nww\n\nSample Output 4\n\nYes\n\nSample Input 5\n\nzzz\nzzz\n\nSample Output 5\n\nNo", "sample_input": "yx\naxy\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03486", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given strings s and t, consisting of lowercase English letters.\nYou will create a string s' by freely rearranging the characters in s.\nYou will also create a string t' by freely rearranging the characters in t.\nDetermine whether it is possible to satisfy s' < t' for the lexicographic order.\n\nNotes\n\nFor a string a = a_1 a_2 ... a_N of length N and a string b = b_1 b_2 ... b_M of length M, we say a < b for the lexicographic order if either one of the following two conditions holds true:\n\nN < M and a_1 = b_1, a_2 = b_2, ..., a_N = b_N.\n\nThere exists i (1 \\leq i \\leq N, M) such that a_1 = b_1, a_2 = b_2, ..., a_{i - 1} = b_{i - 1} and a_i < b_i. Here, letters are compared using alphabetical order.\n\nFor example, xy < xya and atcoder < atlas.\n\nConstraints\n\nThe lengths of s and t are between 1 and 100 (inclusive).\n\ns and t consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nIf it is possible to satisfy s' < t', print Yes; if it is not, print No.\n\nSample Input 1\n\nyx\naxy\n\nSample Output 1\n\nYes\n\nWe can, for example, rearrange yx into xy and axy into yxa. Then, xy < yxa.\n\nSample Input 2\n\nratcode\natlas\n\nSample Output 2\n\nYes\n\nWe can, for example, rearrange ratcode into acdeort and atlas into tslaa. Then, acdeort < tslaa.\n\nSample Input 3\n\ncd\nabc\n\nSample Output 3\n\nNo\n\nNo matter how we rearrange cd and abc, we cannot achieve our objective.\n\nSample Input 4\n\nw\nww\n\nSample Output 4\n\nYes\n\nSample Input 5\n\nzzz\nzzz\n\nSample Output 5\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 750, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s371200468", "group_id": "codeNet:p03486", "input_text": "let () =\n  let s = read_line () in\n  let t = read_line () in\n  let sort s f =\n    let arr = Array.init (String.length s) (fun i -> String.make 1 s.[i]) in\n    Array.sort f arr ;\n    Array.fold_left (fun x y -> x ^ y) \"\" arr\n  in\n  let s = sort s compare in\n  let t = sort t (fun x y -> compare y x) in\n  (match s < t with true -> \"Yes\" | false -> \"No\") |> print_endline\n", "language": "OCaml", "metadata": {"date": 1550719053, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03486.html", "problem_id": "p03486", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03486/input.txt", "sample_output_relpath": "derived/input_output/data/p03486/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03486/OCaml/s371200468.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s371200468", "user_id": "u406828576"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n  let s = read_line () in\n  let t = read_line () in\n  let sort s f =\n    let arr = Array.init (String.length s) (fun i -> String.make 1 s.[i]) in\n    Array.sort f arr ;\n    Array.fold_left (fun x y -> x ^ y) \"\" arr\n  in\n  let s = sort s compare in\n  let t = sort t (fun x y -> compare y x) in\n  (match s < t with true -> \"Yes\" | false -> \"No\") |> print_endline\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given strings s and t, consisting of lowercase English letters.\nYou will create a string s' by freely rearranging the characters in s.\nYou will also create a string t' by freely rearranging the characters in t.\nDetermine whether it is possible to satisfy s' < t' for the lexicographic order.\n\nNotes\n\nFor a string a = a_1 a_2 ... a_N of length N and a string b = b_1 b_2 ... b_M of length M, we say a < b for the lexicographic order if either one of the following two conditions holds true:\n\nN < M and a_1 = b_1, a_2 = b_2, ..., a_N = b_N.\n\nThere exists i (1 \\leq i \\leq N, M) such that a_1 = b_1, a_2 = b_2, ..., a_{i - 1} = b_{i - 1} and a_i < b_i. Here, letters are compared using alphabetical order.\n\nFor example, xy < xya and atcoder < atlas.\n\nConstraints\n\nThe lengths of s and t are between 1 and 100 (inclusive).\n\ns and t consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nIf it is possible to satisfy s' < t', print Yes; if it is not, print No.\n\nSample Input 1\n\nyx\naxy\n\nSample Output 1\n\nYes\n\nWe can, for example, rearrange yx into xy and axy into yxa. Then, xy < yxa.\n\nSample Input 2\n\nratcode\natlas\n\nSample Output 2\n\nYes\n\nWe can, for example, rearrange ratcode into acdeort and atlas into tslaa. Then, acdeort < tslaa.\n\nSample Input 3\n\ncd\nabc\n\nSample Output 3\n\nNo\n\nNo matter how we rearrange cd and abc, we cannot achieve our objective.\n\nSample Input 4\n\nw\nww\n\nSample Output 4\n\nYes\n\nSample Input 5\n\nzzz\nzzz\n\nSample Output 5\n\nNo", "sample_input": "yx\naxy\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03486", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given strings s and t, consisting of lowercase English letters.\nYou will create a string s' by freely rearranging the characters in s.\nYou will also create a string t' by freely rearranging the characters in t.\nDetermine whether it is possible to satisfy s' < t' for the lexicographic order.\n\nNotes\n\nFor a string a = a_1 a_2 ... a_N of length N and a string b = b_1 b_2 ... b_M of length M, we say a < b for the lexicographic order if either one of the following two conditions holds true:\n\nN < M and a_1 = b_1, a_2 = b_2, ..., a_N = b_N.\n\nThere exists i (1 \\leq i \\leq N, M) such that a_1 = b_1, a_2 = b_2, ..., a_{i - 1} = b_{i - 1} and a_i < b_i. Here, letters are compared using alphabetical order.\n\nFor example, xy < xya and atcoder < atlas.\n\nConstraints\n\nThe lengths of s and t are between 1 and 100 (inclusive).\n\ns and t consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nt\n\nOutput\n\nIf it is possible to satisfy s' < t', print Yes; if it is not, print No.\n\nSample Input 1\n\nyx\naxy\n\nSample Output 1\n\nYes\n\nWe can, for example, rearrange yx into xy and axy into yxa. Then, xy < yxa.\n\nSample Input 2\n\nratcode\natlas\n\nSample Output 2\n\nYes\n\nWe can, for example, rearrange ratcode into acdeort and atlas into tslaa. Then, acdeort < tslaa.\n\nSample Input 3\n\ncd\nabc\n\nSample Output 3\n\nNo\n\nNo matter how we rearrange cd and abc, we cannot achieve our objective.\n\nSample Input 4\n\nw\nww\n\nSample Output 4\n\nYes\n\nSample Input 5\n\nzzz\nzzz\n\nSample Output 5\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 370, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s445924931", "group_id": "codeNet:p03487", "input_text": "let id x = x\nlet n = Scanf.scanf \"%d\\n\" id\nlet h = Hashtbl.create n\nlet ans = ref 0\n\nlet () =\n  for i = 1 to n do\n    let a = Scanf.scanf \"%d \" id in\n    let v = try Hashtbl.find h a with _ -> 0 in\n    Hashtbl.replace h a (v + 1)\n  done ;\n  Hashtbl.iter\n    (fun k v ->\n      if v < k then ans := !ans + v else if v > k then ans := !ans + (v - k))\n    h ;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1523614148, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03487.html", "problem_id": "p03487", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03487/input.txt", "sample_output_relpath": "derived/input_output/data/p03487/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03487/OCaml/s445924931.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s445924931", "user_id": "u987869509"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let id x = x\nlet n = Scanf.scanf \"%d\\n\" id\nlet h = Hashtbl.create n\nlet ans = ref 0\n\nlet () =\n  for i = 1 to n do\n    let a = Scanf.scanf \"%d \" id in\n    let v = try Hashtbl.find h a with _ -> 0 in\n    Hashtbl.replace h a (v + 1)\n  done ;\n  Hashtbl.iter\n    (fun k v ->\n      if v < k then ans := !ans + v else if v > k then ans := !ans + (v - k))\n    h ;\n  Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of positive integers of length N, a = (a_1, a_2, ..., a_N).\nYour objective is to remove some of the elements in a so that a will be a good sequence.\n\nHere, an sequence b is a good sequence when the following condition holds true:\n\nFor each element x in b, the value x occurs exactly x times in b.\n\nFor example, (3, 3, 3), (4, 2, 4, 1, 4, 2, 4) and () (an empty sequence) are good sequences, while (3, 3, 3, 3) and (2, 4, 1, 4, 2) are not.\n\nFind the minimum number of elements that needs to be removed so that a will be a good sequence.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\na_i is an integer.\n\n1 \\leq a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum number of elements that needs to be removed so that a will be a good sequence.\n\nSample Input 1\n\n4\n3 3 3 3\n\nSample Output 1\n\n1\n\nWe can, for example, remove one occurrence of 3. Then, (3, 3, 3) is a good sequence.\n\nSample Input 2\n\n5\n2 4 1 4 2\n\nSample Output 2\n\n2\n\nWe can, for example, remove two occurrences of 4. Then, (2, 1, 2) is a good sequence.\n\nSample Input 3\n\n6\n1 2 2 3 3 3\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\n1\n\nRemove one occurrence of 10^9. Then, () is a good sequence.\n\nSample Input 5\n\n8\n2 7 1 8 2 8 1 8\n\nSample Output 5\n\n5", "sample_input": "4\n3 3 3 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03487", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of positive integers of length N, a = (a_1, a_2, ..., a_N).\nYour objective is to remove some of the elements in a so that a will be a good sequence.\n\nHere, an sequence b is a good sequence when the following condition holds true:\n\nFor each element x in b, the value x occurs exactly x times in b.\n\nFor example, (3, 3, 3), (4, 2, 4, 1, 4, 2, 4) and () (an empty sequence) are good sequences, while (3, 3, 3, 3) and (2, 4, 1, 4, 2) are not.\n\nFind the minimum number of elements that needs to be removed so that a will be a good sequence.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\na_i is an integer.\n\n1 \\leq a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum number of elements that needs to be removed so that a will be a good sequence.\n\nSample Input 1\n\n4\n3 3 3 3\n\nSample Output 1\n\n1\n\nWe can, for example, remove one occurrence of 3. Then, (3, 3, 3) is a good sequence.\n\nSample Input 2\n\n5\n2 4 1 4 2\n\nSample Output 2\n\n2\n\nWe can, for example, remove two occurrences of 4. Then, (2, 1, 2) is a good sequence.\n\nSample Input 3\n\n6\n1 2 2 3 3 3\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\n1\n\nRemove one occurrence of 10^9. Then, () is a good sequence.\n\nSample Input 5\n\n8\n2 7 1 8 2 8 1 8\n\nSample Output 5\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 49, "memory_kb": 7040}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s732605904", "group_id": "codeNet:p03487", "input_text": "open Batteries\n\nmodule Counter = Map.Make(Int)\n\nlet solve xs =\n  let update = function\n    | None -> Some 1\n    | Some i -> Some (i + 1)\n  in let rec count counter = function\n    | [] -> counter\n    | h :: t -> Counter.modify_opt h update counter\n  in let count_dict = count Counter.empty xs\n  in let n_reduce i =\n    let ni = Counter.find i count_dict in\n    if i < ni then ni - i\n    else if i = ni then 0\n    else ni\n  in BatEnum.map n_reduce (Counter.keys count_dict) |> BatEnum.sum |> print_int\n\nlet () =\n  let _ = read_int () in\n  let xs = read_line () |> String.split_on_char ' ' |> List.map int_of_string in\n  solve xs\n", "language": "OCaml", "metadata": {"date": 1513483847, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03487.html", "problem_id": "p03487", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03487/input.txt", "sample_output_relpath": "derived/input_output/data/p03487/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03487/OCaml/s732605904.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s732605904", "user_id": "u508294160"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Batteries\n\nmodule Counter = Map.Make(Int)\n\nlet solve xs =\n  let update = function\n    | None -> Some 1\n    | Some i -> Some (i + 1)\n  in let rec count counter = function\n    | [] -> counter\n    | h :: t -> Counter.modify_opt h update counter\n  in let count_dict = count Counter.empty xs\n  in let n_reduce i =\n    let ni = Counter.find i count_dict in\n    if i < ni then ni - i\n    else if i = ni then 0\n    else ni\n  in BatEnum.map n_reduce (Counter.keys count_dict) |> BatEnum.sum |> print_int\n\nlet () =\n  let _ = read_int () in\n  let xs = read_line () |> String.split_on_char ' ' |> List.map int_of_string in\n  solve xs\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of positive integers of length N, a = (a_1, a_2, ..., a_N).\nYour objective is to remove some of the elements in a so that a will be a good sequence.\n\nHere, an sequence b is a good sequence when the following condition holds true:\n\nFor each element x in b, the value x occurs exactly x times in b.\n\nFor example, (3, 3, 3), (4, 2, 4, 1, 4, 2, 4) and () (an empty sequence) are good sequences, while (3, 3, 3, 3) and (2, 4, 1, 4, 2) are not.\n\nFind the minimum number of elements that needs to be removed so that a will be a good sequence.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\na_i is an integer.\n\n1 \\leq a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum number of elements that needs to be removed so that a will be a good sequence.\n\nSample Input 1\n\n4\n3 3 3 3\n\nSample Output 1\n\n1\n\nWe can, for example, remove one occurrence of 3. Then, (3, 3, 3) is a good sequence.\n\nSample Input 2\n\n5\n2 4 1 4 2\n\nSample Output 2\n\n2\n\nWe can, for example, remove two occurrences of 4. Then, (2, 1, 2) is a good sequence.\n\nSample Input 3\n\n6\n1 2 2 3 3 3\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\n1\n\nRemove one occurrence of 10^9. Then, () is a good sequence.\n\nSample Input 5\n\n8\n2 7 1 8 2 8 1 8\n\nSample Output 5\n\n5", "sample_input": "4\n3 3 3 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03487", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of positive integers of length N, a = (a_1, a_2, ..., a_N).\nYour objective is to remove some of the elements in a so that a will be a good sequence.\n\nHere, an sequence b is a good sequence when the following condition holds true:\n\nFor each element x in b, the value x occurs exactly x times in b.\n\nFor example, (3, 3, 3), (4, 2, 4, 1, 4, 2, 4) and () (an empty sequence) are good sequences, while (3, 3, 3, 3) and (2, 4, 1, 4, 2) are not.\n\nFind the minimum number of elements that needs to be removed so that a will be a good sequence.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\na_i is an integer.\n\n1 \\leq a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum number of elements that needs to be removed so that a will be a good sequence.\n\nSample Input 1\n\n4\n3 3 3 3\n\nSample Output 1\n\n1\n\nWe can, for example, remove one occurrence of 3. Then, (3, 3, 3) is a good sequence.\n\nSample Input 2\n\n5\n2 4 1 4 2\n\nSample Output 2\n\n2\n\nWe can, for example, remove two occurrences of 4. Then, (2, 1, 2) is a good sequence.\n\nSample Input 3\n\n6\n1 2 2 3 3 3\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\n1\n\nRemove one occurrence of 10^9. Then, () is a good sequence.\n\nSample Input 5\n\n8\n2 7 1 8 2 8 1 8\n\nSample Output 5\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 25, "memory_kb": 11264}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s679548255", "group_id": "codeNet:p03488", "input_text": "open Batteries\n\ntype rot_t = Left | Down | Right | Up\n\nlet rotate_left = function\n  | Left -> Down\n  | Down -> Right\n  | Right -> Up\n  | Up -> Left\n\nlet rotate_right = function\n  | Left -> Up\n  | Up -> Right\n  | Right -> Down\n  | Down -> Left\n\nlet move (x, y) = function\n  | Left -> (x-1, y)\n  | Down -> (x, y-1)\n  | Right -> (x+1, y)\n  | Up -> (x, y+1)\n\nlet solve s x y =\n  let instrs = String.to_list s in\n  let rec go (ix, iy) rot m = function\n    | [] -> (ix = x) && (iy = y)\n    | 'F' :: rest ->\n      if (abs (x - ix) + abs (y - iy)) > m then false\n      else go (move (ix, iy) rot) rot (m-1) rest\n    | 'T' :: rest ->\n      (go (ix, iy) (rotate_left rot) (m-1) rest)\n      || (go (ix, iy) (rotate_right rot) (m-1) rest)\n  in\n  print_string @@ if go (0, 0) Right (String.length s) instrs then \"Yes\" else \"No\"\n\nlet () = Scanf.scanf \"%s\\n%d %d\" solve", "language": "OCaml", "metadata": {"date": 1513481758, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03488.html", "problem_id": "p03488", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03488/input.txt", "sample_output_relpath": "derived/input_output/data/p03488/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03488/OCaml/s679548255.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s679548255", "user_id": "u508294160"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Batteries\n\ntype rot_t = Left | Down | Right | Up\n\nlet rotate_left = function\n  | Left -> Down\n  | Down -> Right\n  | Right -> Up\n  | Up -> Left\n\nlet rotate_right = function\n  | Left -> Up\n  | Up -> Right\n  | Right -> Down\n  | Down -> Left\n\nlet move (x, y) = function\n  | Left -> (x-1, y)\n  | Down -> (x, y-1)\n  | Right -> (x+1, y)\n  | Up -> (x, y+1)\n\nlet solve s x y =\n  let instrs = String.to_list s in\n  let rec go (ix, iy) rot m = function\n    | [] -> (ix = x) && (iy = y)\n    | 'F' :: rest ->\n      if (abs (x - ix) + abs (y - iy)) > m then false\n      else go (move (ix, iy) rot) rot (m-1) rest\n    | 'T' :: rest ->\n      (go (ix, iy) (rotate_left rot) (m-1) rest)\n      || (go (ix, iy) (rotate_right rot) (m-1) rest)\n  in\n  print_string @@ if go (0, 0) Right (String.length s) instrs then \"Yes\" else \"No\"\n\nlet () = Scanf.scanf \"%s\\n%d %d\" solve", "problem_context": "Score : 500 points\n\nProblem Statement\n\nA robot is put at the origin in a two-dimensional plane.\nInitially, the robot is facing in the positive x-axis direction.\n\nThis robot will be given an instruction sequence s.\ns consists of the following two kinds of letters, and will be executed in order from front to back.\n\nF : Move in the current direction by distance 1.\n\nT : Turn 90 degrees, either clockwise or counterclockwise.\n\nThe objective of the robot is to be at coordinates (x, y) after all the instructions are executed.\nDetermine whether this objective is achievable.\n\nConstraints\n\ns consists of F and T.\n\n1 \\leq |s| \\leq 8 000\n\nx and y are integers.\n\n|x|, |y| \\leq |s|\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nx y\n\nOutput\n\nIf the objective is achievable, print Yes; if it is not, print No.\n\nSample Input 1\n\nFTFFTFFF\n4 2\n\nSample Output 1\n\nYes\n\nThe objective can be achieved by, for example, turning counterclockwise in the first T and turning clockwise in the second T.\n\nSample Input 2\n\nFTFFTFFF\n-2 -2\n\nSample Output 2\n\nYes\n\nThe objective can be achieved by, for example, turning clockwise in the first T and turning clockwise in the second T.\n\nSample Input 3\n\nFF\n1 0\n\nSample Output 3\n\nNo\n\nSample Input 4\n\nTF\n1 0\n\nSample Output 4\n\nNo\n\nSample Input 5\n\nFFTTFF\n0 0\n\nSample Output 5\n\nYes\n\nThe objective can be achieved by, for example, turning counterclockwise in the first T and turning counterclockwise in the second T.\n\nSample Input 6\n\nTTTT\n1 0\n\nSample Output 6\n\nNo", "sample_input": "FTFFTFFF\n4 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03488", "source_text": "Score : 500 points\n\nProblem Statement\n\nA robot is put at the origin in a two-dimensional plane.\nInitially, the robot is facing in the positive x-axis direction.\n\nThis robot will be given an instruction sequence s.\ns consists of the following two kinds of letters, and will be executed in order from front to back.\n\nF : Move in the current direction by distance 1.\n\nT : Turn 90 degrees, either clockwise or counterclockwise.\n\nThe objective of the robot is to be at coordinates (x, y) after all the instructions are executed.\nDetermine whether this objective is achievable.\n\nConstraints\n\ns consists of F and T.\n\n1 \\leq |s| \\leq 8 000\n\nx and y are integers.\n\n|x|, |y| \\leq |s|\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nx y\n\nOutput\n\nIf the objective is achievable, print Yes; if it is not, print No.\n\nSample Input 1\n\nFTFFTFFF\n4 2\n\nSample Output 1\n\nYes\n\nThe objective can be achieved by, for example, turning counterclockwise in the first T and turning clockwise in the second T.\n\nSample Input 2\n\nFTFFTFFF\n-2 -2\n\nSample Output 2\n\nYes\n\nThe objective can be achieved by, for example, turning clockwise in the first T and turning clockwise in the second T.\n\nSample Input 3\n\nFF\n1 0\n\nSample Output 3\n\nNo\n\nSample Input 4\n\nTF\n1 0\n\nSample Output 4\n\nNo\n\nSample Input 5\n\nFFTTFF\n0 0\n\nSample Output 5\n\nYes\n\nThe objective can be achieved by, for example, turning counterclockwise in the first T and turning counterclockwise in the second T.\n\nSample Input 6\n\nTTTT\n1 0\n\nSample Output 6\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 854, "cpu_time_ms": 2104, "memory_kb": 5632}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s102124325", "group_id": "codeNet:p03488", "input_text": "open Batteries\n\ntype rot_t = Left | Down | Right | Up\n\nlet rotate_left = function\n  | Left -> Down\n  | Down -> Right\n  | Right -> Up\n  | Up -> Left\n\nlet rotate_right = function\n  | Left -> Up\n  | Up -> Right\n  | Right -> Down\n  | Down -> Left\n\nlet move (x, y) = function\n  | Left -> (x-1, y)\n  | Down -> (x, y-1)\n  | Right -> (x+1, y)\n  | Up -> (x, y+1)\n\nlet solve s x y =\n  let instrs = String.to_list s in\n  let rec go (ix, iy) rot = function\n    | [] -> (ix = x) && (iy = y)\n    | 'F' :: rest -> go (move (ix, iy) rot) rot rest\n    | 'T' :: rest ->\n      (go (ix, iy) (rotate_left rot) rest) || (go (ix, iy) (rotate_right rot) rest)\n  in\n  print_string @@ if go (0, 0) Right instrs then \"Yes\" else \"No\"\n\nlet () = Scanf.scanf \"%s\\n%d %d\" solve", "language": "OCaml", "metadata": {"date": 1513480835, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03488.html", "problem_id": "p03488", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03488/input.txt", "sample_output_relpath": "derived/input_output/data/p03488/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03488/OCaml/s102124325.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s102124325", "user_id": "u508294160"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Batteries\n\ntype rot_t = Left | Down | Right | Up\n\nlet rotate_left = function\n  | Left -> Down\n  | Down -> Right\n  | Right -> Up\n  | Up -> Left\n\nlet rotate_right = function\n  | Left -> Up\n  | Up -> Right\n  | Right -> Down\n  | Down -> Left\n\nlet move (x, y) = function\n  | Left -> (x-1, y)\n  | Down -> (x, y-1)\n  | Right -> (x+1, y)\n  | Up -> (x, y+1)\n\nlet solve s x y =\n  let instrs = String.to_list s in\n  let rec go (ix, iy) rot = function\n    | [] -> (ix = x) && (iy = y)\n    | 'F' :: rest -> go (move (ix, iy) rot) rot rest\n    | 'T' :: rest ->\n      (go (ix, iy) (rotate_left rot) rest) || (go (ix, iy) (rotate_right rot) rest)\n  in\n  print_string @@ if go (0, 0) Right instrs then \"Yes\" else \"No\"\n\nlet () = Scanf.scanf \"%s\\n%d %d\" solve", "problem_context": "Score : 500 points\n\nProblem Statement\n\nA robot is put at the origin in a two-dimensional plane.\nInitially, the robot is facing in the positive x-axis direction.\n\nThis robot will be given an instruction sequence s.\ns consists of the following two kinds of letters, and will be executed in order from front to back.\n\nF : Move in the current direction by distance 1.\n\nT : Turn 90 degrees, either clockwise or counterclockwise.\n\nThe objective of the robot is to be at coordinates (x, y) after all the instructions are executed.\nDetermine whether this objective is achievable.\n\nConstraints\n\ns consists of F and T.\n\n1 \\leq |s| \\leq 8 000\n\nx and y are integers.\n\n|x|, |y| \\leq |s|\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nx y\n\nOutput\n\nIf the objective is achievable, print Yes; if it is not, print No.\n\nSample Input 1\n\nFTFFTFFF\n4 2\n\nSample Output 1\n\nYes\n\nThe objective can be achieved by, for example, turning counterclockwise in the first T and turning clockwise in the second T.\n\nSample Input 2\n\nFTFFTFFF\n-2 -2\n\nSample Output 2\n\nYes\n\nThe objective can be achieved by, for example, turning clockwise in the first T and turning clockwise in the second T.\n\nSample Input 3\n\nFF\n1 0\n\nSample Output 3\n\nNo\n\nSample Input 4\n\nTF\n1 0\n\nSample Output 4\n\nNo\n\nSample Input 5\n\nFFTTFF\n0 0\n\nSample Output 5\n\nYes\n\nThe objective can be achieved by, for example, turning counterclockwise in the first T and turning counterclockwise in the second T.\n\nSample Input 6\n\nTTTT\n1 0\n\nSample Output 6\n\nNo", "sample_input": "FTFFTFFF\n4 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03488", "source_text": "Score : 500 points\n\nProblem Statement\n\nA robot is put at the origin in a two-dimensional plane.\nInitially, the robot is facing in the positive x-axis direction.\n\nThis robot will be given an instruction sequence s.\ns consists of the following two kinds of letters, and will be executed in order from front to back.\n\nF : Move in the current direction by distance 1.\n\nT : Turn 90 degrees, either clockwise or counterclockwise.\n\nThe objective of the robot is to be at coordinates (x, y) after all the instructions are executed.\nDetermine whether this objective is achievable.\n\nConstraints\n\ns consists of F and T.\n\n1 \\leq |s| \\leq 8 000\n\nx and y are integers.\n\n|x|, |y| \\leq |s|\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nx y\n\nOutput\n\nIf the objective is achievable, print Yes; if it is not, print No.\n\nSample Input 1\n\nFTFFTFFF\n4 2\n\nSample Output 1\n\nYes\n\nThe objective can be achieved by, for example, turning counterclockwise in the first T and turning clockwise in the second T.\n\nSample Input 2\n\nFTFFTFFF\n-2 -2\n\nSample Output 2\n\nYes\n\nThe objective can be achieved by, for example, turning clockwise in the first T and turning clockwise in the second T.\n\nSample Input 3\n\nFF\n1 0\n\nSample Output 3\n\nNo\n\nSample Input 4\n\nTF\n1 0\n\nSample Output 4\n\nNo\n\nSample Input 5\n\nFFTTFF\n0 0\n\nSample Output 5\n\nYes\n\nThe objective can be achieved by, for example, turning counterclockwise in the first T and turning counterclockwise in the second T.\n\nSample Input 6\n\nTTTT\n1 0\n\nSample Output 6\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 745, "cpu_time_ms": 2104, "memory_kb": 5632}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s791136711", "group_id": "codeNet:p03494", "input_text": "let input_int_array n =\n  Array.init n (fun _ -> Scanf.scanf \"%d \" (fun v -> v))\n\nlet () =\n  let n = read_int ()\n  in let ar = input_int_array n\n  in let min_k = Array.fold_left (fun u v ->\n    let rec f0 p =\n      if p mod 2 = 1 then 0 else (1 + f0 (p/2))\n    in let k = f0 v\n    in min u k\n  ) max_int ar\n  in min_k |> string_of_int |> print_endline", "language": "OCaml", "metadata": {"date": 1530404262, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s791136711.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s791136711", "user_id": "u481480055"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let input_int_array n =\n  Array.init n (fun _ -> Scanf.scanf \"%d \" (fun v -> v))\n\nlet () =\n  let n = read_int ()\n  in let ar = input_int_array n\n  in let min_k = Array.fold_left (fun u v ->\n    let rec f0 p =\n      if p mod 2 = 1 then 0 else (1 + f0 (p/2))\n    in let k = f0 v\n    in min u k\n  ) max_int ar\n  in min_k |> string_of_int |> print_endline", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N positive integers written on a blackboard: A_1, ..., A_N.\n\nSnuke can perform the following operation when all integers on the blackboard are even:\n\nReplace each integer X on the blackboard by X divided by 2.\n\nFind the maximum possible number of operations that Snuke can perform.\n\nConstraints\n\n1 \\leq N \\leq 200\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible number of operations that Snuke can perform.\n\nSample Input 1\n\n3\n8 12 40\n\nSample Output 1\n\n2\n\nInitially, [8, 12, 40] are written on the blackboard.\nSince all those integers are even, Snuke can perform the operation.\n\nAfter the operation is performed once, [4, 6, 20] are written on the blackboard.\nSince all those integers are again even, he can perform the operation.\n\nAfter the operation is performed twice, [2, 3, 10] are written on the blackboard.\nNow, there is an odd number 3 on the blackboard, so he cannot perform the operation any more.\n\nThus, Snuke can perform the operation at most twice.\n\nSample Input 2\n\n4\n5 6 8 10\n\nSample Output 2\n\n0\n\nSince there is an odd number 5 on the blackboard already in the beginning, Snuke cannot perform the operation at all.\n\nSample Input 3\n\n6\n382253568 723152896 37802240 379425024 404894720 471526144\n\nSample Output 3\n\n8", "sample_input": "3\n8 12 40\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03494", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N positive integers written on a blackboard: A_1, ..., A_N.\n\nSnuke can perform the following operation when all integers on the blackboard are even:\n\nReplace each integer X on the blackboard by X divided by 2.\n\nFind the maximum possible number of operations that Snuke can perform.\n\nConstraints\n\n1 \\leq N \\leq 200\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible number of operations that Snuke can perform.\n\nSample Input 1\n\n3\n8 12 40\n\nSample Output 1\n\n2\n\nInitially, [8, 12, 40] are written on the blackboard.\nSince all those integers are even, Snuke can perform the operation.\n\nAfter the operation is performed once, [4, 6, 20] are written on the blackboard.\nSince all those integers are again even, he can perform the operation.\n\nAfter the operation is performed twice, [2, 3, 10] are written on the blackboard.\nNow, there is an odd number 3 on the blackboard, so he cannot perform the operation any more.\n\nThus, Snuke can perform the operation at most twice.\n\nSample Input 2\n\n4\n5 6 8 10\n\nSample Output 2\n\n0\n\nSince there is an odd number 5 on the blackboard already in the beginning, Snuke cannot perform the operation at all.\n\nSample Input 3\n\n6\n382253568 723152896 37802240 379425024 404894720 471526144\n\nSample Output 3\n\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 351, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s420287166", "group_id": "codeNet:p03495", "input_text": "open Hashtbl\n\nlet id x = x\nlet n = Scanf.scanf \"%d \" id\nlet h = create n\nlet k = Scanf.scanf \"%d\\n\" id\nlet ans = ref 0\n\nlet find_min () =\n  fold\n    (fun k v tmp ->\n       let k', v' = tmp in\n       if v < v' then (k, v) else tmp)\n    h (0, max_int)\n\n\nlet inith () =\n  let rec f i =\n    if i <= n then\n      let a = Scanf.scanf \"%d \" id in\n      let v = try find h a with _ -> 0 in\n      replace h a (v + 1) ;\n      f (i + 1)\n  in\n  f 1\n\n\nlet () =\n  inith () ;\n  let len = ref (length h) in\n  while k < !len do\n    let v = find_min () in\n    remove h (fst v) ;\n    ans := !ans + snd v\n  done ;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1523653077, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03495.html", "problem_id": "p03495", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03495/input.txt", "sample_output_relpath": "derived/input_output/data/p03495/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03495/OCaml/s420287166.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s420287166", "user_id": "u987869509"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Hashtbl\n\nlet id x = x\nlet n = Scanf.scanf \"%d \" id\nlet h = create n\nlet k = Scanf.scanf \"%d\\n\" id\nlet ans = ref 0\n\nlet find_min () =\n  fold\n    (fun k v tmp ->\n       let k', v' = tmp in\n       if v < v' then (k, v) else tmp)\n    h (0, max_int)\n\n\nlet inith () =\n  let rec f i =\n    if i <= n then\n      let a = Scanf.scanf \"%d \" id in\n      let v = try find h a with _ -> 0 in\n      replace h a (v + 1) ;\n      f (i + 1)\n  in\n  f 1\n\n\nlet () =\n  inith () ;\n  let len = ref (length h) in\n  while k < !len do\n    let v = find_min () in\n    remove h (fst v) ;\n    ans := !ans + snd v\n  done ;\n  Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi has N balls. Initially, an integer A_i is written on the i-th ball.\n\nHe would like to rewrite the integer on some balls so that there are at most K different integers written on the N balls.\n\nFind the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 200000\n\n1 \\leq A_i \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nSample Input 1\n\n5 2\n1 1 2 2 5\n\nSample Output 1\n\n1\n\nFor example, if we rewrite the integer on the fifth ball to 2, there are two different integers written on the balls: 1 and 2.\nOn the other hand, it is not possible to rewrite the integers on zero balls so that there are at most two different integers written on the balls, so we should print 1.\n\nSample Input 2\n\n4 4\n1 1 2 2\n\nSample Output 2\n\n0\n\nAlready in the beginning, there are two different integers written on the balls, so we do not need to rewrite anything.\n\nSample Input 3\n\n10 3\n5 1 3 2 4 1 1 2 3 4\n\nSample Output 3\n\n3", "sample_input": "5 2\n1 1 2 2 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03495", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi has N balls. Initially, an integer A_i is written on the i-th ball.\n\nHe would like to rewrite the integer on some balls so that there are at most K different integers written on the N balls.\n\nFind the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 200000\n\n1 \\leq A_i \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nSample Input 1\n\n5 2\n1 1 2 2 5\n\nSample Output 1\n\n1\n\nFor example, if we rewrite the integer on the fifth ball to 2, there are two different integers written on the balls: 1 and 2.\nOn the other hand, it is not possible to rewrite the integers on zero balls so that there are at most two different integers written on the balls, so we should print 1.\n\nSample Input 2\n\n4 4\n1 1 2 2\n\nSample Output 2\n\n0\n\nAlready in the beginning, there are two different integers written on the balls, so we do not need to rewrite anything.\n\nSample Input 3\n\n10 3\n5 1 3 2 4 1 1 2 3 4\n\nSample Output 3\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 621, "cpu_time_ms": 2104, "memory_kb": 11520}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s031776154", "group_id": "codeNet:p03495", "input_text": "open Hashtbl\n\nlet id x = x\nlet n = Scanf.scanf \"%d \" id\nlet h = create n\nlet k = Scanf.scanf \"%d\\n\" id\nlet ans = ref 0\n\nlet find_min () =\n  fold\n    (fun k v tmp ->\n       let k', v' = tmp in\n       if v < v' then (k, v) else tmp)\n    h (0, max_int)\n\n\nlet inith () =\n  let rec f i =\n    if i <= n then\n      let a = Scanf.scanf \"%d \" id in\n      let v = try find h a with _ -> 0 in\n      replace h a (v + 1) ;\n      f (i + 1)\n  in\n  f 1\n\n\nlet () =\n  inith () ;\n  while k < length h do\n    let v = find_min () in\n    remove h (fst v) ;\n    ans := !ans + snd v\n  done ;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1523652966, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03495.html", "problem_id": "p03495", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03495/input.txt", "sample_output_relpath": "derived/input_output/data/p03495/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03495/OCaml/s031776154.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s031776154", "user_id": "u987869509"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Hashtbl\n\nlet id x = x\nlet n = Scanf.scanf \"%d \" id\nlet h = create n\nlet k = Scanf.scanf \"%d\\n\" id\nlet ans = ref 0\n\nlet find_min () =\n  fold\n    (fun k v tmp ->\n       let k', v' = tmp in\n       if v < v' then (k, v) else tmp)\n    h (0, max_int)\n\n\nlet inith () =\n  let rec f i =\n    if i <= n then\n      let a = Scanf.scanf \"%d \" id in\n      let v = try find h a with _ -> 0 in\n      replace h a (v + 1) ;\n      f (i + 1)\n  in\n  f 1\n\n\nlet () =\n  inith () ;\n  while k < length h do\n    let v = find_min () in\n    remove h (fst v) ;\n    ans := !ans + snd v\n  done ;\n  Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi has N balls. Initially, an integer A_i is written on the i-th ball.\n\nHe would like to rewrite the integer on some balls so that there are at most K different integers written on the N balls.\n\nFind the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 200000\n\n1 \\leq A_i \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nSample Input 1\n\n5 2\n1 1 2 2 5\n\nSample Output 1\n\n1\n\nFor example, if we rewrite the integer on the fifth ball to 2, there are two different integers written on the balls: 1 and 2.\nOn the other hand, it is not possible to rewrite the integers on zero balls so that there are at most two different integers written on the balls, so we should print 1.\n\nSample Input 2\n\n4 4\n1 1 2 2\n\nSample Output 2\n\n0\n\nAlready in the beginning, there are two different integers written on the balls, so we do not need to rewrite anything.\n\nSample Input 3\n\n10 3\n5 1 3 2 4 1 1 2 3 4\n\nSample Output 3\n\n3", "sample_input": "5 2\n1 1 2 2 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03495", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi has N balls. Initially, an integer A_i is written on the i-th ball.\n\nHe would like to rewrite the integer on some balls so that there are at most K different integers written on the N balls.\n\nFind the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 200000\n\n1 \\leq A_i \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nSample Input 1\n\n5 2\n1 1 2 2 5\n\nSample Output 1\n\n1\n\nFor example, if we rewrite the integer on the fifth ball to 2, there are two different integers written on the balls: 1 and 2.\nOn the other hand, it is not possible to rewrite the integers on zero balls so that there are at most two different integers written on the balls, so we should print 1.\n\nSample Input 2\n\n4 4\n1 1 2 2\n\nSample Output 2\n\n0\n\nAlready in the beginning, there are two different integers written on the balls, so we do not need to rewrite anything.\n\nSample Input 3\n\n10 3\n5 1 3 2 4 1 1 2 3 4\n\nSample Output 3\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 595, "cpu_time_ms": 2104, "memory_kb": 11520}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s979727946", "group_id": "codeNet:p03495", "input_text": "\nopen Scanf\nopen Printf\n\nlet read_int () = scanf \" %d\" (fun x -> x)\nlet rec read_ints n = if n = 0 then [] else let i = read_int () in i :: read_ints (n-1)\n\nlet rec take n xs_ = match xs_ with\n  | (x::xs) when n > 0 -> x :: take (n-1) xs\n  | _ -> []\n\nlet group_len xs_ =\n  let rec f c x ys =\n    match ys with\n    | [] -> [c]\n    | (y::ys') -> if x = y then f (c+1) x ys' else c :: f 1 y ys' in\n  match xs_ with\n    | [] -> []\n    | (x::xs) -> f 1 x xs\n\nlet () =\n  let n = read_int () in let k = read_int () in\n  let ls = read_ints n |> List.sort (-) |> group_len |> List.sort (-) in\n  take (List.length ls - k) ls |> List.fold_left (+) 0 |> printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1519125778, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03495.html", "problem_id": "p03495", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03495/input.txt", "sample_output_relpath": "derived/input_output/data/p03495/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03495/OCaml/s979727946.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s979727946", "user_id": "u798181098"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "\nopen Scanf\nopen Printf\n\nlet read_int () = scanf \" %d\" (fun x -> x)\nlet rec read_ints n = if n = 0 then [] else let i = read_int () in i :: read_ints (n-1)\n\nlet rec take n xs_ = match xs_ with\n  | (x::xs) when n > 0 -> x :: take (n-1) xs\n  | _ -> []\n\nlet group_len xs_ =\n  let rec f c x ys =\n    match ys with\n    | [] -> [c]\n    | (y::ys') -> if x = y then f (c+1) x ys' else c :: f 1 y ys' in\n  match xs_ with\n    | [] -> []\n    | (x::xs) -> f 1 x xs\n\nlet () =\n  let n = read_int () in let k = read_int () in\n  let ls = read_ints n |> List.sort (-) |> group_len |> List.sort (-) in\n  take (List.length ls - k) ls |> List.fold_left (+) 0 |> printf \"%d\\n\"\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi has N balls. Initially, an integer A_i is written on the i-th ball.\n\nHe would like to rewrite the integer on some balls so that there are at most K different integers written on the N balls.\n\nFind the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 200000\n\n1 \\leq A_i \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nSample Input 1\n\n5 2\n1 1 2 2 5\n\nSample Output 1\n\n1\n\nFor example, if we rewrite the integer on the fifth ball to 2, there are two different integers written on the balls: 1 and 2.\nOn the other hand, it is not possible to rewrite the integers on zero balls so that there are at most two different integers written on the balls, so we should print 1.\n\nSample Input 2\n\n4 4\n1 1 2 2\n\nSample Output 2\n\n0\n\nAlready in the beginning, there are two different integers written on the balls, so we do not need to rewrite anything.\n\nSample Input 3\n\n10 3\n5 1 3 2 4 1 1 2 3 4\n\nSample Output 3\n\n3", "sample_input": "5 2\n1 1 2 2 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03495", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi has N balls. Initially, an integer A_i is written on the i-th ball.\n\nHe would like to rewrite the integer on some balls so that there are at most K different integers written on the N balls.\n\nFind the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 200000\n\n1 \\leq A_i \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nSample Input 1\n\n5 2\n1 1 2 2 5\n\nSample Output 1\n\n1\n\nFor example, if we rewrite the integer on the fifth ball to 2, there are two different integers written on the balls: 1 and 2.\nOn the other hand, it is not possible to rewrite the integers on zero balls so that there are at most two different integers written on the balls, so we should print 1.\n\nSample Input 2\n\n4 4\n1 1 2 2\n\nSample Output 2\n\n0\n\nAlready in the beginning, there are two different integers written on the balls, so we do not need to rewrite anything.\n\nSample Input 3\n\n10 3\n5 1 3 2 4 1 1 2 3 4\n\nSample Output 3\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 656, "cpu_time_ms": 308, "memory_kb": 26016}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s719563173", "group_id": "codeNet:p03501", "input_text": "module A = Array\nmodule C = Char\nmodule I = Int64\nmodule L = List\nmodule Q = Queue\n\nlet pf = Printf.printf\nlet sf = Scanf.scanf\nlet ssf = Scanf.sscanf\n\nlet read_int () = sf \"%d \" (fun x -> x)\nlet read_float () = sf \"%f \" (fun x -> x)\nlet read_str () = sf \"%s \" (fun x -> x)\nlet read_array n read () = A.init n (fun _ -> read ())\nlet err s = raise (Failure s)\n\nlet range s t = A.init (t - s) @@ (+) s\nlet foreach fold_f init s t map_f =\n  range s t |> A.map map_f |> A.fold_left fold_f init\n\nlet inf = int_of_float 1e18\nlet eps = 1e-11\n\nmodule S = struct\n  include String\n  let of_array a = String.init (A.length a) (A.get a)\n  let to_array s = A.init (String.length s) (String.get s)\nend;;\n\nlet () =\n  let n = read_int () in\n  let a = read_int () in\n  let b = read_int () in\n  let res = min (n * a) b in\n  pf \"%d\\n\" res\n", "language": "OCaml", "metadata": {"date": 1515009054, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s719563173.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s719563173", "user_id": "u748871552"}, "prompt_components": {"gold_output": "119\n", "input_to_evaluate": "module A = Array\nmodule C = Char\nmodule I = Int64\nmodule L = List\nmodule Q = Queue\n\nlet pf = Printf.printf\nlet sf = Scanf.scanf\nlet ssf = Scanf.sscanf\n\nlet read_int () = sf \"%d \" (fun x -> x)\nlet read_float () = sf \"%f \" (fun x -> x)\nlet read_str () = sf \"%s \" (fun x -> x)\nlet read_array n read () = A.init n (fun _ -> read ())\nlet err s = raise (Failure s)\n\nlet range s t = A.init (t - s) @@ (+) s\nlet foreach fold_f init s t map_f =\n  range s t |> A.map map_f |> A.fold_left fold_f init\n\nlet inf = int_of_float 1e18\nlet eps = 1e-11\n\nmodule S = struct\n  include String\n  let of_array a = String.init (A.length a) (A.get a)\n  let to_array s = A.init (String.length s) (String.get s)\nend;;\n\nlet () =\n  let n = read_int () in\n  let a = read_int () in\n  let b = read_int () in\n  let res = min (n * a) b in\n  pf \"%d\\n\" res\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 820, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s634180927", "group_id": "codeNet:p03502", "input_text": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  let len = String.length (string_of_int n) in\n  let rec sum n i len =\n    let jyu = int_of_float (10. ** float_of_int (i-1)) in\n    if i > len then 0 else (n / jyu) mod (jyu*10) + sum n (i+1) len in\n  Printf.printf \"%s\\n\" (if n mod (sum n 1 len) = 0 then \"Yes\" else \"No\")", "language": "OCaml", "metadata": {"date": 1600887815, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s634180927.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s634180927", "user_id": "u307426615"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d\\n\" @@ fun n ->\n  let len = String.length (string_of_int n) in\n  let rec sum n i len =\n    let jyu = int_of_float (10. ** float_of_int (i-1)) in\n    if i > len then 0 else (n / jyu) mod (jyu*10) + sum n (i+1) len in\n  Printf.printf \"%s\\n\" (if n mod (sum n 1 len) = 0 then \"Yes\" else \"No\")", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAn integer X is called a Harshad number if X is divisible by f(X), where f(X) is the sum of the digits in X when written in base 10.\n\nGiven an integer N, determine whether it is a Harshad number.\n\nConstraints\n\n1?N?10^8\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint Yes if N is a Harshad number; print No otherwise.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nf(12)=1+2=3. Since 12 is divisible by 3, 12 is a Harshad number.\n\nSample Input 2\n\n57\n\nSample Output 2\n\nNo\n\nf(57)=5+7=12. Since 57 is not divisible by 12, 12 is not a Harshad number.\n\nSample Input 3\n\n148\n\nSample Output 3\n\nNo", "sample_input": "12\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03502", "source_text": "Score : 200 points\n\nProblem Statement\n\nAn integer X is called a Harshad number if X is divisible by f(X), where f(X) is the sum of the digits in X when written in base 10.\n\nGiven an integer N, determine whether it is a Harshad number.\n\nConstraints\n\n1?N?10^8\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint Yes if N is a Harshad number; print No otherwise.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nf(12)=1+2=3. Since 12 is divisible by 3, 12 is a Harshad number.\n\nSample Input 2\n\n57\n\nSample Output 2\n\nNo\n\nf(57)=5+7=12. Since 57 is not divisible by 12, 12 is not a Harshad number.\n\nSample Input 3\n\n148\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 10, "memory_kb": 4256}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s957892067", "group_id": "codeNet:p03502", "input_text": "(* O(|n|) *)\nlet n = read_line () in\nlet ds = Array.init (String.length n) @@ fun i -> int_of_char n.[i] - 48 in\nprint_endline @@ if int_of_string n mod Array.fold_left (+) 0 ds = 0 then \"Yes\" else \"No\"", "language": "OCaml", "metadata": {"date": 1558556757, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s957892067.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s957892067", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(* O(|n|) *)\nlet n = read_line () in\nlet ds = Array.init (String.length n) @@ fun i -> int_of_char n.[i] - 48 in\nprint_endline @@ if int_of_string n mod Array.fold_left (+) 0 ds = 0 then \"Yes\" else \"No\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAn integer X is called a Harshad number if X is divisible by f(X), where f(X) is the sum of the digits in X when written in base 10.\n\nGiven an integer N, determine whether it is a Harshad number.\n\nConstraints\n\n1?N?10^8\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint Yes if N is a Harshad number; print No otherwise.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nf(12)=1+2=3. Since 12 is divisible by 3, 12 is a Harshad number.\n\nSample Input 2\n\n57\n\nSample Output 2\n\nNo\n\nf(57)=5+7=12. Since 57 is not divisible by 12, 12 is not a Harshad number.\n\nSample Input 3\n\n148\n\nSample Output 3\n\nNo", "sample_input": "12\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03502", "source_text": "Score : 200 points\n\nProblem Statement\n\nAn integer X is called a Harshad number if X is divisible by f(X), where f(X) is the sum of the digits in X when written in base 10.\n\nGiven an integer N, determine whether it is a Harshad number.\n\nConstraints\n\n1?N?10^8\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint Yes if N is a Harshad number; print No otherwise.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nf(12)=1+2=3. Since 12 is divisible by 3, 12 is a Harshad number.\n\nSample Input 2\n\n57\n\nSample Output 2\n\nNo\n\nf(57)=5+7=12. Since 57 is not divisible by 12, 12 is not a Harshad number.\n\nSample Input 3\n\n148\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 202, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s223954634", "group_id": "codeNet:p03502", "input_text": "(* O(log n) *)\nScanf.scanf \"%d\" @@ fun n ->\n  let rec sum acc m =\n    if m <= 0 then acc else sum (acc + m mod 10) @@ m / 10 in\n  print_endline @@ if n mod sum 0 n = 0 then \"Yes\" else \"No\"", "language": "OCaml", "metadata": {"date": 1558555111, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s223954634.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s223954634", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(* O(log n) *)\nScanf.scanf \"%d\" @@ fun n ->\n  let rec sum acc m =\n    if m <= 0 then acc else sum (acc + m mod 10) @@ m / 10 in\n  print_endline @@ if n mod sum 0 n = 0 then \"Yes\" else \"No\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAn integer X is called a Harshad number if X is divisible by f(X), where f(X) is the sum of the digits in X when written in base 10.\n\nGiven an integer N, determine whether it is a Harshad number.\n\nConstraints\n\n1?N?10^8\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint Yes if N is a Harshad number; print No otherwise.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nf(12)=1+2=3. Since 12 is divisible by 3, 12 is a Harshad number.\n\nSample Input 2\n\n57\n\nSample Output 2\n\nNo\n\nf(57)=5+7=12. Since 57 is not divisible by 12, 12 is not a Harshad number.\n\nSample Input 3\n\n148\n\nSample Output 3\n\nNo", "sample_input": "12\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03502", "source_text": "Score : 200 points\n\nProblem Statement\n\nAn integer X is called a Harshad number if X is divisible by f(X), where f(X) is the sum of the digits in X when written in base 10.\n\nGiven an integer N, determine whether it is a Harshad number.\n\nConstraints\n\n1?N?10^8\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint Yes if N is a Harshad number; print No otherwise.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nf(12)=1+2=3. Since 12 is divisible by 3, 12 is a Harshad number.\n\nSample Input 2\n\n57\n\nSample Output 2\n\nNo\n\nf(57)=5+7=12. Since 57 is not divisible by 12, 12 is not a Harshad number.\n\nSample Input 3\n\n148\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s452627724", "group_id": "codeNet:p03502", "input_text": "let rec f = function 0 -> 0 | n -> n mod 10 + f (n / 10)\n\nlet () = Scanf.scanf \"%d\" @@ fun x ->\n  print_endline @@ if x mod f x = 0 then \"Yes\" else \"No\"", "language": "OCaml", "metadata": {"date": 1530666523, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s452627724.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s452627724", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let rec f = function 0 -> 0 | n -> n mod 10 + f (n / 10)\n\nlet () = Scanf.scanf \"%d\" @@ fun x ->\n  print_endline @@ if x mod f x = 0 then \"Yes\" else \"No\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAn integer X is called a Harshad number if X is divisible by f(X), where f(X) is the sum of the digits in X when written in base 10.\n\nGiven an integer N, determine whether it is a Harshad number.\n\nConstraints\n\n1?N?10^8\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint Yes if N is a Harshad number; print No otherwise.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nf(12)=1+2=3. Since 12 is divisible by 3, 12 is a Harshad number.\n\nSample Input 2\n\n57\n\nSample Output 2\n\nNo\n\nf(57)=5+7=12. Since 57 is not divisible by 12, 12 is not a Harshad number.\n\nSample Input 3\n\n148\n\nSample Output 3\n\nNo", "sample_input": "12\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03502", "source_text": "Score : 200 points\n\nProblem Statement\n\nAn integer X is called a Harshad number if X is divisible by f(X), where f(X) is the sum of the digits in X when written in base 10.\n\nGiven an integer N, determine whether it is a Harshad number.\n\nConstraints\n\n1?N?10^8\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint Yes if N is a Harshad number; print No otherwise.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nf(12)=1+2=3. Since 12 is divisible by 3, 12 is a Harshad number.\n\nSample Input 2\n\n57\n\nSample Output 2\n\nNo\n\nf(57)=5+7=12. Since 57 is not divisible by 12, 12 is not a Harshad number.\n\nSample Input 3\n\n148\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 152, "cpu_time_ms": 3, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s246927592", "group_id": "codeNet:p03504", "input_text": "let () =\n  let n, c = Scanf.scanf \"%d %d\\n\" (fun n c -> n, c) in\n  let cs = Array.make c []\n  in\n  for i = 0 to n - 1 do\n    Scanf.scanf \"%d %d %d\\n\" (fun s t c ->\n      cs.(c - 1) <- (s, t) :: cs.(c - 1))\n  done;\n  let channels = Array.make 200003 0 in\n  begin Array.map (fun sts ->\n    match List.sort compare sts with\n    | [] -> []\n    | (s, t) :: sts ->\n        List.fold_left (fun (s, t, acc) (s', t') ->\n          if t = s' then (s, t', acc)\n          else (s', t', (s, t) :: acc)) (s, t, []) sts\n        |> (fun (s, t, acc) -> (s, t) :: acc)) cs\n  |> Array.to_list\n  |> List.concat\n  |> List.iter (fun (s, t) ->\n      channels.(2 * s - 1) <- channels.(2 * s - 1) + 1;\n      channels.(2 * t) <- channels.(2 * t) - 1)\n  end;\n  for i = 1 to Array.length channels - 1 do\n    channels.(i) <- channels.(i) + channels.(i - 1)\n  done;\n  Printf.printf \"%d\\n\" (Array.fold_left max 0 channels)", "language": "OCaml", "metadata": {"date": 1515126180, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s246927592.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s246927592", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () =\n  let n, c = Scanf.scanf \"%d %d\\n\" (fun n c -> n, c) in\n  let cs = Array.make c []\n  in\n  for i = 0 to n - 1 do\n    Scanf.scanf \"%d %d %d\\n\" (fun s t c ->\n      cs.(c - 1) <- (s, t) :: cs.(c - 1))\n  done;\n  let channels = Array.make 200003 0 in\n  begin Array.map (fun sts ->\n    match List.sort compare sts with\n    | [] -> []\n    | (s, t) :: sts ->\n        List.fold_left (fun (s, t, acc) (s', t') ->\n          if t = s' then (s, t', acc)\n          else (s', t', (s, t) :: acc)) (s, t, []) sts\n        |> (fun (s, t, acc) -> (s, t) :: acc)) cs\n  |> Array.to_list\n  |> List.concat\n  |> List.iter (fun (s, t) ->\n      channels.(2 * s - 1) <- channels.(2 * s - 1) + 1;\n      channels.(2 * t) <- channels.(2 * t) - 1)\n  end;\n  for i = 1 to Array.length channels - 1 do\n    channels.(i) <- channels.(i) + channels.(i - 1)\n  done;\n  Printf.printf \"%d\\n\" (Array.fold_left max 0 channels)", "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_i<t_i≤10^5\n\n1≤c_i≤C\n\nIf c_i=c_j and i≠j, either t_i≤s_j or s_i≥t_j.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN C\ns_1 t_1 c_1\n:\ns_N t_N c_N\n\nOutput\n\nWhen the minimum required number of recorders is x, print the value of x.\n\nSample Input 1\n\n3 2\n1 7 2\n7 8 1\n8 12 1\n\nSample Output 1\n\n2\n\nTwo recorders can record all the programs, for example, as follows:\n\nWith the first recorder, record Channel 2 from time 1 to time 7. The first program will be recorded. Note that this recorder will be unable to record other channels from time 0.5 to time 7.\n\nWith the second recorder, record Channel 1 from time 7 to time 12. The second and third programs will be recorded. Note that this recorder will be unable to record other channels from time 6.5 to time 12.\n\nSample Input 2\n\n3 4\n1 3 2\n3 4 4\n1 4 3\n\nSample Output 2\n\n3\n\nThere may be a channel where there is no program to record.\n\nSample Input 3\n\n9 4\n56 60 4\n33 37 2\n89 90 3\n32 43 1\n67 68 3\n49 51 3\n31 32 3\n70 71 1\n11 12 3\n\nSample Output 3\n\n2", "sample_input": "3 2\n1 7 2\n7 8 1\n8 12 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03504", "source_text": "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_i<t_i≤10^5\n\n1≤c_i≤C\n\nIf c_i=c_j and i≠j, either t_i≤s_j or s_i≥t_j.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN C\ns_1 t_1 c_1\n:\ns_N t_N c_N\n\nOutput\n\nWhen the minimum required number of recorders is x, print the value of x.\n\nSample Input 1\n\n3 2\n1 7 2\n7 8 1\n8 12 1\n\nSample Output 1\n\n2\n\nTwo recorders can record all the programs, for example, as follows:\n\nWith the first recorder, record Channel 2 from time 1 to time 7. The first program will be recorded. Note that this recorder will be unable to record other channels from time 0.5 to time 7.\n\nWith the second recorder, record Channel 1 from time 7 to time 12. The second and third programs will be recorded. Note that this recorder will be unable to record other channels from time 6.5 to time 12.\n\nSample Input 2\n\n3 4\n1 3 2\n3 4 4\n1 4 3\n\nSample Output 2\n\n3\n\nThere may be a channel where there is no program to record.\n\nSample Input 3\n\n9 4\n56 60 4\n33 37 2\n89 90 3\n32 43 1\n67 68 3\n49 51 3\n31 32 3\n70 71 1\n11 12 3\n\nSample Output 3\n\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 890, "cpu_time_ms": 151, "memory_kb": 17152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s603123859", "group_id": "codeNet:p03543", "input_text": "open Batteries\nlet () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n\n  let rec digits base n res =\n    if n = 0 then res \n    else digits base (n/base) ((n mod base)::res)\n  in\n\n  let digits_l = digits 10 n [] in\n\n  let rec aux prev cnt = function\n      [] -> \"No\" \n    | hd :: tl -> \n      if prev = hd then\n        let cnt = cnt + 1 in\n        if cnt = 3 then\n          \"Yes\"\n        else\n          aux hd (cnt+1) tl\n      else \n        aux hd 0 tl\n  in\n\n  Printf.printf \"%s\\n\" @@\n  aux (-1) 0 digits_l\n", "language": "OCaml", "metadata": {"date": 1529239939, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s603123859.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s603123859", "user_id": "u139013163"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Batteries\nlet () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n\n  let rec digits base n res =\n    if n = 0 then res \n    else digits base (n/base) ((n mod base)::res)\n  in\n\n  let digits_l = digits 10 n [] in\n\n  let rec aux prev cnt = function\n      [] -> \"No\" \n    | hd :: tl -> \n      if prev = hd then\n        let cnt = cnt + 1 in\n        if cnt = 3 then\n          \"Yes\"\n        else\n          aux hd (cnt+1) tl\n      else \n        aux hd 0 tl\n  in\n\n  Printf.printf \"%s\\n\" @@\n  aux (-1) 0 digits_l\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe call a 4-digit integer with three or more consecutive same digits, such as 1118, good.\n\nYou are given a 4-digit integer N. Answer the question: Is N good?\n\nConstraints\n\n1000 ≤ N ≤ 9999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is good, print Yes; otherwise, print No.\n\nSample Input 1\n\n1118\n\nSample Output 1\n\nYes\n\nN is good, since it contains three consecutive 1.\n\nSample Input 2\n\n7777\n\nSample Output 2\n\nYes\n\nAn integer is also good when all the digits are the same.\n\nSample Input 3\n\n1234\n\nSample Output 3\n\nNo", "sample_input": "1118\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03543", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe call a 4-digit integer with three or more consecutive same digits, such as 1118, good.\n\nYou are given a 4-digit integer N. Answer the question: Is N good?\n\nConstraints\n\n1000 ≤ N ≤ 9999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is good, print Yes; otherwise, print No.\n\nSample Input 1\n\n1118\n\nSample Output 1\n\nYes\n\nN is good, since it contains three consecutive 1.\n\nSample Input 2\n\n7777\n\nSample Output 2\n\nYes\n\nAn integer is also good when all the digits are the same.\n\nSample Input 3\n\n1234\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 505, "cpu_time_ms": 2, "memory_kb": 1024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s359267806", "group_id": "codeNet:p03543", "input_text": "let solve s =\n  if s.[0] = s.[1] && s.[1] = s.[2] || s.[1] = s.[2] && s.[2] = s.[3] then\n    \"Yes\"\n  else \"No\"\n\n\nlet () = read_line () |> solve |> print_endline", "language": "OCaml", "metadata": {"date": 1523956240, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s359267806.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s359267806", "user_id": "u987869509"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let solve s =\n  if s.[0] = s.[1] && s.[1] = s.[2] || s.[1] = s.[2] && s.[2] = s.[3] then\n    \"Yes\"\n  else \"No\"\n\n\nlet () = read_line () |> solve |> print_endline", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe call a 4-digit integer with three or more consecutive same digits, such as 1118, good.\n\nYou are given a 4-digit integer N. Answer the question: Is N good?\n\nConstraints\n\n1000 ≤ N ≤ 9999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is good, print Yes; otherwise, print No.\n\nSample Input 1\n\n1118\n\nSample Output 1\n\nYes\n\nN is good, since it contains three consecutive 1.\n\nSample Input 2\n\n7777\n\nSample Output 2\n\nYes\n\nAn integer is also good when all the digits are the same.\n\nSample Input 3\n\n1234\n\nSample Output 3\n\nNo", "sample_input": "1118\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03543", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe call a 4-digit integer with three or more consecutive same digits, such as 1118, good.\n\nYou are given a 4-digit integer N. Answer the question: Is N good?\n\nConstraints\n\n1000 ≤ N ≤ 9999\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf N is good, print Yes; otherwise, print No.\n\nSample Input 1\n\n1118\n\nSample Output 1\n\nYes\n\nN is good, since it contains three consecutive 1.\n\nSample Input 2\n\n7777\n\nSample Output 2\n\nYes\n\nAn integer is also good when all the digits are the same.\n\nSample Input 3\n\n1234\n\nSample Output 3\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 160, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s422503638", "group_id": "codeNet:p03544", "input_text": "let n = read_int ();;\nlet rec h n m l = if n = 1 then l else h (n-1) l (m+l);;\nprint_int (h n 2 1)", "language": "OCaml", "metadata": {"date": 1593024511, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s422503638.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s422503638", "user_id": "u326834569"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "let n = read_int ();;\nlet rec h n m l = if n = 1 then l else h (n-1) l (m+l);;\nprint_int (h n 2 1)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIt is November 18 now in Japan. By the way, 11 and 18 are adjacent Lucas numbers.\n\nYou are given an integer N. Find the N-th Lucas number.\n\nHere, the i-th Lucas number L_i is defined as follows:\n\nL_0=2\n\nL_1=1\n\nL_i=L_{i-1}+L_{i-2} (i≥2)\n\nConstraints\n\n1≤N≤86\n\nIt is guaranteed that the answer is less than 10^{18}.\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the N-th Lucas number.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n11\n\nL_0=2\n\nL_1=1\n\nL_2=L_0+L_1=3\n\nL_3=L_1+L_2=4\n\nL_4=L_2+L_3=7\n\nL_5=L_3+L_4=11\n\nThus, the 5-th Lucas number is 11.\n\nSample Input 2\n\n86\n\nSample Output 2\n\n939587134549734843", "sample_input": "5\n"}, "reference_outputs": ["11\n"], "source_document_id": "p03544", "source_text": "Score : 200 points\n\nProblem Statement\n\nIt is November 18 now in Japan. By the way, 11 and 18 are adjacent Lucas numbers.\n\nYou are given an integer N. Find the N-th Lucas number.\n\nHere, the i-th Lucas number L_i is defined as follows:\n\nL_0=2\n\nL_1=1\n\nL_i=L_{i-1}+L_{i-2} (i≥2)\n\nConstraints\n\n1≤N≤86\n\nIt is guaranteed that the answer is less than 10^{18}.\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the N-th Lucas number.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n11\n\nL_0=2\n\nL_1=1\n\nL_2=L_0+L_1=3\n\nL_3=L_1+L_2=4\n\nL_4=L_2+L_3=7\n\nL_5=L_3+L_4=11\n\nThus, the 5-th Lucas number is 11.\n\nSample Input 2\n\n86\n\nSample Output 2\n\n939587134549734843", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 98, "cpu_time_ms": 5, "memory_kb": 3664}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s234624703", "group_id": "codeNet:p03544", "input_text": "let rec lucas = function\n  | 0 -> (2, 1)\n  | n ->\n      let (l_n_2, l_n_1) = lucas (n - 1) in\n      (l_n_1, l_n_1 + l_n_2)\n\nlet () = Scanf.scanf \"%d\" (fun n ->\n  Printf.printf \"%d\\n\" @@ fst @@ lucas n)", "language": "OCaml", "metadata": {"date": 1511057682, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s234624703.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s234624703", "user_id": "u504158101"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "let rec lucas = function\n  | 0 -> (2, 1)\n  | n ->\n      let (l_n_2, l_n_1) = lucas (n - 1) in\n      (l_n_1, l_n_1 + l_n_2)\n\nlet () = Scanf.scanf \"%d\" (fun n ->\n  Printf.printf \"%d\\n\" @@ fst @@ lucas n)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIt is November 18 now in Japan. By the way, 11 and 18 are adjacent Lucas numbers.\n\nYou are given an integer N. Find the N-th Lucas number.\n\nHere, the i-th Lucas number L_i is defined as follows:\n\nL_0=2\n\nL_1=1\n\nL_i=L_{i-1}+L_{i-2} (i≥2)\n\nConstraints\n\n1≤N≤86\n\nIt is guaranteed that the answer is less than 10^{18}.\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the N-th Lucas number.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n11\n\nL_0=2\n\nL_1=1\n\nL_2=L_0+L_1=3\n\nL_3=L_1+L_2=4\n\nL_4=L_2+L_3=7\n\nL_5=L_3+L_4=11\n\nThus, the 5-th Lucas number is 11.\n\nSample Input 2\n\n86\n\nSample Output 2\n\n939587134549734843", "sample_input": "5\n"}, "reference_outputs": ["11\n"], "source_document_id": "p03544", "source_text": "Score : 200 points\n\nProblem Statement\n\nIt is November 18 now in Japan. By the way, 11 and 18 are adjacent Lucas numbers.\n\nYou are given an integer N. Find the N-th Lucas number.\n\nHere, the i-th Lucas number L_i is defined as follows:\n\nL_0=2\n\nL_1=1\n\nL_i=L_{i-1}+L_{i-2} (i≥2)\n\nConstraints\n\n1≤N≤86\n\nIt is guaranteed that the answer is less than 10^{18}.\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the N-th Lucas number.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n11\n\nL_0=2\n\nL_1=1\n\nL_2=L_0+L_1=3\n\nL_3=L_1+L_2=4\n\nL_4=L_2+L_3=7\n\nL_5=L_3+L_4=11\n\nThus, the 5-th Lucas number is 11.\n\nSample Input 2\n\n86\n\nSample Output 2\n\n939587134549734843", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 201, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s814550978", "group_id": "codeNet:p03545", "input_text": "Scanf.scanf \"%d\" (fun abcd ->\n    let a = abcd            / 1000 in\n    let b = (abcd mod 1000) /  100 in\n    let c = (abcd mod  100) /   10 in\n    let d = (abcd mod   10)        in\n    if a + b + c + d = 7 then Printf.printf \"%d+%d+%d+%d=7\\n\" a b c d else\n    if a + b + c - d = 7 then Printf.printf \"%d+%d+%d-%d=7\\n\" a b c d else\n    if a + b - c + d = 7 then Printf.printf \"%d+%d-%d+%d=7\\n\" a b c d else\n    if a + b - c - d = 7 then Printf.printf \"%d+%d-%d-%d=7\\n\" a b c d else\n    if a - b + c + d = 7 then Printf.printf \"%d-%d+%d+%d=7\\n\" a b c d else\n    if a - b + c - d = 7 then Printf.printf \"%d-%d+%d-%d=7\\n\" a b c d else\n    if a - b - c + d = 7 then Printf.printf \"%d-%d-%d+%d=7\\n\" a b c d else\n    if a - b - c - d = 7 then Printf.printf \"%d-%d-%d-%d=7\\n\" a b c d else ()\n)", "language": "OCaml", "metadata": {"date": 1599104579, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s814550978.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s814550978", "user_id": "u342443598"}, "prompt_components": {"gold_output": "1+2+2+2=7\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun abcd ->\n    let a = abcd            / 1000 in\n    let b = (abcd mod 1000) /  100 in\n    let c = (abcd mod  100) /   10 in\n    let d = (abcd mod   10)        in\n    if a + b + c + d = 7 then Printf.printf \"%d+%d+%d+%d=7\\n\" a b c d else\n    if a + b + c - d = 7 then Printf.printf \"%d+%d+%d-%d=7\\n\" a b c d else\n    if a + b - c + d = 7 then Printf.printf \"%d+%d-%d+%d=7\\n\" a b c d else\n    if a + b - c - d = 7 then Printf.printf \"%d+%d-%d-%d=7\\n\" a b c d else\n    if a - b + c + d = 7 then Printf.printf \"%d-%d+%d+%d=7\\n\" a b c d else\n    if a - b + c - d = 7 then Printf.printf \"%d-%d+%d-%d=7\\n\" a b c d else\n    if a - b - c + d = 7 then Printf.printf \"%d-%d-%d+%d=7\\n\" a b c d else\n    if a - b - c - d = 7 then Printf.printf \"%d-%d-%d-%d=7\\n\" a b c d else ()\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSitting in a station waiting room, Joisino is gazing at her train ticket.\n\nThe ticket is numbered with four digits A, B, C and D in this order, each between 0 and 9 (inclusive).\n\nIn the formula A op1 B op2 C op3 D = 7, replace each of the symbols op1, op2 and op3 with + or - so that the formula holds.\n\nThe given input guarantees that there is a solution. If there are multiple solutions, any of them will be accepted.\n\nConstraints\n\n0≤A,B,C,D≤9\n\nAll input values are integers.\n\nIt is guaranteed that there is a solution.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nABCD\n\nOutput\n\nPrint the formula you made, including the part =7.\n\nUse the signs + and -.\n\nDo not print a space between a digit and a sign.\n\nSample Input 1\n\n1222\n\nSample Output 1\n\n1+2+2+2=7\n\nThis is the only valid solution.\n\nSample Input 2\n\n0290\n\nSample Output 2\n\n0-2+9+0=7\n\n0 - 2 + 9 - 0 = 7 is also a valid solution.\n\nSample Input 3\n\n3242\n\nSample Output 3\n\n3+2+4-2=7", "sample_input": "1222\n"}, "reference_outputs": ["1+2+2+2=7\n"], "source_document_id": "p03545", "source_text": "Score : 300 points\n\nProblem Statement\n\nSitting in a station waiting room, Joisino is gazing at her train ticket.\n\nThe ticket is numbered with four digits A, B, C and D in this order, each between 0 and 9 (inclusive).\n\nIn the formula A op1 B op2 C op3 D = 7, replace each of the symbols op1, op2 and op3 with + or - so that the formula holds.\n\nThe given input guarantees that there is a solution. If there are multiple solutions, any of them will be accepted.\n\nConstraints\n\n0≤A,B,C,D≤9\n\nAll input values are integers.\n\nIt is guaranteed that there is a solution.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nABCD\n\nOutput\n\nPrint the formula you made, including the part =7.\n\nUse the signs + and -.\n\nDo not print a space between a digit and a sign.\n\nSample Input 1\n\n1222\n\nSample Output 1\n\n1+2+2+2=7\n\nThis is the only valid solution.\n\nSample Input 2\n\n0290\n\nSample Output 2\n\n0-2+9+0=7\n\n0 - 2 + 9 - 0 = 7 is also a valid solution.\n\nSample Input 3\n\n3242\n\nSample Output 3\n\n3+2+4-2=7", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 786, "cpu_time_ms": 9, "memory_kb": 3856}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s653728229", "group_id": "codeNet:p03546", "input_text": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list sep conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet (h, w) = scan \"%d %d\" Tuple2.make\nlet mat = scan_matrix ~sep:' ' 10 10 0 Int.of_string\nlet mat2 = scan_matrix ~sep:' ' h w 0 Int.of_string\n\nlet () =\n  ListL.iter (0++^10) ~f:(fun k ->\n      ListL.iter (0++^10) ~f:(fun i ->\n          ListL.iter (0++^10) ~f:(fun j ->\n              mat.(i).(j) <- min mat.(i).(j) (mat.(i).(k)+mat.(k).(j))\n            )\n        ));\n  ArrayL.map mat2 ~f:(fun a ->\n      ArrayL.map a ~f:(fun v ->\n          if v = -1 then 0\n          else mat.(v).(1)\n        )\n      |> Array.sum\n    )\n  |> Array.sum\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1589742724, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03546.html", "problem_id": "p03546", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03546/input.txt", "sample_output_relpath": "derived/input_output/data/p03546/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03546/OCaml/s653728229.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s653728229", "user_id": "u802614675"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list sep conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet (h, w) = scan \"%d %d\" Tuple2.make\nlet mat = scan_matrix ~sep:' ' 10 10 0 Int.of_string\nlet mat2 = scan_matrix ~sep:' ' h w 0 Int.of_string\n\nlet () =\n  ListL.iter (0++^10) ~f:(fun k ->\n      ListL.iter (0++^10) ~f:(fun i ->\n          ListL.iter (0++^10) ~f:(fun j ->\n              mat.(i).(j) <- min mat.(i).(j) (mat.(i).(k)+mat.(k).(j))\n            )\n        ));\n  ArrayL.map mat2 ~f:(fun a ->\n      ArrayL.map a ~f:(fun v ->\n          if v = -1 then 0\n          else mat.(v).(1)\n        )\n      |> Array.sum\n    )\n  |> Array.sum\n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nJoisino the magical girl has decided to turn every single digit that exists on this world into 1.\n\nRewriting a digit i with j (0≤i,j≤9) costs c_{i,j} MP (Magic Points).\n\nShe is now standing before a wall. The wall is divided into HW squares in H rows and W columns, and at least one square contains a digit between 0 and 9 (inclusive).\n\nYou are given A_{i,j} that describes the square at the i-th row from the top and j-th column from the left, as follows:\n\nIf A_{i,j}≠-1, the square contains a digit A_{i,j}.\n\nIf A_{i,j}=-1, the square does not contain a digit.\n\nFind the minimum total amount of MP required to turn every digit on this wall into 1 in the end.\n\nConstraints\n\n1≤H,W≤200\n\n1≤c_{i,j}≤10^3 (i≠j)\n\nc_{i,j}=0 (i=j)\n\n-1≤A_{i,j}≤9\n\nAll input values are integers.\n\nThere is at least one digit on the wall.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nc_{0,0} ... c_{0,9}\n:\nc_{9,0} ... c_{9,9}\nA_{1,1} ... A_{1,W}\n:\nA_{H,1} ... A_{H,W}\n\nOutput\n\nPrint the minimum total amount of MP required to turn every digit on the wall into 1 in the end.\n\nSample Input 1\n\n2 4\n0 9 9 9 9 9 9 9 9 9\n9 0 9 9 9 9 9 9 9 9\n9 9 0 9 9 9 9 9 9 9\n9 9 9 0 9 9 9 9 9 9\n9 9 9 9 0 9 9 9 9 2\n9 9 9 9 9 0 9 9 9 9\n9 9 9 9 9 9 0 9 9 9\n9 9 9 9 9 9 9 0 9 9\n9 9 9 9 2 9 9 9 0 9\n9 2 9 9 9 9 9 9 9 0\n-1 -1 -1 -1\n8 1 1 8\n\nSample Output 1\n\n12\n\nTo turn a single 8 into 1, it is optimal to first turn 8 into 4, then turn 4 into 9, and finally turn 9 into 1, costing 6 MP.\n\nThe wall contains two 8s, so the minimum total MP required is 6×2=12.\n\nSample Input 2\n\n5 5\n0 999 999 999 999 999 999 999 999 999\n999 0 999 999 999 999 999 999 999 999\n999 999 0 999 999 999 999 999 999 999\n999 999 999 0 999 999 999 999 999 999\n999 999 999 999 0 999 999 999 999 999\n999 999 999 999 999 0 999 999 999 999\n999 999 999 999 999 999 0 999 999 999\n999 999 999 999 999 999 999 0 999 999\n999 999 999 999 999 999 999 999 0 999\n999 999 999 999 999 999 999 999 999 0\n1 1 1 1 1\n1 1 1 1 1\n1 1 1 1 1\n1 1 1 1 1\n1 1 1 1 1\n\nSample Output 2\n\n0\n\nNote that she may not need to change any digit.\n\nSample Input 3\n\n3 5\n0 4 3 6 2 7 2 5 3 3\n4 0 5 3 7 5 3 7 2 7\n5 7 0 7 2 9 3 2 9 1\n3 6 2 0 2 4 6 4 2 3\n3 5 7 4 0 6 9 7 6 7\n9 8 5 2 2 0 4 7 6 5\n5 4 6 3 2 3 0 5 4 3\n3 6 2 3 4 2 4 0 8 9\n4 6 5 4 3 5 3 2 0 8\n2 1 3 4 5 7 8 6 4 0\n3 5 2 6 1\n2 5 3 2 1\n6 9 2 5 6\n\nSample Output 3\n\n47", "sample_input": "2 4\n0 9 9 9 9 9 9 9 9 9\n9 0 9 9 9 9 9 9 9 9\n9 9 0 9 9 9 9 9 9 9\n9 9 9 0 9 9 9 9 9 9\n9 9 9 9 0 9 9 9 9 2\n9 9 9 9 9 0 9 9 9 9\n9 9 9 9 9 9 0 9 9 9\n9 9 9 9 9 9 9 0 9 9\n9 9 9 9 2 9 9 9 0 9\n9 2 9 9 9 9 9 9 9 0\n-1 -1 -1 -1\n8 1 1 8\n"}, "reference_outputs": ["12\n"], "source_document_id": "p03546", "source_text": "Score : 400 points\n\nProblem Statement\n\nJoisino the magical girl has decided to turn every single digit that exists on this world into 1.\n\nRewriting a digit i with j (0≤i,j≤9) costs c_{i,j} MP (Magic Points).\n\nShe is now standing before a wall. The wall is divided into HW squares in H rows and W columns, and at least one square contains a digit between 0 and 9 (inclusive).\n\nYou are given A_{i,j} that describes the square at the i-th row from the top and j-th column from the left, as follows:\n\nIf A_{i,j}≠-1, the square contains a digit A_{i,j}.\n\nIf A_{i,j}=-1, the square does not contain a digit.\n\nFind the minimum total amount of MP required to turn every digit on this wall into 1 in the end.\n\nConstraints\n\n1≤H,W≤200\n\n1≤c_{i,j}≤10^3 (i≠j)\n\nc_{i,j}=0 (i=j)\n\n-1≤A_{i,j}≤9\n\nAll input values are integers.\n\nThere is at least one digit on the wall.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nc_{0,0} ... c_{0,9}\n:\nc_{9,0} ... c_{9,9}\nA_{1,1} ... A_{1,W}\n:\nA_{H,1} ... A_{H,W}\n\nOutput\n\nPrint the minimum total amount of MP required to turn every digit on the wall into 1 in the end.\n\nSample Input 1\n\n2 4\n0 9 9 9 9 9 9 9 9 9\n9 0 9 9 9 9 9 9 9 9\n9 9 0 9 9 9 9 9 9 9\n9 9 9 0 9 9 9 9 9 9\n9 9 9 9 0 9 9 9 9 2\n9 9 9 9 9 0 9 9 9 9\n9 9 9 9 9 9 0 9 9 9\n9 9 9 9 9 9 9 0 9 9\n9 9 9 9 2 9 9 9 0 9\n9 2 9 9 9 9 9 9 9 0\n-1 -1 -1 -1\n8 1 1 8\n\nSample Output 1\n\n12\n\nTo turn a single 8 into 1, it is optimal to first turn 8 into 4, then turn 4 into 9, and finally turn 9 into 1, costing 6 MP.\n\nThe wall contains two 8s, so the minimum total MP required is 6×2=12.\n\nSample Input 2\n\n5 5\n0 999 999 999 999 999 999 999 999 999\n999 0 999 999 999 999 999 999 999 999\n999 999 0 999 999 999 999 999 999 999\n999 999 999 0 999 999 999 999 999 999\n999 999 999 999 0 999 999 999 999 999\n999 999 999 999 999 0 999 999 999 999\n999 999 999 999 999 999 0 999 999 999\n999 999 999 999 999 999 999 0 999 999\n999 999 999 999 999 999 999 999 0 999\n999 999 999 999 999 999 999 999 999 0\n1 1 1 1 1\n1 1 1 1 1\n1 1 1 1 1\n1 1 1 1 1\n1 1 1 1 1\n\nSample Output 2\n\n0\n\nNote that she may not need to change any digit.\n\nSample Input 3\n\n3 5\n0 4 3 6 2 7 2 5 3 3\n4 0 5 3 7 5 3 7 2 7\n5 7 0 7 2 9 3 2 9 1\n3 6 2 0 2 4 6 4 2 3\n3 5 7 4 0 6 9 7 6 7\n9 8 5 2 2 0 4 7 6 5\n5 4 6 3 2 3 0 5 4 3\n3 6 2 3 4 2 4 0 8 9\n4 6 5 4 3 5 3 2 0 8\n2 1 3 4 5 7 8 6 4 0\n3 5 2 6 1\n2 5 3 2 1\n6 9 2 5 6\n\nSample Output 3\n\n47", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2561, "cpu_time_ms": 7, "memory_kb": 5504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s474932677", "group_id": "codeNet:p03547", "input_text": "Scanf.scanf \"%c %c\" @@ fun x y -> print_endline @@ if x = y then \"=\" else if x < y then \"<\" else \">\"", "language": "OCaml", "metadata": {"date": 1577598552, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s474932677.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s474932677", "user_id": "u732304692"}, "prompt_components": {"gold_output": "<\n", "input_to_evaluate": "Scanf.scanf \"%c %c\" @@ fun x y -> print_endline @@ if x = y then \"=\" else if x < y then \"<\" else \">\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn programming, hexadecimal notation is often used.\n\nIn hexadecimal notation, besides the ten digits 0, 1, ..., 9, the six letters A, B, C, D, E and F are used to represent the values 10, 11, 12, 13, 14 and 15, respectively.\n\nIn this problem, you are given two letters X and Y. Each X and Y is A, B, C, D, E or F.\n\nWhen X and Y are seen as hexadecimal numbers, which is larger?\n\nConstraints\n\nEach X and Y is A, B, C, D, E or F.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf X is smaller, print <; if Y is smaller, print >; if they are equal, print =.\n\nSample Input 1\n\nA B\n\nSample Output 1\n\n<\n\n10 < 11.\n\nSample Input 2\n\nE C\n\nSample Output 2\n\n>\n\n14 > 12.\n\nSample Input 3\n\nF F\n\nSample Output 3\n\n=\n\n15 = 15.", "sample_input": "A B\n"}, "reference_outputs": ["<\n"], "source_document_id": "p03547", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn programming, hexadecimal notation is often used.\n\nIn hexadecimal notation, besides the ten digits 0, 1, ..., 9, the six letters A, B, C, D, E and F are used to represent the values 10, 11, 12, 13, 14 and 15, respectively.\n\nIn this problem, you are given two letters X and Y. Each X and Y is A, B, C, D, E or F.\n\nWhen X and Y are seen as hexadecimal numbers, which is larger?\n\nConstraints\n\nEach X and Y is A, B, C, D, E or F.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf X is smaller, print <; if Y is smaller, print >; if they are equal, print =.\n\nSample Input 1\n\nA B\n\nSample Output 1\n\n<\n\n10 < 11.\n\nSample Input 2\n\nE C\n\nSample Output 2\n\n>\n\n14 > 12.\n\nSample Input 3\n\nF F\n\nSample Output 3\n\n=\n\n15 = 15.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 100, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s098525520", "group_id": "codeNet:p03547", "input_text": "let (x,y,z) = Scanf.scanf \"%d %d %d\\n\" (fun x y z-> (x, y, z))\n\nlet ans = (x-z)/(y+z)  \n\n    let _ =  Printf.printf \"%d\\n\" ans\n;;", "language": "OCaml", "metadata": {"date": 1510632922, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s098525520.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s098525520", "user_id": "u161156777"}, "prompt_components": {"gold_output": "<\n", "input_to_evaluate": "let (x,y,z) = Scanf.scanf \"%d %d %d\\n\" (fun x y z-> (x, y, z))\n\nlet ans = (x-z)/(y+z)  \n\n    let _ =  Printf.printf \"%d\\n\" ans\n;;", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn programming, hexadecimal notation is often used.\n\nIn hexadecimal notation, besides the ten digits 0, 1, ..., 9, the six letters A, B, C, D, E and F are used to represent the values 10, 11, 12, 13, 14 and 15, respectively.\n\nIn this problem, you are given two letters X and Y. Each X and Y is A, B, C, D, E or F.\n\nWhen X and Y are seen as hexadecimal numbers, which is larger?\n\nConstraints\n\nEach X and Y is A, B, C, D, E or F.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf X is smaller, print <; if Y is smaller, print >; if they are equal, print =.\n\nSample Input 1\n\nA B\n\nSample Output 1\n\n<\n\n10 < 11.\n\nSample Input 2\n\nE C\n\nSample Output 2\n\n>\n\n14 > 12.\n\nSample Input 3\n\nF F\n\nSample Output 3\n\n=\n\n15 = 15.", "sample_input": "A B\n"}, "reference_outputs": ["<\n"], "source_document_id": "p03547", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn programming, hexadecimal notation is often used.\n\nIn hexadecimal notation, besides the ten digits 0, 1, ..., 9, the six letters A, B, C, D, E and F are used to represent the values 10, 11, 12, 13, 14 and 15, respectively.\n\nIn this problem, you are given two letters X and Y. Each X and Y is A, B, C, D, E or F.\n\nWhen X and Y are seen as hexadecimal numbers, which is larger?\n\nConstraints\n\nEach X and Y is A, B, C, D, E or F.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nIf X is smaller, print <; if Y is smaller, print >; if they are equal, print =.\n\nSample Input 1\n\nA B\n\nSample Output 1\n\n<\n\n10 < 11.\n\nSample Input 2\n\nE C\n\nSample Output 2\n\n>\n\n14 > 12.\n\nSample Input 3\n\nF F\n\nSample Output 3\n\n=\n\n15 = 15.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 129, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s953068300", "group_id": "codeNet:p03548", "input_text": "(* Vicfred\n * https://atcoder.jp/contests/abc078/tasks/abc078_b\n * math\n * *)\nScanf.scanf \"%d %d %d\\n\" @@ fun x y z -> Printf.printf \"%d\\n\" @@ (x - z) / (y + z)\n\n", "language": "OCaml", "metadata": {"date": 1593916801, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s953068300.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s953068300", "user_id": "u737840172"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(* Vicfred\n * https://atcoder.jp/contests/abc078/tasks/abc078_b\n * math\n * *)\nScanf.scanf \"%d %d %d\\n\" @@ fun x y z -> Printf.printf \"%d\\n\" @@ (x - z) / (y + z)\n\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 3768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s723234657", "group_id": "codeNet:p03548", "input_text": "Scanf.scanf \" %d %d %d\" @@ fun x y z -> Printf.printf \"%d\\n\" @@ (x - z) / (y + z)", "language": "OCaml", "metadata": {"date": 1575606205, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s723234657.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s723234657", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "Scanf.scanf \" %d %d %d\" @@ fun x y z -> Printf.printf \"%d\\n\" @@ (x - z) / (y + z)", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s219092087", "group_id": "codeNet:p03548", "input_text": "Scanf.scanf \"%d %d %d\" @@ fun x y z -> Printf.printf \"%d\\n\" @@ (x - z) / (y + z)", "language": "OCaml", "metadata": {"date": 1562031333, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s219092087.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s219092087", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" @@ fun x y z -> Printf.printf \"%d\\n\" @@ (x - z) / (y + z)", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 80, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s819982840", "group_id": "codeNet:p03548", "input_text": "open Batteries\nlet () =\n  let x,y = Scanf.scanf \"%s %s \" (fun a b -> a,b) in\n  Printf.printf \"%s\\n\" @@\n  if x > y then \">\" else if x < y then \"<\" else \"=\"\n", "language": "OCaml", "metadata": {"date": 1529240605, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s819982840.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s819982840", "user_id": "u139013163"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Batteries\nlet () =\n  let x,y = Scanf.scanf \"%s %s \" (fun a b -> a,b) in\n  Printf.printf \"%s\\n\" @@\n  if x > y then \">\" else if x < y then \"<\" else \"=\"\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 1024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s122878375", "group_id": "codeNet:p03548", "input_text": "let () = Scanf.scanf \"%d %d %d\" (fun x y z -> (x-z)/(y+z)) |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1519794518, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s122878375.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s122878375", "user_id": "u798181098"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" (fun x y z -> (x-z)/(y+z)) |> Printf.printf \"%d\\n\"\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s381158712", "group_id": "codeNet:p03553", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ = Array.init (n + 1) @@ function\n    | 0 -> 0\n    | _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  for i = n downto 1 do\n    if\n      ( > ) 0 @@\n      Array.fold_left ( + ) 0 @@\n      Array.init (n / i) (fun j -> as_.(i * (1 + j)))\n    then\n      for j = 1 to n / i do\n        as_.(i * j) <- 0\n      done\n  done;\n  Printf.printf \"%d\\n\" @@ Array.fold_left ( + ) 0 as_\n", "language": "OCaml", "metadata": {"date": 1532100249, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03553.html", "problem_id": "p03553", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03553/input.txt", "sample_output_relpath": "derived/input_output/data/p03553/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03553/OCaml/s381158712.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s381158712", "user_id": "u504158101"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ = Array.init (n + 1) @@ function\n    | 0 -> 0\n    | _ -> Scanf.scanf \"%d \" @@ fun a -> a in\n  for i = n downto 1 do\n    if\n      ( > ) 0 @@\n      Array.fold_left ( + ) 0 @@\n      Array.init (n / i) (fun j -> as_.(i * (1 + j)))\n    then\n      for j = 1 to n / i do\n        as_.(i * j) <- 0\n      done\n  done;\n  Printf.printf \"%d\\n\" @@ Array.fold_left ( + ) 0 as_\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nWe have N gemstones labeled 1 through N.\n\nYou can perform the following operation any number of times (possibly zero).\n\nSelect a positive integer x, and smash all the gems labeled with multiples of x.\n\nThen, for each i, if the gem labeled i remains without getting smashed, you will receive a_i yen (the currency of Japan).\nHowever, a_i may be negative, in which case you will be charged money.\n\nBy optimally performing the operation, how much yen can you earn?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 100\n\n|a_i| \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum amount of money that can be earned.\n\nSample Input 1\n\n6\n1 2 -6 4 5 3\n\nSample Output 1\n\n12\n\nIt is optimal to smash Gem 3 and 6.\n\nSample Input 2\n\n6\n100 -100 -100 -100 100 -100\n\nSample Output 2\n\n200\n\nSample Input 3\n\n5\n-1 -2 -3 -4 -5\n\nSample Output 3\n\n0\n\nIt is optimal to smash all the gems.\n\nSample Input 4\n\n2\n-1000 100000\n\nSample Output 4\n\n99000", "sample_input": "6\n1 2 -6 4 5 3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p03553", "source_text": "Score : 700 points\n\nProblem Statement\n\nWe have N gemstones labeled 1 through N.\n\nYou can perform the following operation any number of times (possibly zero).\n\nSelect a positive integer x, and smash all the gems labeled with multiples of x.\n\nThen, for each i, if the gem labeled i remains without getting smashed, you will receive a_i yen (the currency of Japan).\nHowever, a_i may be negative, in which case you will be charged money.\n\nBy optimally performing the operation, how much yen can you earn?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 100\n\n|a_i| \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the maximum amount of money that can be earned.\n\nSample Input 1\n\n6\n1 2 -6 4 5 3\n\nSample Output 1\n\n12\n\nIt is optimal to smash Gem 3 and 6.\n\nSample Input 2\n\n6\n100 -100 -100 -100 100 -100\n\nSample Output 2\n\n200\n\nSample Input 3\n\n5\n-1 -2 -3 -4 -5\n\nSample Output 3\n\n0\n\nIt is optimal to smash all the gems.\n\nSample Input 4\n\n2\n-1000 100000\n\nSample Output 4\n\n99000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s816568102", "group_id": "codeNet:p03555", "input_text": "open Printf\nopen Scanf\n\nlet solve s1 s2 =\n  if s1.[0] = s2.[2] && s1.[1] = s2.[1] && s1.[2] = s2.[0] then \"YES\" else \"NO\"\n\nlet () =\n  scanf \"%s %s \" solve |> printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1582833522, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s816568102.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s816568102", "user_id": "u388783188"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve s1 s2 =\n  if s1.[0] = s2.[2] && s1.[1] = s2.[1] && s1.[2] = s2.[0] then \"YES\" else \"NO\"\n\nlet () =\n  scanf \"%s %s \" solve |> printf \"%s\\n\"\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s391528785", "group_id": "codeNet:p03555", "input_text": "let () =\n  let c1s = read_line () in\n  let c2s = read_line () in\n  Array.init 3 (fun i -> c1s.[i] = c2s.[2 - i])\n  |> Array.fold_left ( && ) true\n  |> (function true -> \"YES\" | false -> \"NO\")\n  |> print_endline", "language": "OCaml", "metadata": {"date": 1530666932, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s391528785.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s391528785", "user_id": "u504158101"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let () =\n  let c1s = read_line () in\n  let c2s = read_line () in\n  Array.init 3 (fun i -> c1s.[i] = c2s.[2 - i])\n  |> Array.fold_left ( && ) true\n  |> (function true -> \"YES\" | false -> \"NO\")\n  |> print_endline", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 210, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s643274248", "group_id": "codeNet:p03556", "input_text": "let n = read_int ()\nlet i = ref 1\nlet _ =\n  while !i * !i <= n do incr i done;\n  Printf.printf \"%d\\n\" @@ (!i - 1) * (!i - 1)", "language": "OCaml", "metadata": {"date": 1562037592, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s643274248.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s643274248", "user_id": "u732304692"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "let n = read_int ()\nlet i = ref 1\nlet _ =\n  while !i * !i <= n do incr i done;\n  Printf.printf \"%d\\n\" @@ (!i - 1) * (!i - 1)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the largest square number not exceeding N. Here, a square number is an integer that can be represented as the square of an integer.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the largest square number not exceeding N.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\n10 is not square, but 9 = 3 × 3 is. Thus, we print 9.\n\nSample Input 2\n\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\n271828182\n\nSample Output 3\n\n271821169", "sample_input": "10\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03556", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the largest square number not exceeding N. Here, a square number is an integer that can be represented as the square of an integer.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the largest square number not exceeding N.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\n10 is not square, but 9 = 3 × 3 is. Thus, we print 9.\n\nSample Input 2\n\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\n271828182\n\nSample Output 3\n\n271821169", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 124, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s893078072", "group_id": "codeNet:p03557", "input_text": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then Enum.empty ()\n  else\n    List.map (fun _ -> scan fmt f) (List.range 1 `To n)\n    |> List.enum\n\nlet scan_list cnv =\n  String.split_on_char ' ' @@ read_line ()\n  |> List.map cnv\n\nlet scan_array cnv = Array.of_list @@ scan_list cnv\n\nlet scan_matrix n m e conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (List.range 0 `To (pred n))\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet n = scan \"%d\" id\nlet a = scan_array Int.of_string\nlet b = scan_array Int.of_string\nlet c = scan_array Int.of_string\n\n\nlet () =\n  Array.sort Int.compare a;\n  Array.sort Int.compare b;\n  Array.sort Int.compare c;\n  let d = Array.of_list @@\n    ListL.map (0 ++^ Array.length b) ~f:(fun i ->\n        match Array.bsearch Int.ord c b.(i) with\n        | `At i | `Just_after i -> Array.length c - succ i\n        | `All_bigger -> Array.length c\n        | _ -> 0) in\n  ListL.iter (List.rev @@ 0 ++^ Array.length d) ~f:(fun i ->\n      if i - 1 >= 0 then d.(i-1) <- d.(i-1) + d.(i));\n  ListL.map (0 ++^ Array.length c) ~f:(fun i ->\n      match Array.bsearch Int.ord b a.(i) with\n      | `At i | `Just_after i -> d.(succ i)\n      | `All_bigger -> d.(0)\n      | _ -> 0)\n  |> List.sum\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1587267856, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s893078072.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s893078072", "user_id": "u802614675"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then Enum.empty ()\n  else\n    List.map (fun _ -> scan fmt f) (List.range 1 `To n)\n    |> List.enum\n\nlet scan_list cnv =\n  String.split_on_char ' ' @@ read_line ()\n  |> List.map cnv\n\nlet scan_array cnv = Array.of_list @@ scan_list cnv\n\nlet scan_matrix n m e conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (List.range 0 `To (pred n))\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet n = scan \"%d\" id\nlet a = scan_array Int.of_string\nlet b = scan_array Int.of_string\nlet c = scan_array Int.of_string\n\n\nlet () =\n  Array.sort Int.compare a;\n  Array.sort Int.compare b;\n  Array.sort Int.compare c;\n  let d = Array.of_list @@\n    ListL.map (0 ++^ Array.length b) ~f:(fun i ->\n        match Array.bsearch Int.ord c b.(i) with\n        | `At i | `Just_after i -> Array.length c - succ i\n        | `All_bigger -> Array.length c\n        | _ -> 0) in\n  ListL.iter (List.rev @@ 0 ++^ Array.length d) ~f:(fun i ->\n      if i - 1 >= 0 then d.(i-1) <- d.(i-1) + d.(i));\n  ListL.map (0 ++^ Array.length c) ~f:(fun i ->\n      match Array.bsearch Int.ord b a.(i) with\n      | `At i | `Just_after i -> d.(succ i)\n      | `All_bigger -> d.(0)\n      | _ -> 0)\n  |> List.sum\n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe season for Snuke Festival has come again this year. First of all, Ringo will perform a ritual to summon Snuke. For the ritual, he needs an altar, which consists of three parts, one in each of the three categories: upper, middle and lower.\n\nHe has N parts for each of the three categories. The size of the i-th upper part is A_i, the size of the i-th middle part is B_i, and the size of the i-th lower part is C_i.\n\nTo build an altar, the size of the middle part must be strictly greater than that of the upper part, and the size of the lower part must be strictly greater than that of the middle part. On the other hand, any three parts that satisfy these conditions can be combined to form an altar.\n\nHow many different altars can Ringo build? Here, two altars are considered different when at least one of the three parts used is different.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq C_i \\leq 10^9(1\\leq i\\leq N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\nB_1 ... B_N\nC_1 ... C_N\n\nOutput\n\nPrint the number of different altars that Ringo can build.\n\nSample Input 1\n\n2\n1 5\n2 4\n3 6\n\nSample Output 1\n\n3\n\nThe following three altars can be built:\n\nUpper: 1-st part, Middle: 1-st part, Lower: 1-st part\n\nUpper: 1-st part, Middle: 1-st part, Lower: 2-nd part\n\nUpper: 1-st part, Middle: 2-nd part, Lower: 2-nd part\n\nSample Input 2\n\n3\n1 1 1\n2 2 2\n3 3 3\n\nSample Output 2\n\n27\n\nSample Input 3\n\n6\n3 14 159 2 6 53\n58 9 79 323 84 6\n2643 383 2 79 50 288\n\nSample Output 3\n\n87", "sample_input": "2\n1 5\n2 4\n3 6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03557", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe season for Snuke Festival has come again this year. First of all, Ringo will perform a ritual to summon Snuke. For the ritual, he needs an altar, which consists of three parts, one in each of the three categories: upper, middle and lower.\n\nHe has N parts for each of the three categories. The size of the i-th upper part is A_i, the size of the i-th middle part is B_i, and the size of the i-th lower part is C_i.\n\nTo build an altar, the size of the middle part must be strictly greater than that of the upper part, and the size of the lower part must be strictly greater than that of the middle part. On the other hand, any three parts that satisfy these conditions can be combined to form an altar.\n\nHow many different altars can Ringo build? Here, two altars are considered different when at least one of the three parts used is different.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq C_i \\leq 10^9(1\\leq i\\leq N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\nB_1 ... B_N\nC_1 ... C_N\n\nOutput\n\nPrint the number of different altars that Ringo can build.\n\nSample Input 1\n\n2\n1 5\n2 4\n3 6\n\nSample Output 1\n\n3\n\nThe following three altars can be built:\n\nUpper: 1-st part, Middle: 1-st part, Lower: 1-st part\n\nUpper: 1-st part, Middle: 1-st part, Lower: 2-nd part\n\nUpper: 1-st part, Middle: 2-nd part, Lower: 2-nd part\n\nSample Input 2\n\n3\n1 1 1\n2 2 2\n3 3 3\n\nSample Output 2\n\n27\n\nSample Input 3\n\n6\n3 14 159 2 6 53\n58 9 79 323 84 6\n2643 383 2 79 50 288\n\nSample Output 3\n\n87", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2326, "cpu_time_ms": 262, "memory_kb": 19132}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s250518481", "group_id": "codeNet:p03557", "input_text": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++^) n m = List.range n `To (pred m)\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then Enum.empty ()\n  else\n    List.map (fun _ -> scan fmt f) (List.range 1 `To n)\n    |> List.enum\n\nlet scan_list cnv =\n  String.split_on_char ' ' @@ read_line ()\n  |> List.map cnv\n\nlet scan_array cnv = Array.of_list @@ scan_list cnv\n\nlet scan_matrix n m e conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (List.range 0 `To (pred n))\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet n = scan \"%d\" id\nlet a = scan_array Int.of_string\nlet b = scan_array Int.of_string\nlet c = scan_array Int.of_string\n\nlet () =\n  Array.sort Int.compare a;\n  Array.sort Int.compare b;\n  Array.sort Int.compare c;\n  Array.Labels.map a ~f:(fun va ->\n      match match Array.bsearch Int.ord b va with\n        | `At i | `Just_after i -> Some (succ i)\n        | `All_bigger -> Some 0\n        | _ -> None\n      with\n      | Some i ->\n        Array.Labels.map (Array.sub b i (Array.length b - i))\n          ~f:(fun vb ->\n              match Array.bsearch Int.ord c vb with\n              | `At i | `Just_after i ->\n                Array.length c - i - 1\n              | `All_bigger -> Array.length c\n              | _ -> 0)\n        |> Array.sum\n      | None -> 0)\n  |> Array.sum\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1587265998, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s250518481.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s250518481", "user_id": "u802614675"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++^) n m = List.range n `To (pred m)\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then Enum.empty ()\n  else\n    List.map (fun _ -> scan fmt f) (List.range 1 `To n)\n    |> List.enum\n\nlet scan_list cnv =\n  String.split_on_char ' ' @@ read_line ()\n  |> List.map cnv\n\nlet scan_array cnv = Array.of_list @@ scan_list cnv\n\nlet scan_matrix n m e conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (List.range 0 `To (pred n))\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet n = scan \"%d\" id\nlet a = scan_array Int.of_string\nlet b = scan_array Int.of_string\nlet c = scan_array Int.of_string\n\nlet () =\n  Array.sort Int.compare a;\n  Array.sort Int.compare b;\n  Array.sort Int.compare c;\n  Array.Labels.map a ~f:(fun va ->\n      match match Array.bsearch Int.ord b va with\n        | `At i | `Just_after i -> Some (succ i)\n        | `All_bigger -> Some 0\n        | _ -> None\n      with\n      | Some i ->\n        Array.Labels.map (Array.sub b i (Array.length b - i))\n          ~f:(fun vb ->\n              match Array.bsearch Int.ord c vb with\n              | `At i | `Just_after i ->\n                Array.length c - i - 1\n              | `All_bigger -> Array.length c\n              | _ -> 0)\n        |> Array.sum\n      | None -> 0)\n  |> Array.sum\n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe season for Snuke Festival has come again this year. First of all, Ringo will perform a ritual to summon Snuke. For the ritual, he needs an altar, which consists of three parts, one in each of the three categories: upper, middle and lower.\n\nHe has N parts for each of the three categories. The size of the i-th upper part is A_i, the size of the i-th middle part is B_i, and the size of the i-th lower part is C_i.\n\nTo build an altar, the size of the middle part must be strictly greater than that of the upper part, and the size of the lower part must be strictly greater than that of the middle part. On the other hand, any three parts that satisfy these conditions can be combined to form an altar.\n\nHow many different altars can Ringo build? Here, two altars are considered different when at least one of the three parts used is different.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq C_i \\leq 10^9(1\\leq i\\leq N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\nB_1 ... B_N\nC_1 ... C_N\n\nOutput\n\nPrint the number of different altars that Ringo can build.\n\nSample Input 1\n\n2\n1 5\n2 4\n3 6\n\nSample Output 1\n\n3\n\nThe following three altars can be built:\n\nUpper: 1-st part, Middle: 1-st part, Lower: 1-st part\n\nUpper: 1-st part, Middle: 1-st part, Lower: 2-nd part\n\nUpper: 1-st part, Middle: 2-nd part, Lower: 2-nd part\n\nSample Input 2\n\n3\n1 1 1\n2 2 2\n3 3 3\n\nSample Output 2\n\n27\n\nSample Input 3\n\n6\n3 14 159 2 6 53\n58 9 79 323 84 6\n2643 383 2 79 50 288\n\nSample Output 3\n\n87", "sample_input": "2\n1 5\n2 4\n3 6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03557", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe season for Snuke Festival has come again this year. First of all, Ringo will perform a ritual to summon Snuke. For the ritual, he needs an altar, which consists of three parts, one in each of the three categories: upper, middle and lower.\n\nHe has N parts for each of the three categories. The size of the i-th upper part is A_i, the size of the i-th middle part is B_i, and the size of the i-th lower part is C_i.\n\nTo build an altar, the size of the middle part must be strictly greater than that of the upper part, and the size of the lower part must be strictly greater than that of the middle part. On the other hand, any three parts that satisfy these conditions can be combined to form an altar.\n\nHow many different altars can Ringo build? Here, two altars are considered different when at least one of the three parts used is different.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\n1 \\leq C_i \\leq 10^9(1\\leq i\\leq N)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 ... A_N\nB_1 ... B_N\nC_1 ... C_N\n\nOutput\n\nPrint the number of different altars that Ringo can build.\n\nSample Input 1\n\n2\n1 5\n2 4\n3 6\n\nSample Output 1\n\n3\n\nThe following three altars can be built:\n\nUpper: 1-st part, Middle: 1-st part, Lower: 1-st part\n\nUpper: 1-st part, Middle: 1-st part, Lower: 2-nd part\n\nUpper: 1-st part, Middle: 2-nd part, Lower: 2-nd part\n\nSample Input 2\n\n3\n1 1 1\n2 2 2\n3 3 3\n\nSample Output 2\n\n27\n\nSample Input 3\n\n6\n3 14 159 2 6 53\n58 9 79 323 84 6\n2643 383 2 79 50 288\n\nSample Output 3\n\n87", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2302, "cpu_time_ms": 2105, "memory_kb": 23984}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s385568911", "group_id": "codeNet:p03558", "input_text": "\nmodule M = Set.Make(struct\n  type t = int * int\n  let compare = compare\nend)\n\nlet () =\n  Scanf.scanf \"%d\" @@ fun k ->\n  let (+%) a b = (a + b) mod k in\n  let ( *%) a b = (a * b) mod k in\n\n  let a = Array.make k k in\n  a.(1) <- 1;\n  let rec loop pq =\n    if M.is_empty pq then () else begin\n      let (d, m) = M.min_elt pq in\n      let pq' = M.remove (d, m) pq in\n      if d > a.(m) then loop pq' else\n      [(d+1, m+%1); (d, m *% 10)] |> List.fold_left (fun q (d',m') ->\n        if d' < a.(m') then begin\n          a.(m') <- d';\n          M.add (d', m') q\n        end else q\n      ) pq' |> loop\n    end\n  in\n  loop (M.singleton (1, 1));\n  Printf.printf \"%d\\n\" a.(0)", "language": "OCaml", "metadata": {"date": 1532751310, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03558.html", "problem_id": "p03558", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03558/input.txt", "sample_output_relpath": "derived/input_output/data/p03558/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03558/OCaml/s385568911.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s385568911", "user_id": "u798181098"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "\nmodule M = Set.Make(struct\n  type t = int * int\n  let compare = compare\nend)\n\nlet () =\n  Scanf.scanf \"%d\" @@ fun k ->\n  let (+%) a b = (a + b) mod k in\n  let ( *%) a b = (a * b) mod k in\n\n  let a = Array.make k k in\n  a.(1) <- 1;\n  let rec loop pq =\n    if M.is_empty pq then () else begin\n      let (d, m) = M.min_elt pq in\n      let pq' = M.remove (d, m) pq in\n      if d > a.(m) then loop pq' else\n      [(d+1, m+%1); (d, m *% 10)] |> List.fold_left (fun q (d',m') ->\n        if d' < a.(m') then begin\n          a.(m') <- d';\n          M.add (d', m') q\n        end else q\n      ) pq' |> loop\n    end\n  in\n  loop (M.singleton (1, 1));\n  Printf.printf \"%d\\n\" a.(0)", "problem_context": "Score : 700 points\n\nProblem Statement\n\nFind the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nConstraints\n\n2 \\leq K \\leq 10^5\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n3\n\n12=6×2 yields the smallest sum.\n\nSample Input 2\n\n41\n\nSample Output 2\n\n5\n\n11111=41×271 yields the smallest sum.\n\nSample Input 3\n\n79992\n\nSample Output 3\n\n36", "sample_input": "6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03558", "source_text": "Score : 700 points\n\nProblem Statement\n\nFind the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nConstraints\n\n2 \\leq K \\leq 10^5\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n3\n\n12=6×2 yields the smallest sum.\n\nSample Input 2\n\n41\n\nSample Output 2\n\n5\n\n11111=41×271 yields the smallest sum.\n\nSample Input 3\n\n79992\n\nSample Output 3\n\n36", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 666, "cpu_time_ms": 163, "memory_kb": 9344}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s542742873", "group_id": "codeNet:p03558", "input_text": "let rec sum10 n acc =\n  let m = n / 10 in\n  if m = 0 then n + acc\n  else sum10 m (acc + (n mod 10))\n\n\nlet solve n =\n  Array.init 100 (fun i -> sum10 (n * (i + 1)) 0)\n  |> Array.fold_left min n\n\nlet () = Scanf.scanf \"%d\" solve |> Printf.printf \"%d\"", "language": "OCaml", "metadata": {"date": 1509846572, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03558.html", "problem_id": "p03558", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03558/input.txt", "sample_output_relpath": "derived/input_output/data/p03558/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03558/OCaml/s542742873.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s542742873", "user_id": "u702189202"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let rec sum10 n acc =\n  let m = n / 10 in\n  if m = 0 then n + acc\n  else sum10 m (acc + (n mod 10))\n\n\nlet solve n =\n  Array.init 100 (fun i -> sum10 (n * (i + 1)) 0)\n  |> Array.fold_left min n\n\nlet () = Scanf.scanf \"%d\" solve |> Printf.printf \"%d\"", "problem_context": "Score : 700 points\n\nProblem Statement\n\nFind the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nConstraints\n\n2 \\leq K \\leq 10^5\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n3\n\n12=6×2 yields the smallest sum.\n\nSample Input 2\n\n41\n\nSample Output 2\n\n5\n\n11111=41×271 yields the smallest sum.\n\nSample Input 3\n\n79992\n\nSample Output 3\n\n36", "sample_input": "6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03558", "source_text": "Score : 700 points\n\nProblem Statement\n\nFind the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nConstraints\n\n2 \\leq K \\leq 10^5\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n3\n\n12=6×2 yields the smallest sum.\n\nSample Input 2\n\n41\n\nSample Output 2\n\n5\n\n11111=41×271 yields the smallest sum.\n\nSample Input 3\n\n79992\n\nSample Output 3\n\n36", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s782835402", "group_id": "codeNet:p03563", "input_text": "let f now to_ = to_+to_-now;;\nScanf.scanf \"%d %d\" f |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1561095961, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s782835402.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s782835402", "user_id": "u635974378"}, "prompt_components": {"gold_output": "2032\n", "input_to_evaluate": "let f now to_ = to_+to_-now;;\nScanf.scanf \"%d %d\" f |> Printf.printf \"%d\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is a user of a site that hosts programming contests.\n\nWhen a user competes in a contest, the rating of the user (not necessarily an integer) changes according to the performance of the user, as follows:\n\nLet the current rating of the user be a.\n\nSuppose that the performance of the user in the contest is b.\n\nThen, the new rating of the user will be the avarage of a and b.\n\nFor example, if a user with rating 1 competes in a contest and gives performance 1000, his/her new rating will be 500.5, the average of 1 and 1000.\n\nTakahashi's current rating is R, and he wants his rating to be exactly G after the next contest.\n\nFind the performance required to achieve it.\n\nConstraints\n\n0 \\leq R, G \\leq 4500\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\nG\n\nOutput\n\nPrint the performance required to achieve the objective.\n\nSample Input 1\n\n2002\n2017\n\nSample Output 1\n\n2032\n\nTakahashi's current rating is 2002.\n\nIf his performance in the contest is 2032, his rating will be the average of 2002 and 2032, which is equal to the desired rating, 2017.\n\nSample Input 2\n\n4500\n0\n\nSample Output 2\n\n-4500\n\nAlthough the current and desired ratings are between 0 and 4500, the performance of a user can be below 0.", "sample_input": "2002\n2017\n"}, "reference_outputs": ["2032\n"], "source_document_id": "p03563", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is a user of a site that hosts programming contests.\n\nWhen a user competes in a contest, the rating of the user (not necessarily an integer) changes according to the performance of the user, as follows:\n\nLet the current rating of the user be a.\n\nSuppose that the performance of the user in the contest is b.\n\nThen, the new rating of the user will be the avarage of a and b.\n\nFor example, if a user with rating 1 competes in a contest and gives performance 1000, his/her new rating will be 500.5, the average of 1 and 1000.\n\nTakahashi's current rating is R, and he wants his rating to be exactly G after the next contest.\n\nFind the performance required to achieve it.\n\nConstraints\n\n0 \\leq R, G \\leq 4500\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\nG\n\nOutput\n\nPrint the performance required to achieve the objective.\n\nSample Input 1\n\n2002\n2017\n\nSample Output 1\n\n2032\n\nTakahashi's current rating is 2002.\n\nIf his performance in the contest is 2032, his rating will be the average of 2002 and 2032, which is equal to the desired rating, 2017.\n\nSample Input 2\n\n4500\n0\n\nSample Output 2\n\n-4500\n\nAlthough the current and desired ratings are between 0 and 4500, the performance of a user can be below 0.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 75, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s536612165", "group_id": "codeNet:p03563", "input_text": "open Batteries\nlet () =\n  let a,b = Scanf.scanf \"%d %d \" (fun a b -> a,b) in\n  Printf.printf \"%d\\n\" @@\n  a+(b-a)*2\n", "language": "OCaml", "metadata": {"date": 1529242112, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s536612165.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s536612165", "user_id": "u139013163"}, "prompt_components": {"gold_output": "2032\n", "input_to_evaluate": "open Batteries\nlet () =\n  let a,b = Scanf.scanf \"%d %d \" (fun a b -> a,b) in\n  Printf.printf \"%d\\n\" @@\n  a+(b-a)*2\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is a user of a site that hosts programming contests.\n\nWhen a user competes in a contest, the rating of the user (not necessarily an integer) changes according to the performance of the user, as follows:\n\nLet the current rating of the user be a.\n\nSuppose that the performance of the user in the contest is b.\n\nThen, the new rating of the user will be the avarage of a and b.\n\nFor example, if a user with rating 1 competes in a contest and gives performance 1000, his/her new rating will be 500.5, the average of 1 and 1000.\n\nTakahashi's current rating is R, and he wants his rating to be exactly G after the next contest.\n\nFind the performance required to achieve it.\n\nConstraints\n\n0 \\leq R, G \\leq 4500\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\nG\n\nOutput\n\nPrint the performance required to achieve the objective.\n\nSample Input 1\n\n2002\n2017\n\nSample Output 1\n\n2032\n\nTakahashi's current rating is 2002.\n\nIf his performance in the contest is 2032, his rating will be the average of 2002 and 2032, which is equal to the desired rating, 2017.\n\nSample Input 2\n\n4500\n0\n\nSample Output 2\n\n-4500\n\nAlthough the current and desired ratings are between 0 and 4500, the performance of a user can be below 0.", "sample_input": "2002\n2017\n"}, "reference_outputs": ["2032\n"], "source_document_id": "p03563", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is a user of a site that hosts programming contests.\n\nWhen a user competes in a contest, the rating of the user (not necessarily an integer) changes according to the performance of the user, as follows:\n\nLet the current rating of the user be a.\n\nSuppose that the performance of the user in the contest is b.\n\nThen, the new rating of the user will be the avarage of a and b.\n\nFor example, if a user with rating 1 competes in a contest and gives performance 1000, his/her new rating will be 500.5, the average of 1 and 1000.\n\nTakahashi's current rating is R, and he wants his rating to be exactly G after the next contest.\n\nFind the performance required to achieve it.\n\nConstraints\n\n0 \\leq R, G \\leq 4500\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\nG\n\nOutput\n\nPrint the performance required to achieve the objective.\n\nSample Input 1\n\n2002\n2017\n\nSample Output 1\n\n2032\n\nTakahashi's current rating is 2002.\n\nIf his performance in the contest is 2032, his rating will be the average of 2002 and 2032, which is equal to the desired rating, 2017.\n\nSample Input 2\n\n4500\n0\n\nSample Output 2\n\n-4500\n\nAlthough the current and desired ratings are between 0 and 4500, the performance of a user can be below 0.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 115, "cpu_time_ms": 2, "memory_kb": 3072}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s021903480", "group_id": "codeNet:p03564", "input_text": "let rec f res (n, k) =\n  if n <= 0 then res\n  else if res > k then f (res + k) (n - 1, k)\n  else f (res * 2) (n - 1, k)\n\nlet () =\n  let n, k = Scanf.scanf \"%d\\n%d\" (fun n k -> (n, k)) in\n  f 1 (n, k) |> print_int\n", "language": "OCaml", "metadata": {"date": 1582595368, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s021903480.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s021903480", "user_id": "u575440531"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let rec f res (n, k) =\n  if n <= 0 then res\n  else if res > k then f (res + k) (n - 1, k)\n  else f (res * 2) (n - 1, k)\n\nlet () =\n  let n, k = Scanf.scanf \"%d\\n%d\" (fun n k -> (n, k)) in\n  f 1 (n, k) |> print_int\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 213, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s099792795", "group_id": "codeNet:p03564", "input_text": "let n, k = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet ans = ref 1\nlet _ =\n  for i = 1 to n do ans := min (!ans * 2) @@ !ans + k done;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1562121942, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s099792795.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s099792795", "user_id": "u732304692"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let n, k = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet ans = ref 1\nlet _ =\n  for i = 1 to n do ans := min (!ans * 2) @@ !ans + k done;\n  Printf.printf \"%d\\n\" !ans", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s045146986", "group_id": "codeNet:p03568", "input_text": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet rec f i b =\n  if i >= n then if b then 1 else 0\n  else let ft, fb = f (i + 1) true, f (i + 1) b in if a_s.(i) mod 2 = 0 then ft + 2 * fb else fb + 2 * ft\nlet _ = Printf.printf \"%d\\n\" @@ f 0 false", "language": "OCaml", "metadata": {"date": 1563938314, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s045146986.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s045146986", "user_id": "u732304692"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet rec f i b =\n  if i >= n then if b then 1 else 0\n  else let ft, fb = f (i + 1) true, f (i + 1) b in if a_s.(i) mod 2 = 0 then ft + 2 * fb else fb + 2 * ft\nlet _ = Printf.printf \"%d\\n\" @@ f 0 false", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s826567491", "group_id": "codeNet:p03568", "input_text": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet rec f i b =\n  if i >= n then if b then 1 else 0\n  else if a_s.(i) mod 2 = 0 then f (i + 1) true + f (i + 1) b + f (i + 1) b\n  else f (i + 1) b + f (i + 1) true + f (i + 1) true\nlet _ = Printf.printf \"%d\\n\" @@ f 0 false", "language": "OCaml", "metadata": {"date": 1563938041, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s826567491.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s826567491", "user_id": "u732304692"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet rec f i b =\n  if i >= n then if b then 1 else 0\n  else if a_s.(i) mod 2 = 0 then f (i + 1) true + f (i + 1) b + f (i + 1) b\n  else f (i + 1) b + f (i + 1) true + f (i + 1) true\nlet _ = Printf.printf \"%d\\n\" @@ f 0 false", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 313, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s779599095", "group_id": "codeNet:p03573", "input_text": "let a, b, c = Scanf.scanf \"%d %d %d\" @@ fun a b c -> a, b, c\nlet ans = if a = b then c else if a = c then b else a\nlet () = print_int ans", "language": "OCaml", "metadata": {"date": 1588003481, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s779599095.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s779599095", "user_id": "u307426615"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "let a, b, c = Scanf.scanf \"%d %d %d\" @@ fun a b c -> a, b, c\nlet ans = if a = b then c else if a = c then b else a\nlet () = print_int ans", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers, A, B and C.\n\nAmong them, two are the same, but the remaining one is different from the rest.\n\nFor example, when A=5,B=7,C=5, A and C are the same, but B is different.\n\nFind the one that is different from the rest among the given three integers.\n\nConstraints\n\n-100 \\leq A,B,C \\leq 100\n\nA, B and C are integers.\n\nThe input satisfies the condition in the statement.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nAmong A, B and C, print the integer that is different from the rest.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\n7\n\nThis is the same case as the one in the statement.\n\nSample Input 2\n\n1 1 7\n\nSample Output 2\n\n7\n\nIn this case, C is the one we seek.\n\nSample Input 3\n\n-100 100 100\n\nSample Output 3\n\n-100", "sample_input": "5 7 5\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03573", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers, A, B and C.\n\nAmong them, two are the same, but the remaining one is different from the rest.\n\nFor example, when A=5,B=7,C=5, A and C are the same, but B is different.\n\nFind the one that is different from the rest among the given three integers.\n\nConstraints\n\n-100 \\leq A,B,C \\leq 100\n\nA, B and C are integers.\n\nThe input satisfies the condition in the statement.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nAmong A, B and C, print the integer that is different from the rest.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\n7\n\nThis is the same case as the one in the statement.\n\nSample Input 2\n\n1 1 7\n\nSample Output 2\n\n7\n\nIn this case, C is the one we seek.\n\nSample Input 3\n\n-100 100 100\n\nSample Output 3\n\n-100", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 137, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s586708308", "group_id": "codeNet:p03576", "input_text": "let n, k = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet xys = Array.init n @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet ans, xs, ys = ref max_int, ref [], ref []\nlet _ = Array.iteri (fun i (xi, yi) -> for j = i + 1 to n - 1 do let xj, yj = xys.(j) in xs := (xi, xj) :: !xs; ys := (yi, yj) :: !ys done) xys; List.(iter (fun (xi, xj) -> iter (fun (yi, yj) -> if Array.fold_left (fun c (x, y) -> if (xi <= x && x <= xj || xj <= x && x <= xi) && (yi <= y && y <= yj || yj <= y && y <= yi) then c + 1 else c) 0 xys >= k then ans := min !ans @@ abs (xi - xj) * abs (yi - yj)) !ys) !xs); Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1583519073, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03576.html", "problem_id": "p03576", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03576/input.txt", "sample_output_relpath": "derived/input_output/data/p03576/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03576/OCaml/s586708308.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s586708308", "user_id": "u732304692"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "let n, k = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet xys = Array.init n @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet ans, xs, ys = ref max_int, ref [], ref []\nlet _ = Array.iteri (fun i (xi, yi) -> for j = i + 1 to n - 1 do let xj, yj = xys.(j) in xs := (xi, xj) :: !xs; ys := (yi, yj) :: !ys done) xys; List.(iter (fun (xi, xj) -> iter (fun (yi, yj) -> if Array.fold_left (fun c (x, y) -> if (xi <= x && x <= xj || xj <= x && x <= xi) && (yi <= y && y <= yj || yj <= y && y <= yi) then c + 1 else c) 0 xys >= k then ans := min !ans @@ abs (xi - xj) * abs (yi - yj)) !ys) !xs); Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N points in a two-dimensional plane.\n\nThe coordinates of the i-th point (1 \\leq i \\leq N) are (x_i,y_i).\n\nLet us consider a rectangle whose sides are parallel to the coordinate axes that contains K or more of the N points in its interior.\n\nHere, points on the sides of the rectangle are considered to be in the interior.\n\nFind the minimum possible area of such a rectangle.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 50\n\n-10^9 \\leq x_i,y_i \\leq 10^9 (1 \\leq i \\leq N)\n\nx_i≠x_j (1 \\leq i<j \\leq N)\n\ny_i≠y_j (1 \\leq i<j \\leq N)\n\nAll input values are integers. (Added at 21:50 JST)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 y_1\n:\nx_{N} y_{N}\n\nOutput\n\nPrint the minimum possible area of a rectangle that satisfies the condition.\n\nSample Input 1\n\n4 4\n1 4\n3 3\n6 2\n8 1\n\nSample Output 1\n\n21\n\nOne rectangle that satisfies the condition with the minimum possible area has the following vertices: (1,1), (8,1), (1,4) and (8,4).\n\nIts area is (8-1) × (4-1) = 21.\n\nSample Input 2\n\n4 2\n0 0\n1 1\n2 2\n3 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n4 3\n-1000000000 -1000000000\n1000000000 1000000000\n-999999999 999999999\n999999999 -999999999\n\nSample Output 3\n\n3999999996000000001\n\nWatch out for integer overflows.", "sample_input": "4 4\n1 4\n3 3\n6 2\n8 1\n"}, "reference_outputs": ["21\n"], "source_document_id": "p03576", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N points in a two-dimensional plane.\n\nThe coordinates of the i-th point (1 \\leq i \\leq N) are (x_i,y_i).\n\nLet us consider a rectangle whose sides are parallel to the coordinate axes that contains K or more of the N points in its interior.\n\nHere, points on the sides of the rectangle are considered to be in the interior.\n\nFind the minimum possible area of such a rectangle.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 50\n\n-10^9 \\leq x_i,y_i \\leq 10^9 (1 \\leq i \\leq N)\n\nx_i≠x_j (1 \\leq i<j \\leq N)\n\ny_i≠y_j (1 \\leq i<j \\leq N)\n\nAll input values are integers. (Added at 21:50 JST)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 y_1\n:\nx_{N} y_{N}\n\nOutput\n\nPrint the minimum possible area of a rectangle that satisfies the condition.\n\nSample Input 1\n\n4 4\n1 4\n3 3\n6 2\n8 1\n\nSample Output 1\n\n21\n\nOne rectangle that satisfies the condition with the minimum possible area has the following vertices: (1,1), (8,1), (1,4) and (8,4).\n\nIts area is (8-1) × (4-1) = 21.\n\nSample Input 2\n\n4 2\n0 0\n1 1\n2 2\n3 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n4 3\n-1000000000 -1000000000\n1000000000 1000000000\n-999999999 999999999\n999999999 -999999999\n\nSample Output 3\n\n3999999996000000001\n\nWatch out for integer overflows.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 616, "cpu_time_ms": 455, "memory_kb": 4608}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s125727943", "group_id": "codeNet:p03576", "input_text": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let xys = Array.init n @@ fun _ ->\n    Scanf.scanf \"%d %d\\n\" @@ fun x y -> x, y in\n  Array.sort (fun (v, w) (x, y) -> compare (v, ~- w) (x, ~- y)) xys;\n  Printf.printf \"%d\\n\" @@ Array.fold_left (Array.fold_left min) max_int @@\n    Array.init (n - k + 1) @@ fun i ->\n      Array.init (n - i - k + 1) @@ fun j ->\n        let xys' = Array.init (j + k) (fun k -> snd xys.(i + k)) in\n        Array.sort compare xys';\n        (fst xys.(i + j + k - 1) - fst xys.(i)) * \n        Array.fold_left min max_int (Array.init (j + 1) (fun j -> xys'.(j + k - 1) - xys'.(j)))\n", "language": "OCaml", "metadata": {"date": 1531836816, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03576.html", "problem_id": "p03576", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03576/input.txt", "sample_output_relpath": "derived/input_output/data/p03576/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03576/OCaml/s125727943.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s125727943", "user_id": "u504158101"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let xys = Array.init n @@ fun _ ->\n    Scanf.scanf \"%d %d\\n\" @@ fun x y -> x, y in\n  Array.sort (fun (v, w) (x, y) -> compare (v, ~- w) (x, ~- y)) xys;\n  Printf.printf \"%d\\n\" @@ Array.fold_left (Array.fold_left min) max_int @@\n    Array.init (n - k + 1) @@ fun i ->\n      Array.init (n - i - k + 1) @@ fun j ->\n        let xys' = Array.init (j + k) (fun k -> snd xys.(i + k)) in\n        Array.sort compare xys';\n        (fst xys.(i + j + k - 1) - fst xys.(i)) * \n        Array.fold_left min max_int (Array.init (j + 1) (fun j -> xys'.(j + k - 1) - xys'.(j)))\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N points in a two-dimensional plane.\n\nThe coordinates of the i-th point (1 \\leq i \\leq N) are (x_i,y_i).\n\nLet us consider a rectangle whose sides are parallel to the coordinate axes that contains K or more of the N points in its interior.\n\nHere, points on the sides of the rectangle are considered to be in the interior.\n\nFind the minimum possible area of such a rectangle.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 50\n\n-10^9 \\leq x_i,y_i \\leq 10^9 (1 \\leq i \\leq N)\n\nx_i≠x_j (1 \\leq i<j \\leq N)\n\ny_i≠y_j (1 \\leq i<j \\leq N)\n\nAll input values are integers. (Added at 21:50 JST)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 y_1\n:\nx_{N} y_{N}\n\nOutput\n\nPrint the minimum possible area of a rectangle that satisfies the condition.\n\nSample Input 1\n\n4 4\n1 4\n3 3\n6 2\n8 1\n\nSample Output 1\n\n21\n\nOne rectangle that satisfies the condition with the minimum possible area has the following vertices: (1,1), (8,1), (1,4) and (8,4).\n\nIts area is (8-1) × (4-1) = 21.\n\nSample Input 2\n\n4 2\n0 0\n1 1\n2 2\n3 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n4 3\n-1000000000 -1000000000\n1000000000 1000000000\n-999999999 999999999\n999999999 -999999999\n\nSample Output 3\n\n3999999996000000001\n\nWatch out for integer overflows.", "sample_input": "4 4\n1 4\n3 3\n6 2\n8 1\n"}, "reference_outputs": ["21\n"], "source_document_id": "p03576", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N points in a two-dimensional plane.\n\nThe coordinates of the i-th point (1 \\leq i \\leq N) are (x_i,y_i).\n\nLet us consider a rectangle whose sides are parallel to the coordinate axes that contains K or more of the N points in its interior.\n\nHere, points on the sides of the rectangle are considered to be in the interior.\n\nFind the minimum possible area of such a rectangle.\n\nConstraints\n\n2 \\leq K \\leq N \\leq 50\n\n-10^9 \\leq x_i,y_i \\leq 10^9 (1 \\leq i \\leq N)\n\nx_i≠x_j (1 \\leq i<j \\leq N)\n\ny_i≠y_j (1 \\leq i<j \\leq N)\n\nAll input values are integers. (Added at 21:50 JST)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 y_1\n:\nx_{N} y_{N}\n\nOutput\n\nPrint the minimum possible area of a rectangle that satisfies the condition.\n\nSample Input 1\n\n4 4\n1 4\n3 3\n6 2\n8 1\n\nSample Output 1\n\n21\n\nOne rectangle that satisfies the condition with the minimum possible area has the following vertices: (1,1), (8,1), (1,4) and (8,4).\n\nIts area is (8-1) × (4-1) = 21.\n\nSample Input 2\n\n4 2\n0 0\n1 1\n2 2\n3 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n4 3\n-1000000000 -1000000000\n1000000000 1000000000\n-999999999 999999999\n999999999 -999999999\n\nSample Output 3\n\n3999999996000000001\n\nWatch out for integer overflows.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 606, "cpu_time_ms": 5, "memory_kb": 1792}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s203695525", "group_id": "codeNet:p03583", "input_text": "let () = Scanf.scanf \"%d\" (fun n ->\n  try\n    for h = 1 to 3500 do\n      for w = h to 3500 do\n        if 4 * h * w > n * w + n * h && (n * h * w) mod (4 * h * w - n * w - n * h) = 0\n        then (Printf.printf \"%d %d %d\\n\" h ((n * h * w) / (4 * h * w - n * w - n * h)) w; raise Not_found)\n      done\n    done\n  with Not_found -> ())", "language": "OCaml", "metadata": {"date": 1506820866, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03583.html", "problem_id": "p03583", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03583/input.txt", "sample_output_relpath": "derived/input_output/data/p03583/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03583/OCaml/s203695525.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s203695525", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1 2 2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\" (fun n ->\n  try\n    for h = 1 to 3500 do\n      for w = h to 3500 do\n        if 4 * h * w > n * w + n * h && (n * h * w) mod (4 * h * w - n * w - n * h) = 0\n        then (Printf.printf \"%d %d %d\\n\" h ((n * h * w) / (4 * h * w - n * w - n * h)) w; raise Not_found)\n      done\n    done\n  with Not_found -> ())", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFind a triple of positive integers h, n and w such that 4/N = 1/h + 1/n + 1/w.\n\nIf there are multiple solutions, any of them will be accepted.\n\nConstraints\n\nIt is guaranteed that, for the given integer N, there exists a solution such that h,n,w \\leq 3500.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutputs\n\nPrint a triple of positive integers h, n and w that satisfies the condition, in the following format:\n\nh n w\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1 2 2\n\n4/2 = 1/1 + 1/2 + 1/2.\n\nSample Input 2\n\n3485\n\nSample Output 2\n\n872 1012974 1539173474040\n\nIt is allowed to use an integer exceeding 3500 in a solution.\n\nSample Input 3\n\n4664\n\nSample Output 3\n\n3498 3498 3498", "sample_input": "2\n"}, "reference_outputs": ["1 2 2\n"], "source_document_id": "p03583", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFind a triple of positive integers h, n and w such that 4/N = 1/h + 1/n + 1/w.\n\nIf there are multiple solutions, any of them will be accepted.\n\nConstraints\n\nIt is guaranteed that, for the given integer N, there exists a solution such that h,n,w \\leq 3500.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutputs\n\nPrint a triple of positive integers h, n and w that satisfies the condition, in the following format:\n\nh n w\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1 2 2\n\n4/2 = 1/1 + 1/2 + 1/2.\n\nSample Input 2\n\n3485\n\nSample Output 2\n\n872 1012974 1539173474040\n\nIt is allowed to use an integer exceeding 3500 in a solution.\n\nSample Input 3\n\n4664\n\nSample Output 3\n\n3498 3498 3498", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 332, "cpu_time_ms": 9, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s669618902", "group_id": "codeNet:p03584", "input_text": "let flood_bits bits =\n  List.fold_left (fun bits shamt ->\n    bits lor (bits lsr shamt)) bits\n  [1; 2; 4; 8; 16; 32]\nlet highest_bit bits =\n  bits land lnot (flood_bits bits lsr 1)\n\nlet rec generate_pattern k =\n  if k = 0 then [0]\n  else begin\n    let highest = highest_bit k in\n    highest - 1 :: List.map (( lor ) highest) (generate_pattern (k land lnot highest))\n  end\n\nlet () =\n  let n, k = Scanf.scanf \"%d %d\\n\" (fun n k -> n, k) in\n  let abs = Array.init n (fun _ -> Scanf.scanf \"%d %d\\n\" (fun a b -> a, b)) in\n  generate_pattern k\n  |> List.map (fun pat ->\n      Array.fold_left (fun b' (a, b) ->\n        if a land lnot pat = 0 then b + b' else b') 0 abs)\n  |> List.fold_left max 0\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1506826073, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03584.html", "problem_id": "p03584", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03584/input.txt", "sample_output_relpath": "derived/input_output/data/p03584/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03584/OCaml/s669618902.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s669618902", "user_id": "u504158101"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "let flood_bits bits =\n  List.fold_left (fun bits shamt ->\n    bits lor (bits lsr shamt)) bits\n  [1; 2; 4; 8; 16; 32]\nlet highest_bit bits =\n  bits land lnot (flood_bits bits lsr 1)\n\nlet rec generate_pattern k =\n  if k = 0 then [0]\n  else begin\n    let highest = highest_bit k in\n    highest - 1 :: List.map (( lor ) highest) (generate_pattern (k land lnot highest))\n  end\n\nlet () =\n  let n, k = Scanf.scanf \"%d %d\\n\" (fun n k -> n, k) in\n  let abs = Array.init n (fun _ -> Scanf.scanf \"%d %d\\n\" (fun a b -> a, b)) in\n  generate_pattern k\n  |> List.map (fun pat ->\n      Array.fold_left (fun b' (a, b) ->\n        if a land lnot pat = 0 then b + b' else b') 0 abs)\n  |> List.fold_left max 0\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 500 points\n\nProblem Statement\n\nSeisu-ya, a store specializing in non-negative integers, sells N non-negative integers. The i-th integer is A_i and has a utility of B_i.\nThere may be multiple equal integers with different utilities.\n\nTakahashi will buy some integers in this store. He can buy a combination of integers whose bitwise OR is less than or equal to K. He wants the sum of utilities of purchased integers to be as large as possible.\n\nFind the maximum possible sum of utilities of purchased integers.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K < 2^{30}\n\n0 \\leq A_i < 2^{30}(1\\leq i\\leq N)\n\n1 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\nAll input values are integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 B_1\n:\nA_N B_N\n\nOutputs\n\nPrint the maximum possible sum of utilities of purchased integers.\n\nSample Input 1\n\n3 5\n3 3\n4 4\n2 5\n\nSample Output 1\n\n8\n\nBuy 2 and 3 to achieve the maximum possible total utility, 8.\n\nSample Input 2\n\n3 6\n3 3\n4 4\n2 5\n\nSample Output 2\n\n9\n\nBuy 2 and 4 to achieve the maximum possible total utility, 9.\n\nSample Input 3\n\n7 14\n10 5\n7 4\n11 4\n9 8\n3 6\n6 2\n8 9\n\nSample Output 3\n\n32", "sample_input": "3 5\n3 3\n4 4\n2 5\n"}, "reference_outputs": ["8\n"], "source_document_id": "p03584", "source_text": "Score : 500 points\n\nProblem Statement\n\nSeisu-ya, a store specializing in non-negative integers, sells N non-negative integers. The i-th integer is A_i and has a utility of B_i.\nThere may be multiple equal integers with different utilities.\n\nTakahashi will buy some integers in this store. He can buy a combination of integers whose bitwise OR is less than or equal to K. He wants the sum of utilities of purchased integers to be as large as possible.\n\nFind the maximum possible sum of utilities of purchased integers.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K < 2^{30}\n\n0 \\leq A_i < 2^{30}(1\\leq i\\leq N)\n\n1 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\nAll input values are integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 B_1\n:\nA_N B_N\n\nOutputs\n\nPrint the maximum possible sum of utilities of purchased integers.\n\nSample Input 1\n\n3 5\n3 3\n4 4\n2 5\n\nSample Output 1\n\n8\n\nBuy 2 and 3 to achieve the maximum possible total utility, 8.\n\nSample Input 2\n\n3 6\n3 3\n4 4\n2 5\n\nSample Output 2\n\n9\n\nBuy 2 and 4 to achieve the maximum possible total utility, 9.\n\nSample Input 3\n\n7 14\n10 5\n7 4\n11 4\n9 8\n3 6\n6 2\n8 9\n\nSample Output 3\n\n32", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 714, "cpu_time_ms": 92, "memory_kb": 6784}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s159577121", "group_id": "codeNet:p03588", "input_text": "open Printf\nopen Scanf\n\nlet flip f x y = f y x\n                   \nlet () =\n  let n = scanf \"%d \" (fun x -> x) in\n  let rec read x ls =\n    if x = 0 then ls\n    else let p = scanf \"%d %d \" (fun a b -> (a, b)) in\n         read (x - 1) (p :: ls) in\n  let ps = read n [] in\n  List.sort (flip compare) ps |> List.hd |> (fun (a, b) -> printf \"%d\\n\" (a + b))\n", "language": "OCaml", "metadata": {"date": 1506820957, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s159577121.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s159577121", "user_id": "u388783188"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet flip f x y = f y x\n                   \nlet () =\n  let n = scanf \"%d \" (fun x -> x) in\n  let rec read x ls =\n    if x = 0 then ls\n    else let p = scanf \"%d %d \" (fun a b -> (a, b)) in\n         read (x - 1) (p :: ls) in\n  let ps = read n [] in\n  List.sort (flip compare) ps |> List.hd |> (fun (a, b) -> printf \"%d\\n\" (a + b))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA group of people played a game. All players had distinct scores, which are positive integers.\n\nTakahashi knows N facts on the players' scores. The i-th fact is as follows: the A_i-th highest score among the players is B_i.\n\nFind the maximum possible number of players in the game.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n0 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\nIf i ≠ j, A_i ≠ A_j.\n\nThere exists a possible outcome of the game that are consistent with the facts.\n\nAll input values are integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutputs\n\nPrint the maximum possible number of players in the game.\n\nSample Input 1\n\n3\n4 7\n2 9\n6 2\n\nSample Output 1\n\n8\n\nThe maximum possible number of players is achieved when, for example, the players have the following scores: 12,9,8,7,5,2,1,0.\n\nSample Input 2\n\n5\n1 10\n3 6\n5 2\n4 4\n2 8\n\nSample Output 2\n\n7\n\nSample Input 3\n\n2\n1 1000000000\n1000000000 1\n\nSample Output 3\n\n1000000001", "sample_input": "3\n4 7\n2 9\n6 2\n"}, "reference_outputs": ["8\n"], "source_document_id": "p03588", "source_text": "Score : 200 points\n\nProblem Statement\n\nA group of people played a game. All players had distinct scores, which are positive integers.\n\nTakahashi knows N facts on the players' scores. The i-th fact is as follows: the A_i-th highest score among the players is B_i.\n\nFind the maximum possible number of players in the game.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n0 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\nIf i ≠ j, A_i ≠ A_j.\n\nThere exists a possible outcome of the game that are consistent with the facts.\n\nAll input values are integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutputs\n\nPrint the maximum possible number of players in the game.\n\nSample Input 1\n\n3\n4 7\n2 9\n6 2\n\nSample Output 1\n\n8\n\nThe maximum possible number of players is achieved when, for example, the players have the following scores: 12,9,8,7,5,2,1,0.\n\nSample Input 2\n\n5\n1 10\n3 6\n5 2\n4 4\n2 8\n\nSample Output 2\n\n7\n\nSample Input 3\n\n2\n1 1000000000\n1000000000 1\n\nSample Output 3\n\n1000000001", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 353, "cpu_time_ms": 143, "memory_kb": 13696}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s750118368", "group_id": "codeNet:p03592", "input_text": "let () =\n  let n, m, k = Scanf.scanf \"%d %d %d\" (fun n m k -> n, m, k) in\n  begin List.concat @@ Array.to_list @@ Array.init (n + 1) (fun x ->\n    Array.to_list @@ Array.init (m + 1) (fun y -> (x, y))) end\n  |> List.exists (fun (x, y) -> k = x * m + y * n - 2 * x * y)\n  |> (function true -> \"Yes\" | false -> \"No\")\n  |> print_endline", "language": "OCaml", "metadata": {"date": 1506216163, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03592.html", "problem_id": "p03592", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03592/input.txt", "sample_output_relpath": "derived/input_output/data/p03592/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03592/OCaml/s750118368.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s750118368", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n  let n, m, k = Scanf.scanf \"%d %d %d\" (fun n m k -> n, m, k) in\n  begin List.concat @@ Array.to_list @@ Array.init (n + 1) (fun x ->\n    Array.to_list @@ Array.init (m + 1) (fun y -> (x, y))) end\n  |> List.exists (fun (x, y) -> k = x * m + y * n - 2 * x * y)\n  |> (function true -> \"Yes\" | false -> \"No\")\n  |> print_endline", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a grid with N rows and M columns of squares. Initially, all the squares are white.\n\nThere is a button attached to each row and each column.\nWhen a button attached to a row is pressed, the colors of all the squares in that row are inverted; that is, white squares become black and vice versa.\nWhen a button attached to a column is pressed, the colors of all the squares in that column are inverted.\n\nTakahashi can freely press the buttons any number of times. Determine whether he can have exactly K black squares in the grid.\n\nConstraints\n\n1 \\leq N,M \\leq 1000\n\n0 \\leq K \\leq NM\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\n\nOutput\n\nIf Takahashi can have exactly K black squares in the grid, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 2 2\n\nSample Output 1\n\nYes\n\nPress the buttons in the order of the first row, the first column.\n\nSample Input 2\n\n2 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n3 5 8\n\nSample Output 3\n\nYes\n\nPress the buttons in the order of the first column, third column, second row, fifth column.\n\nSample Input 4\n\n7 9 20\n\nSample Output 4\n\nNo", "sample_input": "2 2 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03592", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a grid with N rows and M columns of squares. Initially, all the squares are white.\n\nThere is a button attached to each row and each column.\nWhen a button attached to a row is pressed, the colors of all the squares in that row are inverted; that is, white squares become black and vice versa.\nWhen a button attached to a column is pressed, the colors of all the squares in that column are inverted.\n\nTakahashi can freely press the buttons any number of times. Determine whether he can have exactly K black squares in the grid.\n\nConstraints\n\n1 \\leq N,M \\leq 1000\n\n0 \\leq K \\leq NM\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\n\nOutput\n\nIf Takahashi can have exactly K black squares in the grid, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 2 2\n\nSample Output 1\n\nYes\n\nPress the buttons in the order of the first row, the first column.\n\nSample Input 2\n\n2 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n3 5 8\n\nSample Output 3\n\nYes\n\nPress the buttons in the order of the first column, third column, second row, fifth column.\n\nSample Input 4\n\n7 9 20\n\nSample Output 4\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 236, "memory_kb": 75640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s197263205", "group_id": "codeNet:p03597", "input_text": "open Scanf\nopen Printf\n\nlet cell n a = n * n - a\n\nlet a, n = (read_int (), read_int())\nlet () = printf \"%d\\n\" @@ cell n a", "language": "OCaml", "metadata": {"date": 1595935817, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s197263205.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s197263205", "user_id": "u272377260"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet cell n a = n * n - a\n\nlet a, n = (read_int (), read_int())\nlet () = printf \"%d\\n\" @@ cell n a", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have an N \\times N square grid.\n\nWe will paint each square in the grid either black or white.\n\nIf we paint exactly A squares white, how many squares will be painted black?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq A \\leq N^2\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA\n\nOutputs\n\nPrint the number of squares that will be painted black.\n\nSample Input 1\n\n3\n4\n\nSample Output 1\n\n5\n\nThere are nine squares in a 3 \\times 3 square grid.\nFour of them will be painted white, so the remaining five squares will be painted black.\n\nSample Input 2\n\n19\n100\n\nSample Output 2\n\n261\n\nSample Input 3\n\n10\n0\n\nSample Output 3\n\n100\n\nAs zero squares will be painted white, all the squares will be painted black.", "sample_input": "3\n4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03597", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have an N \\times N square grid.\n\nWe will paint each square in the grid either black or white.\n\nIf we paint exactly A squares white, how many squares will be painted black?\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq A \\leq N^2\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA\n\nOutputs\n\nPrint the number of squares that will be painted black.\n\nSample Input 1\n\n3\n4\n\nSample Output 1\n\n5\n\nThere are nine squares in a 3 \\times 3 square grid.\nFour of them will be painted white, so the remaining five squares will be painted black.\n\nSample Input 2\n\n19\n100\n\nSample Output 2\n\n261\n\nSample Input 3\n\n10\n0\n\nSample Output 3\n\n100\n\nAs zero squares will be painted white, all the squares will be painted black.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 121, "cpu_time_ms": 4, "memory_kb": 3660}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s073539189", "group_id": "codeNet:p03599", "input_text": "Array.(Scanf.scanf\" %d %d %d %d %d %d\"@@fun a b c d e f->\n  let r=ref (0.,(0,0)) in\n  for i=0 to 32 do\n    for j=0 to 32 do\n      for k=0 to 103 do\n        for l=0 to 103 do\n          let w,s=100*a*i+100*b*j,c*k+d*l in\n          if w+s<=f && w/100*e>=s && w+s<>0 then\n            let d=100. *. (float s) /. (float w +. float s) in\n            if d>fst !r then r:=(d,(w+s,s)) done;done;done;done;\n  Printf.printf \"%d %d\\n\" (fst@@snd !r) (snd@@snd !r))", "language": "OCaml", "metadata": {"date": 1541119435, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s073539189.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s073539189", "user_id": "u481480055"}, "prompt_components": {"gold_output": "110 10\n", "input_to_evaluate": "Array.(Scanf.scanf\" %d %d %d %d %d %d\"@@fun a b c d e f->\n  let r=ref (0.,(0,0)) in\n  for i=0 to 32 do\n    for j=0 to 32 do\n      for k=0 to 103 do\n        for l=0 to 103 do\n          let w,s=100*a*i+100*b*j,c*k+d*l in\n          if w+s<=f && w/100*e>=s && w+s<>0 then\n            let d=100. *. (float s) /. (float w +. float s) in\n            if d>fst !r then r:=(d,(w+s,s)) done;done;done;done;\n  Printf.printf \"%d %d\\n\" (fst@@snd !r) (snd@@snd !r))", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 46, "memory_kb": 2560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s641987781", "group_id": "codeNet:p03600", "input_text": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list sep conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet n = scan \"%d\" id\nlet mat = scan_matrix ~sep:' ' n n 0 Int.of_string\nlet mat2 = Array.make_matrix n n true\n\nlet () =\n  ListL.map (0 ++^ n) ~f:(fun k ->\n      ListL.map (0 ++^ n) ~f:(fun i ->\n          ListL.map (0 ++^ n) ~f:(fun j ->\n              if mat.(i).(j) > mat.(i).(k) + mat.(k).(j) then -1\n              else mat.(i).(j)\n            )\n        )\n    )\n  |> List.concat |> List.concat |> List.min\n  |> (fun v -> if v = -1 then Printf.printf \"-1\\n\" else\n         (ListL.iter (0 ++^ n) ~f:(fun k ->\n              ListL.iter (0 ++^ n) ~f:(fun i ->\n                  ListL.iter (0 ++^ n) ~f:(fun j ->\n                      if i <> k && k <> j && mat.(i).(j) = mat.(i).(k) + mat.(k).(j) then\n                        mat2.(i).(j) <- false\n                    )\n                )\n            );\n          ArrayL.mapi mat2 ~f:(fun i a ->\n              ArrayL.mapi a ~f:(fun j v ->\n                  if v then mat.(i).(j)\n                  else 0\n                )\n              |> Array.sum\n            ) |> Array.sum |> (fun v -> Printf.printf \"%d\\n\" (v/2)))\n     )\n", "language": "OCaml", "metadata": {"date": 1589744392, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03600.html", "problem_id": "p03600", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03600/input.txt", "sample_output_relpath": "derived/input_output/data/p03600/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03600/OCaml/s641987781.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s641987781", "user_id": "u802614675"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list sep conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet n = scan \"%d\" id\nlet mat = scan_matrix ~sep:' ' n n 0 Int.of_string\nlet mat2 = Array.make_matrix n n true\n\nlet () =\n  ListL.map (0 ++^ n) ~f:(fun k ->\n      ListL.map (0 ++^ n) ~f:(fun i ->\n          ListL.map (0 ++^ n) ~f:(fun j ->\n              if mat.(i).(j) > mat.(i).(k) + mat.(k).(j) then -1\n              else mat.(i).(j)\n            )\n        )\n    )\n  |> List.concat |> List.concat |> List.min\n  |> (fun v -> if v = -1 then Printf.printf \"-1\\n\" else\n         (ListL.iter (0 ++^ n) ~f:(fun k ->\n              ListL.iter (0 ++^ n) ~f:(fun i ->\n                  ListL.iter (0 ++^ n) ~f:(fun j ->\n                      if i <> k && k <> j && mat.(i).(j) = mat.(i).(k) + mat.(k).(j) then\n                        mat2.(i).(j) <- false\n                    )\n                )\n            );\n          ArrayL.mapi mat2 ~f:(fun i a ->\n              ArrayL.mapi a ~f:(fun j v ->\n                  if v then mat.(i).(j)\n                  else 0\n                )\n              |> Array.sum\n            ) |> Array.sum |> (fun v -> Printf.printf \"%d\\n\" (v/2)))\n     )\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nIn Takahashi Kingdom, which once existed, there are N cities, and some pairs of cities are connected bidirectionally by roads.\nThe following are known about the road network:\n\nPeople traveled between cities only through roads. It was possible to reach any city from any other city, via intermediate cities if necessary.\n\nDifferent roads may have had different lengths, but all the lengths were positive integers.\n\nSnuke the archeologist found a table with N rows and N columns, A, in the ruin of Takahashi Kingdom.\nHe thought that it represented the shortest distances between the cities along the roads in the kingdom.\n\nDetermine whether there exists a road network such that for each u and v, the integer A_{u, v} at the u-th row and v-th column of A is equal to the length of the shortest path from City u to City v.\nIf such a network exist, find the shortest possible total length of the roads.\n\nConstraints\n\n1 \\leq N \\leq 300\n\nIf i ≠ j, 1 \\leq A_{i, j} = A_{j, i} \\leq 10^9.\n\nA_{i, i} = 0\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} ... A_{1, N}\nA_{2, 1} A_{2, 2} ... A_{2, N}\n...\nA_{N, 1} A_{N, 2} ... A_{N, N}\n\nOutputs\n\nIf there exists no network that satisfies the condition, print -1.\nIf it exists, print the shortest possible total length of the roads.\n\nSample Input 1\n\n3\n0 1 3\n1 0 2\n3 2 0\n\nSample Output 1\n\n3\n\nThe network below satisfies the condition:\n\nCity 1 and City 2 is connected by a road of length 1.\n\nCity 2 and City 3 is connected by a road of length 2.\n\nCity 3 and City 1 is not connected by a road.\n\nSample Input 2\n\n3\n0 1 3\n1 0 1\n3 1 0\n\nSample Output 2\n\n-1\n\nAs there is a path of length 1 from City 1 to City 2 and City 2 to City 3, there is a path of length 2 from City 1 to City 3.\nHowever, according to the table, the shortest distance between City 1 and City 3 must be 3.\n\nThus, we conclude that there exists no network that satisfies the condition.\n\nSample Input 3\n\n5\n0 21 18 11 28\n21 0 13 10 26\n18 13 0 23 13\n11 10 23 0 17\n28 26 13 17 0\n\nSample Output 3\n\n82\n\nSample Input 4\n\n3\n0 1000000000 1000000000\n1000000000 0 1000000000\n1000000000 1000000000 0\n\nSample Output 4\n\n3000000000", "sample_input": "3\n0 1 3\n1 0 2\n3 2 0\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03600", "source_text": "Score : 500 points\n\nProblem Statement\n\nIn Takahashi Kingdom, which once existed, there are N cities, and some pairs of cities are connected bidirectionally by roads.\nThe following are known about the road network:\n\nPeople traveled between cities only through roads. It was possible to reach any city from any other city, via intermediate cities if necessary.\n\nDifferent roads may have had different lengths, but all the lengths were positive integers.\n\nSnuke the archeologist found a table with N rows and N columns, A, in the ruin of Takahashi Kingdom.\nHe thought that it represented the shortest distances between the cities along the roads in the kingdom.\n\nDetermine whether there exists a road network such that for each u and v, the integer A_{u, v} at the u-th row and v-th column of A is equal to the length of the shortest path from City u to City v.\nIf such a network exist, find the shortest possible total length of the roads.\n\nConstraints\n\n1 \\leq N \\leq 300\n\nIf i ≠ j, 1 \\leq A_{i, j} = A_{j, i} \\leq 10^9.\n\nA_{i, i} = 0\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} ... A_{1, N}\nA_{2, 1} A_{2, 2} ... A_{2, N}\n...\nA_{N, 1} A_{N, 2} ... A_{N, N}\n\nOutputs\n\nIf there exists no network that satisfies the condition, print -1.\nIf it exists, print the shortest possible total length of the roads.\n\nSample Input 1\n\n3\n0 1 3\n1 0 2\n3 2 0\n\nSample Output 1\n\n3\n\nThe network below satisfies the condition:\n\nCity 1 and City 2 is connected by a road of length 1.\n\nCity 2 and City 3 is connected by a road of length 2.\n\nCity 3 and City 1 is not connected by a road.\n\nSample Input 2\n\n3\n0 1 3\n1 0 1\n3 1 0\n\nSample Output 2\n\n-1\n\nAs there is a path of length 1 from City 1 to City 2 and City 2 to City 3, there is a path of length 2 from City 1 to City 3.\nHowever, according to the table, the shortest distance between City 1 and City 3 must be 3.\n\nThus, we conclude that there exists no network that satisfies the condition.\n\nSample Input 3\n\n5\n0 21 18 11 28\n21 0 13 10 26\n18 13 0 23 13\n11 10 23 0 17\n28 26 13 17 0\n\nSample Output 3\n\n82\n\nSample Input 4\n\n3\n0 1000000000 1000000000\n1000000000 0 1000000000\n1000000000 1000000000 0\n\nSample Output 4\n\n3000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3070, "cpu_time_ms": 2113, "memory_kb": 654384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s729832951", "group_id": "codeNet:p03600", "input_text": "\nopen Scanf\nopen Printf\n\nlet flip f x y = f y x\n\nlet range a b =\n  let rec f acc a b = if a > b then acc else f (b::acc) a (b-1) in\n  f [] a (b-1)\n\nlet read_int () = scanf \" %d\" (fun x -> x)\nlet rec read_ints n = Array.init n (fun _ -> read_int ())\n\nlet rec for_iter a b f = if a >= b then [] else let x = f a in x :: for_iter (a+1) b f\nlet rec for_iter_ a b f = if a >= b then () else (f a; for_iter_ (a+1) b f)\nlet rec for_all_iter a b f = if a >= b then true else f a && for_all_iter (a+1) b f\n\nlet inf = 20202020202020\n\nlet () =\n  let n = read_int () in\n  let mtx = Array.init n (fun _ -> read_ints n) in\n\n  let mtx' = Array.init n (fun i -> Array.copy mtx.(i)) in\n  for_iter_ 0 n (fun k -> for_iter_ 0 n (fun i -> for_iter_ 0 n (fun j ->\n    mtx'.(i).(j) <- min mtx'.(i).(j) (mtx'.(i).(k) + mtx'.(k).(j)))));\n\n  let valid = for_all_iter 0 n (fun i ->\n    for_all_iter 0 n (fun j ->\n      mtx.(i).(j) = mtx'.(i).(j))) in\n  if not valid then (print_endline \"-1\"; exit 0);\n\n  let edges =\n    let res = Array.make (n*(n-1)/2) (-1,-1,-1) in\n    let rec f i a b =\n      if a >= n then ()\n      else if b >= n then f i (a+1) (a+2)\n      else (res.(i) <- (a, b, mtx.(a).(b)); f (i+1) a (b+1)) in\n    f 0 0 1;\n    Array.sort (fun (_,_,w0) (_,_,w1) -> w0-w1) res;\n    res in\n\n  for_iter_ 0 n (fun j ->\n    for_iter_ 0 n (fun k -> mtx'.(j).(k) <- inf);\n    mtx'.(j).(j) <- 0);\n  Array.fold_left (fun s (u, v, w) ->\n    if mtx'.(u).(v) <= w then s\n    else (\n      mtx'.(u).(v) <- w; mtx'.(v).(u) <- w;\n      for_iter_ 0 n (fun j -> for_iter_ 0 n (fun k ->\n        mtx'.(j).(k) <- min mtx'.(j).(k) (mtx'.(j).(u) + w + mtx'.(v).(k));\n        mtx'.(j).(k) <- min mtx'.(j).(k) (mtx'.(j).(v) + w + mtx'.(u).(k))));\n      s+w)) 0 edges\n  |> printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1519608128, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03600.html", "problem_id": "p03600", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03600/input.txt", "sample_output_relpath": "derived/input_output/data/p03600/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03600/OCaml/s729832951.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s729832951", "user_id": "u798181098"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "\nopen Scanf\nopen Printf\n\nlet flip f x y = f y x\n\nlet range a b =\n  let rec f acc a b = if a > b then acc else f (b::acc) a (b-1) in\n  f [] a (b-1)\n\nlet read_int () = scanf \" %d\" (fun x -> x)\nlet rec read_ints n = Array.init n (fun _ -> read_int ())\n\nlet rec for_iter a b f = if a >= b then [] else let x = f a in x :: for_iter (a+1) b f\nlet rec for_iter_ a b f = if a >= b then () else (f a; for_iter_ (a+1) b f)\nlet rec for_all_iter a b f = if a >= b then true else f a && for_all_iter (a+1) b f\n\nlet inf = 20202020202020\n\nlet () =\n  let n = read_int () in\n  let mtx = Array.init n (fun _ -> read_ints n) in\n\n  let mtx' = Array.init n (fun i -> Array.copy mtx.(i)) in\n  for_iter_ 0 n (fun k -> for_iter_ 0 n (fun i -> for_iter_ 0 n (fun j ->\n    mtx'.(i).(j) <- min mtx'.(i).(j) (mtx'.(i).(k) + mtx'.(k).(j)))));\n\n  let valid = for_all_iter 0 n (fun i ->\n    for_all_iter 0 n (fun j ->\n      mtx.(i).(j) = mtx'.(i).(j))) in\n  if not valid then (print_endline \"-1\"; exit 0);\n\n  let edges =\n    let res = Array.make (n*(n-1)/2) (-1,-1,-1) in\n    let rec f i a b =\n      if a >= n then ()\n      else if b >= n then f i (a+1) (a+2)\n      else (res.(i) <- (a, b, mtx.(a).(b)); f (i+1) a (b+1)) in\n    f 0 0 1;\n    Array.sort (fun (_,_,w0) (_,_,w1) -> w0-w1) res;\n    res in\n\n  for_iter_ 0 n (fun j ->\n    for_iter_ 0 n (fun k -> mtx'.(j).(k) <- inf);\n    mtx'.(j).(j) <- 0);\n  Array.fold_left (fun s (u, v, w) ->\n    if mtx'.(u).(v) <= w then s\n    else (\n      mtx'.(u).(v) <- w; mtx'.(v).(u) <- w;\n      for_iter_ 0 n (fun j -> for_iter_ 0 n (fun k ->\n        mtx'.(j).(k) <- min mtx'.(j).(k) (mtx'.(j).(u) + w + mtx'.(v).(k));\n        mtx'.(j).(k) <- min mtx'.(j).(k) (mtx'.(j).(v) + w + mtx'.(u).(k))));\n      s+w)) 0 edges\n  |> printf \"%d\\n\"\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nIn Takahashi Kingdom, which once existed, there are N cities, and some pairs of cities are connected bidirectionally by roads.\nThe following are known about the road network:\n\nPeople traveled between cities only through roads. It was possible to reach any city from any other city, via intermediate cities if necessary.\n\nDifferent roads may have had different lengths, but all the lengths were positive integers.\n\nSnuke the archeologist found a table with N rows and N columns, A, in the ruin of Takahashi Kingdom.\nHe thought that it represented the shortest distances between the cities along the roads in the kingdom.\n\nDetermine whether there exists a road network such that for each u and v, the integer A_{u, v} at the u-th row and v-th column of A is equal to the length of the shortest path from City u to City v.\nIf such a network exist, find the shortest possible total length of the roads.\n\nConstraints\n\n1 \\leq N \\leq 300\n\nIf i ≠ j, 1 \\leq A_{i, j} = A_{j, i} \\leq 10^9.\n\nA_{i, i} = 0\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} ... A_{1, N}\nA_{2, 1} A_{2, 2} ... A_{2, N}\n...\nA_{N, 1} A_{N, 2} ... A_{N, N}\n\nOutputs\n\nIf there exists no network that satisfies the condition, print -1.\nIf it exists, print the shortest possible total length of the roads.\n\nSample Input 1\n\n3\n0 1 3\n1 0 2\n3 2 0\n\nSample Output 1\n\n3\n\nThe network below satisfies the condition:\n\nCity 1 and City 2 is connected by a road of length 1.\n\nCity 2 and City 3 is connected by a road of length 2.\n\nCity 3 and City 1 is not connected by a road.\n\nSample Input 2\n\n3\n0 1 3\n1 0 1\n3 1 0\n\nSample Output 2\n\n-1\n\nAs there is a path of length 1 from City 1 to City 2 and City 2 to City 3, there is a path of length 2 from City 1 to City 3.\nHowever, according to the table, the shortest distance between City 1 and City 3 must be 3.\n\nThus, we conclude that there exists no network that satisfies the condition.\n\nSample Input 3\n\n5\n0 21 18 11 28\n21 0 13 10 26\n18 13 0 23 13\n11 10 23 0 17\n28 26 13 17 0\n\nSample Output 3\n\n82\n\nSample Input 4\n\n3\n0 1000000000 1000000000\n1000000000 0 1000000000\n1000000000 1000000000 0\n\nSample Output 4\n\n3000000000", "sample_input": "3\n0 1 3\n1 0 2\n3 2 0\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03600", "source_text": "Score : 500 points\n\nProblem Statement\n\nIn Takahashi Kingdom, which once existed, there are N cities, and some pairs of cities are connected bidirectionally by roads.\nThe following are known about the road network:\n\nPeople traveled between cities only through roads. It was possible to reach any city from any other city, via intermediate cities if necessary.\n\nDifferent roads may have had different lengths, but all the lengths were positive integers.\n\nSnuke the archeologist found a table with N rows and N columns, A, in the ruin of Takahashi Kingdom.\nHe thought that it represented the shortest distances between the cities along the roads in the kingdom.\n\nDetermine whether there exists a road network such that for each u and v, the integer A_{u, v} at the u-th row and v-th column of A is equal to the length of the shortest path from City u to City v.\nIf such a network exist, find the shortest possible total length of the roads.\n\nConstraints\n\n1 \\leq N \\leq 300\n\nIf i ≠ j, 1 \\leq A_{i, j} = A_{j, i} \\leq 10^9.\n\nA_{i, i} = 0\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} ... A_{1, N}\nA_{2, 1} A_{2, 2} ... A_{2, N}\n...\nA_{N, 1} A_{N, 2} ... A_{N, N}\n\nOutputs\n\nIf there exists no network that satisfies the condition, print -1.\nIf it exists, print the shortest possible total length of the roads.\n\nSample Input 1\n\n3\n0 1 3\n1 0 2\n3 2 0\n\nSample Output 1\n\n3\n\nThe network below satisfies the condition:\n\nCity 1 and City 2 is connected by a road of length 1.\n\nCity 2 and City 3 is connected by a road of length 2.\n\nCity 3 and City 1 is not connected by a road.\n\nSample Input 2\n\n3\n0 1 3\n1 0 1\n3 1 0\n\nSample Output 2\n\n-1\n\nAs there is a path of length 1 from City 1 to City 2 and City 2 to City 3, there is a path of length 2 from City 1 to City 3.\nHowever, according to the table, the shortest distance between City 1 and City 3 must be 3.\n\nThus, we conclude that there exists no network that satisfies the condition.\n\nSample Input 3\n\n5\n0 21 18 11 28\n21 0 13 10 26\n18 13 0 23 13\n11 10 23 0 17\n28 26 13 17 0\n\nSample Output 3\n\n82\n\nSample Input 4\n\n3\n0 1000000000 1000000000\n1000000000 0 1000000000\n1000000000 1000000000 0\n\nSample Output 4\n\n3000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1743, "cpu_time_ms": 2103, "memory_kb": 6528}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s629645569", "group_id": "codeNet:p03603", "input_text": "module IntMap = Map.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let es = Array.make n [] in\n  if n = 1 then\n    ignore (read_line ())\n  else\n    for i = 1 to n - 1 do\n      Scanf.scanf \"%d \" @@ fun p ->\n        es.(p - 1) <- i :: es.(p - 1)\n    done;\n  let xs = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun x -> x in\n  let rec solve v =\n    let xys = List.map (fun u -> xs.(u), solve u) es.(v) in\n    let most = List.fold_right (fun (x, y) -> ( + ) @@ max x y) xys 0 in\n    let least = List.fold_right (fun (x, y) -> ( + ) @@ min x y) xys 0 in\n    if xs.(v) < least then raise Not_found\n    else IntMap.fold (fun _ -> min)\n      (List.fold_left (fun m (w, v_) ->\n        let le, _, _ = IntMap.split (xs.(v) - least - w + 1) m in\n        IntMap.fold (fun w' v' m ->\n          IntMap.add (w + w')\n            (max (v_ + v') @@\n              try IntMap.find (w + w') m\n              with Not_found -> min_int) m) le m) (IntMap.singleton 0 most) @@\n        List.map (fun (x, y) -> abs (x - y), ~- (abs (x - y))) xys) max_int in\n  print_endline @@\n  try ignore (solve 0); \"POSSIBLE\"\n  with Not_found -> \"IMPOSSIBLE\"\n\n", "language": "OCaml", "metadata": {"date": 1536362139, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03603.html", "problem_id": "p03603", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03603/input.txt", "sample_output_relpath": "derived/input_output/data/p03603/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03603/OCaml/s629645569.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s629645569", "user_id": "u504158101"}, "prompt_components": {"gold_output": "POSSIBLE\n", "input_to_evaluate": "module IntMap = Map.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let es = Array.make n [] in\n  if n = 1 then\n    ignore (read_line ())\n  else\n    for i = 1 to n - 1 do\n      Scanf.scanf \"%d \" @@ fun p ->\n        es.(p - 1) <- i :: es.(p - 1)\n    done;\n  let xs = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun x -> x in\n  let rec solve v =\n    let xys = List.map (fun u -> xs.(u), solve u) es.(v) in\n    let most = List.fold_right (fun (x, y) -> ( + ) @@ max x y) xys 0 in\n    let least = List.fold_right (fun (x, y) -> ( + ) @@ min x y) xys 0 in\n    if xs.(v) < least then raise Not_found\n    else IntMap.fold (fun _ -> min)\n      (List.fold_left (fun m (w, v_) ->\n        let le, _, _ = IntMap.split (xs.(v) - least - w + 1) m in\n        IntMap.fold (fun w' v' m ->\n          IntMap.add (w + w')\n            (max (v_ + v') @@\n              try IntMap.find (w + w') m\n              with Not_found -> min_int) m) le m) (IntMap.singleton 0 most) @@\n        List.map (fun (x, y) -> abs (x - y), ~- (abs (x - y))) xys) max_int in\n  print_endline @@\n  try ignore (solve 0); \"POSSIBLE\"\n  with Not_found -> \"IMPOSSIBLE\"\n\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nWe have a tree with N vertices. Vertex 1 is the root of the tree, and the parent of Vertex i (2 \\leq i \\leq N) is Vertex P_i.\n\nTo each vertex in the tree, Snuke will allocate a color, either black or white, and a non-negative integer weight.\n\nSnuke has a favorite integer sequence, X_1, X_2, ..., X_N, so he wants to allocate colors and weights so that the following condition is satisfied for all v.\n\nThe total weight of the vertices with the same color as v among the vertices contained in the subtree whose root is v, is X_v.\n\nHere, the subtree whose root is v is the tree consisting of Vertex v and all of its descendants.\n\nDetermine whether it is possible to allocate colors and weights in this way.\n\nConstraints\n\n1 \\leq N \\leq 1 000\n\n1 \\leq P_i \\leq i - 1\n\n0 \\leq X_i \\leq 5 000\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nP_2 P_3 ... P_N\nX_1 X_2 ... X_N\n\nOutputs\n\nIf it is possible to allocate colors and weights to the vertices so that the condition is satisfied, print POSSIBLE; otherwise, print IMPOSSIBLE.\n\nSample Input 1\n\n3\n1 1\n4 3 2\n\nSample Output 1\n\nPOSSIBLE\n\nFor example, the following allocation satisfies the condition:\n\nSet the color of Vertex 1 to white and its weight to 2.\n\nSet the color of Vertex 2 to black and its weight to 3.\n\nSet the color of Vertex 3 to white and its weight to 2.\n\nThere are also other possible allocations.\n\nSample Input 2\n\n3\n1 2\n1 2 3\n\nSample Output 2\n\nIMPOSSIBLE\n\nIf the same color is allocated to Vertex 2 and Vertex 3, Vertex 2 cannot be allocated a non-negative weight.\n\nIf different colors are allocated to Vertex 2 and 3, no matter which color is allocated to Vertex 1, it cannot be allocated a non-negative weight.\n\nThus, there exists no allocation of colors and weights that satisfies the condition.\n\nSample Input 3\n\n8\n1 1 1 3 4 5 5\n4 1 6 2 2 1 3 3\n\nSample Output 3\n\nPOSSIBLE\n\nSample Input 4\n\n1\n\n0\n\nSample Output 4\n\nPOSSIBLE", "sample_input": "3\n1 1\n4 3 2\n"}, "reference_outputs": ["POSSIBLE\n"], "source_document_id": "p03603", "source_text": "Score : 700 points\n\nProblem Statement\n\nWe have a tree with N vertices. Vertex 1 is the root of the tree, and the parent of Vertex i (2 \\leq i \\leq N) is Vertex P_i.\n\nTo each vertex in the tree, Snuke will allocate a color, either black or white, and a non-negative integer weight.\n\nSnuke has a favorite integer sequence, X_1, X_2, ..., X_N, so he wants to allocate colors and weights so that the following condition is satisfied for all v.\n\nThe total weight of the vertices with the same color as v among the vertices contained in the subtree whose root is v, is X_v.\n\nHere, the subtree whose root is v is the tree consisting of Vertex v and all of its descendants.\n\nDetermine whether it is possible to allocate colors and weights in this way.\n\nConstraints\n\n1 \\leq N \\leq 1 000\n\n1 \\leq P_i \\leq i - 1\n\n0 \\leq X_i \\leq 5 000\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nP_2 P_3 ... P_N\nX_1 X_2 ... X_N\n\nOutputs\n\nIf it is possible to allocate colors and weights to the vertices so that the condition is satisfied, print POSSIBLE; otherwise, print IMPOSSIBLE.\n\nSample Input 1\n\n3\n1 1\n4 3 2\n\nSample Output 1\n\nPOSSIBLE\n\nFor example, the following allocation satisfies the condition:\n\nSet the color of Vertex 1 to white and its weight to 2.\n\nSet the color of Vertex 2 to black and its weight to 3.\n\nSet the color of Vertex 3 to white and its weight to 2.\n\nThere are also other possible allocations.\n\nSample Input 2\n\n3\n1 2\n1 2 3\n\nSample Output 2\n\nIMPOSSIBLE\n\nIf the same color is allocated to Vertex 2 and Vertex 3, Vertex 2 cannot be allocated a non-negative weight.\n\nIf different colors are allocated to Vertex 2 and 3, no matter which color is allocated to Vertex 1, it cannot be allocated a non-negative weight.\n\nThus, there exists no allocation of colors and weights that satisfies the condition.\n\nSample Input 3\n\n8\n1 1 1 3 4 5 5\n4 1 6 2 2 1 3 3\n\nSample Output 3\n\nPOSSIBLE\n\nSample Input 4\n\n1\n\n0\n\nSample Output 4\n\nPOSSIBLE", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1173, "cpu_time_ms": 43, "memory_kb": 4992}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s655414775", "group_id": "codeNet:p03605", "input_text": "open Batteries\n(* charのカウント *)\nlet count_char target str =\n  let rec count lst =\n    match lst with\n    | [] -> 0\n    | first :: rest -> if first = target then 1 + count rest else count rest\n  in let explode s = List.init (String.length s) (String.get s)\n  in count @@ explode str\n\nlet _ = \n  let d =read_line () |> count_char '9'\n  in (if d != 0 then \"Yes\" else \"No\") |> print_endline", "language": "OCaml", "metadata": {"date": 1584322040, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s655414775.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s655414775", "user_id": "u511870776"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Batteries\n(* charのカウント *)\nlet count_char target str =\n  let rec count lst =\n    match lst with\n    | [] -> 0\n    | first :: rest -> if first = target then 1 + count rest else count rest\n  in let explode s = List.init (String.length s) (String.get s)\n  in count @@ explode str\n\nlet _ = \n  let d =read_line () |> count_char '9'\n  in (if d != 0 then \"Yes\" else \"No\") |> print_endline", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIt is September 9 in Japan now.\n\nYou are given a two-digit integer N. Answer the question: Is 9 contained in the decimal notation of N?\n\nConstraints\n\n10≤N≤99\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf 9 is contained in the decimal notation of N, print Yes; if not, print No.\n\nSample Input 1\n\n29\n\nSample Output 1\n\nYes\n\nThe one's digit of 29 is 9.\n\nSample Input 2\n\n72\n\nSample Output 2\n\nNo\n\n72 does not contain 9.\n\nSample Input 3\n\n91\n\nSample Output 3\n\nYes", "sample_input": "29\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03605", "source_text": "Score : 100 points\n\nProblem Statement\n\nIt is September 9 in Japan now.\n\nYou are given a two-digit integer N. Answer the question: Is 9 contained in the decimal notation of N?\n\nConstraints\n\n10≤N≤99\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf 9 is contained in the decimal notation of N, print Yes; if not, print No.\n\nSample Input 1\n\n29\n\nSample Output 1\n\nYes\n\nThe one's digit of 29 is 9.\n\nSample Input 2\n\n72\n\nSample Output 2\n\nNo\n\n72 does not contain 9.\n\nSample Input 3\n\n91\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 395, "cpu_time_ms": 4, "memory_kb": 3200}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s902527361", "group_id": "codeNet:p03607", "input_text": "(* O(n) *)\nopen Hashtbl\nlet n = Scanf.scanf \" %d\" @@ (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet h = create n\nlet _ =\n  Array.iter (fun a -> try ignore @@ find h a; remove h a with _ -> add h a 1) a_s;\n  length h |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1560972750, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s902527361.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s902527361", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(* O(n) *)\nopen Hashtbl\nlet n = Scanf.scanf \" %d\" @@ (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet h = create n\nlet _ =\n  Array.iter (fun a -> try ignore @@ find h a; remove h a with _ -> add h a 1) a_s;\n  length h |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are playing the following game with Joisino.\n\nInitially, you have a blank sheet of paper.\n\nJoisino announces a number. If that number is written on the sheet, erase the number from the sheet; if not, write the number on the sheet. This process is repeated N times.\n\nThen, you are asked a question: How many numbers are written on the sheet now?\n\nThe numbers announced by Joisino are given as A_1, ... ,A_N in the order she announces them. How many numbers will be written on the sheet at the end of the game?\n\nConstraints\n\n1≤N≤100000\n\n1≤A_i≤1000000000(=10^9)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint how many numbers will be written on the sheet at the end of the game.\n\nSample Input 1\n\n3\n6\n2\n6\n\nSample Output 1\n\n1\n\nThe game proceeds as follows:\n\n6 is not written on the sheet, so write 6.\n\n2 is not written on the sheet, so write 2.\n\n6 is written on the sheet, so erase 6.\n\nThus, the sheet contains only 2 in the end. The answer is 1.\n\nSample Input 2\n\n4\n2\n5\n5\n2\n\nSample Output 2\n\n0\n\nIt is possible that no number is written on the sheet in the end.\n\nSample Input 3\n\n6\n12\n22\n16\n22\n18\n12\n\nSample Output 3\n\n2", "sample_input": "3\n6\n2\n6\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03607", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are playing the following game with Joisino.\n\nInitially, you have a blank sheet of paper.\n\nJoisino announces a number. If that number is written on the sheet, erase the number from the sheet; if not, write the number on the sheet. This process is repeated N times.\n\nThen, you are asked a question: How many numbers are written on the sheet now?\n\nThe numbers announced by Joisino are given as A_1, ... ,A_N in the order she announces them. How many numbers will be written on the sheet at the end of the game?\n\nConstraints\n\n1≤N≤100000\n\n1≤A_i≤1000000000(=10^9)\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint how many numbers will be written on the sheet at the end of the game.\n\nSample Input 1\n\n3\n6\n2\n6\n\nSample Output 1\n\n1\n\nThe game proceeds as follows:\n\n6 is not written on the sheet, so write 6.\n\n2 is not written on the sheet, so write 2.\n\n6 is written on the sheet, so erase 6.\n\nThus, the sheet contains only 2 in the end. The answer is 1.\n\nSample Input 2\n\n4\n2\n5\n5\n2\n\nSample Output 2\n\n0\n\nIt is possible that no number is written on the sheet in the end.\n\nSample Input 3\n\n6\n12\n22\n16\n22\n18\n12\n\nSample Output 3\n\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 264, "cpu_time_ms": 44, "memory_kb": 7936}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s990433455", "group_id": "codeNet:p03607", "input_text": "open Printf\nopen Scanf\n\nmodule SI = Set.Make(\n                struct\n                  type t = int\n                  let compare = compare\n                end\n              )\n                    \nlet () =\n  let n = scanf \"%d \" (fun x -> x) in\n  let rec loop i st =\n    if i = 0 then SI.cardinal st\n    else\n      let a = scanf \"%d \" (fun x -> x) in\n      if SI.mem a st then loop (i-1) (SI.remove a st)\n      else loop (i-1) (SI.add a st) in\n  loop n SI.empty |> printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1505007305, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s990433455.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s990433455", "user_id": "u388783188"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nmodule SI = Set.Make(\n                struct\n                  type t = int\n                  let compare = compare\n                end\n              )\n                    \nlet () =\n  let n = scanf \"%d \" (fun x -> x) in\n  let rec loop i st =\n    if i = 0 then SI.cardinal st\n    else\n      let a = scanf \"%d \" (fun x -> x) in\n      if SI.mem a st then loop (i-1) (SI.remove a st)\n      else loop (i-1) (SI.add a st) in\n  loop n SI.empty |> printf \"%d\\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 144, "memory_kb": 9472}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s059458086", "group_id": "codeNet:p03608", "input_text": "let n, m, r, ans, ds, rs = Scanf.(scanf \"%d %d %d\" @@ fun n m r -> Array.(n, m, r, ref max_int, make_matrix n n (1 lsl 40), init r @@ fun _ -> scanf \" %d\" pred))\nlet s, fs, is, es = Array.(ref 0, make r false, make r 0, init m @@ fun _ -> Scanf.scanf \" %d %d %d\" @@ fun a b t -> ds.(a - 1).(b - 1) <- t; ds.(b - 1).(a - 1) <- t; a - 1, b - 1, t)\nlet rec f i = if i >= r then ans := min !ans !s else for j = 0 to r - 1 do if not fs.(j) then (fs.(j) <- true; is.(i) <- j; let d = if i > 0 then ds.(rs.(is.(i - 1))).(rs.(j)) else 0 in s := !s + d; f (i + 1); fs.(j) <- false; s := !s - d) done\nlet _ = Array.(iteri (fun i d -> iteri (fun j _ -> if i = j then d.(j) <- 0) d) ds); for k = 0 to n - 1 do for i = 0 to n - 1 do for j = 0 to n - 1 do ds.(i).(j) <- min ds.(i).(j) @@ ds.(i).(k) + ds.(k).(j) done done done; f 0; Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1581704844, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03608.html", "problem_id": "p03608", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03608/input.txt", "sample_output_relpath": "derived/input_output/data/p03608/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03608/OCaml/s059458086.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s059458086", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let n, m, r, ans, ds, rs = Scanf.(scanf \"%d %d %d\" @@ fun n m r -> Array.(n, m, r, ref max_int, make_matrix n n (1 lsl 40), init r @@ fun _ -> scanf \" %d\" pred))\nlet s, fs, is, es = Array.(ref 0, make r false, make r 0, init m @@ fun _ -> Scanf.scanf \" %d %d %d\" @@ fun a b t -> ds.(a - 1).(b - 1) <- t; ds.(b - 1).(a - 1) <- t; a - 1, b - 1, t)\nlet rec f i = if i >= r then ans := min !ans !s else for j = 0 to r - 1 do if not fs.(j) then (fs.(j) <- true; is.(i) <- j; let d = if i > 0 then ds.(rs.(is.(i - 1))).(rs.(j)) else 0 in s := !s + d; f (i + 1); fs.(j) <- false; s := !s - d) done\nlet _ = Array.(iteri (fun i d -> iteri (fun j _ -> if i = j then d.(j) <- 0) d) ds); for k = 0 to n - 1 do for i = 0 to n - 1 do for j = 0 to n - 1 do ds.(i).(j) <- min ds.(i).(j) @@ ds.(i).(k) + ds.(k).(j) done done done; f 0; Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N towns in the State of Atcoder, connected by M bidirectional roads.\n\nThe i-th road connects Town A_i and B_i and has a length of C_i.\n\nJoisino is visiting R towns in the state, r_1,r_2,..,r_R (not necessarily in this order).\n\nShe will fly to the first town she visits, and fly back from the last town she visits, but for the rest of the trip she will have to travel by road.\n\nIf she visits the towns in the order that minimizes the distance traveled by road, what will that distance be?\n\nConstraints\n\n2≤N≤200\n\n1≤M≤N×(N-1)/2\n\n2≤R≤min(8,N) (min(8,N) is the smaller of 8 and N.)\n\nr_i≠r_j (i≠j)\n\n1≤A_i,B_i≤N, A_i≠B_i\n\n(A_i,B_i)≠(A_j,B_j),(A_i,B_i)≠(B_j,A_j) (i≠j)\n\n1≤C_i≤100000\n\nEvery town can be reached from every town by road.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M R\nr_1 ... r_R\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nPrint the distance traveled by road if Joisino visits the towns in the order that minimizes it.\n\nSample Input 1\n\n3 3 3\n1 2 3\n1 2 1\n2 3 1\n3 1 4\n\nSample Output 1\n\n2\n\nFor example, if she visits the towns in the order of 1, 2, 3, the distance traveled will be 2, which is the minimum possible.\n\nSample Input 2\n\n3 3 2\n1 3\n2 3 2\n1 3 6\n1 2 2\n\nSample Output 2\n\n4\n\nThe shortest distance between Towns 1 and 3 is 4. Thus, whether she visits Town 1 or 3 first, the distance traveled will be 4.\n\nSample Input 3\n\n4 6 3\n2 3 4\n1 2 4\n2 3 3\n4 3 1\n1 4 1\n4 2 2\n3 1 6\n\nSample Output 3\n\n3", "sample_input": "3 3 3\n1 2 3\n1 2 1\n2 3 1\n3 1 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03608", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N towns in the State of Atcoder, connected by M bidirectional roads.\n\nThe i-th road connects Town A_i and B_i and has a length of C_i.\n\nJoisino is visiting R towns in the state, r_1,r_2,..,r_R (not necessarily in this order).\n\nShe will fly to the first town she visits, and fly back from the last town she visits, but for the rest of the trip she will have to travel by road.\n\nIf she visits the towns in the order that minimizes the distance traveled by road, what will that distance be?\n\nConstraints\n\n2≤N≤200\n\n1≤M≤N×(N-1)/2\n\n2≤R≤min(8,N) (min(8,N) is the smaller of 8 and N.)\n\nr_i≠r_j (i≠j)\n\n1≤A_i,B_i≤N, A_i≠B_i\n\n(A_i,B_i)≠(A_j,B_j),(A_i,B_i)≠(B_j,A_j) (i≠j)\n\n1≤C_i≤100000\n\nEvery town can be reached from every town by road.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M R\nr_1 ... r_R\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nPrint the distance traveled by road if Joisino visits the towns in the order that minimizes it.\n\nSample Input 1\n\n3 3 3\n1 2 3\n1 2 1\n2 3 1\n3 1 4\n\nSample Output 1\n\n2\n\nFor example, if she visits the towns in the order of 1, 2, 3, the distance traveled will be 2, which is the minimum possible.\n\nSample Input 2\n\n3 3 2\n1 3\n2 3 2\n1 3 6\n1 2 2\n\nSample Output 2\n\n4\n\nThe shortest distance between Towns 1 and 3 is 4. Thus, whether she visits Town 1 or 3 first, the distance traveled will be 4.\n\nSample Input 3\n\n4 6 3\n2 3 4\n1 2 4\n2 3 3\n4 3 1\n1 4 1\n4 2 2\n3 1 6\n\nSample Output 3\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 123, "memory_kb": 5760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s537161660", "group_id": "codeNet:p03609", "input_text": "open Printf\nopen Scanf\n\nlet () =\n        let s = read_line() in\n        let rec iter i ans =\n                if i = (String.length s) then\n                        printf \"%s\\n\" ans\n                else if (i mod 2 = 0) then\n                        iter (i + 1) (ans ^ (String.make 1 s.[i]))\n                else\n                        iter (i + 1) ans\n        in iter 0 \"\"\n", "language": "OCaml", "metadata": {"date": 1504991729, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03609.html", "problem_id": "p03609", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03609/input.txt", "sample_output_relpath": "derived/input_output/data/p03609/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03609/OCaml/s537161660.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s537161660", "user_id": "u625631018"}, "prompt_components": {"gold_output": "83\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet () =\n        let s = read_line() in\n        let rec iter i ans =\n                if i = (String.length s) then\n                        printf \"%s\\n\" ans\n                else if (i mod 2 = 0) then\n                        iter (i + 1) (ans ^ (String.make 1 s.[i]))\n                else\n                        iter (i + 1) ans\n        in iter 0 \"\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have a sandglass that runs for X seconds. The sand drops from the upper bulb at a rate of 1 gram per second. That is, the upper bulb initially contains X grams of sand.\n\nHow many grams of sand will the upper bulb contains after t seconds?\n\nConstraints\n\n1≤X≤10^9\n\n1≤t≤10^9\n\nX and t are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX t\n\nOutput\n\nPrint the number of sand in the upper bulb after t second.\n\nSample Input 1\n\n100 17\n\nSample Output 1\n\n83\n\n17 out of the initial 100 grams of sand will be consumed, resulting in 83 grams.\n\nSample Input 2\n\n48 58\n\nSample Output 2\n\n0\n\nAll 48 grams of sand will be gone, resulting in 0 grams.\n\nSample Input 3\n\n1000000000 1000000000\n\nSample Output 3\n\n0", "sample_input": "100 17\n"}, "reference_outputs": ["83\n"], "source_document_id": "p03609", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have a sandglass that runs for X seconds. The sand drops from the upper bulb at a rate of 1 gram per second. That is, the upper bulb initially contains X grams of sand.\n\nHow many grams of sand will the upper bulb contains after t seconds?\n\nConstraints\n\n1≤X≤10^9\n\n1≤t≤10^9\n\nX and t are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX t\n\nOutput\n\nPrint the number of sand in the upper bulb after t second.\n\nSample Input 1\n\n100 17\n\nSample Output 1\n\n83\n\n17 out of the initial 100 grams of sand will be consumed, resulting in 83 grams.\n\nSample Input 2\n\n48 58\n\nSample Output 2\n\n0\n\nAll 48 grams of sand will be gone, resulting in 0 grams.\n\nSample Input 3\n\n1000000000 1000000000\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 374, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s676487392", "group_id": "codeNet:p03609", "input_text": "open Printf\nopen Scanf\n\nlet () =\n\tlet (x, t) = scanf \"%d %d\" (fun x t -> (x, t)) in\n\t(if x < t then \n\t\t0\n\telse x - t)\n\t|> printf \"%d\\n\"\n\t", "language": "OCaml", "metadata": {"date": 1504818008, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03609.html", "problem_id": "p03609", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03609/input.txt", "sample_output_relpath": "derived/input_output/data/p03609/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03609/OCaml/s676487392.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s676487392", "user_id": "u625631018"}, "prompt_components": {"gold_output": "83\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet () =\n\tlet (x, t) = scanf \"%d %d\" (fun x t -> (x, t)) in\n\t(if x < t then \n\t\t0\n\telse x - t)\n\t|> printf \"%d\\n\"\n\t", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have a sandglass that runs for X seconds. The sand drops from the upper bulb at a rate of 1 gram per second. That is, the upper bulb initially contains X grams of sand.\n\nHow many grams of sand will the upper bulb contains after t seconds?\n\nConstraints\n\n1≤X≤10^9\n\n1≤t≤10^9\n\nX and t are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX t\n\nOutput\n\nPrint the number of sand in the upper bulb after t second.\n\nSample Input 1\n\n100 17\n\nSample Output 1\n\n83\n\n17 out of the initial 100 grams of sand will be consumed, resulting in 83 grams.\n\nSample Input 2\n\n48 58\n\nSample Output 2\n\n0\n\nAll 48 grams of sand will be gone, resulting in 0 grams.\n\nSample Input 3\n\n1000000000 1000000000\n\nSample Output 3\n\n0", "sample_input": "100 17\n"}, "reference_outputs": ["83\n"], "source_document_id": "p03609", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have a sandglass that runs for X seconds. The sand drops from the upper bulb at a rate of 1 gram per second. That is, the upper bulb initially contains X grams of sand.\n\nHow many grams of sand will the upper bulb contains after t seconds?\n\nConstraints\n\n1≤X≤10^9\n\n1≤t≤10^9\n\nX and t are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX t\n\nOutput\n\nPrint the number of sand in the upper bulb after t second.\n\nSample Input 1\n\n100 17\n\nSample Output 1\n\n83\n\n17 out of the initial 100 grams of sand will be consumed, resulting in 83 grams.\n\nSample Input 2\n\n48 58\n\nSample Output 2\n\n0\n\nAll 48 grams of sand will be gone, resulting in 0 grams.\n\nSample Input 3\n\n1000000000 1000000000\n\nSample Output 3\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 137, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s153454779", "group_id": "codeNet:p03611", "input_text": "(* O(n) *)\nlet kMax = 100000 + 10\nlet n = Scanf.scanf \" %d\" @@ (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet ns = Array.make (kMax + 1) 0\nlet f a =\n  for i = 0 to 2 do ns.(a + i) <- ns.(a + i) + 1 done\nlet _ =\n  Array.iter f a_s;\n  Array.fold_left max 0 ns |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1560155004, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03611.html", "problem_id": "p03611", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03611/input.txt", "sample_output_relpath": "derived/input_output/data/p03611/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03611/OCaml/s153454779.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s153454779", "user_id": "u732304692"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(* O(n) *)\nlet kMax = 100000 + 10\nlet n = Scanf.scanf \" %d\" @@ (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet ns = Array.make (kMax + 1) 0\nlet f a =\n  for i = 0 to 2 do ns.(a + i) <- ns.(a + i) + 1 done\nlet _ =\n  Array.iter f a_s;\n  Array.fold_left max 0 ns |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length N, a_1,a_2,...,a_N.\n\nFor each 1≤i≤N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.\n\nAfter these operations, you select an integer X and count the number of i such that a_i=X.\n\nMaximize this count by making optimal choices.\n\nConstraints\n\n1≤N≤10^5\n\n0≤a_i<10^5 (1≤i≤N)\n\na_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 .. a_N\n\nOutput\n\nPrint the maximum possible number of i such that a_i=X.\n\nSample Input 1\n\n7\n3 1 4 1 5 9 2\n\nSample Output 1\n\n4\n\nFor example, turn the sequence into 2,2,3,2,6,9,2 and select X=2 to obtain 4, the maximum possible count.\n\nSample Input 2\n\n10\n0 1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n3\n\nSample Input 3\n\n1\n99999\n\nSample Output 3\n\n1", "sample_input": "7\n3 1 4 1 5 9 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03611", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length N, a_1,a_2,...,a_N.\n\nFor each 1≤i≤N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.\n\nAfter these operations, you select an integer X and count the number of i such that a_i=X.\n\nMaximize this count by making optimal choices.\n\nConstraints\n\n1≤N≤10^5\n\n0≤a_i<10^5 (1≤i≤N)\n\na_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 .. a_N\n\nOutput\n\nPrint the maximum possible number of i such that a_i=X.\n\nSample Input 1\n\n7\n3 1 4 1 5 9 2\n\nSample Output 1\n\n4\n\nFor example, turn the sequence into 2,2,3,2,6,9,2 and select X=2 to obtain 4, the maximum possible count.\n\nSample Input 2\n\n10\n0 1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n3\n\nSample Input 3\n\n1\n99999\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 306, "cpu_time_ms": 28, "memory_kb": 5760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s869401929", "group_id": "codeNet:p03611", "input_text": "open Hashtbl\n\nlet id x = x\nlet n = Scanf.scanf \"%d\\n\" id\nlet h = create 100\n\nlet f n =\n  let rec g n' =\n    if n' = 0 then ()\n    else\n      let a = Scanf.scanf \"%d \" id in\n      let v = try find h a with _ -> 0 in\n      replace h a (v + 1) ;\n      g (n' - 1)\n  in\n  g n\n\n\nlet () =\n  f n ;\n  fold (fun k v tmp -> \n      let v' = try find h (k - 1) with _ -> 0 in\n      let v'' = try find h (k + 1) with _ -> 0 in\n      max tmp (v + v' + v'')) h 0\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1524374072, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03611.html", "problem_id": "p03611", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03611/input.txt", "sample_output_relpath": "derived/input_output/data/p03611/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03611/OCaml/s869401929.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s869401929", "user_id": "u987869509"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "open Hashtbl\n\nlet id x = x\nlet n = Scanf.scanf \"%d\\n\" id\nlet h = create 100\n\nlet f n =\n  let rec g n' =\n    if n' = 0 then ()\n    else\n      let a = Scanf.scanf \"%d \" id in\n      let v = try find h a with _ -> 0 in\n      replace h a (v + 1) ;\n      g (n' - 1)\n  in\n  g n\n\n\nlet () =\n  f n ;\n  fold (fun k v tmp -> \n      let v' = try find h (k - 1) with _ -> 0 in\n      let v'' = try find h (k + 1) with _ -> 0 in\n      max tmp (v + v' + v'')) h 0\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length N, a_1,a_2,...,a_N.\n\nFor each 1≤i≤N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.\n\nAfter these operations, you select an integer X and count the number of i such that a_i=X.\n\nMaximize this count by making optimal choices.\n\nConstraints\n\n1≤N≤10^5\n\n0≤a_i<10^5 (1≤i≤N)\n\na_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 .. a_N\n\nOutput\n\nPrint the maximum possible number of i such that a_i=X.\n\nSample Input 1\n\n7\n3 1 4 1 5 9 2\n\nSample Output 1\n\n4\n\nFor example, turn the sequence into 2,2,3,2,6,9,2 and select X=2 to obtain 4, the maximum possible count.\n\nSample Input 2\n\n10\n0 1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n3\n\nSample Input 3\n\n1\n99999\n\nSample Output 3\n\n1", "sample_input": "7\n3 1 4 1 5 9 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03611", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length N, a_1,a_2,...,a_N.\n\nFor each 1≤i≤N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.\n\nAfter these operations, you select an integer X and count the number of i such that a_i=X.\n\nMaximize this count by making optimal choices.\n\nConstraints\n\n1≤N≤10^5\n\n0≤a_i<10^5 (1≤i≤N)\n\na_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 .. a_N\n\nOutput\n\nPrint the maximum possible number of i such that a_i=X.\n\nSample Input 1\n\n7\n3 1 4 1 5 9 2\n\nSample Output 1\n\n4\n\nFor example, turn the sequence into 2,2,3,2,6,9,2 and select X=2 to obtain 4, the maximum possible count.\n\nSample Input 2\n\n10\n0 1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n3\n\nSample Input 3\n\n1\n99999\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 66, "memory_kb": 6912}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s444667693", "group_id": "codeNet:p03611", "input_text": "open Hashtbl\n\nlet id x = x\nlet n = Scanf.scanf \"%d\\n\" id\nlet h = create 100\n\nlet f n =\n  let rec g n' =\n    if n' = 0 then ()\n    else\n      let a = Scanf.scanf \"%d \" id in\n      let v = try find h a with _ -> 0 in\n      let v' = try find h (a - 1) with _ -> 0 in\n      let v'' = try find h (a + 1) with _ -> 0 in\n      replace h a (v + 1) ;\n      replace h (a - 1) (v' + 1) ;\n      replace h (a + 1) (v'' + 1) ;\n      g (n' - 1)\n  in\n  g n\n\nlet () =\n  f n ;\n  fold (fun _ v tmp -> max v tmp) h 0 |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1524373673, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03611.html", "problem_id": "p03611", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03611/input.txt", "sample_output_relpath": "derived/input_output/data/p03611/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03611/OCaml/s444667693.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s444667693", "user_id": "u987869509"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "open Hashtbl\n\nlet id x = x\nlet n = Scanf.scanf \"%d\\n\" id\nlet h = create 100\n\nlet f n =\n  let rec g n' =\n    if n' = 0 then ()\n    else\n      let a = Scanf.scanf \"%d \" id in\n      let v = try find h a with _ -> 0 in\n      let v' = try find h (a - 1) with _ -> 0 in\n      let v'' = try find h (a + 1) with _ -> 0 in\n      replace h a (v + 1) ;\n      replace h (a - 1) (v' + 1) ;\n      replace h (a + 1) (v'' + 1) ;\n      g (n' - 1)\n  in\n  g n\n\nlet () =\n  f n ;\n  fold (fun _ v tmp -> max v tmp) h 0 |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length N, a_1,a_2,...,a_N.\n\nFor each 1≤i≤N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.\n\nAfter these operations, you select an integer X and count the number of i such that a_i=X.\n\nMaximize this count by making optimal choices.\n\nConstraints\n\n1≤N≤10^5\n\n0≤a_i<10^5 (1≤i≤N)\n\na_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 .. a_N\n\nOutput\n\nPrint the maximum possible number of i such that a_i=X.\n\nSample Input 1\n\n7\n3 1 4 1 5 9 2\n\nSample Output 1\n\n4\n\nFor example, turn the sequence into 2,2,3,2,6,9,2 and select X=2 to obtain 4, the maximum possible count.\n\nSample Input 2\n\n10\n0 1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n3\n\nSample Input 3\n\n1\n99999\n\nSample Output 3\n\n1", "sample_input": "7\n3 1 4 1 5 9 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03611", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length N, a_1,a_2,...,a_N.\n\nFor each 1≤i≤N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.\n\nAfter these operations, you select an integer X and count the number of i such that a_i=X.\n\nMaximize this count by making optimal choices.\n\nConstraints\n\n1≤N≤10^5\n\n0≤a_i<10^5 (1≤i≤N)\n\na_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 .. a_N\n\nOutput\n\nPrint the maximum possible number of i such that a_i=X.\n\nSample Input 1\n\n7\n3 1 4 1 5 9 2\n\nSample Output 1\n\n4\n\nFor example, turn the sequence into 2,2,3,2,6,9,2 and select X=2 to obtain 4, the maximum possible count.\n\nSample Input 2\n\n10\n0 1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n3\n\nSample Input 3\n\n1\n99999\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 118, "memory_kb": 10624}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s973354572", "group_id": "codeNet:p03613", "input_text": "module IMap=Map.Make(struct type t=int let compare=compare end);;\nScanf.(Array.(scanf\" %d\"@@ fun n->\n\tlet m = init n(fun _->scanf\" %d\"@@fun v->v)\n\t|> fold_left(fun m v->IMap.add v (1+try IMap.find v m with Not_found -> 0) m) IMap.empty\n\tin IMap.fold(fun v c r->\n\t\tlet p,q=(try IMap.find (v-1) m with Not_found->0),(try IMap.find (v+1) m with Not_found->0)\n\t\tin max r (p+q+c)) m 0 |> print_int))", "language": "OCaml", "metadata": {"date": 1541095046, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03613.html", "problem_id": "p03613", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03613/input.txt", "sample_output_relpath": "derived/input_output/data/p03613/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03613/OCaml/s973354572.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s973354572", "user_id": "u481480055"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "module IMap=Map.Make(struct type t=int let compare=compare end);;\nScanf.(Array.(scanf\" %d\"@@ fun n->\n\tlet m = init n(fun _->scanf\" %d\"@@fun v->v)\n\t|> fold_left(fun m v->IMap.add v (1+try IMap.find v m with Not_found -> 0) m) IMap.empty\n\tin IMap.fold(fun v c r->\n\t\tlet p,q=(try IMap.find (v-1) m with Not_found->0),(try IMap.find (v+1) m with Not_found->0)\n\t\tin max r (p+q+c)) m 0 |> print_int))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length N, a_1,a_2,...,a_N.\n\nFor each 1≤i≤N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.\n\nAfter these operations, you select an integer X and count the number of i such that a_i=X.\n\nMaximize this count by making optimal choices.\n\nConstraints\n\n1≤N≤10^5\n\n0≤a_i<10^5 (1≤i≤N)\n\na_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 .. a_N\n\nOutput\n\nPrint the maximum possible number of i such that a_i=X.\n\nSample Input 1\n\n7\n3 1 4 1 5 9 2\n\nSample Output 1\n\n4\n\nFor example, turn the sequence into 2,2,3,2,6,9,2 and select X=2 to obtain 4, the maximum possible count.\n\nSample Input 2\n\n10\n0 1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n3\n\nSample Input 3\n\n1\n99999\n\nSample Output 3\n\n1", "sample_input": "7\n3 1 4 1 5 9 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03613", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length N, a_1,a_2,...,a_N.\n\nFor each 1≤i≤N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.\n\nAfter these operations, you select an integer X and count the number of i such that a_i=X.\n\nMaximize this count by making optimal choices.\n\nConstraints\n\n1≤N≤10^5\n\n0≤a_i<10^5 (1≤i≤N)\n\na_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 .. a_N\n\nOutput\n\nPrint the maximum possible number of i such that a_i=X.\n\nSample Input 1\n\n7\n3 1 4 1 5 9 2\n\nSample Output 1\n\n4\n\nFor example, turn the sequence into 2,2,3,2,6,9,2 and select X=2 to obtain 4, the maximum possible count.\n\nSample Input 2\n\n10\n0 1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n3\n\nSample Input 3\n\n1\n99999\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 394, "cpu_time_ms": 155, "memory_kb": 10496}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s089894966", "group_id": "codeNet:p03617", "input_text": "let q, h, s, d = Scanf.scanf \" %d %d %d %d\" @@ fun a b c d -> a, b, c, d\nlet n = Scanf.scanf \" %d\" @@ (+) 0\nlet m0_5 = min h @@ q * 2\nlet m1 = min s @@ m0_5 * 2\nlet m2 = min d @@ m1 * 2\nlet c2 = n / 2\nlet c1 = n - c2 * 2\nlet _ = c2 * m2 + c1 * m1 |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1561506965, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03617.html", "problem_id": "p03617", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03617/input.txt", "sample_output_relpath": "derived/input_output/data/p03617/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03617/OCaml/s089894966.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s089894966", "user_id": "u732304692"}, "prompt_components": {"gold_output": "150\n", "input_to_evaluate": "let q, h, s, d = Scanf.scanf \" %d %d %d %d\" @@ fun a b c d -> a, b, c, d\nlet n = Scanf.scanf \" %d\" @@ (+) 0\nlet m0_5 = min h @@ q * 2\nlet m1 = min s @@ m0_5 * 2\nlet m2 = min d @@ m1 * 2\nlet c2 = n / 2\nlet c1 = n - c2 * 2\nlet _ = c2 * m2 + c1 * m1 |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou've come to your favorite store Infinitesco to buy some ice tea.\n\nThe store sells ice tea in bottles of different volumes at different costs.\nSpecifically, a 0.25-liter bottle costs Q yen, a 0.5-liter bottle costs H yen, a 1-liter bottle costs S yen, and a 2-liter bottle costs D yen.\nThe store has an infinite supply of bottles of each type.\n\nYou want to buy exactly N liters of ice tea. How many yen do you have to spend?\n\nConstraints\n\n1 \\leq Q, H, S, D \\leq 10^8\n\n1 \\leq N \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ H S D\nN\n\nOutput\n\nPrint the smallest number of yen you have to spend to buy exactly N liters of ice tea.\n\nSample Input 1\n\n20 30 70 90\n3\n\nSample Output 1\n\n150\n\nBuy one 2-liter bottle and two 0.5-liter bottles. You'll get 3 liters for 90 + 30 + 30 = 150 yen.\n\nSample Input 2\n\n10000 1000 100 10\n1\n\nSample Output 2\n\n100\n\nEven though a 2-liter bottle costs just 10 yen, you need only 1 liter.\nThus, you have to buy a 1-liter bottle for 100 yen.\n\nSample Input 3\n\n10 100 1000 10000\n1\n\nSample Output 3\n\n40\n\nNow it's better to buy four 0.25-liter bottles for 10 + 10 + 10 + 10 = 40 yen.\n\nSample Input 4\n\n12345678 87654321 12345678 87654321\n123456789\n\nSample Output 4\n\n1524157763907942", "sample_input": "20 30 70 90\n3\n"}, "reference_outputs": ["150\n"], "source_document_id": "p03617", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou've come to your favorite store Infinitesco to buy some ice tea.\n\nThe store sells ice tea in bottles of different volumes at different costs.\nSpecifically, a 0.25-liter bottle costs Q yen, a 0.5-liter bottle costs H yen, a 1-liter bottle costs S yen, and a 2-liter bottle costs D yen.\nThe store has an infinite supply of bottles of each type.\n\nYou want to buy exactly N liters of ice tea. How many yen do you have to spend?\n\nConstraints\n\n1 \\leq Q, H, S, D \\leq 10^8\n\n1 \\leq N \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ H S D\nN\n\nOutput\n\nPrint the smallest number of yen you have to spend to buy exactly N liters of ice tea.\n\nSample Input 1\n\n20 30 70 90\n3\n\nSample Output 1\n\n150\n\nBuy one 2-liter bottle and two 0.5-liter bottles. You'll get 3 liters for 90 + 30 + 30 = 150 yen.\n\nSample Input 2\n\n10000 1000 100 10\n1\n\nSample Output 2\n\n100\n\nEven though a 2-liter bottle costs just 10 yen, you need only 1 liter.\nThus, you have to buy a 1-liter bottle for 100 yen.\n\nSample Input 3\n\n10 100 1000 10000\n1\n\nSample Output 3\n\n40\n\nNow it's better to buy four 0.25-liter bottles for 10 + 10 + 10 + 10 = 40 yen.\n\nSample Input 4\n\n12345678 87654321 12345678 87654321\n123456789\n\nSample Output 4\n\n1524157763907942", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 270, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s771909747", "group_id": "codeNet:p03617", "input_text": "let () =\n  let q, h, s, d = Scanf.scanf \"%d %d %d %d\\n\" (fun q h s d -> q, h, s, d) in\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  [(1, q); (2, h); (4, s); (8, d)]\n  |> List.sort (fun (size, price) (size', price') -> compare (price * size') (price' * size))\n  |> List.fold_left (fun (acc, n) (size, price) -> (acc + n / size * price, n mod size)) (0, 4 * n)\n  |> fst\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1507366855, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03617.html", "problem_id": "p03617", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03617/input.txt", "sample_output_relpath": "derived/input_output/data/p03617/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03617/OCaml/s771909747.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s771909747", "user_id": "u504158101"}, "prompt_components": {"gold_output": "150\n", "input_to_evaluate": "let () =\n  let q, h, s, d = Scanf.scanf \"%d %d %d %d\\n\" (fun q h s d -> q, h, s, d) in\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  [(1, q); (2, h); (4, s); (8, d)]\n  |> List.sort (fun (size, price) (size', price') -> compare (price * size') (price' * size))\n  |> List.fold_left (fun (acc, n) (size, price) -> (acc + n / size * price, n mod size)) (0, 4 * n)\n  |> fst\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou've come to your favorite store Infinitesco to buy some ice tea.\n\nThe store sells ice tea in bottles of different volumes at different costs.\nSpecifically, a 0.25-liter bottle costs Q yen, a 0.5-liter bottle costs H yen, a 1-liter bottle costs S yen, and a 2-liter bottle costs D yen.\nThe store has an infinite supply of bottles of each type.\n\nYou want to buy exactly N liters of ice tea. How many yen do you have to spend?\n\nConstraints\n\n1 \\leq Q, H, S, D \\leq 10^8\n\n1 \\leq N \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ H S D\nN\n\nOutput\n\nPrint the smallest number of yen you have to spend to buy exactly N liters of ice tea.\n\nSample Input 1\n\n20 30 70 90\n3\n\nSample Output 1\n\n150\n\nBuy one 2-liter bottle and two 0.5-liter bottles. You'll get 3 liters for 90 + 30 + 30 = 150 yen.\n\nSample Input 2\n\n10000 1000 100 10\n1\n\nSample Output 2\n\n100\n\nEven though a 2-liter bottle costs just 10 yen, you need only 1 liter.\nThus, you have to buy a 1-liter bottle for 100 yen.\n\nSample Input 3\n\n10 100 1000 10000\n1\n\nSample Output 3\n\n40\n\nNow it's better to buy four 0.25-liter bottles for 10 + 10 + 10 + 10 = 40 yen.\n\nSample Input 4\n\n12345678 87654321 12345678 87654321\n123456789\n\nSample Output 4\n\n1524157763907942", "sample_input": "20 30 70 90\n3\n"}, "reference_outputs": ["150\n"], "source_document_id": "p03617", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou've come to your favorite store Infinitesco to buy some ice tea.\n\nThe store sells ice tea in bottles of different volumes at different costs.\nSpecifically, a 0.25-liter bottle costs Q yen, a 0.5-liter bottle costs H yen, a 1-liter bottle costs S yen, and a 2-liter bottle costs D yen.\nThe store has an infinite supply of bottles of each type.\n\nYou want to buy exactly N liters of ice tea. How many yen do you have to spend?\n\nConstraints\n\n1 \\leq Q, H, S, D \\leq 10^8\n\n1 \\leq N \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ H S D\nN\n\nOutput\n\nPrint the smallest number of yen you have to spend to buy exactly N liters of ice tea.\n\nSample Input 1\n\n20 30 70 90\n3\n\nSample Output 1\n\n150\n\nBuy one 2-liter bottle and two 0.5-liter bottles. You'll get 3 liters for 90 + 30 + 30 = 150 yen.\n\nSample Input 2\n\n10000 1000 100 10\n1\n\nSample Output 2\n\n100\n\nEven though a 2-liter bottle costs just 10 yen, you need only 1 liter.\nThus, you have to buy a 1-liter bottle for 100 yen.\n\nSample Input 3\n\n10 100 1000 10000\n1\n\nSample Output 3\n\n40\n\nNow it's better to buy four 0.25-liter bottles for 10 + 10 + 10 + 10 = 40 yen.\n\nSample Input 4\n\n12345678 87654321 12345678 87654321\n123456789\n\nSample Output 4\n\n1524157763907942", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 395, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s892922919", "group_id": "codeNet:p03623", "input_text": "let x, a, b = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet ans = if abs(a-x) >abs(b-x) then \"B\" else \"A\"\nlet () = print_endline ans", "language": "OCaml", "metadata": {"date": 1588002992, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03623.html", "problem_id": "p03623", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03623/input.txt", "sample_output_relpath": "derived/input_output/data/p03623/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03623/OCaml/s892922919.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s892922919", "user_id": "u307426615"}, "prompt_components": {"gold_output": "B\n", "input_to_evaluate": "let x, a, b = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet ans = if abs(a-x) >abs(b-x) then \"B\" else \"A\"\nlet () = print_endline ans", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke lives at position x on a number line.\nOn this line, there are two stores A and B, respectively at position a and b, that offer food for delivery.\n\nSnuke decided to get food delivery from the closer of stores A and B.\nFind out which store is closer to Snuke's residence.\n\nHere, the distance between two points s and t on a number line is represented by |s-t|.\n\nConstraints\n\n1 \\leq x \\leq 1000\n\n1 \\leq a \\leq 1000\n\n1 \\leq b \\leq 1000\n\nx, a and b are pairwise distinct.\n\nThe distances between Snuke's residence and stores A and B are different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx a b\n\nOutput\n\nIf store A is closer, print A; if store B is closer, print B.\n\nSample Input 1\n\n5 2 7\n\nSample Output 1\n\nB\n\nThe distances between Snuke's residence and stores A and B are 3 and 2, respectively.\nSince store B is closer, print B.\n\nSample Input 2\n\n1 999 1000\n\nSample Output 2\n\nA", "sample_input": "5 2 7\n"}, "reference_outputs": ["B\n"], "source_document_id": "p03623", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke lives at position x on a number line.\nOn this line, there are two stores A and B, respectively at position a and b, that offer food for delivery.\n\nSnuke decided to get food delivery from the closer of stores A and B.\nFind out which store is closer to Snuke's residence.\n\nHere, the distance between two points s and t on a number line is represented by |s-t|.\n\nConstraints\n\n1 \\leq x \\leq 1000\n\n1 \\leq a \\leq 1000\n\n1 \\leq b \\leq 1000\n\nx, a and b are pairwise distinct.\n\nThe distances between Snuke's residence and stores A and B are different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx a b\n\nOutput\n\nIf store A is closer, print A; if store B is closer, print B.\n\nSample Input 1\n\n5 2 7\n\nSample Output 1\n\nB\n\nThe distances between Snuke's residence and stores A and B are 3 and 2, respectively.\nSince store B is closer, print B.\n\nSample Input 2\n\n1 999 1000\n\nSample Output 2\n\nA", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 138, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s682929397", "group_id": "codeNet:p03625", "input_text": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet xs = Array.(sort (-) a_s; fold_left (fun (xs, p) a -> if p = a then a :: xs, 0 else xs, a) ([], 0) a_s) |> fst\nlet _ = Printf.printf \"%d\\n\" @@ match xs with a :: b :: _ -> a * b | _ -> 0", "language": "OCaml", "metadata": {"date": 1570377343, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s682929397.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s682929397", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet xs = Array.(sort (-) a_s; fold_left (fun (xs, p) a -> if p = a then a :: xs, 0 else xs, a) ([], 0) a_s) |> fst\nlet _ = Printf.printf \"%d\\n\" @@ match xs with a :: b :: _ -> a * b | _ -> 0", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "sample_input": "6\n3 1 2 4 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03625", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 281, "cpu_time_ms": 66, "memory_kb": 5504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s631053092", "group_id": "codeNet:p03625", "input_text": "open Hashtbl\nlet n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet h = create n\nlet acs = Array.(iter (fun a -> replace h a @@ try find h a + 1 with _ -> 1) a_s; List.(fold (fun a c xs -> (a, c) :: xs) h [] |> filter (fun (_, c) -> c >= 2) |> sort (fun x y -> compare y x) |> of_list))\nlet _ = Printf.printf \"%d\\n\" @@ if Array.length acs < 2 then 0 else fst acs.(0) * fst acs.(1)", "language": "OCaml", "metadata": {"date": 1570370143, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s631053092.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s631053092", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Hashtbl\nlet n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet h = create n\nlet acs = Array.(iter (fun a -> replace h a @@ try find h a + 1 with _ -> 1) a_s; List.(fold (fun a c xs -> (a, c) :: xs) h [] |> filter (fun (_, c) -> c >= 2) |> sort (fun x y -> compare y x) |> of_list))\nlet _ = Printf.printf \"%d\\n\" @@ if Array.length acs < 2 then 0 else fst acs.(0) * fst acs.(1)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "sample_input": "6\n3 1 2 4 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03625", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 420, "cpu_time_ms": 80, "memory_kb": 12032}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s748736741", "group_id": "codeNet:p03625", "input_text": "let mkls n =\n  let rec f n' ls =\n    if n' = 0 then List.fast_sort (fun i j -> j - i) ls\n    else\n      f (pred n') (Scanf.scanf \"%d \" (fun x -> x) :: ls)\n  in\n  f n []\n\nlet solve ls =\n  let rec f ed = function\n    | [] | [_] -> 0\n    | h :: (h' :: t as t') ->\n      if h = h' && ed > 0 then h * ed\n      else if h = h' && ed <= 0 then f h t\n      else f ed t'\n  in\n  f 0 ls\n\nlet () = Scanf.scanf \"%d\\n\" mkls |> solve |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1524479066, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s748736741.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s748736741", "user_id": "u987869509"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let mkls n =\n  let rec f n' ls =\n    if n' = 0 then List.fast_sort (fun i j -> j - i) ls\n    else\n      f (pred n') (Scanf.scanf \"%d \" (fun x -> x) :: ls)\n  in\n  f n []\n\nlet solve ls =\n  let rec f ed = function\n    | [] | [_] -> 0\n    | h :: (h' :: t as t') ->\n      if h = h' && ed > 0 then h * ed\n      else if h = h' && ed <= 0 then f h t\n      else f ed t'\n  in\n  f 0 ls\n\nlet () = Scanf.scanf \"%d\\n\" mkls |> solve |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "sample_input": "6\n3 1 2 4 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03625", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 441, "cpu_time_ms": 71, "memory_kb": 8448}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s306543813", "group_id": "codeNet:p03626", "input_text": "\nopen Scanf\nopen Printf\n\nlet flip f x y = f y x\n\nlet rec range a b = if a >= b then [] else a :: range (a+1) b\n\nlet read_int () = scanf \" %d\" (fun x -> x)\nlet rec read_ints n = if n = 0 then [] else let i = read_int () in i :: read_ints (n-1)\n\nlet rec for_iter a b f = if a >= b then [] else let x = f a in x :: for_iter (a+1) b f\nlet rec for_iter_ a b f = if a >= b then () else (f a; for_iter_ (a+1) b f)\n\nlet list_of_string str = range 0 (String.length str) |> List.map (fun i -> str.[i])\n\ntype domino = H | V\n\nlet m = 1000000007\n\nlet mm x y = (x * y) mod m\n\nlet parse s =\n  let rec f str = match str with\n  | [] -> []\n  | [_] -> [V]\n  | (x::y::ys) -> if x = y then H :: f ys else V :: f (y::ys) in\n  f (list_of_string s)\n\nlet calc xs =\n  let f (p, a) x =\n    match p, x with\n    | H, H -> (H, mm 3 a)\n    | H, V -> (V, a)\n    | V, _ -> (x, mm 2 a) in\n  match xs with\n  | [] -> 1\n  | (x::xs') ->\n      let mult = match x with H -> 6 | V -> 3 in\n      List.fold_left f (x, mult) xs' |> snd\n\nlet () =\n  let _ = read_line () in\n  let _ = read_line () in\n  read_line () |> parse |> calc |> printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1519616938, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s306543813.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s306543813", "user_id": "u798181098"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "\nopen Scanf\nopen Printf\n\nlet flip f x y = f y x\n\nlet rec range a b = if a >= b then [] else a :: range (a+1) b\n\nlet read_int () = scanf \" %d\" (fun x -> x)\nlet rec read_ints n = if n = 0 then [] else let i = read_int () in i :: read_ints (n-1)\n\nlet rec for_iter a b f = if a >= b then [] else let x = f a in x :: for_iter (a+1) b f\nlet rec for_iter_ a b f = if a >= b then () else (f a; for_iter_ (a+1) b f)\n\nlet list_of_string str = range 0 (String.length str) |> List.map (fun i -> str.[i])\n\ntype domino = H | V\n\nlet m = 1000000007\n\nlet mm x y = (x * y) mod m\n\nlet parse s =\n  let rec f str = match str with\n  | [] -> []\n  | [_] -> [V]\n  | (x::y::ys) -> if x = y then H :: f ys else V :: f (y::ys) in\n  f (list_of_string s)\n\nlet calc xs =\n  let f (p, a) x =\n    match p, x with\n    | H, H -> (H, mm 3 a)\n    | H, V -> (V, a)\n    | V, _ -> (x, mm 2 a) in\n  match xs with\n  | [] -> 1\n  | (x::xs') ->\n      let mult = match x with H -> 6 | V -> 3 in\n      List.fold_left f (x, mult) xs' |> snd\n\nlet () =\n  let _ = read_line () in\n  let _ = read_line () in\n  read_line () |> parse |> calc |> printf \"%d\\n\"\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a board with a 2 \\times N grid.\nSnuke covered the board with N dominoes without overlaps.\nHere, a domino can cover a 1 \\times 2 or 2 \\times 1 square.\n\nThen, Snuke decided to paint these dominoes using three colors: red, cyan and green.\nTwo dominoes that are adjacent by side should be painted by different colors.\nHere, it is not always necessary to use all three colors.\n\nFind the number of such ways to paint the dominoes, modulo 1000000007.\n\nThe arrangement of the dominoes is given to you as two strings S_1 and S_2 in the following manner:\n\nEach domino is represented by a different English letter (lowercase or uppercase).\n\nThe j-th character in S_i represents the domino that occupies the square at the i-th row from the top and j-th column from the left.\n\nConstraints\n\n1 \\leq N \\leq 52\n\n|S_1| = |S_2| = N\n\nS_1 and S_2 consist of lowercase and uppercase English letters.\n\nS_1 and S_2 represent a valid arrangement of dominoes.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\nS_2\n\nOutput\n\nPrint the number of such ways to paint the dominoes, modulo 1000000007.\n\nSample Input 1\n\n3\naab\nccb\n\nSample Output 1\n\n6\n\nThere are six ways as shown below:\n\nSample Input 2\n\n1\nZ\nZ\n\nSample Output 2\n\n3\n\nNote that it is not always necessary to use all the colors.\n\nSample Input 3\n\n52\nRvvttdWIyyPPQFFZZssffEEkkaSSDKqcibbeYrhAljCCGGJppHHn\nRLLwwdWIxxNNQUUXXVVMMooBBaggDKqcimmeYrhAljOOTTJuuzzn\n\nSample Output 3\n\n958681902", "sample_input": "3\naab\nccb\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03626", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a board with a 2 \\times N grid.\nSnuke covered the board with N dominoes without overlaps.\nHere, a domino can cover a 1 \\times 2 or 2 \\times 1 square.\n\nThen, Snuke decided to paint these dominoes using three colors: red, cyan and green.\nTwo dominoes that are adjacent by side should be painted by different colors.\nHere, it is not always necessary to use all three colors.\n\nFind the number of such ways to paint the dominoes, modulo 1000000007.\n\nThe arrangement of the dominoes is given to you as two strings S_1 and S_2 in the following manner:\n\nEach domino is represented by a different English letter (lowercase or uppercase).\n\nThe j-th character in S_i represents the domino that occupies the square at the i-th row from the top and j-th column from the left.\n\nConstraints\n\n1 \\leq N \\leq 52\n\n|S_1| = |S_2| = N\n\nS_1 and S_2 consist of lowercase and uppercase English letters.\n\nS_1 and S_2 represent a valid arrangement of dominoes.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\nS_2\n\nOutput\n\nPrint the number of such ways to paint the dominoes, modulo 1000000007.\n\nSample Input 1\n\n3\naab\nccb\n\nSample Output 1\n\n6\n\nThere are six ways as shown below:\n\nSample Input 2\n\n1\nZ\nZ\n\nSample Output 2\n\n3\n\nNote that it is not always necessary to use all the colors.\n\nSample Input 3\n\n52\nRvvttdWIyyPPQFFZZssffEEkkaSSDKqcibbeYrhAljCCGGJppHHn\nRLLwwdWIxxNNQUUXXVVMMooBBaggDKqcimmeYrhAljOOTTJuuzzn\n\nSample Output 3\n\n958681902", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1103, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s823129978", "group_id": "codeNet:p03632", "input_text": "Scanf.scanf \" %d %d %d %d\" @@ fun a b c d ->\n  max 0 @@ min b d - max a c |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1559292872, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03632.html", "problem_id": "p03632", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03632/input.txt", "sample_output_relpath": "derived/input_output/data/p03632/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03632/OCaml/s823129978.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s823129978", "user_id": "u732304692"}, "prompt_components": {"gold_output": "50\n", "input_to_evaluate": "Scanf.scanf \" %d %d %d %d\" @@ fun a b c d ->\n  max 0 @@ min b d - max a c |> Printf.printf \"%d\\n\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAlice and Bob are controlling a robot. They each have one switch that controls the robot.\n\nAlice started holding down her button A second after the start-up of the robot, and released her button B second after the start-up.\n\nBob started holding down his button C second after the start-up, and released his button D second after the start-up.\n\nFor how many seconds both Alice and Bob were holding down their buttons?\n\nConstraints\n\n0≤A<B≤100\n\n0≤C<D≤100\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint the length of the duration (in seconds) in which both Alice and Bob were holding down their buttons.\n\nSample Input 1\n\n0 75 25 100\n\nSample Output 1\n\n50\n\nAlice started holding down her button 0 second after the start-up of the robot, and released her button 75 second after the start-up.\n\nBob started holding down his button 25 second after the start-up, and released his button 100 second after the start-up.\n\nTherefore, the time when both of them were holding down their buttons, is the 50 seconds from 25 seconds after the start-up to 75 seconds after the start-up.\n\nSample Input 2\n\n0 33 66 99\n\nSample Output 2\n\n0\n\nAlice and Bob were not holding their buttons at the same time, so the answer is zero seconds.\n\nSample Input 3\n\n10 90 20 80\n\nSample Output 3\n\n60", "sample_input": "0 75 25 100\n"}, "reference_outputs": ["50\n"], "source_document_id": "p03632", "source_text": "Score : 200 points\n\nProblem Statement\n\nAlice and Bob are controlling a robot. They each have one switch that controls the robot.\n\nAlice started holding down her button A second after the start-up of the robot, and released her button B second after the start-up.\n\nBob started holding down his button C second after the start-up, and released his button D second after the start-up.\n\nFor how many seconds both Alice and Bob were holding down their buttons?\n\nConstraints\n\n0≤A<B≤100\n\n0≤C<D≤100\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint the length of the duration (in seconds) in which both Alice and Bob were holding down their buttons.\n\nSample Input 1\n\n0 75 25 100\n\nSample Output 1\n\n50\n\nAlice started holding down her button 0 second after the start-up of the robot, and released her button 75 second after the start-up.\n\nBob started holding down his button 25 second after the start-up, and released his button 100 second after the start-up.\n\nTherefore, the time when both of them were holding down their buttons, is the 50 seconds from 25 seconds after the start-up to 75 seconds after the start-up.\n\nSample Input 2\n\n0 33 66 99\n\nSample Output 2\n\n0\n\nAlice and Bob were not holding their buttons at the same time, so the answer is zero seconds.\n\nSample Input 3\n\n10 90 20 80\n\nSample Output 3\n\n60", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 97, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s087463558", "group_id": "codeNet:p03632", "input_text": "let a, b, c, d = Scanf.scanf \"%d %d %d %d\" (fun a b c d -> (a, b, c, d))\n\nlet () =\n  let x = max a c in\n  let y = min b d in\n  if y - x > 0 then Printf.printf \"%d\\n\" (y - x) else Printf.printf \"%d\\n\" 0", "language": "OCaml", "metadata": {"date": 1521427997, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03632.html", "problem_id": "p03632", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03632/input.txt", "sample_output_relpath": "derived/input_output/data/p03632/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03632/OCaml/s087463558.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s087463558", "user_id": "u987869509"}, "prompt_components": {"gold_output": "50\n", "input_to_evaluate": "let a, b, c, d = Scanf.scanf \"%d %d %d %d\" (fun a b c d -> (a, b, c, d))\n\nlet () =\n  let x = max a c in\n  let y = min b d in\n  if y - x > 0 then Printf.printf \"%d\\n\" (y - x) else Printf.printf \"%d\\n\" 0", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAlice and Bob are controlling a robot. They each have one switch that controls the robot.\n\nAlice started holding down her button A second after the start-up of the robot, and released her button B second after the start-up.\n\nBob started holding down his button C second after the start-up, and released his button D second after the start-up.\n\nFor how many seconds both Alice and Bob were holding down their buttons?\n\nConstraints\n\n0≤A<B≤100\n\n0≤C<D≤100\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint the length of the duration (in seconds) in which both Alice and Bob were holding down their buttons.\n\nSample Input 1\n\n0 75 25 100\n\nSample Output 1\n\n50\n\nAlice started holding down her button 0 second after the start-up of the robot, and released her button 75 second after the start-up.\n\nBob started holding down his button 25 second after the start-up, and released his button 100 second after the start-up.\n\nTherefore, the time when both of them were holding down their buttons, is the 50 seconds from 25 seconds after the start-up to 75 seconds after the start-up.\n\nSample Input 2\n\n0 33 66 99\n\nSample Output 2\n\n0\n\nAlice and Bob were not holding their buttons at the same time, so the answer is zero seconds.\n\nSample Input 3\n\n10 90 20 80\n\nSample Output 3\n\n60", "sample_input": "0 75 25 100\n"}, "reference_outputs": ["50\n"], "source_document_id": "p03632", "source_text": "Score : 200 points\n\nProblem Statement\n\nAlice and Bob are controlling a robot. They each have one switch that controls the robot.\n\nAlice started holding down her button A second after the start-up of the robot, and released her button B second after the start-up.\n\nBob started holding down his button C second after the start-up, and released his button D second after the start-up.\n\nFor how many seconds both Alice and Bob were holding down their buttons?\n\nConstraints\n\n0≤A<B≤100\n\n0≤C<D≤100\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint the length of the duration (in seconds) in which both Alice and Bob were holding down their buttons.\n\nSample Input 1\n\n0 75 25 100\n\nSample Output 1\n\n50\n\nAlice started holding down her button 0 second after the start-up of the robot, and released her button 75 second after the start-up.\n\nBob started holding down his button 25 second after the start-up, and released his button 100 second after the start-up.\n\nTherefore, the time when both of them were holding down their buttons, is the 50 seconds from 25 seconds after the start-up to 75 seconds after the start-up.\n\nSample Input 2\n\n0 33 66 99\n\nSample Output 2\n\n0\n\nAlice and Bob were not holding their buttons at the same time, so the answer is zero seconds.\n\nSample Input 3\n\n10 90 20 80\n\nSample Output 3\n\n60", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 201, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s446389825", "group_id": "codeNet:p03634", "input_text": "open Printf\nopen Scanf\nopen Num\n\n\nmodule Pqueue = struct\n\n  type 'a t = {mutable cnt : int; hp : 'a array; cmp : 'a -> 'a -> int}\n\n  let create n v f = {cnt = 0; hp = Array.make n v; cmp = f}\n\n  let push k pq =\n    let swap i j =\n      let t = pq.hp.(i) in\n      pq.hp.(i) <- pq.hp.(j);\n      pq.hp.(j) <- t in\n    let rec iter i =\n      let p = i / 2 in\n      if p = 0 || pq.cmp pq.hp.(p) pq.hp.(i) >= 0 then ()\n      else (swap p i; iter p)\n    in\n    pq.cnt <- pq.cnt + 1;\n    pq.hp.(pq.cnt) <- k;\n    iter (pq.cnt)\n\n  let max_heapify pq n =\n    let swap i j =\n      let t = pq.hp.(i) in\n      pq.hp.(i) <- pq.hp.(j);\n      pq.hp.(j) <- t in\n    let rec iter i =\n      let l = 2 * i in\n      let r = 2 * i + 1 in\n      let mi =\n        let ti = if l <= pq.cnt && pq.cmp pq.hp.(l) pq.hp.(i) > 0 then l else i in\n        if r <= pq.cnt && pq.cmp pq.hp.(r) pq.hp.(ti) > 0 then r else ti in\n      if mi <> i then\n        begin\n          swap mi i;\n          iter mi\n        end\n    in\n    iter n\n\n  let pop pq =\n    let ret = pq.hp.(1) in\n    pq.hp.(1) <- pq.hp.(pq.cnt);\n    pq.cnt <- pq.cnt - 1;\n    max_heapify pq 1;\n    ret\n\n  let top pq = pq.hp.(1)\n\n  let is_empty pq = pq.cnt = 0\n\n  let length pq = pq.cnt\n\nend\n\nlet id x = x\n\nlet dijkstra g n s =\n  let d = Array.make n (num_of_string \"200000000000000\") in\n  let av = Array.make n true in\n  let pq = Pqueue.create 2000000 ((num_of_int 0),0) (fun x y -> let x1 = fst x and y1 = fst y in if y1 >/ x1 then 1 else if y1 =/ x1 then 0 else (-1)) in\n  let rec loop () =\n    if Pqueue.is_empty pq then d\n    else let du, u = Pqueue.pop pq in\n         if av.(u) then begin\n             av.(u) <- false;\n             List.iter (fun (v, c) ->\n                        if du +/ c </ d.(v) then begin\n                            d.(v) <- du +/ c;\n                            Pqueue.push (d.(v), v) pq\n                          end\n                       ) g.(u);\n             loop ()\n           end\n         else loop ()\n  in\n  d.(s) <- num_of_int 0;\n  Pqueue.push (d.(s), s) pq;\n  loop ()\n\nlet () =\n  let n = scanf \"%d \" id in\n  let g = Array.make n [] in\n  let rec make_g x =\n    if x = 0 then ()\n    else\n      let a, b, c = scanf \"%d %d %s \" (fun i j k -> (i-1, j-1, num_of_string k)) in\n      g.(a) <- (b, c) :: g.(a);\n      g.(b) <- (a, c) :: g.(b);\n      make_g (x-1) in\n  make_g (n-1);\n  let q, k = scanf \"%d %d \" (fun i j -> (i, j-1)) in\n  let d = dijkstra g n k in\n  let rec loop z =\n    if z = 0 then ()\n    else\n      let x, y = scanf \"%d %d \" (fun i j -> (i-1, j-1)) in\n      printf \"%s\\n\" (string_of_num (d.(x) +/ d.(y)));\n      loop (z-1)\n  in\n  loop q\n", "language": "OCaml", "metadata": {"date": 1502591065, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03634.html", "problem_id": "p03634", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03634/input.txt", "sample_output_relpath": "derived/input_output/data/p03634/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03634/OCaml/s446389825.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s446389825", "user_id": "u388783188"}, "prompt_components": {"gold_output": "3\n2\n4\n", "input_to_evaluate": "open Printf\nopen Scanf\nopen Num\n\n\nmodule Pqueue = struct\n\n  type 'a t = {mutable cnt : int; hp : 'a array; cmp : 'a -> 'a -> int}\n\n  let create n v f = {cnt = 0; hp = Array.make n v; cmp = f}\n\n  let push k pq =\n    let swap i j =\n      let t = pq.hp.(i) in\n      pq.hp.(i) <- pq.hp.(j);\n      pq.hp.(j) <- t in\n    let rec iter i =\n      let p = i / 2 in\n      if p = 0 || pq.cmp pq.hp.(p) pq.hp.(i) >= 0 then ()\n      else (swap p i; iter p)\n    in\n    pq.cnt <- pq.cnt + 1;\n    pq.hp.(pq.cnt) <- k;\n    iter (pq.cnt)\n\n  let max_heapify pq n =\n    let swap i j =\n      let t = pq.hp.(i) in\n      pq.hp.(i) <- pq.hp.(j);\n      pq.hp.(j) <- t in\n    let rec iter i =\n      let l = 2 * i in\n      let r = 2 * i + 1 in\n      let mi =\n        let ti = if l <= pq.cnt && pq.cmp pq.hp.(l) pq.hp.(i) > 0 then l else i in\n        if r <= pq.cnt && pq.cmp pq.hp.(r) pq.hp.(ti) > 0 then r else ti in\n      if mi <> i then\n        begin\n          swap mi i;\n          iter mi\n        end\n    in\n    iter n\n\n  let pop pq =\n    let ret = pq.hp.(1) in\n    pq.hp.(1) <- pq.hp.(pq.cnt);\n    pq.cnt <- pq.cnt - 1;\n    max_heapify pq 1;\n    ret\n\n  let top pq = pq.hp.(1)\n\n  let is_empty pq = pq.cnt = 0\n\n  let length pq = pq.cnt\n\nend\n\nlet id x = x\n\nlet dijkstra g n s =\n  let d = Array.make n (num_of_string \"200000000000000\") in\n  let av = Array.make n true in\n  let pq = Pqueue.create 2000000 ((num_of_int 0),0) (fun x y -> let x1 = fst x and y1 = fst y in if y1 >/ x1 then 1 else if y1 =/ x1 then 0 else (-1)) in\n  let rec loop () =\n    if Pqueue.is_empty pq then d\n    else let du, u = Pqueue.pop pq in\n         if av.(u) then begin\n             av.(u) <- false;\n             List.iter (fun (v, c) ->\n                        if du +/ c </ d.(v) then begin\n                            d.(v) <- du +/ c;\n                            Pqueue.push (d.(v), v) pq\n                          end\n                       ) g.(u);\n             loop ()\n           end\n         else loop ()\n  in\n  d.(s) <- num_of_int 0;\n  Pqueue.push (d.(s), s) pq;\n  loop ()\n\nlet () =\n  let n = scanf \"%d \" id in\n  let g = Array.make n [] in\n  let rec make_g x =\n    if x = 0 then ()\n    else\n      let a, b, c = scanf \"%d %d %s \" (fun i j k -> (i-1, j-1, num_of_string k)) in\n      g.(a) <- (b, c) :: g.(a);\n      g.(b) <- (a, c) :: g.(b);\n      make_g (x-1) in\n  make_g (n-1);\n  let q, k = scanf \"%d %d \" (fun i j -> (i, j-1)) in\n  let d = dijkstra g n k in\n  let rec loop z =\n    if z = 0 then ()\n    else\n      let x, y = scanf \"%d %d \" (fun i j -> (i-1, j-1)) in\n      printf \"%s\\n\" (string_of_num (d.(x) +/ d.(y)));\n      loop (z-1)\n  in\n  loop q\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given a tree with N vertices.\n\nHere, a tree is a kind of graph, and more specifically, a connected undirected graph with N-1 edges, where N is the number of its vertices.\n\nThe i-th edge (1≤i≤N-1) connects Vertices a_i and b_i, and has a length of c_i.\n\nYou are also given Q queries and an integer K. In the j-th query (1≤j≤Q):\n\nfind the length of the shortest path from Vertex x_j and Vertex y_j via Vertex K.\n\nConstraints\n\n3≤N≤10^5\n\n1≤a_i,b_i≤N (1≤i≤N-1)\n\n1≤c_i≤10^9 (1≤i≤N-1)\n\nThe given graph is a tree.\n\n1≤Q≤10^5\n\n1≤K≤N\n\n1≤x_j,y_j≤N (1≤j≤Q)\n\nx_j≠y_j (1≤j≤Q)\n\nx_j≠K,y_j≠K (1≤j≤Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\n:\na_{N-1} b_{N-1} c_{N-1}\nQ K\nx_1 y_1\n:\nx_{Q} y_{Q}\n\nOutput\n\nPrint the responses to the queries in Q lines.\n\nIn the j-th line j(1≤j≤Q), print the response to the j-th query.\n\nSample Input 1\n\n5\n1 2 1\n1 3 1\n2 4 1\n3 5 1\n3 1\n2 4\n2 3\n4 5\n\nSample Output 1\n\n3\n2\n4\n\nThe shortest paths for the three queries are as follows:\n\nQuery 1: Vertex 2 → Vertex 1 → Vertex 2 → Vertex 4 : Length 1+1+1=3\n\nQuery 2: Vertex 2 → Vertex 1 → Vertex 3 : Length 1+1=2\n\nQuery 3: Vertex 4 → Vertex 2 → Vertex 1 → Vertex 3 → Vertex 5 : Length 1+1+1+1=4\n\nSample Input 2\n\n7\n1 2 1\n1 3 3\n1 4 5\n1 5 7\n1 6 9\n1 7 11\n3 2\n1 3\n4 5\n6 7\n\nSample Output 2\n\n5\n14\n22\n\nThe path for each query must pass Vertex K=2.\n\nSample Input 3\n\n10\n1 2 1000000000\n2 3 1000000000\n3 4 1000000000\n4 5 1000000000\n5 6 1000000000\n6 7 1000000000\n7 8 1000000000\n8 9 1000000000\n9 10 1000000000\n1 1\n9 10\n\nSample Output 3\n\n17000000000", "sample_input": "5\n1 2 1\n1 3 1\n2 4 1\n3 5 1\n3 1\n2 4\n2 3\n4 5\n"}, "reference_outputs": ["3\n2\n4\n"], "source_document_id": "p03634", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given a tree with N vertices.\n\nHere, a tree is a kind of graph, and more specifically, a connected undirected graph with N-1 edges, where N is the number of its vertices.\n\nThe i-th edge (1≤i≤N-1) connects Vertices a_i and b_i, and has a length of c_i.\n\nYou are also given Q queries and an integer K. In the j-th query (1≤j≤Q):\n\nfind the length of the shortest path from Vertex x_j and Vertex y_j via Vertex K.\n\nConstraints\n\n3≤N≤10^5\n\n1≤a_i,b_i≤N (1≤i≤N-1)\n\n1≤c_i≤10^9 (1≤i≤N-1)\n\nThe given graph is a tree.\n\n1≤Q≤10^5\n\n1≤K≤N\n\n1≤x_j,y_j≤N (1≤j≤Q)\n\nx_j≠y_j (1≤j≤Q)\n\nx_j≠K,y_j≠K (1≤j≤Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\n:\na_{N-1} b_{N-1} c_{N-1}\nQ K\nx_1 y_1\n:\nx_{Q} y_{Q}\n\nOutput\n\nPrint the responses to the queries in Q lines.\n\nIn the j-th line j(1≤j≤Q), print the response to the j-th query.\n\nSample Input 1\n\n5\n1 2 1\n1 3 1\n2 4 1\n3 5 1\n3 1\n2 4\n2 3\n4 5\n\nSample Output 1\n\n3\n2\n4\n\nThe shortest paths for the three queries are as follows:\n\nQuery 1: Vertex 2 → Vertex 1 → Vertex 2 → Vertex 4 : Length 1+1+1=3\n\nQuery 2: Vertex 2 → Vertex 1 → Vertex 3 : Length 1+1=2\n\nQuery 3: Vertex 4 → Vertex 2 → Vertex 1 → Vertex 3 → Vertex 5 : Length 1+1+1+1=4\n\nSample Input 2\n\n7\n1 2 1\n1 3 3\n1 4 5\n1 5 7\n1 6 9\n1 7 11\n3 2\n1 3\n4 5\n6 7\n\nSample Output 2\n\n5\n14\n22\n\nThe path for each query must pass Vertex K=2.\n\nSample Input 3\n\n10\n1 2 1000000000\n2 3 1000000000\n3 4 1000000000\n4 5 1000000000\n5 6 1000000000\n6 7 1000000000\n7 8 1000000000\n8 9 1000000000\n9 10 1000000000\n1 1\n9 10\n\nSample Output 3\n\n17000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2609, "cpu_time_ms": 446, "memory_kb": 42620}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s960272240", "group_id": "codeNet:p03635", "input_text": "let solve n m = (n - 1) * (m - 1)\n\nlet read_ints () = read_line () |> Str.split (Str.regexp \" \") |> List.map int_of_string\n\nlet _ =\n  match read_ints () with\n  | [n; m] -> solve n m |> string_of_int |> print_endline\n  | _ -> ()", "language": "OCaml", "metadata": {"date": 1557252208, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s960272240.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s960272240", "user_id": "u732304692"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let solve n m = (n - 1) * (m - 1)\n\nlet read_ints () = read_line () |> Str.split (Str.regexp \" \") |> List.map int_of_string\n\nlet _ =\n  match read_ints () with\n  | [n; m] -> solve n m |> string_of_int |> print_endline\n  | _ -> ()", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn K-city, there are n streets running east-west, and m streets running north-south. Each street running east-west and each street running north-south cross each other. We will call the smallest area that is surrounded by four streets a block. How many blocks there are in K-city?\n\nConstraints\n\n2 ≤ n, m ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m\n\nOutput\n\nPrint the number of blocks in K-city.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\n6\n\nThere are six blocks, as shown below:\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n1\n\nThere are one block, as shown below:", "sample_input": "3 4\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03635", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn K-city, there are n streets running east-west, and m streets running north-south. Each street running east-west and each street running north-south cross each other. We will call the smallest area that is surrounded by four streets a block. How many blocks there are in K-city?\n\nConstraints\n\n2 ≤ n, m ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m\n\nOutput\n\nPrint the number of blocks in K-city.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\n6\n\nThere are six blocks, as shown below:\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n1\n\nThere are one block, as shown below:", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 227, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s855085761", "group_id": "codeNet:p03635", "input_text": "let () =\n  Scanf.scanf \"%d %d\" (fun n m -> (n - 1) * (m - 1))\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1521579990, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s855085761.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s855085761", "user_id": "u987869509"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d\" (fun n m -> (n - 1) * (m - 1))\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn K-city, there are n streets running east-west, and m streets running north-south. Each street running east-west and each street running north-south cross each other. We will call the smallest area that is surrounded by four streets a block. How many blocks there are in K-city?\n\nConstraints\n\n2 ≤ n, m ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m\n\nOutput\n\nPrint the number of blocks in K-city.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\n6\n\nThere are six blocks, as shown below:\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n1\n\nThere are one block, as shown below:", "sample_input": "3 4\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03635", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn K-city, there are n streets running east-west, and m streets running north-south. Each street running east-west and each street running north-south cross each other. We will call the smallest area that is surrounded by four streets a block. How many blocks there are in K-city?\n\nConstraints\n\n2 ≤ n, m ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m\n\nOutput\n\nPrint the number of blocks in K-city.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\n6\n\nThere are six blocks, as shown below:\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n1\n\nThere are one block, as shown below:", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 87, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s340242175", "group_id": "codeNet:p03635", "input_text": "let main () = Scanf.sscanf (read_line()) \"%d %d\" (fun a b -> print_int((a-1)*(b-1)));;\n\nlet _ = main()\n", "language": "OCaml", "metadata": {"date": 1502068171, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s340242175.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s340242175", "user_id": "u160759921"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let main () = Scanf.sscanf (read_line()) \"%d %d\" (fun a b -> print_int((a-1)*(b-1)));;\n\nlet _ = main()\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn K-city, there are n streets running east-west, and m streets running north-south. Each street running east-west and each street running north-south cross each other. We will call the smallest area that is surrounded by four streets a block. How many blocks there are in K-city?\n\nConstraints\n\n2 ≤ n, m ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m\n\nOutput\n\nPrint the number of blocks in K-city.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\n6\n\nThere are six blocks, as shown below:\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n1\n\nThere are one block, as shown below:", "sample_input": "3 4\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03635", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn K-city, there are n streets running east-west, and m streets running north-south. Each street running east-west and each street running north-south cross each other. We will call the smallest area that is surrounded by four streets a block. How many blocks there are in K-city?\n\nConstraints\n\n2 ≤ n, m ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m\n\nOutput\n\nPrint the number of blocks in K-city.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\n6\n\nThere are six blocks, as shown below:\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n1\n\nThere are one block, as shown below:", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 103, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s741645120", "group_id": "codeNet:p03635", "input_text": "let () =\n  let (n, m) = Scanf.scanf \"%d %d \" (fun n m -> n, m) in\n  (n - 1) * (m - 1) |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1502067717, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s741645120.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s741645120", "user_id": "u322845568"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let () =\n  let (n, m) = Scanf.scanf \"%d %d \" (fun n m -> n, m) in\n  (n - 1) * (m - 1) |> Printf.printf \"%d\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn K-city, there are n streets running east-west, and m streets running north-south. Each street running east-west and each street running north-south cross each other. We will call the smallest area that is surrounded by four streets a block. How many blocks there are in K-city?\n\nConstraints\n\n2 ≤ n, m ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m\n\nOutput\n\nPrint the number of blocks in K-city.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\n6\n\nThere are six blocks, as shown below:\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n1\n\nThere are one block, as shown below:", "sample_input": "3 4\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03635", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn K-city, there are n streets running east-west, and m streets running north-south. Each street running east-west and each street running north-south cross each other. We will call the smallest area that is surrounded by four streets a block. How many blocks there are in K-city?\n\nConstraints\n\n2 ≤ n, m ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m\n\nOutput\n\nPrint the number of blocks in K-city.\n\nSample Input 1\n\n3 4\n\nSample Output 1\n\n6\n\nThere are six blocks, as shown below:\n\nSample Input 2\n\n2 2\n\nSample Output 2\n\n1\n\nThere are one block, as shown below:", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 109, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s130645332", "group_id": "codeNet:p03636", "input_text": "let () =\n  let s = read_line () in\n  Printf.printf \"%c%d%c\\n\" s.[0] (String.length s - 2) s.[String.length s - 1]\n", "language": "OCaml", "metadata": {"date": 1530677081, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03636.html", "problem_id": "p03636", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03636/input.txt", "sample_output_relpath": "derived/input_output/data/p03636/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03636/OCaml/s130645332.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s130645332", "user_id": "u504158101"}, "prompt_components": {"gold_output": "i18n\n", "input_to_evaluate": "let () =\n  let s = read_line () in\n  Printf.printf \"%c%d%c\\n\" s.[0] (String.length s - 2) s.[String.length s - 1]\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThe word internationalization is sometimes abbreviated to i18n.\nThis comes from the fact that there are 18 letters between the first i and the last n.\n\nYou are given a string s of length at least 3 consisting of lowercase English letters.\nAbbreviate s in the same way.\n\nConstraints\n\n3 ≤ |s| ≤ 100 (|s| denotes the length of s.)\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the abbreviation of s.\n\nSample Input 1\n\ninternationalization\n\nSample Output 1\n\ni18n\n\nSample Input 2\n\nsmiles\n\nSample Output 2\n\ns4s\n\nSample Input 3\n\nxyz\n\nSample Output 3\n\nx1z", "sample_input": "internationalization\n"}, "reference_outputs": ["i18n\n"], "source_document_id": "p03636", "source_text": "Score : 200 points\n\nProblem Statement\n\nThe word internationalization is sometimes abbreviated to i18n.\nThis comes from the fact that there are 18 letters between the first i and the last n.\n\nYou are given a string s of length at least 3 consisting of lowercase English letters.\nAbbreviate s in the same way.\n\nConstraints\n\n3 ≤ |s| ≤ 100 (|s| denotes the length of s.)\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the abbreviation of s.\n\nSample Input 1\n\ninternationalization\n\nSample Output 1\n\ni18n\n\nSample Input 2\n\nsmiles\n\nSample Output 2\n\ns4s\n\nSample Input 3\n\nxyz\n\nSample Output 3\n\nx1z", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 114, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s569824360", "group_id": "codeNet:p03636", "input_text": "let f s =\n  let len = String.length s in\n  Printf.sprintf \"%c%d%c\" s.[0] (len - 2) s.[len-1]\n\nlet () = f (read_line ()) |> print_endline", "language": "OCaml", "metadata": {"date": 1524537151, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03636.html", "problem_id": "p03636", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03636/input.txt", "sample_output_relpath": "derived/input_output/data/p03636/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03636/OCaml/s569824360.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s569824360", "user_id": "u987869509"}, "prompt_components": {"gold_output": "i18n\n", "input_to_evaluate": "let f s =\n  let len = String.length s in\n  Printf.sprintf \"%c%d%c\" s.[0] (len - 2) s.[len-1]\n\nlet () = f (read_line ()) |> print_endline", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThe word internationalization is sometimes abbreviated to i18n.\nThis comes from the fact that there are 18 letters between the first i and the last n.\n\nYou are given a string s of length at least 3 consisting of lowercase English letters.\nAbbreviate s in the same way.\n\nConstraints\n\n3 ≤ |s| ≤ 100 (|s| denotes the length of s.)\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the abbreviation of s.\n\nSample Input 1\n\ninternationalization\n\nSample Output 1\n\ni18n\n\nSample Input 2\n\nsmiles\n\nSample Output 2\n\ns4s\n\nSample Input 3\n\nxyz\n\nSample Output 3\n\nx1z", "sample_input": "internationalization\n"}, "reference_outputs": ["i18n\n"], "source_document_id": "p03636", "source_text": "Score : 200 points\n\nProblem Statement\n\nThe word internationalization is sometimes abbreviated to i18n.\nThis comes from the fact that there are 18 letters between the first i and the last n.\n\nYou are given a string s of length at least 3 consisting of lowercase English letters.\nAbbreviate s in the same way.\n\nConstraints\n\n3 ≤ |s| ≤ 100 (|s| denotes the length of s.)\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the abbreviation of s.\n\nSample Input 1\n\ninternationalization\n\nSample Output 1\n\ni18n\n\nSample Input 2\n\nsmiles\n\nSample Output 2\n\ns4s\n\nSample Input 3\n\nxyz\n\nSample Output 3\n\nx1z", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 136, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s363599299", "group_id": "codeNet:p03637", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ = Array.to_list @@ Array.init n @@ fun _ ->\n    Scanf.scanf \"%d \" @@ fun a -> a in\n  print_endline @@\n    if\n      List.for_all (fun a -> a mod 2 = 0) as_ ||\n      List.length (List.filter (fun a -> a mod 2 = 1) as_)\n      <= 2 * List.length (List.filter (fun a -> a mod 4 = 0) as_) - 1\n    then \"Yes\"\n    else \"No\"\n\n", "language": "OCaml", "metadata": {"date": 1531702671, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s363599299.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s363599299", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let as_ = Array.to_list @@ Array.init n @@ fun _ ->\n    Scanf.scanf \"%d \" @@ fun a -> a in\n  print_endline @@\n    if\n      List.for_all (fun a -> a mod 2 = 0) as_ ||\n      List.length (List.filter (fun a -> a mod 2 = 1) as_)\n      <= 2 * List.length (List.filter (fun a -> a mod 4 = 0) as_) - 1\n    then \"Yes\"\n    else \"No\"\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a sequence of length N, a = (a_1, a_2, ..., a_N).\nEach a_i is a positive integer.\n\nSnuke's objective is to permute the element in a so that the following condition is satisfied:\n\nFor each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.\n\nDetermine whether Snuke can achieve his objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf Snuke can achieve his objective, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 10 100\n\nSample Output 1\n\nYes\n\nOne solution is (1, 100, 10).\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\nNo\n\nIt is impossible to permute a so that the condition is satisfied.\n\nSample Input 3\n\n3\n1 4 1\n\nSample Output 3\n\nYes\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n6\n2 7 1 8 2 8\n\nSample Output 5\n\nYes", "sample_input": "3\n1 10 100\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03637", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a sequence of length N, a = (a_1, a_2, ..., a_N).\nEach a_i is a positive integer.\n\nSnuke's objective is to permute the element in a so that the following condition is satisfied:\n\nFor each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.\n\nDetermine whether Snuke can achieve his objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf Snuke can achieve his objective, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 10 100\n\nSample Output 1\n\nYes\n\nOne solution is (1, 100, 10).\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\nNo\n\nIt is impossible to permute a so that the condition is satisfied.\n\nSample Input 3\n\n3\n1 4 1\n\nSample Output 3\n\nYes\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n6\n2 7 1 8 2 8\n\nSample Output 5\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 367, "cpu_time_ms": 41, "memory_kb": 7936}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s341643320", "group_id": "codeNet:p03637", "input_text": "open Scanf\nopen Printf\nopen String;;\n\n(* sscanf (read_line ()) \"%d %d\" \n   (fun x y -> printf \"%d\" ((x-1)*(y-1)));; *)\n\n\n\n(* let abb s = (sub s 0 1) \n            ^ (string_of_int (length s - 2))\n            ^ (sub s (length s - 1) 1);;\n\nsscanf (read_line ()) \"%s\"\n          (fun s -> printf \"%s\" (abb s));; *)\n\nlet judge l =\n  let len = List.length l in\n  let f l = List.fold_left \n              (fun (x,l') y -> if y mod 4==0 then (x+1,l') else (x,y::l')) (0,[]) l in\n  let g l = List.fold_left (fun x y -> x + if y mod 2!=0 then 1 else 0) 0 l in\n  let (four, fourl) = f l in\n  if four >= len/2 then true else\n    if g fourl <= four then true else false\n\nlet usage n = \n  let list = ref [] in\n  for i = 1 to n do\n    list := (scanf (if i < n then \"%d \" else \"%d\") (fun x -> x))::!list\n  done; !list;;\n\nsscanf (read_line ()) \"%d\" \n   (fun x -> printf \"%s\" (if judge (usage x) then \"Yes\" else \"No\"));;\n\n", "language": "OCaml", "metadata": {"date": 1502157607, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s341643320.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s341643320", "user_id": "u470717435"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "open Scanf\nopen Printf\nopen String;;\n\n(* sscanf (read_line ()) \"%d %d\" \n   (fun x y -> printf \"%d\" ((x-1)*(y-1)));; *)\n\n\n\n(* let abb s = (sub s 0 1) \n            ^ (string_of_int (length s - 2))\n            ^ (sub s (length s - 1) 1);;\n\nsscanf (read_line ()) \"%s\"\n          (fun s -> printf \"%s\" (abb s));; *)\n\nlet judge l =\n  let len = List.length l in\n  let f l = List.fold_left \n              (fun (x,l') y -> if y mod 4==0 then (x+1,l') else (x,y::l')) (0,[]) l in\n  let g l = List.fold_left (fun x y -> x + if y mod 2!=0 then 1 else 0) 0 l in\n  let (four, fourl) = f l in\n  if four >= len/2 then true else\n    if g fourl <= four then true else false\n\nlet usage n = \n  let list = ref [] in\n  for i = 1 to n do\n    list := (scanf (if i < n then \"%d \" else \"%d\") (fun x -> x))::!list\n  done; !list;;\n\nsscanf (read_line ()) \"%d\" \n   (fun x -> printf \"%s\" (if judge (usage x) then \"Yes\" else \"No\"));;\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a sequence of length N, a = (a_1, a_2, ..., a_N).\nEach a_i is a positive integer.\n\nSnuke's objective is to permute the element in a so that the following condition is satisfied:\n\nFor each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.\n\nDetermine whether Snuke can achieve his objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf Snuke can achieve his objective, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 10 100\n\nSample Output 1\n\nYes\n\nOne solution is (1, 100, 10).\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\nNo\n\nIt is impossible to permute a so that the condition is satisfied.\n\nSample Input 3\n\n3\n1 4 1\n\nSample Output 3\n\nYes\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n6\n2 7 1 8 2 8\n\nSample Output 5\n\nYes", "sample_input": "3\n1 10 100\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03637", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a sequence of length N, a = (a_1, a_2, ..., a_N).\nEach a_i is a positive integer.\n\nSnuke's objective is to permute the element in a so that the following condition is satisfied:\n\nFor each 1 ≤ i ≤ N - 1, the product of a_i and a_{i + 1} is a multiple of 4.\n\nDetermine whether Snuke can achieve his objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf Snuke can achieve his objective, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 10 100\n\nSample Output 1\n\nYes\n\nOne solution is (1, 100, 10).\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\nNo\n\nIt is impossible to permute a so that the condition is satisfied.\n\nSample Input 3\n\n3\n1 4 1\n\nSample Output 3\n\nYes\n\nThe condition is already satisfied initially.\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n6\n2 7 1 8 2 8\n\nSample Output 5\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 41, "memory_kb": 6656}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s319152966", "group_id": "codeNet:p03637", "input_text": "let () =\n  let n = Scanf.scanf \"%d \" (fun n -> n) in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  let (e, o) = Array.fold_left (fun (x, y) e -> if e mod 2 = 0 then (x + 1, y) else (x, y + 1)) (0, 0) a in\n  print_endline (if e = 0 || e - 2 <= o then \"No\" else \"Yes\")", "language": "OCaml", "metadata": {"date": 1502069511, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s319152966.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s319152966", "user_id": "u322845568"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n  let n = Scanf.scanf \"%d \" (fun n -> n) in\n  let a = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun i -> i)) in\n  let (e, o) = Array.fold_left (fun (x, y) e -> if e mod 2 = 0 then (x + 1, y) else (x, y + 1)) (0, 0) a in\n  print_endline (if e = 0 || e - 2 <= o then \"No\" else \"Yes\")", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 32, "memory_kb": 5248}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s457508357", "group_id": "codeNet:p03638", "input_text": "let ans, c, h, w, a_s = Scanf.(scanf \"%d %d %d\" @@ fun h w n -> Array.(make_matrix h w 0, ref 0, h, w, init n @@ fun _ -> scanf \" %d\" (+) 0))\nlet rec f i = if a_s.(i) = 0 then f (i + 1) else (a_s.(i) <- a_s.(i) - 1; i)\nlet _ = for i = 0 to h - 1 do for j = 0 to w - 1 do c := f !c; ans.(i).(if i mod 2 = 1 then w - 1 - j else j) <- !c + 1 done done; Array.(iter (fun cs -> to_list cs |> List.map string_of_int |> String.concat \" \" |> print_endline) ans)", "language": "OCaml", "metadata": {"date": 1578420398, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s457508357.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s457508357", "user_id": "u732304692"}, "prompt_components": {"gold_output": "1 1\n2 3\n", "input_to_evaluate": "let ans, c, h, w, a_s = Scanf.(scanf \"%d %d %d\" @@ fun h w n -> Array.(make_matrix h w 0, ref 0, h, w, init n @@ fun _ -> scanf \" %d\" (+) 0))\nlet rec f i = if a_s.(i) = 0 then f (i + 1) else (a_s.(i) <- a_s.(i) - 1; i)\nlet _ = for i = 0 to h - 1 do for j = 0 to w - 1 do c := f !c; ans.(i).(if i mod 2 = 1 then w - 1 - j else j) <- !c + 1 done done; Array.(iter (fun cs -> to_list cs |> List.map string_of_int |> String.concat \" \" |> print_endline) ans)", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 453, "cpu_time_ms": 6, "memory_kb": 2688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s510405379", "group_id": "codeNet:p03640", "input_text": "let rec foldn f a = function\n  | 0 -> a\n  | n -> foldn f (f a) (n - 1)\n\nlet () =\n  let h, w = Scanf.scanf \"%d %d\\n\" (fun h w -> h, w) in\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let as_ = Array.init n (fun i -> Scanf.scanf \"%d \" (fun a -> (i + 1, a))) in\n  Array.fold_left (fun (acc, current, current_sum) (i, a) ->\n    let c = Char.chr (i + Char.code '0') in\n    if w <= current_sum + a then\n      foldn (fun xs -> [String.make w c] :: xs)\n        ((String.make (w - current_sum) c :: current) :: acc)\n        ((current_sum + a) / w - 1), [String.make ((current_sum + a - w) mod w) c], (current_sum + a - w) mod w\n    else (acc, String.make a c :: current, a + current_sum)) ([], [], 0) as_\n  |> (fun (acc, _, _) -> acc)\n  |> List.fold_left (fun (acc, b) a -> ((if b then List.rev a else a) :: acc, not b)) ([], true)\n  |> fst\n  |> List.map (String.concat \"\")\n  |> List.iter print_endline", "language": "OCaml", "metadata": {"date": 1510469825, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03640.html", "problem_id": "p03640", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03640/input.txt", "sample_output_relpath": "derived/input_output/data/p03640/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03640/OCaml/s510405379.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s510405379", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1 1\n2 3\n", "input_to_evaluate": "let rec foldn f a = function\n  | 0 -> a\n  | n -> foldn f (f a) (n - 1)\n\nlet () =\n  let h, w = Scanf.scanf \"%d %d\\n\" (fun h w -> h, w) in\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let as_ = Array.init n (fun i -> Scanf.scanf \"%d \" (fun a -> (i + 1, a))) in\n  Array.fold_left (fun (acc, current, current_sum) (i, a) ->\n    let c = Char.chr (i + Char.code '0') in\n    if w <= current_sum + a then\n      foldn (fun xs -> [String.make w c] :: xs)\n        ((String.make (w - current_sum) c :: current) :: acc)\n        ((current_sum + a) / w - 1), [String.make ((current_sum + a - w) mod w) c], (current_sum + a - w) mod w\n    else (acc, String.make a c :: current, a + current_sum)) ([], [], 0) as_\n  |> (fun (acc, _, _) -> acc)\n  |> List.fold_left (fun (acc, b) a -> ((if b then List.rev a else a) :: acc, not b)) ([], true)\n  |> fst\n  |> List.map (String.concat \"\")\n  |> List.iter print_endline", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns of squares.\nSnuke is painting these squares in colors 1, 2, ..., N.\nHere, the following conditions should be satisfied:\n\nFor each i (1 ≤ i ≤ N), there are exactly a_i squares painted in Color i. Here, a_1 + a_2 + ... + a_N = H W.\n\nFor each i (1 ≤ i ≤ N), the squares painted in Color i are 4-connected. That is, every square painted in Color i can be reached from every square painted in Color i by repeatedly traveling to a horizontally or vertically adjacent square painted in Color i.\n\nFind a way to paint the squares so that the conditions are satisfied.\nIt can be shown that a solution always exists.\n\nConstraints\n\n1 ≤ H, W ≤ 100\n\n1 ≤ N ≤ H W\n\na_i ≥ 1\n\na_1 + a_2 + ... + a_N = H W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint one way to paint the squares that satisfies the conditions.\nOutput in the following format:\n\nc_{1 1} ... c_{1 W}\n:\nc_{H 1} ... c_{H W}\n\nHere, c_{i j} is the color of the square at the i-th row from the top and j-th column from the left.\n\nSample Input 1\n\n2 2\n3\n2 1 1\n\nSample Output 1\n\n1 1\n2 3\n\nBelow is an example of an invalid solution:\n\n1 2\n3 1\n\nThis is because the squares painted in Color 1 are not 4-connected.\n\nSample Input 2\n\n3 5\n5\n1 2 3 4 5\n\nSample Output 2\n\n1 4 4 4 3\n2 5 4 5 3\n2 5 5 5 3\n\nSample Input 3\n\n1 1\n1\n1\n\nSample Output 3\n\n1", "sample_input": "2 2\n3\n2 1 1\n"}, "reference_outputs": ["1 1\n2 3\n"], "source_document_id": "p03640", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns of squares.\nSnuke is painting these squares in colors 1, 2, ..., N.\nHere, the following conditions should be satisfied:\n\nFor each i (1 ≤ i ≤ N), there are exactly a_i squares painted in Color i. Here, a_1 + a_2 + ... + a_N = H W.\n\nFor each i (1 ≤ i ≤ N), the squares painted in Color i are 4-connected. That is, every square painted in Color i can be reached from every square painted in Color i by repeatedly traveling to a horizontally or vertically adjacent square painted in Color i.\n\nFind a way to paint the squares so that the conditions are satisfied.\nIt can be shown that a solution always exists.\n\nConstraints\n\n1 ≤ H, W ≤ 100\n\n1 ≤ N ≤ H W\n\na_i ≥ 1\n\na_1 + a_2 + ... + a_N = H W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint one way to paint the squares that satisfies the conditions.\nOutput in the following format:\n\nc_{1 1} ... c_{1 W}\n:\nc_{H 1} ... c_{H W}\n\nHere, c_{i j} is the color of the square at the i-th row from the top and j-th column from the left.\n\nSample Input 1\n\n2 2\n3\n2 1 1\n\nSample Output 1\n\n1 1\n2 3\n\nBelow is an example of an invalid solution:\n\n1 2\n3 1\n\nThis is because the squares painted in Color 1 are not 4-connected.\n\nSample Input 2\n\n3 5\n5\n1 2 3 4 5\n\nSample Output 2\n\n1 4 4 4 3\n2 5 4 5 3\n2 5 5 5 3\n\nSample Input 3\n\n1 1\n1\n1\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 895, "cpu_time_ms": 4, "memory_kb": 2944}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s718548612", "group_id": "codeNet:p03643", "input_text": "let () = print_endline (\"ABC\" ^ (read_line ()))", "language": "OCaml", "metadata": {"date": 1590111774, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s718548612.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s718548612", "user_id": "u173515518"}, "prompt_components": {"gold_output": "ABC100\n", "input_to_evaluate": "let () = print_endline (\"ABC\" ^ (read_line ()))", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 47, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s068761385", "group_id": "codeNet:p03643", "input_text": "let id x = x\nlet n = Scanf.scanf \"%d\\n\" id\n\nlet () =\n  Printf.printf \"ABC%d\\n\" n\n", "language": "OCaml", "metadata": {"date": 1501376541, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s068761385.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s068761385", "user_id": "u735499035"}, "prompt_components": {"gold_output": "ABC100\n", "input_to_evaluate": "let id x = x\nlet n = Scanf.scanf \"%d\\n\" id\n\nlet () =\n  Printf.printf \"ABC%d\\n\" n\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s830320262", "group_id": "codeNet:p03644", "input_text": "let n = read_int ()\nlet m = ref (0, 1)\nlet rec f n = if n mod 2 <> 0 then 0 else 1 + f (n / 2)\nlet _ = for i = 1 to n do m := max !m @@ (f i, i) done; Printf.printf \"%d\\n\" @@ snd !m", "language": "OCaml", "metadata": {"date": 1569205377, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s830320262.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s830320262", "user_id": "u732304692"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let n = read_int ()\nlet m = ref (0, 1)\nlet rec f n = if n mod 2 <> 0 then 0 else 1 + f (n / 2)\nlet _ = for i = 1 to n do m := max !m @@ (f i, i) done; Printf.printf \"%d\\n\" @@ snd !m", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves numbers divisible by 2.\n\nYou are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times. The solution is always unique.\n\nHere, the number of times an integer can be divisible by 2, is how many times the integer can be divided by 2 without remainder.\n\nFor example,\n\n6 can be divided by 2 once: 6 -> 3.\n\n8 can be divided by 2 three times: 8 -> 4 -> 2 -> 1.\n\n3 can be divided by 2 zero times.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n4\n\n4 can be divided by 2 twice, which is the most number of times among 1, 2, ..., 7.\n\nSample Input 2\n\n32\n\nSample Output 2\n\n32\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1\n\nSample Input 4\n\n100\n\nSample Output 4\n\n64", "sample_input": "7\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03644", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves numbers divisible by 2.\n\nYou are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times. The solution is always unique.\n\nHere, the number of times an integer can be divisible by 2, is how many times the integer can be divided by 2 without remainder.\n\nFor example,\n\n6 can be divided by 2 once: 6 -> 3.\n\n8 can be divided by 2 three times: 8 -> 4 -> 2 -> 1.\n\n3 can be divided by 2 zero times.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n4\n\n4 can be divided by 2 twice, which is the most number of times among 1, 2, ..., 7.\n\nSample Input 2\n\n32\n\nSample Output 2\n\n32\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1\n\nSample Input 4\n\n100\n\nSample Output 4\n\n64", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 181, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s348365927", "group_id": "codeNet:p03644", "input_text": "let () = Scanf.scanf \"%d\" @@ fun n ->\n  let n = n lor (n lsr 1) in\n  let n = n lor (n lsr 2) in\n  let n = n lor (n lsr 4) in\n  let n = n lor (n lsr 8) in\n  let n = n lor (n lsr 16) in\n  let n = (n land 0x55555555) + ((n lsr 1) land 0x55555555) in\n  let n = (n land 0x33333333) + ((n lsr 2) land 0x33333333) in\n  let n = (n land 0x0f0f0f0f) + ((n lsr 4) land 0x0f0f0f0f) in\n  let n = (n land 0x00ff00ff) + ((n lsr 8) land 0x00ff00ff) in\n  let n = (n land 0x0000ffff) + ((n lsr 16) land 0x0000ffff) in\n  Printf.printf \"%d\\n\" @@ 1 lsl (n - 1)\n", "language": "OCaml", "metadata": {"date": 1530676714, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s348365927.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s348365927", "user_id": "u504158101"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\" @@ fun n ->\n  let n = n lor (n lsr 1) in\n  let n = n lor (n lsr 2) in\n  let n = n lor (n lsr 4) in\n  let n = n lor (n lsr 8) in\n  let n = n lor (n lsr 16) in\n  let n = (n land 0x55555555) + ((n lsr 1) land 0x55555555) in\n  let n = (n land 0x33333333) + ((n lsr 2) land 0x33333333) in\n  let n = (n land 0x0f0f0f0f) + ((n lsr 4) land 0x0f0f0f0f) in\n  let n = (n land 0x00ff00ff) + ((n lsr 8) land 0x00ff00ff) in\n  let n = (n land 0x0000ffff) + ((n lsr 16) land 0x0000ffff) in\n  Printf.printf \"%d\\n\" @@ 1 lsl (n - 1)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves numbers divisible by 2.\n\nYou are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times. The solution is always unique.\n\nHere, the number of times an integer can be divisible by 2, is how many times the integer can be divided by 2 without remainder.\n\nFor example,\n\n6 can be divided by 2 once: 6 -> 3.\n\n8 can be divided by 2 three times: 8 -> 4 -> 2 -> 1.\n\n3 can be divided by 2 zero times.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n4\n\n4 can be divided by 2 twice, which is the most number of times among 1, 2, ..., 7.\n\nSample Input 2\n\n32\n\nSample Output 2\n\n32\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1\n\nSample Input 4\n\n100\n\nSample Output 4\n\n64", "sample_input": "7\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03644", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves numbers divisible by 2.\n\nYou are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times. The solution is always unique.\n\nHere, the number of times an integer can be divisible by 2, is how many times the integer can be divided by 2 without remainder.\n\nFor example,\n\n6 can be divided by 2 once: 6 -> 3.\n\n8 can be divided by 2 three times: 8 -> 4 -> 2 -> 1.\n\n3 can be divided by 2 zero times.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n4\n\n4 can be divided by 2 twice, which is the most number of times among 1, 2, ..., 7.\n\nSample Input 2\n\n32\n\nSample Output 2\n\n32\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1\n\nSample Input 4\n\n100\n\nSample Output 4\n\n64", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 540, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s537328828", "group_id": "codeNet:p03644", "input_text": "open Batteries\nopen Printf\nlet () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n\n  let l = [1;2;4;8;16;32;64] in\n  let ans = \n    List.filter (fun x -> x <= n) l |>\n    List.max\n  in\n\n  Printf.printf \"%d\\n\" ans\n", "language": "OCaml", "metadata": {"date": 1529319621, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s537328828.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s537328828", "user_id": "u139013163"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "open Batteries\nopen Printf\nlet () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n\n  let l = [1;2;4;8;16;32;64] in\n  let ans = \n    List.filter (fun x -> x <= n) l |>\n    List.max\n  in\n\n  Printf.printf \"%d\\n\" ans\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves numbers divisible by 2.\n\nYou are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times. The solution is always unique.\n\nHere, the number of times an integer can be divisible by 2, is how many times the integer can be divided by 2 without remainder.\n\nFor example,\n\n6 can be divided by 2 once: 6 -> 3.\n\n8 can be divided by 2 three times: 8 -> 4 -> 2 -> 1.\n\n3 can be divided by 2 zero times.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n4\n\n4 can be divided by 2 twice, which is the most number of times among 1, 2, ..., 7.\n\nSample Input 2\n\n32\n\nSample Output 2\n\n32\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1\n\nSample Input 4\n\n100\n\nSample Output 4\n\n64", "sample_input": "7\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03644", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves numbers divisible by 2.\n\nYou are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times. The solution is always unique.\n\nHere, the number of times an integer can be divisible by 2, is how many times the integer can be divided by 2 without remainder.\n\nFor example,\n\n6 can be divided by 2 once: 6 -> 3.\n\n8 can be divided by 2 three times: 8 -> 4 -> 2 -> 1.\n\n3 can be divided by 2 zero times.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n4\n\n4 can be divided by 2 twice, which is the most number of times among 1, 2, ..., 7.\n\nSample Input 2\n\n32\n\nSample Output 2\n\n32\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1\n\nSample Input 4\n\n100\n\nSample Output 4\n\n64", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 211, "cpu_time_ms": 2, "memory_kb": 3072}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s905171660", "group_id": "codeNet:p03645", "input_text": "let n, m = Scanf.scanf \"%d %d\\n\" (fun n m -> (n, m))\n\nlet hash = Hashtbl.create m\n\nlet rec init_hash m =\n  if m = 0 then ()\n  else\n    let a, b = Scanf.scanf \"%d %d\\n\" (fun a b -> (a, b)) in\n    let ls = b :: (try Hashtbl.find hash a with Not_found -> []) in\n    Hashtbl.replace hash a ls ;\n    init_hash (m - 1)\n\n\nlet rec iter_search = function\n  | [] -> \"IMPOSSIBLE\"\n  | from_first :: rest ->\n    let to_n = (try Hashtbl.find hash from_first with Not_found -> []) in \n    if List.exists (( = ) n)  to_n then \"POSSIBLE\"\n    else iter_search rest\n\n\nlet () =\n  let () = init_hash m in\n  Hashtbl.find hash 1 |> iter_search |> Printf.printf \"%s\\n\"", "language": "OCaml", "metadata": {"date": 1521632893, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03645.html", "problem_id": "p03645", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03645/input.txt", "sample_output_relpath": "derived/input_output/data/p03645/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03645/OCaml/s905171660.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s905171660", "user_id": "u987869509"}, "prompt_components": {"gold_output": "POSSIBLE\n", "input_to_evaluate": "let n, m = Scanf.scanf \"%d %d\\n\" (fun n m -> (n, m))\n\nlet hash = Hashtbl.create m\n\nlet rec init_hash m =\n  if m = 0 then ()\n  else\n    let a, b = Scanf.scanf \"%d %d\\n\" (fun a b -> (a, b)) in\n    let ls = b :: (try Hashtbl.find hash a with Not_found -> []) in\n    Hashtbl.replace hash a ls ;\n    init_hash (m - 1)\n\n\nlet rec iter_search = function\n  | [] -> \"IMPOSSIBLE\"\n  | from_first :: rest ->\n    let to_n = (try Hashtbl.find hash from_first with Not_found -> []) in \n    if List.exists (( = ) n)  to_n then \"POSSIBLE\"\n    else iter_search rest\n\n\nlet () =\n  let () = init_hash m in\n  Hashtbl.find hash 1 |> iter_search |> Printf.printf \"%s\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIn Takahashi Kingdom, there is an archipelago of N islands, called Takahashi Islands.\nFor convenience, we will call them Island 1, Island 2, ..., Island N.\n\nThere are M kinds of regular boat services between these islands.\nEach service connects two islands. The i-th service connects Island a_i and Island b_i.\n\nCat Snuke is on Island 1 now, and wants to go to Island N.\nHowever, it turned out that there is no boat service from Island 1 to Island N, so he wants to know whether it is possible to go to Island N by using two boat services.\n\nHelp him.\n\nConstraints\n\n3 ≤ N ≤ 200 000\n\n1 ≤ M ≤ 200 000\n\n1 ≤ a_i < b_i ≤ N\n\n(a_i, b_i) \\neq (1, N)\n\nIf i \\neq j, (a_i, b_i) \\neq (a_j, b_j).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nOutput\n\nIf it is possible to go to Island N by using two boat services, print POSSIBLE; otherwise, print IMPOSSIBLE.\n\nSample Input 1\n\n3 2\n1 2\n2 3\n\nSample Output 1\n\nPOSSIBLE\n\nSample Input 2\n\n4 3\n1 2\n2 3\n3 4\n\nSample Output 2\n\nIMPOSSIBLE\n\nYou have to use three boat services to get to Island 4.\n\nSample Input 3\n\n100000 1\n1 99999\n\nSample Output 3\n\nIMPOSSIBLE\n\nSample Input 4\n\n5 5\n1 3\n4 5\n2 3\n2 4\n1 4\n\nSample Output 4\n\nPOSSIBLE\n\nYou can get to Island 5 by using two boat services: Island 1 -> Island 4 -> Island 5.", "sample_input": "3 2\n1 2\n2 3\n"}, "reference_outputs": ["POSSIBLE\n"], "source_document_id": "p03645", "source_text": "Score : 300 points\n\nProblem Statement\n\nIn Takahashi Kingdom, there is an archipelago of N islands, called Takahashi Islands.\nFor convenience, we will call them Island 1, Island 2, ..., Island N.\n\nThere are M kinds of regular boat services between these islands.\nEach service connects two islands. The i-th service connects Island a_i and Island b_i.\n\nCat Snuke is on Island 1 now, and wants to go to Island N.\nHowever, it turned out that there is no boat service from Island 1 to Island N, so he wants to know whether it is possible to go to Island N by using two boat services.\n\nHelp him.\n\nConstraints\n\n3 ≤ N ≤ 200 000\n\n1 ≤ M ≤ 200 000\n\n1 ≤ a_i < b_i ≤ N\n\n(a_i, b_i) \\neq (1, N)\n\nIf i \\neq j, (a_i, b_i) \\neq (a_j, b_j).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nOutput\n\nIf it is possible to go to Island N by using two boat services, print POSSIBLE; otherwise, print IMPOSSIBLE.\n\nSample Input 1\n\n3 2\n1 2\n2 3\n\nSample Output 1\n\nPOSSIBLE\n\nSample Input 2\n\n4 3\n1 2\n2 3\n3 4\n\nSample Output 2\n\nIMPOSSIBLE\n\nYou have to use three boat services to get to Island 4.\n\nSample Input 3\n\n100000 1\n1 99999\n\nSample Output 3\n\nIMPOSSIBLE\n\nSample Input 4\n\n5 5\n1 3\n4 5\n2 3\n2 4\n1 4\n\nSample Output 4\n\nPOSSIBLE\n\nYou can get to Island 5 by using two boat services: Island 1 -> Island 4 -> Island 5.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 644, "cpu_time_ms": 153, "memory_kb": 15232}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s639146899", "group_id": "codeNet:p03647", "input_text": "module IntSet = Set.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet () =\n  let n, m = Scanf.scanf \"%d %d\\n\" (fun n m -> n, m) in\n  let abs = Array.init m (fun _ -> Scanf.scanf \"%d %d\\n\" (fun a b -> a, b)) in\n  let e = Array.make n IntSet.empty in\n  Array.iter (fun (a, b) ->\n    e.(a - 1) <- IntSet.add (b - 1) e.(a - 1);\n    e.(b - 1) <- IntSet.add (a - 1) e.(b - 1)) abs;\n  if IntSet.is_empty (IntSet.inter e.(0) e.(n - 1)) then\n    print_endline \"IMPOSSIBLE\"\n  else\n    print_endline \"POSSIBLE\"", "language": "OCaml", "metadata": {"date": 1501376796, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03647.html", "problem_id": "p03647", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03647/input.txt", "sample_output_relpath": "derived/input_output/data/p03647/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03647/OCaml/s639146899.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s639146899", "user_id": "u504158101"}, "prompt_components": {"gold_output": "POSSIBLE\n", "input_to_evaluate": "module IntSet = Set.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet () =\n  let n, m = Scanf.scanf \"%d %d\\n\" (fun n m -> n, m) in\n  let abs = Array.init m (fun _ -> Scanf.scanf \"%d %d\\n\" (fun a b -> a, b)) in\n  let e = Array.make n IntSet.empty in\n  Array.iter (fun (a, b) ->\n    e.(a - 1) <- IntSet.add (b - 1) e.(a - 1);\n    e.(b - 1) <- IntSet.add (a - 1) e.(b - 1)) abs;\n  if IntSet.is_empty (IntSet.inter e.(0) e.(n - 1)) then\n    print_endline \"IMPOSSIBLE\"\n  else\n    print_endline \"POSSIBLE\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIn Takahashi Kingdom, there is an archipelago of N islands, called Takahashi Islands.\nFor convenience, we will call them Island 1, Island 2, ..., Island N.\n\nThere are M kinds of regular boat services between these islands.\nEach service connects two islands. The i-th service connects Island a_i and Island b_i.\n\nCat Snuke is on Island 1 now, and wants to go to Island N.\nHowever, it turned out that there is no boat service from Island 1 to Island N, so he wants to know whether it is possible to go to Island N by using two boat services.\n\nHelp him.\n\nConstraints\n\n3 ≤ N ≤ 200 000\n\n1 ≤ M ≤ 200 000\n\n1 ≤ a_i < b_i ≤ N\n\n(a_i, b_i) \\neq (1, N)\n\nIf i \\neq j, (a_i, b_i) \\neq (a_j, b_j).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nOutput\n\nIf it is possible to go to Island N by using two boat services, print POSSIBLE; otherwise, print IMPOSSIBLE.\n\nSample Input 1\n\n3 2\n1 2\n2 3\n\nSample Output 1\n\nPOSSIBLE\n\nSample Input 2\n\n4 3\n1 2\n2 3\n3 4\n\nSample Output 2\n\nIMPOSSIBLE\n\nYou have to use three boat services to get to Island 4.\n\nSample Input 3\n\n100000 1\n1 99999\n\nSample Output 3\n\nIMPOSSIBLE\n\nSample Input 4\n\n5 5\n1 3\n4 5\n2 3\n2 4\n1 4\n\nSample Output 4\n\nPOSSIBLE\n\nYou can get to Island 5 by using two boat services: Island 1 -> Island 4 -> Island 5.", "sample_input": "3 2\n1 2\n2 3\n"}, "reference_outputs": ["POSSIBLE\n"], "source_document_id": "p03647", "source_text": "Score : 300 points\n\nProblem Statement\n\nIn Takahashi Kingdom, there is an archipelago of N islands, called Takahashi Islands.\nFor convenience, we will call them Island 1, Island 2, ..., Island N.\n\nThere are M kinds of regular boat services between these islands.\nEach service connects two islands. The i-th service connects Island a_i and Island b_i.\n\nCat Snuke is on Island 1 now, and wants to go to Island N.\nHowever, it turned out that there is no boat service from Island 1 to Island N, so he wants to know whether it is possible to go to Island N by using two boat services.\n\nHelp him.\n\nConstraints\n\n3 ≤ N ≤ 200 000\n\n1 ≤ M ≤ 200 000\n\n1 ≤ a_i < b_i ≤ N\n\n(a_i, b_i) \\neq (1, N)\n\nIf i \\neq j, (a_i, b_i) \\neq (a_j, b_j).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nOutput\n\nIf it is possible to go to Island N by using two boat services, print POSSIBLE; otherwise, print IMPOSSIBLE.\n\nSample Input 1\n\n3 2\n1 2\n2 3\n\nSample Output 1\n\nPOSSIBLE\n\nSample Input 2\n\n4 3\n1 2\n2 3\n3 4\n\nSample Output 2\n\nIMPOSSIBLE\n\nYou have to use three boat services to get to Island 4.\n\nSample Input 3\n\n100000 1\n1 99999\n\nSample Output 3\n\nIMPOSSIBLE\n\nSample Input 4\n\n5 5\n1 3\n4 5\n2 3\n2 4\n1 4\n\nSample Output 4\n\nPOSSIBLE\n\nYou can get to Island 5 by using two boat services: Island 1 -> Island 4 -> Island 5.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 398, "memory_kb": 39804}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s234445095", "group_id": "codeNet:p03658", "input_text": "let () =\n  Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let l = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun d -> d in\n  let _ = Array.fast_sort (fun x y -> y-x) l in\n  let ans = ref 0 in\n  for i = 0 to k-1 do\n    ans := !ans + l.(i)\n  done;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1600789968, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s234445095.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s234445095", "user_id": "u307426615"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let l = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun d -> d in\n  let _ = Array.fast_sort (fun x y -> y-x) l in\n  let ans = ref 0 in\n  for i = 0 to k-1 do\n    ans := !ans + l.(i)\n  done;\n  Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N sticks.\nThe length of the i-th stick is l_i.\n\nSnuke is making a snake toy by joining K of the sticks together.\n\nThe length of the toy is represented by the sum of the individual sticks that compose it.\nFind the maximum possible length of the toy.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 50\n\n1 \\leq l_i \\leq 50\n\nl_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nl_1 l_2 l_3 ... l_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5 3\n1 2 3 4 5\n\nSample Output 1\n\n12\n\nYou can make a toy of length 12 by joining the sticks of lengths 3, 4 and 5, which is the maximum possible length.\n\nSample Input 2\n\n15 14\n50 26 27 21 41 7 42 35 7 5 5 36 39 1 45\n\nSample Output 2\n\n386", "sample_input": "5 3\n1 2 3 4 5\n"}, "reference_outputs": ["12\n"], "source_document_id": "p03658", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N sticks.\nThe length of the i-th stick is l_i.\n\nSnuke is making a snake toy by joining K of the sticks together.\n\nThe length of the toy is represented by the sum of the individual sticks that compose it.\nFind the maximum possible length of the toy.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 50\n\n1 \\leq l_i \\leq 50\n\nl_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nl_1 l_2 l_3 ... l_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5 3\n1 2 3 4 5\n\nSample Output 1\n\n12\n\nYou can make a toy of length 12 by joining the sticks of lengths 3, 4 and 5, which is the maximum possible length.\n\nSample Input 2\n\n15 14\n50 26 27 21 41 7 42 35 7 5 5 36 39 1 45\n\nSample Output 2\n\n386", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 267, "cpu_time_ms": 10, "memory_kb": 3804}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s522345982", "group_id": "codeNet:p03658", "input_text": "let rec take n = function\n  | [] -> []\n  | x :: xs ->\n      if n = 0 then []\n      else x :: take (n - 1) xs\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  Array.init n (fun _ ->\n    Scanf.scanf \"%d \" @@ fun l -> l)\n  |> Array.to_list\n  |> List.sort (fun x y -> compare y x)\n  |> take k\n  |> List.fold_left ( + ) 0\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1530676208, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s522345982.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s522345982", "user_id": "u504158101"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "let rec take n = function\n  | [] -> []\n  | x :: xs ->\n      if n = 0 then []\n      else x :: take (n - 1) xs\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  Array.init n (fun _ ->\n    Scanf.scanf \"%d \" @@ fun l -> l)\n  |> Array.to_list\n  |> List.sort (fun x y -> compare y x)\n  |> take k\n  |> List.fold_left ( + ) 0\n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N sticks.\nThe length of the i-th stick is l_i.\n\nSnuke is making a snake toy by joining K of the sticks together.\n\nThe length of the toy is represented by the sum of the individual sticks that compose it.\nFind the maximum possible length of the toy.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 50\n\n1 \\leq l_i \\leq 50\n\nl_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nl_1 l_2 l_3 ... l_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5 3\n1 2 3 4 5\n\nSample Output 1\n\n12\n\nYou can make a toy of length 12 by joining the sticks of lengths 3, 4 and 5, which is the maximum possible length.\n\nSample Input 2\n\n15 14\n50 26 27 21 41 7 42 35 7 5 5 36 39 1 45\n\nSample Output 2\n\n386", "sample_input": "5 3\n1 2 3 4 5\n"}, "reference_outputs": ["12\n"], "source_document_id": "p03658", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N sticks.\nThe length of the i-th stick is l_i.\n\nSnuke is making a snake toy by joining K of the sticks together.\n\nThe length of the toy is represented by the sum of the individual sticks that compose it.\nFind the maximum possible length of the toy.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 50\n\n1 \\leq l_i \\leq 50\n\nl_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nl_1 l_2 l_3 ... l_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5 3\n1 2 3 4 5\n\nSample Output 1\n\n12\n\nYou can make a toy of length 12 by joining the sticks of lengths 3, 4 and 5, which is the maximum possible length.\n\nSample Input 2\n\n15 14\n50 26 27 21 41 7 42 35 7 5 5 36 39 1 45\n\nSample Output 2\n\n386", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 342, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s756823262", "group_id": "codeNet:p03658", "input_text": "open Batteries\nopen Printf\nlet () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  let k = Scanf.scanf \"%d \" (fun a -> a) in\n  let a_lst = Array.to_list @@ Array.init n (fun _ -> Scanf.scanf \"%d \" (fun a -> a)) in\n\n  let l = List.sort (fun x y -> compare y x) a_lst in\n  let (ans_l,_) = List.split_nth k l in\n\n  Printf.printf \"%d\\n\" @@\n  List.fold_left (+) 0 ans_l\n", "language": "OCaml", "metadata": {"date": 1529320368, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s756823262.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s756823262", "user_id": "u139013163"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "open Batteries\nopen Printf\nlet () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  let k = Scanf.scanf \"%d \" (fun a -> a) in\n  let a_lst = Array.to_list @@ Array.init n (fun _ -> Scanf.scanf \"%d \" (fun a -> a)) in\n\n  let l = List.sort (fun x y -> compare y x) a_lst in\n  let (ans_l,_) = List.split_nth k l in\n\n  Printf.printf \"%d\\n\" @@\n  List.fold_left (+) 0 ans_l\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N sticks.\nThe length of the i-th stick is l_i.\n\nSnuke is making a snake toy by joining K of the sticks together.\n\nThe length of the toy is represented by the sum of the individual sticks that compose it.\nFind the maximum possible length of the toy.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 50\n\n1 \\leq l_i \\leq 50\n\nl_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nl_1 l_2 l_3 ... l_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5 3\n1 2 3 4 5\n\nSample Output 1\n\n12\n\nYou can make a toy of length 12 by joining the sticks of lengths 3, 4 and 5, which is the maximum possible length.\n\nSample Input 2\n\n15 14\n50 26 27 21 41 7 42 35 7 5 5 36 39 1 45\n\nSample Output 2\n\n386", "sample_input": "5 3\n1 2 3 4 5\n"}, "reference_outputs": ["12\n"], "source_document_id": "p03658", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N sticks.\nThe length of the i-th stick is l_i.\n\nSnuke is making a snake toy by joining K of the sticks together.\n\nThe length of the toy is represented by the sum of the individual sticks that compose it.\nFind the maximum possible length of the toy.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 50\n\n1 \\leq l_i \\leq 50\n\nl_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nl_1 l_2 l_3 ... l_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5 3\n1 2 3 4 5\n\nSample Output 1\n\n12\n\nYou can make a toy of length 12 by joining the sticks of lengths 3, 4 and 5, which is the maximum possible length.\n\nSample Input 2\n\n15 14\n50 26 27 21 41 7 42 35 7 5 5 36 39 1 45\n\nSample Output 2\n\n386", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 364, "cpu_time_ms": 2, "memory_kb": 1152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s856464172", "group_id": "codeNet:p03659", "input_text": "let n = Scanf.scanf \"%d\\n\" (fun x -> x)\n\nlet a = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun x -> x))\n\nlet total = Array.fold_left ( + ) 0 a\n\nlet () =\n  let rec f i sumx tmp =\n    if i = n then tmp\n    else\n      let next_sumx = sumx + a.(i) in\n      let next_tmp = min tmp (abs (2 * sumx - total)) in\n      f (i + 1) next_sumx next_tmp\n  in\n  f 1 a.(0) max_int |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1521673342, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03659.html", "problem_id": "p03659", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03659/input.txt", "sample_output_relpath": "derived/input_output/data/p03659/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03659/OCaml/s856464172.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s856464172", "user_id": "u987869509"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let n = Scanf.scanf \"%d\\n\" (fun x -> x)\n\nlet a = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun x -> x))\n\nlet total = Array.fold_left ( + ) 0 a\n\nlet () =\n  let rec f i sumx tmp =\n    if i = n then tmp\n    else\n      let next_sumx = sumx + a.(i) in\n      let next_tmp = min tmp (abs (2 * sumx - total)) in\n      f (i + 1) next_sumx next_tmp\n  in\n  f 1 a.(0) max_int |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke and Raccoon have a heap of N cards. The i-th card from the top has the integer a_i written on it.\n\nThey will share these cards.\nFirst, Snuke will take some number of cards from the top of the heap, then Raccoon will take all the remaining cards.\nHere, both Snuke and Raccoon have to take at least one card.\n\nLet the sum of the integers on Snuke's cards and Raccoon's cards be x and y, respectively.\nThey would like to minimize |x-y|.\nFind the minimum possible value of |x-y|.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n-10^{9} \\leq a_i \\leq 10^{9}\n\na_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n6\n1 2 3 4 5 6\n\nSample Output 1\n\n1\n\nIf Snuke takes four cards from the top, and Raccoon takes the remaining two cards, x=10, y=11, and thus |x-y|=1. This is the minimum possible value.\n\nSample Input 2\n\n2\n10 -10\n\nSample Output 2\n\n20\n\nSnuke can only take one card from the top, and Raccoon can only take the remaining one card. In this case, x=10, y=-10, and thus |x-y|=20.", "sample_input": "6\n1 2 3 4 5 6\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03659", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke and Raccoon have a heap of N cards. The i-th card from the top has the integer a_i written on it.\n\nThey will share these cards.\nFirst, Snuke will take some number of cards from the top of the heap, then Raccoon will take all the remaining cards.\nHere, both Snuke and Raccoon have to take at least one card.\n\nLet the sum of the integers on Snuke's cards and Raccoon's cards be x and y, respectively.\nThey would like to minimize |x-y|.\nFind the minimum possible value of |x-y|.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n-10^{9} \\leq a_i \\leq 10^{9}\n\na_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n6\n1 2 3 4 5 6\n\nSample Output 1\n\n1\n\nIf Snuke takes four cards from the top, and Raccoon takes the remaining two cards, x=10, y=11, and thus |x-y|=1. This is the minimum possible value.\n\nSample Input 2\n\n2\n10 -10\n\nSample Output 2\n\n20\n\nSnuke can only take one card from the top, and Raccoon can only take the remaining one card. In this case, x=10, y=-10, and thus |x-y|=20.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 387, "cpu_time_ms": 58, "memory_kb": 5760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s046621198", "group_id": "codeNet:p03660", "input_text": "module DirectedGraph\n  (* 道の表現 *)\n  (Path : sig\n    type t\n    (* 辺の名前 *)\n    type edge\n    (* 長さ0の道 *)\n    val nil : t\n    (* 道の後ろに辺を付け足した道 *)\n    val snoc : t -> edge -> t\n  end) :\nsig\n  (* BFSにより，重みのないグラフの最短経路を求める *)\n  val bfs :\n    (* 頂点数（Hashtblを用いるので目安程度） *)\n    int ->\n    (* 辺の名前が付いた隣接リスト *)\n    ('v -> ('v * Path.edge) list) ->\n    (* 始点 *)\n    'v ->\n    (* 最短経路を返す関数 辿り着けなければNoneを返す） *)\n    ('v -> Path.t option)\nend = struct\n  let rec bfs_aux es d frontier t =\n    try Some (Hashtbl.find d t) with\n    | Not_found ->\n        match !frontier with\n        | [] -> None\n        | _ :: _ ->\n            frontier := List.fold_right (fun u ->\n              List.fold_right (fun (v, e) frontier ->\n                if Hashtbl.mem d v\n                then frontier\n                else (Hashtbl.add d v (Path.snoc (Hashtbl.find d u) e); v :: frontier))\n              (es u)) !frontier [];\n            bfs_aux es d frontier t\n\n  (*\n   * 終点に辿り着いた時点で探索を切り上げるが，\n   * 戻り値の関数を覚えておくと，途中まで探索した結果が再利用される\n   * （#trace bfs_aux すると分かりやすい）\n   *)\n  let bfs n es s =\n    let d = Hashtbl.create n in\n    Hashtbl.add d s Path.nil;\n    let frontier = ref [s] in\n    bfs_aux es d frontier\nend\n\n(* 配列版素集合データ構造 *)\nmodule RawUnionFind : sig\n  type t\n  type class_\n\n  (* n要素の素集合データ構造を作る *)\n  val make : int -> t\n  (* 要素がどの集合に属するか調べる *)\n  (* 要素は0からn-1の整数である必要がある *)\n  val find : t -> int -> class_\n  (* 与えられた要素が属する集合同士を合併する *)\n  val unite : t -> int -> int -> unit\n\n  val compare_class : class_ -> class_ -> int\nend = struct\n  type t = { rank : int array; parent : int array }\n  type class_ = int\n\n  let make n =\n    { rank = Array.make n 0;\n      parent = Array.init n (fun c -> c) }\n\n  let rec find uf x =\n    if x = uf.parent.(x) then x\n    else begin\n      let y = find uf uf.parent.(x) in\n      uf.parent.(x) <- y; y\n    end\n\n  let unite uf i j =\n    let x = find uf i in\n    let y = find uf j in\n    if x <> y then begin\n      if uf.rank.(x) < uf.rank.(y) then uf.parent.(x) <- y\n      else begin\n        uf.parent.(y) <- x;\n        if uf.rank.(x) = uf.rank.(y) then\n          uf.rank.(x) <- 1 + uf.rank.(x)\n      end\n    end\n\n  let compare_class = compare\nend\n\nmodule G = DirectedGraph (struct\n  type t = int list\n  type edge = int\n  let nil = []\n  let snoc t e = e :: t\nend)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let abs = Array.init (n - 1) @@ fun _ ->\n    Scanf.scanf \"%d %d\\n\" @@ fun a b -> a, b in\n  let es = Array.make n [] in\n  Array.iteri (fun i (a, b) ->\n    es.(a - 1) <- (b - 1, i) :: es.(a - 1);\n    es.(b - 1) <- (a - 1, i) :: es.(b - 1)) abs;\n  let (Some route) = G.bfs n (fun v -> es.(v)) 0 (n - 1) in\n  let i = List.nth route ((List.length route - 1) / 2) in\n  let uf = RawUnionFind.make n in\n  Array.iteri (fun j (a, b) ->\n    if i <> j then RawUnionFind.unite uf (a - 1) (b - 1)) abs;\n  print_endline @@\n    if\n      List.length (List.filter (fun i ->\n        RawUnionFind.compare_class (RawUnionFind.find uf 0) (RawUnionFind.find uf i) = 0)\n      @@ Array.to_list @@ Array.init n @@ fun i -> i)\n      <= List.length (List.filter (fun i ->\n          RawUnionFind.compare_class (RawUnionFind.find uf (n - 1)) (RawUnionFind.find uf i) = 0)\n        @@ Array.to_list @@ Array.init n @@ fun i -> i)\n    then \"Snuke\" else \"Fennec\"", "language": "OCaml", "metadata": {"date": 1531751805, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03660.html", "problem_id": "p03660", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03660/input.txt", "sample_output_relpath": "derived/input_output/data/p03660/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03660/OCaml/s046621198.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s046621198", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Fennec\n", "input_to_evaluate": "module DirectedGraph\n  (* 道の表現 *)\n  (Path : sig\n    type t\n    (* 辺の名前 *)\n    type edge\n    (* 長さ0の道 *)\n    val nil : t\n    (* 道の後ろに辺を付け足した道 *)\n    val snoc : t -> edge -> t\n  end) :\nsig\n  (* BFSにより，重みのないグラフの最短経路を求める *)\n  val bfs :\n    (* 頂点数（Hashtblを用いるので目安程度） *)\n    int ->\n    (* 辺の名前が付いた隣接リスト *)\n    ('v -> ('v * Path.edge) list) ->\n    (* 始点 *)\n    'v ->\n    (* 最短経路を返す関数 辿り着けなければNoneを返す） *)\n    ('v -> Path.t option)\nend = struct\n  let rec bfs_aux es d frontier t =\n    try Some (Hashtbl.find d t) with\n    | Not_found ->\n        match !frontier with\n        | [] -> None\n        | _ :: _ ->\n            frontier := List.fold_right (fun u ->\n              List.fold_right (fun (v, e) frontier ->\n                if Hashtbl.mem d v\n                then frontier\n                else (Hashtbl.add d v (Path.snoc (Hashtbl.find d u) e); v :: frontier))\n              (es u)) !frontier [];\n            bfs_aux es d frontier t\n\n  (*\n   * 終点に辿り着いた時点で探索を切り上げるが，\n   * 戻り値の関数を覚えておくと，途中まで探索した結果が再利用される\n   * （#trace bfs_aux すると分かりやすい）\n   *)\n  let bfs n es s =\n    let d = Hashtbl.create n in\n    Hashtbl.add d s Path.nil;\n    let frontier = ref [s] in\n    bfs_aux es d frontier\nend\n\n(* 配列版素集合データ構造 *)\nmodule RawUnionFind : sig\n  type t\n  type class_\n\n  (* n要素の素集合データ構造を作る *)\n  val make : int -> t\n  (* 要素がどの集合に属するか調べる *)\n  (* 要素は0からn-1の整数である必要がある *)\n  val find : t -> int -> class_\n  (* 与えられた要素が属する集合同士を合併する *)\n  val unite : t -> int -> int -> unit\n\n  val compare_class : class_ -> class_ -> int\nend = struct\n  type t = { rank : int array; parent : int array }\n  type class_ = int\n\n  let make n =\n    { rank = Array.make n 0;\n      parent = Array.init n (fun c -> c) }\n\n  let rec find uf x =\n    if x = uf.parent.(x) then x\n    else begin\n      let y = find uf uf.parent.(x) in\n      uf.parent.(x) <- y; y\n    end\n\n  let unite uf i j =\n    let x = find uf i in\n    let y = find uf j in\n    if x <> y then begin\n      if uf.rank.(x) < uf.rank.(y) then uf.parent.(x) <- y\n      else begin\n        uf.parent.(y) <- x;\n        if uf.rank.(x) = uf.rank.(y) then\n          uf.rank.(x) <- 1 + uf.rank.(x)\n      end\n    end\n\n  let compare_class = compare\nend\n\nmodule G = DirectedGraph (struct\n  type t = int list\n  type edge = int\n  let nil = []\n  let snoc t e = e :: t\nend)\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let abs = Array.init (n - 1) @@ fun _ ->\n    Scanf.scanf \"%d %d\\n\" @@ fun a b -> a, b in\n  let es = Array.make n [] in\n  Array.iteri (fun i (a, b) ->\n    es.(a - 1) <- (b - 1, i) :: es.(a - 1);\n    es.(b - 1) <- (a - 1, i) :: es.(b - 1)) abs;\n  let (Some route) = G.bfs n (fun v -> es.(v)) 0 (n - 1) in\n  let i = List.nth route ((List.length route - 1) / 2) in\n  let uf = RawUnionFind.make n in\n  Array.iteri (fun j (a, b) ->\n    if i <> j then RawUnionFind.unite uf (a - 1) (b - 1)) abs;\n  print_endline @@\n    if\n      List.length (List.filter (fun i ->\n        RawUnionFind.compare_class (RawUnionFind.find uf 0) (RawUnionFind.find uf i) = 0)\n      @@ Array.to_list @@ Array.init n @@ fun i -> i)\n      <= List.length (List.filter (fun i ->\n          RawUnionFind.compare_class (RawUnionFind.find uf (n - 1)) (RawUnionFind.find uf i) = 0)\n        @@ Array.to_list @@ Array.init n @@ fun i -> i)\n    then \"Snuke\" else \"Fennec\"", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFennec and Snuke are playing a board game.\n\nOn the board, there are N cells numbered 1 through N, and N-1 roads, each connecting two cells. Cell a_i is adjacent to Cell b_i through the i-th road. Every cell can be reached from every other cell by repeatedly traveling to an adjacent cell. In terms of graph theory, the graph formed by the cells and the roads is a tree.\n\nInitially, Cell 1 is painted black, and Cell N is painted white. The other cells are not yet colored.\nFennec (who goes first) and Snuke (who goes second) alternately paint an uncolored cell.\nMore specifically, each player performs the following action in her/his turn:\n\nFennec: selects an uncolored cell that is adjacent to a black cell, and paints it black.\n\nSnuke: selects an uncolored cell that is adjacent to a white cell, and paints it white.\n\nA player loses when she/he cannot paint a cell. Determine the winner of the game when Fennec and Snuke play optimally.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i \\leq N\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\n:\na_{N-1} b_{N-1}\n\nOutput\n\nIf Fennec wins, print Fennec; if Snuke wins, print Snuke.\n\nSample Input 1\n\n7\n3 6\n1 2\n3 1\n7 4\n5 7\n1 4\n\nSample Output 1\n\nFennec\n\nFor example, if Fennec first paints Cell 2 black, she will win regardless of Snuke's moves.\n\nSample Input 2\n\n4\n1 4\n4 2\n2 3\n\nSample Output 2\n\nSnuke", "sample_input": "7\n3 6\n1 2\n3 1\n7 4\n5 7\n1 4\n"}, "reference_outputs": ["Fennec\n"], "source_document_id": "p03660", "source_text": "Score : 400 points\n\nProblem Statement\n\nFennec and Snuke are playing a board game.\n\nOn the board, there are N cells numbered 1 through N, and N-1 roads, each connecting two cells. Cell a_i is adjacent to Cell b_i through the i-th road. Every cell can be reached from every other cell by repeatedly traveling to an adjacent cell. In terms of graph theory, the graph formed by the cells and the roads is a tree.\n\nInitially, Cell 1 is painted black, and Cell N is painted white. The other cells are not yet colored.\nFennec (who goes first) and Snuke (who goes second) alternately paint an uncolored cell.\nMore specifically, each player performs the following action in her/his turn:\n\nFennec: selects an uncolored cell that is adjacent to a black cell, and paints it black.\n\nSnuke: selects an uncolored cell that is adjacent to a white cell, and paints it white.\n\nA player loses when she/he cannot paint a cell. Determine the winner of the game when Fennec and Snuke play optimally.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i \\leq N\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\n:\na_{N-1} b_{N-1}\n\nOutput\n\nIf Fennec wins, print Fennec; if Snuke wins, print Snuke.\n\nSample Input 1\n\n7\n3 6\n1 2\n3 1\n7 4\n5 7\n1 4\n\nSample Output 1\n\nFennec\n\nFor example, if Fennec first paints Cell 2 black, she will win regardless of Snuke's moves.\n\nSample Input 2\n\n4\n1 4\n4 2\n2 3\n\nSample Output 2\n\nSnuke", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3704, "cpu_time_ms": 156, "memory_kb": 34684}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s673098548", "group_id": "codeNet:p03662", "input_text": "open Printf\nopen Scanf\n\ntype node = {p : int; cs : int list}\n\nlet id x = x\n\nlet rec remove e = function\n    [] -> []\n  | x::xs when x = e -> xs\n  | x::xs -> x :: remove e xs\n  \nlet spath tr n =\n  let rec iter i ls =\n    let p = tr.(i).p in\n    if p = 0 then ls\n    else iter p (p::ls)\n  in iter n []\n\nlet count tr n =\n  let rec iter i =\n    let cs = tr.(i).cs in\n    match cs with\n      [] -> 1\n    | xs -> List.fold_left (fun s j -> s + iter j) 1 xs\n  in\n  iter n\n       \nlet () =\n  let n = scanf \"%d\\n\" id in\n  let adj = Array.make n [] in\n  let tree = Array.make n {p = -1; cs = []} in\n  let rec read n =\n    if n = 1 then ()\n    else let i, j = scanf \"%d %d\\n\" (fun x y -> (x-1, y-1)) in\n         adj.(i) <- j :: adj.(i);\n         adj.(j) <- i :: adj.(j);\n         read (n-1)\n  in\n  let rec set_node p i =\n    let cs = remove p adj.(i) in\n    tree.(i) <- {p = p; cs = cs};\n    List.iter (fun x -> set_node i x) cs\n  in\n  read n;\n  set_node (-1) 0;\n  let pt = spath tree (n-1) in\n  let l = List.length pt in\n  let w = (if l <= 1 then n-1 else List.nth pt ((l+1) / 2)) in\n  let s = count tree w in\n  printf \"%s\\n\" (if s >= n - s then \"Snuke\" else \"Fennec\")\n", "language": "OCaml", "metadata": {"date": 1500173830, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03662.html", "problem_id": "p03662", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03662/input.txt", "sample_output_relpath": "derived/input_output/data/p03662/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03662/OCaml/s673098548.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s673098548", "user_id": "u388783188"}, "prompt_components": {"gold_output": "Fennec\n", "input_to_evaluate": "open Printf\nopen Scanf\n\ntype node = {p : int; cs : int list}\n\nlet id x = x\n\nlet rec remove e = function\n    [] -> []\n  | x::xs when x = e -> xs\n  | x::xs -> x :: remove e xs\n  \nlet spath tr n =\n  let rec iter i ls =\n    let p = tr.(i).p in\n    if p = 0 then ls\n    else iter p (p::ls)\n  in iter n []\n\nlet count tr n =\n  let rec iter i =\n    let cs = tr.(i).cs in\n    match cs with\n      [] -> 1\n    | xs -> List.fold_left (fun s j -> s + iter j) 1 xs\n  in\n  iter n\n       \nlet () =\n  let n = scanf \"%d\\n\" id in\n  let adj = Array.make n [] in\n  let tree = Array.make n {p = -1; cs = []} in\n  let rec read n =\n    if n = 1 then ()\n    else let i, j = scanf \"%d %d\\n\" (fun x y -> (x-1, y-1)) in\n         adj.(i) <- j :: adj.(i);\n         adj.(j) <- i :: adj.(j);\n         read (n-1)\n  in\n  let rec set_node p i =\n    let cs = remove p adj.(i) in\n    tree.(i) <- {p = p; cs = cs};\n    List.iter (fun x -> set_node i x) cs\n  in\n  read n;\n  set_node (-1) 0;\n  let pt = spath tree (n-1) in\n  let l = List.length pt in\n  let w = (if l <= 1 then n-1 else List.nth pt ((l+1) / 2)) in\n  let s = count tree w in\n  printf \"%s\\n\" (if s >= n - s then \"Snuke\" else \"Fennec\")\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFennec and Snuke are playing a board game.\n\nOn the board, there are N cells numbered 1 through N, and N-1 roads, each connecting two cells. Cell a_i is adjacent to Cell b_i through the i-th road. Every cell can be reached from every other cell by repeatedly traveling to an adjacent cell. In terms of graph theory, the graph formed by the cells and the roads is a tree.\n\nInitially, Cell 1 is painted black, and Cell N is painted white. The other cells are not yet colored.\nFennec (who goes first) and Snuke (who goes second) alternately paint an uncolored cell.\nMore specifically, each player performs the following action in her/his turn:\n\nFennec: selects an uncolored cell that is adjacent to a black cell, and paints it black.\n\nSnuke: selects an uncolored cell that is adjacent to a white cell, and paints it white.\n\nA player loses when she/he cannot paint a cell. Determine the winner of the game when Fennec and Snuke play optimally.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i \\leq N\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\n:\na_{N-1} b_{N-1}\n\nOutput\n\nIf Fennec wins, print Fennec; if Snuke wins, print Snuke.\n\nSample Input 1\n\n7\n3 6\n1 2\n3 1\n7 4\n5 7\n1 4\n\nSample Output 1\n\nFennec\n\nFor example, if Fennec first paints Cell 2 black, she will win regardless of Snuke's moves.\n\nSample Input 2\n\n4\n1 4\n4 2\n2 3\n\nSample Output 2\n\nSnuke", "sample_input": "7\n3 6\n1 2\n3 1\n7 4\n5 7\n1 4\n"}, "reference_outputs": ["Fennec\n"], "source_document_id": "p03662", "source_text": "Score : 400 points\n\nProblem Statement\n\nFennec and Snuke are playing a board game.\n\nOn the board, there are N cells numbered 1 through N, and N-1 roads, each connecting two cells. Cell a_i is adjacent to Cell b_i through the i-th road. Every cell can be reached from every other cell by repeatedly traveling to an adjacent cell. In terms of graph theory, the graph formed by the cells and the roads is a tree.\n\nInitially, Cell 1 is painted black, and Cell N is painted white. The other cells are not yet colored.\nFennec (who goes first) and Snuke (who goes second) alternately paint an uncolored cell.\nMore specifically, each player performs the following action in her/his turn:\n\nFennec: selects an uncolored cell that is adjacent to a black cell, and paints it black.\n\nSnuke: selects an uncolored cell that is adjacent to a white cell, and paints it white.\n\nA player loses when she/he cannot paint a cell. Determine the winner of the game when Fennec and Snuke play optimally.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i \\leq N\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\n:\na_{N-1} b_{N-1}\n\nOutput\n\nIf Fennec wins, print Fennec; if Snuke wins, print Snuke.\n\nSample Input 1\n\n7\n3 6\n1 2\n3 1\n7 4\n5 7\n1 4\n\nSample Output 1\n\nFennec\n\nFor example, if Fennec first paints Cell 2 black, she will win regardless of Snuke's moves.\n\nSample Input 2\n\n4\n1 4\n4 2\n2 3\n\nSample Output 2\n\nSnuke", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1159, "cpu_time_ms": 103, "memory_kb": 22400}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s729044860", "group_id": "codeNet:p03671", "input_text": "(* unihernandez22\n * https://atcoder.jp/contests/abc066/tasks/abc066_a\n * sorting, implementation\n * *)\n\nPrintf.printf \"%d\\n\" @@\nScanf.scanf \"%d %d %d\\n\" @@ fun a b c ->\n    [a; b; c]\n    |> List.sort compare\n    |> fun l -> List.nth l 0 + List.nth l 1\n", "language": "OCaml", "metadata": {"date": 1593836197, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s729044860.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s729044860", "user_id": "u878654696"}, "prompt_components": {"gold_output": "1300\n", "input_to_evaluate": "(* unihernandez22\n * https://atcoder.jp/contests/abc066/tasks/abc066_a\n * sorting, implementation\n * *)\n\nPrintf.printf \"%d\\n\" @@\nScanf.scanf \"%d %d %d\\n\" @@ fun a b c ->\n    [a; b; c]\n    |> List.sort compare\n    |> fun l -> List.nth l 0 + List.nth l 1\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke is buying a bicycle.\nThe bicycle of his choice does not come with a bell, so he has to buy one separately.\n\nHe has very high awareness of safety, and decides to buy two bells, one for each hand.\n\nThe store sells three kinds of bells for the price of a, b and c yen (the currency of Japan), respectively.\nFind the minimum total price of two different bells.\n\nConstraints\n\n1 \\leq a,b,c \\leq 10000\n\na, b and c are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the minimum total price of two different bells.\n\nSample Input 1\n\n700 600 780\n\nSample Output 1\n\n1300\n\nBuying a 700-yen bell and a 600-yen bell costs 1300 yen.\n\nBuying a 700-yen bell and a 780-yen bell costs 1480 yen.\n\nBuying a 600-yen bell and a 780-yen bell costs 1380 yen.\n\nThe minimum among these is 1300 yen.\n\nSample Input 2\n\n10000 10000 10000\n\nSample Output 2\n\n20000\n\nBuying any two bells costs 20000 yen.", "sample_input": "700 600 780\n"}, "reference_outputs": ["1300\n"], "source_document_id": "p03671", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke is buying a bicycle.\nThe bicycle of his choice does not come with a bell, so he has to buy one separately.\n\nHe has very high awareness of safety, and decides to buy two bells, one for each hand.\n\nThe store sells three kinds of bells for the price of a, b and c yen (the currency of Japan), respectively.\nFind the minimum total price of two different bells.\n\nConstraints\n\n1 \\leq a,b,c \\leq 10000\n\na, b and c are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the minimum total price of two different bells.\n\nSample Input 1\n\n700 600 780\n\nSample Output 1\n\n1300\n\nBuying a 700-yen bell and a 600-yen bell costs 1300 yen.\n\nBuying a 700-yen bell and a 780-yen bell costs 1480 yen.\n\nBuying a 600-yen bell and a 780-yen bell costs 1380 yen.\n\nThe minimum among these is 1300 yen.\n\nSample Input 2\n\n10000 10000 10000\n\nSample Output 2\n\n20000\n\nBuying any two bells costs 20000 yen.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 253, "cpu_time_ms": 8, "memory_kb": 3812}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s977266931", "group_id": "codeNet:p03671", "input_text": "let () = Scanf.scanf \"%d %d %d\"\n(fun a b c -> a+b+c - max a (max b c))\n|> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1561076026, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s977266931.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s977266931", "user_id": "u635974378"}, "prompt_components": {"gold_output": "1300\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\"\n(fun a b c -> a+b+c - max a (max b c))\n|> Printf.printf \"%d\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke is buying a bicycle.\nThe bicycle of his choice does not come with a bell, so he has to buy one separately.\n\nHe has very high awareness of safety, and decides to buy two bells, one for each hand.\n\nThe store sells three kinds of bells for the price of a, b and c yen (the currency of Japan), respectively.\nFind the minimum total price of two different bells.\n\nConstraints\n\n1 \\leq a,b,c \\leq 10000\n\na, b and c are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the minimum total price of two different bells.\n\nSample Input 1\n\n700 600 780\n\nSample Output 1\n\n1300\n\nBuying a 700-yen bell and a 600-yen bell costs 1300 yen.\n\nBuying a 700-yen bell and a 780-yen bell costs 1480 yen.\n\nBuying a 600-yen bell and a 780-yen bell costs 1380 yen.\n\nThe minimum among these is 1300 yen.\n\nSample Input 2\n\n10000 10000 10000\n\nSample Output 2\n\n20000\n\nBuying any two bells costs 20000 yen.", "sample_input": "700 600 780\n"}, "reference_outputs": ["1300\n"], "source_document_id": "p03671", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke is buying a bicycle.\nThe bicycle of his choice does not come with a bell, so he has to buy one separately.\n\nHe has very high awareness of safety, and decides to buy two bells, one for each hand.\n\nThe store sells three kinds of bells for the price of a, b and c yen (the currency of Japan), respectively.\nFind the minimum total price of two different bells.\n\nConstraints\n\n1 \\leq a,b,c \\leq 10000\n\na, b and c are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the minimum total price of two different bells.\n\nSample Input 1\n\n700 600 780\n\nSample Output 1\n\n1300\n\nBuying a 700-yen bell and a 600-yen bell costs 1300 yen.\n\nBuying a 700-yen bell and a 780-yen bell costs 1480 yen.\n\nBuying a 600-yen bell and a 780-yen bell costs 1380 yen.\n\nThe minimum among these is 1300 yen.\n\nSample Input 2\n\n10000 10000 10000\n\nSample Output 2\n\n20000\n\nBuying any two bells costs 20000 yen.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 94, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s290236646", "group_id": "codeNet:p03671", "input_text": "open Batteries\nopen Printf\nlet () =\n  let a,b,c = Scanf.scanf \"%d %d %d \" (fun a b c -> a,b,c) in\n\n  let ans = \n    let (l, _) = List.sort compare [a;b;c] |>\n                 List.split_nth 2 in\n    List.fold_left (+) 0 l\n  in\n\n  Printf.printf \"%d\\n\" ans\n", "language": "OCaml", "metadata": {"date": 1529325842, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s290236646.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s290236646", "user_id": "u139013163"}, "prompt_components": {"gold_output": "1300\n", "input_to_evaluate": "open Batteries\nopen Printf\nlet () =\n  let a,b,c = Scanf.scanf \"%d %d %d \" (fun a b c -> a,b,c) in\n\n  let ans = \n    let (l, _) = List.sort compare [a;b;c] |>\n                 List.split_nth 2 in\n    List.fold_left (+) 0 l\n  in\n\n  Printf.printf \"%d\\n\" ans\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke is buying a bicycle.\nThe bicycle of his choice does not come with a bell, so he has to buy one separately.\n\nHe has very high awareness of safety, and decides to buy two bells, one for each hand.\n\nThe store sells three kinds of bells for the price of a, b and c yen (the currency of Japan), respectively.\nFind the minimum total price of two different bells.\n\nConstraints\n\n1 \\leq a,b,c \\leq 10000\n\na, b and c are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the minimum total price of two different bells.\n\nSample Input 1\n\n700 600 780\n\nSample Output 1\n\n1300\n\nBuying a 700-yen bell and a 600-yen bell costs 1300 yen.\n\nBuying a 700-yen bell and a 780-yen bell costs 1480 yen.\n\nBuying a 600-yen bell and a 780-yen bell costs 1380 yen.\n\nThe minimum among these is 1300 yen.\n\nSample Input 2\n\n10000 10000 10000\n\nSample Output 2\n\n20000\n\nBuying any two bells costs 20000 yen.", "sample_input": "700 600 780\n"}, "reference_outputs": ["1300\n"], "source_document_id": "p03671", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke is buying a bicycle.\nThe bicycle of his choice does not come with a bell, so he has to buy one separately.\n\nHe has very high awareness of safety, and decides to buy two bells, one for each hand.\n\nThe store sells three kinds of bells for the price of a, b and c yen (the currency of Japan), respectively.\nFind the minimum total price of two different bells.\n\nConstraints\n\n1 \\leq a,b,c \\leq 10000\n\na, b and c are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the minimum total price of two different bells.\n\nSample Input 1\n\n700 600 780\n\nSample Output 1\n\n1300\n\nBuying a 700-yen bell and a 600-yen bell costs 1300 yen.\n\nBuying a 700-yen bell and a 780-yen bell costs 1480 yen.\n\nBuying a 600-yen bell and a 780-yen bell costs 1380 yen.\n\nThe minimum among these is 1300 yen.\n\nSample Input 2\n\n10000 10000 10000\n\nSample Output 2\n\n20000\n\nBuying any two bells costs 20000 yen.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 255, "cpu_time_ms": 2, "memory_kb": 1152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s738863182", "group_id": "codeNet:p03673", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n    for i = 0 to n - 1 do\n        let f = i < (n + 1) / 2 in\n        let idx = if f then n - 1 - i * 2 else (i - (n + 1) / 2) * 2 + (n mod 2) in\n        Printf.printf \"%d \" a.(idx)\n    done;\n    print_newline ()\n)", "language": "OCaml", "metadata": {"date": 1594609013, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s738863182.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s738863182", "user_id": "u342443598"}, "prompt_components": {"gold_output": "4 2 1 3\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n    for i = 0 to n - 1 do\n        let f = i < (n + 1) / 2 in\n        let idx = if f then n - 1 - i * 2 else (i - (n + 1) / 2) * 2 + (n mod 2) in\n        Printf.printf \"%d \" a.(idx)\n    done;\n    print_newline ()\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length n, a_1, ..., a_n.\nLet us consider performing the following n operations on an empty sequence b.\n\nThe i-th operation is as follows:\n\nAppend a_i to the end of b.\n\nReverse the order of the elements in b.\n\nFind the sequence b obtained after these n operations.\n\nConstraints\n\n1 \\leq n \\leq 2\\times 10^5\n\n0 \\leq a_i \\leq 10^9\n\nn and a_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\na_1 a_2 ... a_n\n\nOutput\n\nPrint n integers in a line with spaces in between.\nThe i-th integer should be b_i.\n\nSample Input 1\n\n4\n1 2 3 4\n\nSample Output 1\n\n4 2 1 3\n\nAfter step 1 of the first operation, b becomes: 1.\n\nAfter step 2 of the first operation, b becomes: 1.\n\nAfter step 1 of the second operation, b becomes: 1, 2.\n\nAfter step 2 of the second operation, b becomes: 2, 1.\n\nAfter step 1 of the third operation, b becomes: 2, 1, 3.\n\nAfter step 2 of the third operation, b becomes: 3, 1, 2.\n\nAfter step 1 of the fourth operation, b becomes: 3, 1, 2, 4.\n\nAfter step 2 of the fourth operation, b becomes: 4, 2, 1, 3.\n\nThus, the answer is 4 2 1 3.\n\nSample Input 2\n\n3\n1 2 3\n\nSample Output 2\n\n3 1 2\n\nAs shown above in Sample Output 1, b becomes 3, 1, 2 after step 2 of the third operation. Thus, the answer is 3 1 2.\n\nSample Input 3\n\n1\n1000000000\n\nSample Output 3\n\n1000000000\n\nSample Input 4\n\n6\n0 6 7 6 7 0\n\nSample Output 4\n\n0 6 6 0 7 7", "sample_input": "4\n1 2 3 4\n"}, "reference_outputs": ["4 2 1 3\n"], "source_document_id": "p03673", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length n, a_1, ..., a_n.\nLet us consider performing the following n operations on an empty sequence b.\n\nThe i-th operation is as follows:\n\nAppend a_i to the end of b.\n\nReverse the order of the elements in b.\n\nFind the sequence b obtained after these n operations.\n\nConstraints\n\n1 \\leq n \\leq 2\\times 10^5\n\n0 \\leq a_i \\leq 10^9\n\nn and a_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\na_1 a_2 ... a_n\n\nOutput\n\nPrint n integers in a line with spaces in between.\nThe i-th integer should be b_i.\n\nSample Input 1\n\n4\n1 2 3 4\n\nSample Output 1\n\n4 2 1 3\n\nAfter step 1 of the first operation, b becomes: 1.\n\nAfter step 2 of the first operation, b becomes: 1.\n\nAfter step 1 of the second operation, b becomes: 1, 2.\n\nAfter step 2 of the second operation, b becomes: 2, 1.\n\nAfter step 1 of the third operation, b becomes: 2, 1, 3.\n\nAfter step 2 of the third operation, b becomes: 3, 1, 2.\n\nAfter step 1 of the fourth operation, b becomes: 3, 1, 2, 4.\n\nAfter step 2 of the fourth operation, b becomes: 4, 2, 1, 3.\n\nThus, the answer is 4 2 1 3.\n\nSample Input 2\n\n3\n1 2 3\n\nSample Output 2\n\n3 1 2\n\nAs shown above in Sample Output 1, b becomes 3, 1, 2 after step 2 of the third operation. Thus, the answer is 3 1 2.\n\nSample Input 3\n\n1\n1000000000\n\nSample Output 3\n\n1000000000\n\nSample Input 4\n\n6\n0 6 7 6 7 0\n\nSample Output 4\n\n0 6 6 0 7 7", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 310, "cpu_time_ms": 94, "memory_kb": 7556}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s408173684", "group_id": "codeNet:p03679", "input_text": "let x, a, b = Scanf.scanf \"%d %d %d\\n\" @@ fun a b c -> a, b, c\nlet ans = if a <= b then \"delicious\" else if a + x <= b then \"safe\" else \"dangerous\"\nlet () = print_endline ans", "language": "OCaml", "metadata": {"date": 1588432526, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03679.html", "problem_id": "p03679", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03679/input.txt", "sample_output_relpath": "derived/input_output/data/p03679/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03679/OCaml/s408173684.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s408173684", "user_id": "u307426615"}, "prompt_components": {"gold_output": "safe\n", "input_to_evaluate": "let x, a, b = Scanf.scanf \"%d %d %d\\n\" @@ fun a b c -> a, b, c\nlet ans = if a <= b then \"delicious\" else if a + x <= b then \"safe\" else \"dangerous\"\nlet () = print_endline ans", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi has a strong stomach. He never gets a stomachache from eating something whose \"best-by\" date is at most X days earlier.\nHe gets a stomachache if the \"best-by\" date of the food is X+1 or more days earlier, though.\n\nOther than that, he finds the food delicious if he eats it not later than the \"best-by\" date. Otherwise, he does not find it delicious.\n\nTakahashi bought some food A days before the \"best-by\" date, and ate it B days after he bought it.\n\nWrite a program that outputs delicious if he found it delicious, safe if he did not found it delicious but did not get a stomachache either, and dangerous if he got a stomachache.\n\nConstraints\n\n1 ≤ X,A,B ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A B\n\nOutput\n\nPrint delicious if Takahashi found the food delicious; print safe if he neither found it delicious nor got a stomachache; print dangerous if he got a stomachache.\n\nSample Input 1\n\n4 3 6\n\nSample Output 1\n\nsafe\n\nHe ate the food three days after the \"best-by\" date. It was not delicious or harmful for him.\n\nSample Input 2\n\n6 5 1\n\nSample Output 2\n\ndelicious\n\nHe ate the food by the \"best-by\" date. It was delicious for him.\n\nSample Input 3\n\n3 7 12\n\nSample Output 3\n\ndangerous\n\nHe ate the food five days after the \"best-by\" date. It was harmful for him.", "sample_input": "4 3 6\n"}, "reference_outputs": ["safe\n"], "source_document_id": "p03679", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi has a strong stomach. He never gets a stomachache from eating something whose \"best-by\" date is at most X days earlier.\nHe gets a stomachache if the \"best-by\" date of the food is X+1 or more days earlier, though.\n\nOther than that, he finds the food delicious if he eats it not later than the \"best-by\" date. Otherwise, he does not find it delicious.\n\nTakahashi bought some food A days before the \"best-by\" date, and ate it B days after he bought it.\n\nWrite a program that outputs delicious if he found it delicious, safe if he did not found it delicious but did not get a stomachache either, and dangerous if he got a stomachache.\n\nConstraints\n\n1 ≤ X,A,B ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A B\n\nOutput\n\nPrint delicious if Takahashi found the food delicious; print safe if he neither found it delicious nor got a stomachache; print dangerous if he got a stomachache.\n\nSample Input 1\n\n4 3 6\n\nSample Output 1\n\nsafe\n\nHe ate the food three days after the \"best-by\" date. It was not delicious or harmful for him.\n\nSample Input 2\n\n6 5 1\n\nSample Output 2\n\ndelicious\n\nHe ate the food by the \"best-by\" date. It was delicious for him.\n\nSample Input 3\n\n3 7 12\n\nSample Output 3\n\ndangerous\n\nHe ate the food five days after the \"best-by\" date. It was harmful for him.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 174, "cpu_time_ms": 2, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s782633952", "group_id": "codeNet:p03679", "input_text": "let _ = Scanf.sscanf (read_line()) \"%d %d %d\" (fun x a b ->\n  if b <= a then \"delicious\" else\n  if x + a < b then \"dangerous\" else \"safe\"\n) |> print_endline", "language": "OCaml", "metadata": {"date": 1584323775, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03679.html", "problem_id": "p03679", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03679/input.txt", "sample_output_relpath": "derived/input_output/data/p03679/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03679/OCaml/s782633952.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s782633952", "user_id": "u511870776"}, "prompt_components": {"gold_output": "safe\n", "input_to_evaluate": "let _ = Scanf.sscanf (read_line()) \"%d %d %d\" (fun x a b ->\n  if b <= a then \"delicious\" else\n  if x + a < b then \"dangerous\" else \"safe\"\n) |> print_endline", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi has a strong stomach. He never gets a stomachache from eating something whose \"best-by\" date is at most X days earlier.\nHe gets a stomachache if the \"best-by\" date of the food is X+1 or more days earlier, though.\n\nOther than that, he finds the food delicious if he eats it not later than the \"best-by\" date. Otherwise, he does not find it delicious.\n\nTakahashi bought some food A days before the \"best-by\" date, and ate it B days after he bought it.\n\nWrite a program that outputs delicious if he found it delicious, safe if he did not found it delicious but did not get a stomachache either, and dangerous if he got a stomachache.\n\nConstraints\n\n1 ≤ X,A,B ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A B\n\nOutput\n\nPrint delicious if Takahashi found the food delicious; print safe if he neither found it delicious nor got a stomachache; print dangerous if he got a stomachache.\n\nSample Input 1\n\n4 3 6\n\nSample Output 1\n\nsafe\n\nHe ate the food three days after the \"best-by\" date. It was not delicious or harmful for him.\n\nSample Input 2\n\n6 5 1\n\nSample Output 2\n\ndelicious\n\nHe ate the food by the \"best-by\" date. It was delicious for him.\n\nSample Input 3\n\n3 7 12\n\nSample Output 3\n\ndangerous\n\nHe ate the food five days after the \"best-by\" date. It was harmful for him.", "sample_input": "4 3 6\n"}, "reference_outputs": ["safe\n"], "source_document_id": "p03679", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi has a strong stomach. He never gets a stomachache from eating something whose \"best-by\" date is at most X days earlier.\nHe gets a stomachache if the \"best-by\" date of the food is X+1 or more days earlier, though.\n\nOther than that, he finds the food delicious if he eats it not later than the \"best-by\" date. Otherwise, he does not find it delicious.\n\nTakahashi bought some food A days before the \"best-by\" date, and ate it B days after he bought it.\n\nWrite a program that outputs delicious if he found it delicious, safe if he did not found it delicious but did not get a stomachache either, and dangerous if he got a stomachache.\n\nConstraints\n\n1 ≤ X,A,B ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A B\n\nOutput\n\nPrint delicious if Takahashi found the food delicious; print safe if he neither found it delicious nor got a stomachache; print dangerous if he got a stomachache.\n\nSample Input 1\n\n4 3 6\n\nSample Output 1\n\nsafe\n\nHe ate the food three days after the \"best-by\" date. It was not delicious or harmful for him.\n\nSample Input 2\n\n6 5 1\n\nSample Output 2\n\ndelicious\n\nHe ate the food by the \"best-by\" date. It was delicious for him.\n\nSample Input 3\n\n3 7 12\n\nSample Output 3\n\ndangerous\n\nHe ate the food five days after the \"best-by\" date. It was harmful for him.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 156, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s768318614", "group_id": "codeNet:p03679", "input_text": "Scanf.scanf \"%d %d %d\" @@ fun x a b -> print_endline @@ if b <= a then \"delicious\" else if b > a + x then \"dangerous\" else \"safe\"", "language": "OCaml", "metadata": {"date": 1581348308, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03679.html", "problem_id": "p03679", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03679/input.txt", "sample_output_relpath": "derived/input_output/data/p03679/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03679/OCaml/s768318614.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s768318614", "user_id": "u732304692"}, "prompt_components": {"gold_output": "safe\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" @@ fun x a b -> print_endline @@ if b <= a then \"delicious\" else if b > a + x then \"dangerous\" else \"safe\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi has a strong stomach. He never gets a stomachache from eating something whose \"best-by\" date is at most X days earlier.\nHe gets a stomachache if the \"best-by\" date of the food is X+1 or more days earlier, though.\n\nOther than that, he finds the food delicious if he eats it not later than the \"best-by\" date. Otherwise, he does not find it delicious.\n\nTakahashi bought some food A days before the \"best-by\" date, and ate it B days after he bought it.\n\nWrite a program that outputs delicious if he found it delicious, safe if he did not found it delicious but did not get a stomachache either, and dangerous if he got a stomachache.\n\nConstraints\n\n1 ≤ X,A,B ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A B\n\nOutput\n\nPrint delicious if Takahashi found the food delicious; print safe if he neither found it delicious nor got a stomachache; print dangerous if he got a stomachache.\n\nSample Input 1\n\n4 3 6\n\nSample Output 1\n\nsafe\n\nHe ate the food three days after the \"best-by\" date. It was not delicious or harmful for him.\n\nSample Input 2\n\n6 5 1\n\nSample Output 2\n\ndelicious\n\nHe ate the food by the \"best-by\" date. It was delicious for him.\n\nSample Input 3\n\n3 7 12\n\nSample Output 3\n\ndangerous\n\nHe ate the food five days after the \"best-by\" date. It was harmful for him.", "sample_input": "4 3 6\n"}, "reference_outputs": ["safe\n"], "source_document_id": "p03679", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi has a strong stomach. He never gets a stomachache from eating something whose \"best-by\" date is at most X days earlier.\nHe gets a stomachache if the \"best-by\" date of the food is X+1 or more days earlier, though.\n\nOther than that, he finds the food delicious if he eats it not later than the \"best-by\" date. Otherwise, he does not find it delicious.\n\nTakahashi bought some food A days before the \"best-by\" date, and ate it B days after he bought it.\n\nWrite a program that outputs delicious if he found it delicious, safe if he did not found it delicious but did not get a stomachache either, and dangerous if he got a stomachache.\n\nConstraints\n\n1 ≤ X,A,B ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A B\n\nOutput\n\nPrint delicious if Takahashi found the food delicious; print safe if he neither found it delicious nor got a stomachache; print dangerous if he got a stomachache.\n\nSample Input 1\n\n4 3 6\n\nSample Output 1\n\nsafe\n\nHe ate the food three days after the \"best-by\" date. It was not delicious or harmful for him.\n\nSample Input 2\n\n6 5 1\n\nSample Output 2\n\ndelicious\n\nHe ate the food by the \"best-by\" date. It was delicious for him.\n\nSample Input 3\n\n3 7 12\n\nSample Output 3\n\ndangerous\n\nHe ate the food five days after the \"best-by\" date. It was harmful for him.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 129, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s895303072", "group_id": "codeNet:p03680", "input_text": "open Batteries\nopen Printf\nlet () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  let a_lst = Array.to_list @@ Array.init n (fun i -> (Scanf.scanf \"%d \" (fun a -> a))) in\n\n  let rec aux visited i cnt =\n    let next = (List.nth a_lst i)-1 in\n    if List.mem i visited then -1 else\n    if i = 1 then cnt else\n      aux (i::visited) next (cnt+1)\n  in\n\n  Printf.printf \"%d\\n\" @@\n  aux [] 0 0 \n", "language": "OCaml", "metadata": {"date": 1529328320, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s895303072.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s895303072", "user_id": "u139013163"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "open Batteries\nopen Printf\nlet () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  let a_lst = Array.to_list @@ Array.init n (fun i -> (Scanf.scanf \"%d \" (fun a -> a))) in\n\n  let rec aux visited i cnt =\n    let next = (List.nth a_lst i)-1 in\n    if List.mem i visited then -1 else\n    if i = 1 then cnt else\n      aux (i::visited) next (cnt+1)\n  in\n\n  Printf.printf \"%d\\n\" @@\n  aux [] 0 0 \n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi wants to gain muscle, and decides to work out at AtCoder Gym.\n\nThe exercise machine at the gym has N buttons, and exactly one of the buttons is lighten up.\nThese buttons are numbered 1 through N.\nWhen Button i is lighten up and you press it, the light is turned off, and then Button a_i will be lighten up. It is possible that i=a_i.\nWhen Button i is not lighten up, nothing will happen by pressing it.\n\nInitially, Button 1 is lighten up. Takahashi wants to quit pressing buttons when Button 2 is lighten up.\n\nDetermine whether this is possible. If the answer is positive, find the minimum number of times he needs to press buttons.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\na_2\n:\na_N\n\nOutput\n\nPrint -1 if it is impossible to lighten up Button 2.\nOtherwise, print the minimum number of times we need to press buttons in order to lighten up Button 2.\n\nSample Input 1\n\n3\n3\n1\n2\n\nSample Output 1\n\n2\n\nPress Button 1, then Button 3.\n\nSample Input 2\n\n4\n3\n4\n1\n2\n\nSample Output 2\n\n-1\n\nPressing Button 1 lightens up Button 3, and vice versa, so Button 2 will never be lighten up.\n\nSample Input 3\n\n5\n3\n3\n4\n2\n4\n\nSample Output 3\n\n3", "sample_input": "3\n3\n1\n2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03680", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi wants to gain muscle, and decides to work out at AtCoder Gym.\n\nThe exercise machine at the gym has N buttons, and exactly one of the buttons is lighten up.\nThese buttons are numbered 1 through N.\nWhen Button i is lighten up and you press it, the light is turned off, and then Button a_i will be lighten up. It is possible that i=a_i.\nWhen Button i is not lighten up, nothing will happen by pressing it.\n\nInitially, Button 1 is lighten up. Takahashi wants to quit pressing buttons when Button 2 is lighten up.\n\nDetermine whether this is possible. If the answer is positive, find the minimum number of times he needs to press buttons.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\na_2\n:\na_N\n\nOutput\n\nPrint -1 if it is impossible to lighten up Button 2.\nOtherwise, print the minimum number of times we need to press buttons in order to lighten up Button 2.\n\nSample Input 1\n\n3\n3\n1\n2\n\nSample Output 1\n\n2\n\nPress Button 1, then Button 3.\n\nSample Input 2\n\n4\n3\n4\n1\n2\n\nSample Output 2\n\n-1\n\nPressing Button 1 lightens up Button 3, and vice versa, so Button 2 will never be lighten up.\n\nSample Input 3\n\n5\n3\n3\n4\n2\n4\n\nSample Output 3\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 389, "cpu_time_ms": 2104, "memory_kb": 8320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s633154149", "group_id": "codeNet:p03681", "input_text": "let n, m = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet ( * ) a b = a * b mod 1000000007\nlet rec f n a = if n <= 1 then a else f (n - 1) (a * n)\nlet _ = Printf.printf \"%d\\n\" @@ f n 1 * f m 1 * max 0 (2 - abs (n - m))", "language": "OCaml", "metadata": {"date": 1570646479, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s633154149.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s633154149", "user_id": "u732304692"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "let n, m = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet ( * ) a b = a * b mod 1000000007\nlet rec f n a = if n <= 1 then a else f (n - 1) (a * n)\nlet _ = Printf.printf \"%d\\n\" @@ f n 1 * f m 1 * max 0 (2 - abs (n - m))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has N dogs and M monkeys. He wants them to line up in a row.\n\nAs a Japanese saying goes, these dogs and monkeys are on bad terms. (\"ken'en no naka\", literally \"the relationship of dogs and monkeys\", means a relationship of mutual hatred.) Snuke is trying to reconsile them, by arranging the animals so that there are neither two adjacent dogs nor two adjacent monkeys.\n\nHow many such arrangements there are? Find the count modulo 10^9+7 (since animals cannot understand numbers larger than that).\nHere, dogs and monkeys are both distinguishable. Also, two arrangements that result from reversing each other are distinguished.\n\nConstraints\n\n1 ≤ N,M ≤ 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of possible arrangements, modulo 10^9+7.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n8\n\nWe will denote the dogs by A and B, and the monkeys by C and D. There are eight possible arrangements: ACBD, ADBC, BCAD, BDAC, CADB, CBDA, DACB and DBCA.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\n12\n\nSample Input 3\n\n1 8\n\nSample Output 3\n\n0\n\nSample Input 4\n\n100000 100000\n\nSample Output 4\n\n530123477", "sample_input": "2 2\n"}, "reference_outputs": ["8\n"], "source_document_id": "p03681", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has N dogs and M monkeys. He wants them to line up in a row.\n\nAs a Japanese saying goes, these dogs and monkeys are on bad terms. (\"ken'en no naka\", literally \"the relationship of dogs and monkeys\", means a relationship of mutual hatred.) Snuke is trying to reconsile them, by arranging the animals so that there are neither two adjacent dogs nor two adjacent monkeys.\n\nHow many such arrangements there are? Find the count modulo 10^9+7 (since animals cannot understand numbers larger than that).\nHere, dogs and monkeys are both distinguishable. Also, two arrangements that result from reversing each other are distinguished.\n\nConstraints\n\n1 ≤ N,M ≤ 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of possible arrangements, modulo 10^9+7.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n8\n\nWe will denote the dogs by A and B, and the monkeys by C and D. There are eight possible arrangements: ACBD, ADBC, BCAD, BDAC, CADB, CBDA, DACB and DBCA.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\n12\n\nSample Input 3\n\n1 8\n\nSample Output 3\n\n0\n\nSample Input 4\n\n100000 100000\n\nSample Output 4\n\n530123477", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 215, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s109155170", "group_id": "codeNet:p03682", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let xy = Array.init n (fun i -> Scanf.scanf \" %d %d\" (fun x y -> x, y, i)) in\n    Array.sort compare xy;\n    let module S = Set.Make (struct type t = int * int * int let compare = compare end) in\n    let rec loop j acc =\n        if j = n then acc else\n            let px, _, pi = xy.(j - 1) in\n            let cx, _, ci = xy.(j)     in\n            let acc = S.add (cx - px, pi, ci) acc in\n            loop (j + 1) acc\n    in\n    let edges = loop 1 S.empty in\n    Array.sort (fun (x0, y0, _) (x1, y1, _) -> compare (y0, x0) (y1, x1)) xy;\n    let rec loop j acc =\n        if j = n then acc else\n            let _, py, pi = xy.(j - 1) in\n            let _, cy, ci = xy.(j)     in\n            let acc = S.add (cy - py, pi, ci) acc in\n            loop (j + 1) acc\n    in\n    let edges = loop 1 edges in\n\n    let par = Array.init n (fun i -> i) in\n    let rec root x =\n        if x = par.(x) then x else\n            let r = root par.(x) in\n            let () = par.(x) <- r in\n            r\n    in\n\n    let merge a b =\n        if root a <> root b then par.(par.(b)) <- par.(a)\n    in\n\n    let rec loop edges cost =\n        if S.is_empty edges then cost else (\n            let ((c, n1, n2) as elt) = S.min_elt edges in\n            let edges = S.remove elt edges in\n            if root n1 = root n2 then loop edges cost else (\n                merge n1 n2;\n                loop edges (cost + c)\n            )\n        )\n    in\n    loop edges 0 |> Printf.printf \"%d\\n\"\n)\n", "language": "OCaml", "metadata": {"date": 1589960056, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03682.html", "problem_id": "p03682", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03682/input.txt", "sample_output_relpath": "derived/input_output/data/p03682/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03682/OCaml/s109155170.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s109155170", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let xy = Array.init n (fun i -> Scanf.scanf \" %d %d\" (fun x y -> x, y, i)) in\n    Array.sort compare xy;\n    let module S = Set.Make (struct type t = int * int * int let compare = compare end) in\n    let rec loop j acc =\n        if j = n then acc else\n            let px, _, pi = xy.(j - 1) in\n            let cx, _, ci = xy.(j)     in\n            let acc = S.add (cx - px, pi, ci) acc in\n            loop (j + 1) acc\n    in\n    let edges = loop 1 S.empty in\n    Array.sort (fun (x0, y0, _) (x1, y1, _) -> compare (y0, x0) (y1, x1)) xy;\n    let rec loop j acc =\n        if j = n then acc else\n            let _, py, pi = xy.(j - 1) in\n            let _, cy, ci = xy.(j)     in\n            let acc = S.add (cy - py, pi, ci) acc in\n            loop (j + 1) acc\n    in\n    let edges = loop 1 edges in\n\n    let par = Array.init n (fun i -> i) in\n    let rec root x =\n        if x = par.(x) then x else\n            let r = root par.(x) in\n            let () = par.(x) <- r in\n            r\n    in\n\n    let merge a b =\n        if root a <> root b then par.(par.(b)) <- par.(a)\n    in\n\n    let rec loop edges cost =\n        if S.is_empty edges then cost else (\n            let ((c, n1, n2) as elt) = S.min_elt edges in\n            let edges = S.remove elt edges in\n            if root n1 = root n2 then loop edges cost else (\n                merge n1 n2;\n                loop edges (cost + c)\n            )\n        )\n    in\n    loop edges 0 |> Printf.printf \"%d\\n\"\n)\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N towns on a plane. The i-th town is located at the coordinates (x_i,y_i). There may be more than one town at the same coordinates.\n\nYou can build a road between two towns at coordinates (a,b) and (c,d) for a cost of min(|a-c|,|b-d|) yen (the currency of Japan). It is not possible to build other types of roads.\n\nYour objective is to build roads so that it will be possible to travel between every pair of towns by traversing roads. At least how much money is necessary to achieve this?\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n0 ≤ x_i,y_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n:\nx_N y_N\n\nOutput\n\nPrint the minimum necessary amount of money in order to build roads so that it will be possible to travel between every pair of towns by traversing roads.\n\nSample Input 1\n\n3\n1 5\n3 9\n7 8\n\nSample Output 1\n\n3\n\nBuild a road between Towns 1 and 2, and another between Towns 2 and 3. The total cost is 2+1=3 yen.\n\nSample Input 2\n\n6\n8 3\n4 9\n12 19\n18 1\n13 5\n7 6\n\nSample Output 2\n\n8", "sample_input": "3\n1 5\n3 9\n7 8\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03682", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N towns on a plane. The i-th town is located at the coordinates (x_i,y_i). There may be more than one town at the same coordinates.\n\nYou can build a road between two towns at coordinates (a,b) and (c,d) for a cost of min(|a-c|,|b-d|) yen (the currency of Japan). It is not possible to build other types of roads.\n\nYour objective is to build roads so that it will be possible to travel between every pair of towns by traversing roads. At least how much money is necessary to achieve this?\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n0 ≤ x_i,y_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n:\nx_N y_N\n\nOutput\n\nPrint the minimum necessary amount of money in order to build roads so that it will be possible to travel between every pair of towns by traversing roads.\n\nSample Input 1\n\n3\n1 5\n3 9\n7 8\n\nSample Output 1\n\n3\n\nBuild a road between Towns 1 and 2, and another between Towns 2 and 3. The total cost is 2+1=3 yen.\n\nSample Input 2\n\n6\n8 3\n4 9\n12 19\n18 1\n13 5\n7 6\n\nSample Output 2\n\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1491, "cpu_time_ms": 708, "memory_kb": 36220}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s208817030", "group_id": "codeNet:p03682", "input_text": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list sep conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet n = scan \"%d\" id\nlet ls = scan_lines n \"%d %d\" Tuple2.make\nlet edges = Queue.create ()\n\nmodule UnionFind = struct\n  let empty n = Array.init n id\n\n  let root t n =\n    let rec aux c =\n      if c = t.(c) then c\n      else let p = aux t.(c) in t.(c) <- p; p in\n    aux n\n\n  let unite t v0 v1 =\n    let w0 = root t v0 in\n    let w1 = root t v1 in\n    t.(w1) <- w0\n\n  let same t v0 v1 =\n    root t v0 = root t v1\nend\n\nlet uf = UnionFind.empty n\n\nlet () =\n  let lx = ListL.mapi ls ~f:(fun i (x,_) -> (x,i))\n           |> List.sort Tuple2.compare in\n  let ly = ListL.mapi ls ~f:(fun i (_,y) -> (y,i))\n           |> List.sort Tuple2.compare in\n  ListL.iter (List.combine (List.take (n-1) lx) (List.drop 1 lx))\n    ~f:(fun ((x0,i), (x1,j)) ->\n        let d = Int.abs (x0-x1)  in\n        Queue.add (d, i, j) edges);\n  ListL.iter (List.combine (List.take (n-1) ly) (List.drop 1 ly))\n    ~f:(fun ((x0,i), (x1,j)) ->\n        let d = Int.abs (x0-x1)  in\n        Queue.add (d, i, j) edges);\n  edges\n  |> Queue.enum |> List.of_enum\n  |> List.sort Tuple3.compare\n  |> ListL.map  ~f:(fun (d, i, j) ->\n      if UnionFind.same uf i j then 0\n      else\n        (UnionFind.unite uf i j; d))\n  |> List.sum |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1589774508, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03682.html", "problem_id": "p03682", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03682/input.txt", "sample_output_relpath": "derived/input_output/data/p03682/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03682/OCaml/s208817030.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s208817030", "user_id": "u802614675"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "open Batteries\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\nmodule ArrayL = Array.Labels\n\nlet dbg0 x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\nlet dbg1 x = dbg0 x; x\n\nlet id = identity\n\nlet (++) n m = List.range n `To m\nlet (++-) n m = if n >= m then List.range n `Downto m else []\nlet (++^) n m = if n < m then List.range n `To (pred m) else []\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then []\n  else List.map (fun _ -> scan fmt f) (1 ++ n)\n\nlet scan_list sep cnv =\n  let line = read_line () in\n  (match sep with\n   | None -> List.map String.of_char @@ String.to_list line\n   | Some sep -> String.split_on_char sep line)\n  |> List.map cnv\n\nlet scan_array ?sep cnv = Array.of_list @@ scan_list sep cnv\n\nlet scan_matrix n m e ?sep conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (0 ++^ n)\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list sep conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet permutations l =\n  let rec aux l =\n    let rec interleave x = function\n      | [] -> [[x]]\n      | (hd::tl) as lst ->\n        (x::lst) ::\n        (ListL.map ~f:(List.cons hd)  @@ interleave x tl)\n    in\n    match l with\n    | [] -> [[]]\n    | hd::tl -> List.concat @@ List.map (interleave hd) @@ aux tl in\n  let l = List.sort (List.compare Int.compare) @@ aux @@ List.of_enum l in\n  List.enum % ListL.map ~f:List.enum @@ l\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet zip l m =\n  let n = min (List.length l) (List.length m) in\n  List.combine (List.take n l) (List.take n m)\n\nlet lower_bound n f =\n  let rec aux l u =\n    if u - l > 1 then\n      let m = (l + u) / 2 in\n      if f m then aux l m\n      else aux m u\n    else u in aux (-1) n\n\nlet between n x m = n <= x && x < m\n\nlet n = scan \"%d\" id\nlet ls = scan_lines n \"%d %d\" Tuple2.make\nlet edges = Queue.create ()\n\nmodule UnionFind = struct\n  let empty n = Array.init n id\n\n  let root t n =\n    let rec aux c =\n      if c = t.(c) then c\n      else let p = aux t.(c) in t.(c) <- p; p in\n    aux n\n\n  let unite t v0 v1 =\n    let w0 = root t v0 in\n    let w1 = root t v1 in\n    t.(w1) <- w0\n\n  let same t v0 v1 =\n    root t v0 = root t v1\nend\n\nlet uf = UnionFind.empty n\n\nlet () =\n  let lx = ListL.mapi ls ~f:(fun i (x,_) -> (x,i))\n           |> List.sort Tuple2.compare in\n  let ly = ListL.mapi ls ~f:(fun i (_,y) -> (y,i))\n           |> List.sort Tuple2.compare in\n  ListL.iter (List.combine (List.take (n-1) lx) (List.drop 1 lx))\n    ~f:(fun ((x0,i), (x1,j)) ->\n        let d = Int.abs (x0-x1)  in\n        Queue.add (d, i, j) edges);\n  ListL.iter (List.combine (List.take (n-1) ly) (List.drop 1 ly))\n    ~f:(fun ((x0,i), (x1,j)) ->\n        let d = Int.abs (x0-x1)  in\n        Queue.add (d, i, j) edges);\n  edges\n  |> Queue.enum |> List.of_enum\n  |> List.sort Tuple3.compare\n  |> ListL.map  ~f:(fun (d, i, j) ->\n      if UnionFind.same uf i j then 0\n      else\n        (UnionFind.unite uf i j; d))\n  |> List.sum |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N towns on a plane. The i-th town is located at the coordinates (x_i,y_i). There may be more than one town at the same coordinates.\n\nYou can build a road between two towns at coordinates (a,b) and (c,d) for a cost of min(|a-c|,|b-d|) yen (the currency of Japan). It is not possible to build other types of roads.\n\nYour objective is to build roads so that it will be possible to travel between every pair of towns by traversing roads. At least how much money is necessary to achieve this?\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n0 ≤ x_i,y_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n:\nx_N y_N\n\nOutput\n\nPrint the minimum necessary amount of money in order to build roads so that it will be possible to travel between every pair of towns by traversing roads.\n\nSample Input 1\n\n3\n1 5\n3 9\n7 8\n\nSample Output 1\n\n3\n\nBuild a road between Towns 1 and 2, and another between Towns 2 and 3. The total cost is 2+1=3 yen.\n\nSample Input 2\n\n6\n8 3\n4 9\n12 19\n18 1\n13 5\n7 6\n\nSample Output 2\n\n8", "sample_input": "3\n1 5\n3 9\n7 8\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03682", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N towns on a plane. The i-th town is located at the coordinates (x_i,y_i). There may be more than one town at the same coordinates.\n\nYou can build a road between two towns at coordinates (a,b) and (c,d) for a cost of min(|a-c|,|b-d|) yen (the currency of Japan). It is not possible to build other types of roads.\n\nYour objective is to build roads so that it will be possible to travel between every pair of towns by traversing roads. At least how much money is necessary to achieve this?\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n0 ≤ x_i,y_i ≤ 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n:\nx_N y_N\n\nOutput\n\nPrint the minimum necessary amount of money in order to build roads so that it will be possible to travel between every pair of towns by traversing roads.\n\nSample Input 1\n\n3\n1 5\n3 9\n7 8\n\nSample Output 1\n\n3\n\nBuild a road between Towns 1 and 2, and another between Towns 2 and 3. The total cost is 2+1=3 yen.\n\nSample Input 2\n\n6\n8 3\n4 9\n12 19\n18 1\n13 5\n7 6\n\nSample Output 2\n\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3213, "cpu_time_ms": 644, "memory_kb": 42492}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s318019511", "group_id": "codeNet:p03687", "input_text": "let () =\n  let s = read_line () in\n  let rec shrink a ss c =\n    let sl = String.length ss in\n    if  sl = 1 || (ss = String.make sl c) then a\n    else\n      let ns = String.init (sl - 1) (fun i -> if ss.[i] = c || ss.[i+1] = c then c else ss.[i]) in\n      shrink (a+1) ns c in\n  let tbl = ['a';'b';'c';'d';'e';'f';'g';'h';'i';'j';'k';'l';'m';'n';'o';'p';'q';'r';'s';'t';'u';'v';'w';'x';'y';'z'] in\n  List.map (shrink 0 s) tbl |> List.sort compare |> List.hd |> string_of_int |> print_endline\n\n", "language": "OCaml", "metadata": {"date": 1497836911, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s318019511.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s318019511", "user_id": "u388783188"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let () =\n  let s = read_line () in\n  let rec shrink a ss c =\n    let sl = String.length ss in\n    if  sl = 1 || (ss = String.make sl c) then a\n    else\n      let ns = String.init (sl - 1) (fun i -> if ss.[i] = c || ss.[i+1] = c then c else ss.[i]) in\n      shrink (a+1) ns c in\n  let tbl = ['a';'b';'c';'d';'e';'f';'g';'h';'i';'j';'k';'l';'m';'n';'o';'p';'q';'r';'s';'t';'u';'v';'w';'x';'y';'z'] in\n  List.map (shrink 0 s) tbl |> List.sort compare |> List.hd |> string_of_int |> print_endline\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 494, "cpu_time_ms": 2, "memory_kb": 768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s488218287", "group_id": "codeNet:p03688", "input_text": "print_endline @@\n  Scanf.scanf \"%d\" @@ fun n ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  Array.sort (-) a;\n  let l, r = a.(0), a.(n-1) in\n  if r-l >= 2 then \"No\" else\n  if l = r then\n    if n = l + 1 || n >= 2 * l then \"Yes\" else \"No\"\n  else\n  (* l+1 = r *)\n  let lc = Array.fold_left (fun s x -> s + a.(n-1) - x) 0 a in\n  let rc = n - lc in\n  if lc <= l && rc >= 2 * (r-lc) then \"Yes\" else \"No\"", "language": "OCaml", "metadata": {"date": 1534926247, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03688.html", "problem_id": "p03688", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03688/input.txt", "sample_output_relpath": "derived/input_output/data/p03688/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03688/OCaml/s488218287.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s488218287", "user_id": "u798181098"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "print_endline @@\n  Scanf.scanf \"%d\" @@ fun n ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  Array.sort (-) a;\n  let l, r = a.(0), a.(n-1) in\n  if r-l >= 2 then \"No\" else\n  if l = r then\n    if n = l + 1 || n >= 2 * l then \"Yes\" else \"No\"\n  else\n  (* l+1 = r *)\n  let lc = Array.fold_left (fun s x -> s + a.(n-1) - x) 0 a in\n  let rc = n - lc in\n  if lc <= l && rc >= 2 * (r-lc) then \"Yes\" else \"No\"", "problem_context": "Score : 700 points\n\nProblem Statement\n\nThere are N cats.\nWe number them from 1 through N.\n\nEach of the cats wears a hat.\nCat i says: \"there are exactly a_i different colors among the N - 1 hats worn by the cats except me.\"\n\nDetermine whether there exists a sequence of colors of the hats that is consistent with the remarks of the cats.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ N-1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint Yes if there exists a sequence of colors of the hats that is consistent with the remarks of the cats; print No otherwise.\n\nSample Input 1\n\n3\n1 2 2\n\nSample Output 1\n\nYes\n\nFor example, if cat 1, 2 and 3 wears red, blue and blue hats, respectively, it is consistent with the remarks of the cats.\n\nSample Input 2\n\n3\n1 1 2\n\nSample Output 2\n\nNo\n\nFrom the remark of cat 1, we can see that cat 2 and 3 wear hats of the same color.\nAlso, from the remark of cat 2, we can see that cat 1 and 3 wear hats of the same color.\nTherefore, cat 1 and 2 wear hats of the same color, which contradicts the remark of cat 3.\n\nSample Input 3\n\n5\n4 3 4 3 4\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\n2 2 2\n\nSample Output 4\n\nYes\n\nSample Input 5\n\n4\n2 2 2 2\n\nSample Output 5\n\nYes\n\nSample Input 6\n\n5\n3 3 3 3 3\n\nSample Output 6\n\nNo", "sample_input": "3\n1 2 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03688", "source_text": "Score : 700 points\n\nProblem Statement\n\nThere are N cats.\nWe number them from 1 through N.\n\nEach of the cats wears a hat.\nCat i says: \"there are exactly a_i different colors among the N - 1 hats worn by the cats except me.\"\n\nDetermine whether there exists a sequence of colors of the hats that is consistent with the remarks of the cats.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ N-1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint Yes if there exists a sequence of colors of the hats that is consistent with the remarks of the cats; print No otherwise.\n\nSample Input 1\n\n3\n1 2 2\n\nSample Output 1\n\nYes\n\nFor example, if cat 1, 2 and 3 wears red, blue and blue hats, respectively, it is consistent with the remarks of the cats.\n\nSample Input 2\n\n3\n1 1 2\n\nSample Output 2\n\nNo\n\nFrom the remark of cat 1, we can see that cat 2 and 3 wear hats of the same color.\nAlso, from the remark of cat 2, we can see that cat 1 and 3 wear hats of the same color.\nTherefore, cat 1 and 2 wear hats of the same color, which contradicts the remark of cat 3.\n\nSample Input 3\n\n5\n4 3 4 3 4\n\nSample Output 3\n\nNo\n\nSample Input 4\n\n3\n2 2 2\n\nSample Output 4\n\nYes\n\nSample Input 5\n\n4\n2 2 2 2\n\nSample Output 5\n\nYes\n\nSample Input 6\n\n5\n3 3 3 3 3\n\nSample Output 6\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 419, "cpu_time_ms": 51, "memory_kb": 5248}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s224803815", "group_id": "codeNet:p03693", "input_text": "let _ = Scanf.sscanf (read_line()) \"%s %s %s\" (fun r g b ->\n  if (int_of_string (r ^ g ^ b)) mod 4 = 0 then \"YES\" else \"NO\"\n)", "language": "OCaml", "metadata": {"date": 1584325252, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03693.html", "problem_id": "p03693", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03693/input.txt", "sample_output_relpath": "derived/input_output/data/p03693/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03693/OCaml/s224803815.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s224803815", "user_id": "u511870776"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let _ = Scanf.sscanf (read_line()) \"%s %s %s\" (fun r g b ->\n  if (int_of_string (r ^ g ^ b)) mod 4 = 0 then \"YES\" else \"NO\"\n)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer has three cards, one red, one green and one blue.\n\nAn integer between 1 and 9 (inclusive) is written on each card: r on the red card, g on the green card and b on the blue card.\n\nWe will arrange the cards in the order red, green and blue from left to right, and read them as a three-digit integer.\n\nIs this integer a multiple of 4?\n\nConstraints\n\n1 ≤ r, g, b ≤ 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr g b\n\nOutput\n\nIf the three-digit integer is a multiple of 4, print YES (case-sensitive); otherwise, print NO.\n\nSample Input 1\n\n4 3 2\n\nSample Output 1\n\nYES\n\n432 is a multiple of 4, and thus YES should be printed.\n\nSample Input 2\n\n2 3 4\n\nSample Output 2\n\nNO\n\n234 is not a multiple of 4, and thus NO should be printed.", "sample_input": "4 3 2\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03693", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer has three cards, one red, one green and one blue.\n\nAn integer between 1 and 9 (inclusive) is written on each card: r on the red card, g on the green card and b on the blue card.\n\nWe will arrange the cards in the order red, green and blue from left to right, and read them as a three-digit integer.\n\nIs this integer a multiple of 4?\n\nConstraints\n\n1 ≤ r, g, b ≤ 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr g b\n\nOutput\n\nIf the three-digit integer is a multiple of 4, print YES (case-sensitive); otherwise, print NO.\n\nSample Input 1\n\n4 3 2\n\nSample Output 1\n\nYES\n\n432 is a multiple of 4, and thus YES should be printed.\n\nSample Input 2\n\n2 3 4\n\nSample Output 2\n\nNO\n\n234 is not a multiple of 4, and thus NO should be printed.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 125, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s788380870", "group_id": "codeNet:p03693", "input_text": "let f a b c = if (mod) (100*a+10*b+c) 4 = 0 then \"YES\" else \"NO\";;\nScanf.scanf \"%d %d %d\" f\n|> Printf.printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1561001294, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03693.html", "problem_id": "p03693", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03693/input.txt", "sample_output_relpath": "derived/input_output/data/p03693/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03693/OCaml/s788380870.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s788380870", "user_id": "u635974378"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let f a b c = if (mod) (100*a+10*b+c) 4 = 0 then \"YES\" else \"NO\";;\nScanf.scanf \"%d %d %d\" f\n|> Printf.printf \"%s\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer has three cards, one red, one green and one blue.\n\nAn integer between 1 and 9 (inclusive) is written on each card: r on the red card, g on the green card and b on the blue card.\n\nWe will arrange the cards in the order red, green and blue from left to right, and read them as a three-digit integer.\n\nIs this integer a multiple of 4?\n\nConstraints\n\n1 ≤ r, g, b ≤ 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr g b\n\nOutput\n\nIf the three-digit integer is a multiple of 4, print YES (case-sensitive); otherwise, print NO.\n\nSample Input 1\n\n4 3 2\n\nSample Output 1\n\nYES\n\n432 is a multiple of 4, and thus YES should be printed.\n\nSample Input 2\n\n2 3 4\n\nSample Output 2\n\nNO\n\n234 is not a multiple of 4, and thus NO should be printed.", "sample_input": "4 3 2\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03693", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer has three cards, one red, one green and one blue.\n\nAn integer between 1 and 9 (inclusive) is written on each card: r on the red card, g on the green card and b on the blue card.\n\nWe will arrange the cards in the order red, green and blue from left to right, and read them as a three-digit integer.\n\nIs this integer a multiple of 4?\n\nConstraints\n\n1 ≤ r, g, b ≤ 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr g b\n\nOutput\n\nIf the three-digit integer is a multiple of 4, print YES (case-sensitive); otherwise, print NO.\n\nSample Input 1\n\n4 3 2\n\nSample Output 1\n\nYES\n\n432 is a multiple of 4, and thus YES should be printed.\n\nSample Input 2\n\n2 3 4\n\nSample Output 2\n\nNO\n\n234 is not a multiple of 4, and thus NO should be printed.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 116, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s578865970", "group_id": "codeNet:p03693", "input_text": "let () = Scanf.scanf \"%d %d %d\" (fun r g b ->\n  print_endline @@ if (10 * g + b) mod 4 = 0 then \"YES\" else \"NO\")", "language": "OCaml", "metadata": {"date": 1497143665, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03693.html", "problem_id": "p03693", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03693/input.txt", "sample_output_relpath": "derived/input_output/data/p03693/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03693/OCaml/s578865970.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s578865970", "user_id": "u504158101"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" (fun r g b ->\n  print_endline @@ if (10 * g + b) mod 4 = 0 then \"YES\" else \"NO\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer has three cards, one red, one green and one blue.\n\nAn integer between 1 and 9 (inclusive) is written on each card: r on the red card, g on the green card and b on the blue card.\n\nWe will arrange the cards in the order red, green and blue from left to right, and read them as a three-digit integer.\n\nIs this integer a multiple of 4?\n\nConstraints\n\n1 ≤ r, g, b ≤ 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr g b\n\nOutput\n\nIf the three-digit integer is a multiple of 4, print YES (case-sensitive); otherwise, print NO.\n\nSample Input 1\n\n4 3 2\n\nSample Output 1\n\nYES\n\n432 is a multiple of 4, and thus YES should be printed.\n\nSample Input 2\n\n2 3 4\n\nSample Output 2\n\nNO\n\n234 is not a multiple of 4, and thus NO should be printed.", "sample_input": "4 3 2\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03693", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer has three cards, one red, one green and one blue.\n\nAn integer between 1 and 9 (inclusive) is written on each card: r on the red card, g on the green card and b on the blue card.\n\nWe will arrange the cards in the order red, green and blue from left to right, and read them as a three-digit integer.\n\nIs this integer a multiple of 4?\n\nConstraints\n\n1 ≤ r, g, b ≤ 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr g b\n\nOutput\n\nIf the three-digit integer is a multiple of 4, print YES (case-sensitive); otherwise, print NO.\n\nSample Input 1\n\n4 3 2\n\nSample Output 1\n\nYES\n\n432 is a multiple of 4, and thus YES should be printed.\n\nSample Input 2\n\n2 3 4\n\nSample Output 2\n\nNO\n\n234 is not a multiple of 4, and thus NO should be printed.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 112, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s601284262", "group_id": "codeNet:p03694", "input_text": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet _ = Printf.printf \"%d\\n\" @@ Array.fold_left max a_s.(0) a_s - Array.fold_left min a_s.(0) a_s", "language": "OCaml", "metadata": {"date": 1563851104, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s601284262.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s601284262", "user_id": "u732304692"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet _ = Printf.printf \"%d\\n\" @@ Array.fold_left max a_s.(0) a_s - Array.fold_left min a_s.(0) a_s", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s067467523", "group_id": "codeNet:p03694", "input_text": "let () =\n  let n = read_int () in \n  let a = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun x -> x)) in \n  let () = Array.fast_sort compare a in \n  let rec f i sum =\n    if i = n then sum else f (i + 1) (sum + a.(i) - a.(i - 1))\n  in f 1 0\n     |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1521791765, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s067467523.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s067467523", "user_id": "u987869509"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "let () =\n  let n = read_int () in \n  let a = Array.init n (fun _ -> Scanf.scanf \"%d \" (fun x -> x)) in \n  let () = Array.fast_sort compare a in \n  let rec f i sum =\n    if i = n then sum else f (i + 1) (sum + a.(i) - a.(i - 1))\n  in f 1 0\n     |> Printf.printf \"%d\\n\"", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s400700645", "group_id": "codeNet:p03695", "input_text": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet cs = Array.make 9 0\nlet f i = cs.(i) <- cs.(i) + 1\nlet mi = Array.(iter (fun a -> f @@ min 8 @@ a / 400) a_s; fold_left (fun s c -> s + if c > 0 then 1 else 0) 0 cs - min 1 cs.(8))\nlet _ = Printf.printf \"%d %d\\n\" (max 1 mi) @@ if mi = 0 then max 1 @@ cs.(8) - 1 else mi + max 0 cs.(8)", "language": "OCaml", "metadata": {"date": 1568223914, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s400700645.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s400700645", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2 2\n", "input_to_evaluate": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet cs = Array.make 9 0\nlet f i = cs.(i) <- cs.(i) + 1\nlet mi = Array.(iter (fun a -> f @@ min 8 @@ a / 400) a_s; fold_left (fun s c -> s + if c > 0 then 1 else 0) 0 cs - min 1 cs.(8))\nlet _ = Printf.printf \"%d %d\\n\" (max 1 mi) @@ if mi = 0 then max 1 @@ cs.(8) - 1 else mi + max 0 cs.(8)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIn AtCoder, a person who has participated in a contest receives a color, which corresponds to the person's rating as follows:\n\nRating 1-399 : gray\n\nRating 400-799 : brown\n\nRating 800-1199 : green\n\nRating 1200-1599 : cyan\n\nRating 1600-1999 : blue\n\nRating 2000-2399 : yellow\n\nRating 2400-2799 : orange\n\nRating 2800-3199 : red\n\nOther than the above, a person whose rating is 3200 or higher can freely pick his/her color, which can be one of the eight colors above or not.\n\nCurrently, there are N users who have participated in a contest in AtCoder, and the i-th user has a rating of a_i.\n\nFind the minimum and maximum possible numbers of different colors of the users.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ a_i ≤ 4800\n\na_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum possible number of different colors of the users, and the maximum possible number of different colors, with a space in between.\n\nSample Input 1\n\n4\n2100 2500 2700 2700\n\nSample Output 1\n\n2 2\n\nThe user with rating 2100 is \"yellow\", and the others are \"orange\". There are two different colors.\n\nSample Input 2\n\n5\n1100 1900 2800 3200 3200\n\nSample Output 2\n\n3 5\n\nThe user with rating 1100 is \"green\", the user with rating 1900 is blue and the user with rating 2800 is \"red\".\n\nIf the fourth user picks \"red\", and the fifth user picks \"blue\", there are three different colors. This is one possible scenario for the minimum number of colors.\n\nIf the fourth user picks \"purple\", and the fifth user picks \"black\", there are five different colors. This is one possible scenario for the maximum number of colors.\n\nSample Input 3\n\n20\n800 810 820 830 840 850 860 870 880 890 900 910 920 930 940 950 960 970 980 990\n\nSample Output 3\n\n1 1\n\nAll the users are \"green\", and thus there is one color.", "sample_input": "4\n2100 2500 2700 2700\n"}, "reference_outputs": ["2 2\n"], "source_document_id": "p03695", "source_text": "Score : 300 points\n\nProblem Statement\n\nIn AtCoder, a person who has participated in a contest receives a color, which corresponds to the person's rating as follows:\n\nRating 1-399 : gray\n\nRating 400-799 : brown\n\nRating 800-1199 : green\n\nRating 1200-1599 : cyan\n\nRating 1600-1999 : blue\n\nRating 2000-2399 : yellow\n\nRating 2400-2799 : orange\n\nRating 2800-3199 : red\n\nOther than the above, a person whose rating is 3200 or higher can freely pick his/her color, which can be one of the eight colors above or not.\n\nCurrently, there are N users who have participated in a contest in AtCoder, and the i-th user has a rating of a_i.\n\nFind the minimum and maximum possible numbers of different colors of the users.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ a_i ≤ 4800\n\na_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum possible number of different colors of the users, and the maximum possible number of different colors, with a space in between.\n\nSample Input 1\n\n4\n2100 2500 2700 2700\n\nSample Output 1\n\n2 2\n\nThe user with rating 2100 is \"yellow\", and the others are \"orange\". There are two different colors.\n\nSample Input 2\n\n5\n1100 1900 2800 3200 3200\n\nSample Output 2\n\n3 5\n\nThe user with rating 1100 is \"green\", the user with rating 1900 is blue and the user with rating 2800 is \"red\".\n\nIf the fourth user picks \"red\", and the fifth user picks \"blue\", there are three different colors. This is one possible scenario for the minimum number of colors.\n\nIf the fourth user picks \"purple\", and the fifth user picks \"black\", there are five different colors. This is one possible scenario for the maximum number of colors.\n\nSample Input 3\n\n20\n800 810 820 830 840 850 860 870 880 890 900 910 920 930 940 950 960 970 980 990\n\nSample Output 3\n\n1 1\n\nAll the users are \"green\", and thus there is one color.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 379, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s884171250", "group_id": "codeNet:p03695", "input_text": "open Printf open Scanf\nmodule MyInt = struct let (+) = (+) let (-) = (-) let (/) = (/) let ( * ) = ( * ) let (mod) = (mod) let (%) = (mod) let (+=) r v = r := !r + v let (-=) r v = r := !r - v let ( *=) r v= r := !r * v let (/=) r v = r := !r / v end\nmodule MyInt64 = struct\n\tlet (+$) = (+) let (-$) = (-) let (/$) = (/) let ( *$) = ( * ) let (+) p q = Int64.add p q let (-) p q = Int64.sub p q let ( * ) p q = Int64.mul p q let (/) p q = Int64.div p q let (+=) r v = r := !r + v let (-=) r v = r := !r - v let ( *=) r v= r := !r * v let (/=) r v = r := !r / v let labs p = if p < 0L then -1L*p else p let (~|) p = Int64.to_int p let (~~|) p = Int64.of_int p let input_i64_array n = Array.init (~| n) (fun _ -> Scanf.scanf \" %Ld\" (fun v -> v)) let get_i64 _ = Scanf.scanf \" %Ld\" (fun v -> v) let get_2_i64 _ = Scanf.scanf \" %Ld %Ld\" (fun u v -> u,v) let get_3_i64 _ = Scanf.scanf \" %Ld %Ld %Ld\" (fun u v w -> u,v,w) let get_4_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld\" (fun u v w x -> u,v,w,x) let get_5_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld %Ld\" (fun u v w x y -> u,v,w,x,y) let print_i64_endline n = n |> Int64.to_string |> print_endline let (mod) m n = m - (m/n) * n let (%) = (mod) let rec gcd m n = match m,n with | m,0L -> m | m,n -> gcd n (m mod n) let lcm m n = (m*n) / gcd m n let rep from_ to_ fbod = let i,f = ref ~|from_,ref true in while !i <= ~|to_ && !f do match fbod ~~| !i with | `Break -> f := false | _ -> i := !i +$ 1; done let repb from_ to_ fbod = let i,f = ref ~|from_,ref true in while !i <= ~|to_ && !f do match fbod (~~| !i) with | `Break -> f := false | _ -> i := !i +$ 1 done; !f let repm from_ to_ m_init fbod = let i,f,m = ref ~|from_,ref true,ref m_init in while !i <= ~|to_ && !f do match fbod !m (~~| !i) with | `Break -> f := false | `Break_m m' -> (f := false; m := m') | `Ok m' -> (i := !i +$ 1; m := m') done; !m let repmb from_ to_ m_init fbod = let i,f,m = ref ~|from_,ref true,ref m_init in while !i <= ~|to_ && !f do match fbod (~~| !i) !m with | `Break -> f := false | `Break_m m' -> (f := false; m := m') | `Ok m' -> (i := !i +$ 1; m := m') done; (!m,!f) let string_of_list ?(separator=\" \") f ls = let rec f0 a s = match a with | [] -> s | [h] -> s ^ (f h) ^ separator | h::t -> f0 t (s ^ (f h) ^ separator) in f0 ls \"\" let char_list_of_string str = let rec f0 i a = if i<0 then a else f0 (i-$1) (str.[i]::a) in f0 (String.length str -$ 1) [] let string_of_char_list ls = List.fold_left (fun u v -> u ^ (String.make 1 v)) \"\" ls\n\tlet (@@@) = (@) let (@) a i = a.(~|i) let (<@) a (i,v) = a.(~|i) <- v\n\tlet ceildiv m n = (m+n-1L) / n\nend open MyInt64\n\nlet f v =\n\t[v<400L;v<800L;v<1200L;v<1600L;v<2000L;v<2400L;v<2800L;v<3200L;v>=3200L]\n\t|> List.rev\n\t|> List.mapi (fun i v -> i,v)\n\t|> List.fold_left (fun u (i,v) -> if v then 8-$i else u) 0\n\t|> Int64.of_int\nlet (<+) a (i,v) = a<@(i,(a@i)+v)\nlet () =\n\tlet n = get_i64 0 in\n\tlet a = input_i64_array n in\n\tlet count = Array.make 9 0L in\n\tArray.iter (fun v ->\n\t\tcount<+(f v,1L);\n\t) a;\n\tlet p,q = repm 0L 8L 0L (fun u i ->\n\t\tlet v = count@i in `Ok (u + if i<>8L && v>0L then 1L else 0L)\n\t), count@8L\n\tin\n\t(* a person whose rating is 3200 or higher can freely pick his/her color,\n\t****which can be one of the eight colors above or not****. *)\n\tprintf \"%Ld %Ld\\n\" (max p 1L) (*min 8L *)(p+q)(**)\n\n\n", "language": "OCaml", "metadata": {"date": 1536506222, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s884171250.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s884171250", "user_id": "u481480055"}, "prompt_components": {"gold_output": "2 2\n", "input_to_evaluate": "open Printf open Scanf\nmodule MyInt = struct let (+) = (+) let (-) = (-) let (/) = (/) let ( * ) = ( * ) let (mod) = (mod) let (%) = (mod) let (+=) r v = r := !r + v let (-=) r v = r := !r - v let ( *=) r v= r := !r * v let (/=) r v = r := !r / v end\nmodule MyInt64 = struct\n\tlet (+$) = (+) let (-$) = (-) let (/$) = (/) let ( *$) = ( * ) let (+) p q = Int64.add p q let (-) p q = Int64.sub p q let ( * ) p q = Int64.mul p q let (/) p q = Int64.div p q let (+=) r v = r := !r + v let (-=) r v = r := !r - v let ( *=) r v= r := !r * v let (/=) r v = r := !r / v let labs p = if p < 0L then -1L*p else p let (~|) p = Int64.to_int p let (~~|) p = Int64.of_int p let input_i64_array n = Array.init (~| n) (fun _ -> Scanf.scanf \" %Ld\" (fun v -> v)) let get_i64 _ = Scanf.scanf \" %Ld\" (fun v -> v) let get_2_i64 _ = Scanf.scanf \" %Ld %Ld\" (fun u v -> u,v) let get_3_i64 _ = Scanf.scanf \" %Ld %Ld %Ld\" (fun u v w -> u,v,w) let get_4_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld\" (fun u v w x -> u,v,w,x) let get_5_i64 _ = Scanf.scanf \" %Ld %Ld %Ld %Ld %Ld\" (fun u v w x y -> u,v,w,x,y) let print_i64_endline n = n |> Int64.to_string |> print_endline let (mod) m n = m - (m/n) * n let (%) = (mod) let rec gcd m n = match m,n with | m,0L -> m | m,n -> gcd n (m mod n) let lcm m n = (m*n) / gcd m n let rep from_ to_ fbod = let i,f = ref ~|from_,ref true in while !i <= ~|to_ && !f do match fbod ~~| !i with | `Break -> f := false | _ -> i := !i +$ 1; done let repb from_ to_ fbod = let i,f = ref ~|from_,ref true in while !i <= ~|to_ && !f do match fbod (~~| !i) with | `Break -> f := false | _ -> i := !i +$ 1 done; !f let repm from_ to_ m_init fbod = let i,f,m = ref ~|from_,ref true,ref m_init in while !i <= ~|to_ && !f do match fbod !m (~~| !i) with | `Break -> f := false | `Break_m m' -> (f := false; m := m') | `Ok m' -> (i := !i +$ 1; m := m') done; !m let repmb from_ to_ m_init fbod = let i,f,m = ref ~|from_,ref true,ref m_init in while !i <= ~|to_ && !f do match fbod (~~| !i) !m with | `Break -> f := false | `Break_m m' -> (f := false; m := m') | `Ok m' -> (i := !i +$ 1; m := m') done; (!m,!f) let string_of_list ?(separator=\" \") f ls = let rec f0 a s = match a with | [] -> s | [h] -> s ^ (f h) ^ separator | h::t -> f0 t (s ^ (f h) ^ separator) in f0 ls \"\" let char_list_of_string str = let rec f0 i a = if i<0 then a else f0 (i-$1) (str.[i]::a) in f0 (String.length str -$ 1) [] let string_of_char_list ls = List.fold_left (fun u v -> u ^ (String.make 1 v)) \"\" ls\n\tlet (@@@) = (@) let (@) a i = a.(~|i) let (<@) a (i,v) = a.(~|i) <- v\n\tlet ceildiv m n = (m+n-1L) / n\nend open MyInt64\n\nlet f v =\n\t[v<400L;v<800L;v<1200L;v<1600L;v<2000L;v<2400L;v<2800L;v<3200L;v>=3200L]\n\t|> List.rev\n\t|> List.mapi (fun i v -> i,v)\n\t|> List.fold_left (fun u (i,v) -> if v then 8-$i else u) 0\n\t|> Int64.of_int\nlet (<+) a (i,v) = a<@(i,(a@i)+v)\nlet () =\n\tlet n = get_i64 0 in\n\tlet a = input_i64_array n in\n\tlet count = Array.make 9 0L in\n\tArray.iter (fun v ->\n\t\tcount<+(f v,1L);\n\t) a;\n\tlet p,q = repm 0L 8L 0L (fun u i ->\n\t\tlet v = count@i in `Ok (u + if i<>8L && v>0L then 1L else 0L)\n\t), count@8L\n\tin\n\t(* a person whose rating is 3200 or higher can freely pick his/her color,\n\t****which can be one of the eight colors above or not****. *)\n\tprintf \"%Ld %Ld\\n\" (max p 1L) (*min 8L *)(p+q)(**)\n\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIn AtCoder, a person who has participated in a contest receives a color, which corresponds to the person's rating as follows:\n\nRating 1-399 : gray\n\nRating 400-799 : brown\n\nRating 800-1199 : green\n\nRating 1200-1599 : cyan\n\nRating 1600-1999 : blue\n\nRating 2000-2399 : yellow\n\nRating 2400-2799 : orange\n\nRating 2800-3199 : red\n\nOther than the above, a person whose rating is 3200 or higher can freely pick his/her color, which can be one of the eight colors above or not.\n\nCurrently, there are N users who have participated in a contest in AtCoder, and the i-th user has a rating of a_i.\n\nFind the minimum and maximum possible numbers of different colors of the users.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ a_i ≤ 4800\n\na_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum possible number of different colors of the users, and the maximum possible number of different colors, with a space in between.\n\nSample Input 1\n\n4\n2100 2500 2700 2700\n\nSample Output 1\n\n2 2\n\nThe user with rating 2100 is \"yellow\", and the others are \"orange\". There are two different colors.\n\nSample Input 2\n\n5\n1100 1900 2800 3200 3200\n\nSample Output 2\n\n3 5\n\nThe user with rating 1100 is \"green\", the user with rating 1900 is blue and the user with rating 2800 is \"red\".\n\nIf the fourth user picks \"red\", and the fifth user picks \"blue\", there are three different colors. This is one possible scenario for the minimum number of colors.\n\nIf the fourth user picks \"purple\", and the fifth user picks \"black\", there are five different colors. This is one possible scenario for the maximum number of colors.\n\nSample Input 3\n\n20\n800 810 820 830 840 850 860 870 880 890 900 910 920 930 940 950 960 970 980 990\n\nSample Output 3\n\n1 1\n\nAll the users are \"green\", and thus there is one color.", "sample_input": "4\n2100 2500 2700 2700\n"}, "reference_outputs": ["2 2\n"], "source_document_id": "p03695", "source_text": "Score : 300 points\n\nProblem Statement\n\nIn AtCoder, a person who has participated in a contest receives a color, which corresponds to the person's rating as follows:\n\nRating 1-399 : gray\n\nRating 400-799 : brown\n\nRating 800-1199 : green\n\nRating 1200-1599 : cyan\n\nRating 1600-1999 : blue\n\nRating 2000-2399 : yellow\n\nRating 2400-2799 : orange\n\nRating 2800-3199 : red\n\nOther than the above, a person whose rating is 3200 or higher can freely pick his/her color, which can be one of the eight colors above or not.\n\nCurrently, there are N users who have participated in a contest in AtCoder, and the i-th user has a rating of a_i.\n\nFind the minimum and maximum possible numbers of different colors of the users.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ a_i ≤ 4800\n\na_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum possible number of different colors of the users, and the maximum possible number of different colors, with a space in between.\n\nSample Input 1\n\n4\n2100 2500 2700 2700\n\nSample Output 1\n\n2 2\n\nThe user with rating 2100 is \"yellow\", and the others are \"orange\". There are two different colors.\n\nSample Input 2\n\n5\n1100 1900 2800 3200 3200\n\nSample Output 2\n\n3 5\n\nThe user with rating 1100 is \"green\", the user with rating 1900 is blue and the user with rating 2800 is \"red\".\n\nIf the fourth user picks \"red\", and the fifth user picks \"blue\", there are three different colors. This is one possible scenario for the minimum number of colors.\n\nIf the fourth user picks \"purple\", and the fifth user picks \"black\", there are five different colors. This is one possible scenario for the maximum number of colors.\n\nSample Input 3\n\n20\n800 810 820 830 840 850 860 870 880 890 900 910 920 930 940 950 960 970 980 990\n\nSample Output 3\n\n1 1\n\nAll the users are \"green\", and thus there is one color.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3277, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s318451113", "group_id": "codeNet:p03695", "input_text": "let n = Scanf.scanf \"%d\" (fun x -> x)\nlet xs = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x / 400)) |> Array.to_list\nlet () =\n  let colors = xs |> List.filter ((>) 8) |> List.sort_uniq (-) |> List.length in\n  let num_reds = xs |> List.filter ((<=) 8) |> List.length in\n  let min_colors, max_colors = max 1 colors, min 7 (colors + num_reds) in\n  Printf.printf \"%d %d\\n\" min_colors max_colors", "language": "OCaml", "metadata": {"date": 1528053548, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s318451113.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s318451113", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2 2\n", "input_to_evaluate": "let n = Scanf.scanf \"%d\" (fun x -> x)\nlet xs = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x / 400)) |> Array.to_list\nlet () =\n  let colors = xs |> List.filter ((>) 8) |> List.sort_uniq (-) |> List.length in\n  let num_reds = xs |> List.filter ((<=) 8) |> List.length in\n  let min_colors, max_colors = max 1 colors, min 7 (colors + num_reds) in\n  Printf.printf \"%d %d\\n\" min_colors max_colors", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIn AtCoder, a person who has participated in a contest receives a color, which corresponds to the person's rating as follows:\n\nRating 1-399 : gray\n\nRating 400-799 : brown\n\nRating 800-1199 : green\n\nRating 1200-1599 : cyan\n\nRating 1600-1999 : blue\n\nRating 2000-2399 : yellow\n\nRating 2400-2799 : orange\n\nRating 2800-3199 : red\n\nOther than the above, a person whose rating is 3200 or higher can freely pick his/her color, which can be one of the eight colors above or not.\n\nCurrently, there are N users who have participated in a contest in AtCoder, and the i-th user has a rating of a_i.\n\nFind the minimum and maximum possible numbers of different colors of the users.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ a_i ≤ 4800\n\na_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum possible number of different colors of the users, and the maximum possible number of different colors, with a space in between.\n\nSample Input 1\n\n4\n2100 2500 2700 2700\n\nSample Output 1\n\n2 2\n\nThe user with rating 2100 is \"yellow\", and the others are \"orange\". There are two different colors.\n\nSample Input 2\n\n5\n1100 1900 2800 3200 3200\n\nSample Output 2\n\n3 5\n\nThe user with rating 1100 is \"green\", the user with rating 1900 is blue and the user with rating 2800 is \"red\".\n\nIf the fourth user picks \"red\", and the fifth user picks \"blue\", there are three different colors. This is one possible scenario for the minimum number of colors.\n\nIf the fourth user picks \"purple\", and the fifth user picks \"black\", there are five different colors. This is one possible scenario for the maximum number of colors.\n\nSample Input 3\n\n20\n800 810 820 830 840 850 860 870 880 890 900 910 920 930 940 950 960 970 980 990\n\nSample Output 3\n\n1 1\n\nAll the users are \"green\", and thus there is one color.", "sample_input": "4\n2100 2500 2700 2700\n"}, "reference_outputs": ["2 2\n"], "source_document_id": "p03695", "source_text": "Score : 300 points\n\nProblem Statement\n\nIn AtCoder, a person who has participated in a contest receives a color, which corresponds to the person's rating as follows:\n\nRating 1-399 : gray\n\nRating 400-799 : brown\n\nRating 800-1199 : green\n\nRating 1200-1599 : cyan\n\nRating 1600-1999 : blue\n\nRating 2000-2399 : yellow\n\nRating 2400-2799 : orange\n\nRating 2800-3199 : red\n\nOther than the above, a person whose rating is 3200 or higher can freely pick his/her color, which can be one of the eight colors above or not.\n\nCurrently, there are N users who have participated in a contest in AtCoder, and the i-th user has a rating of a_i.\n\nFind the minimum and maximum possible numbers of different colors of the users.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ a_i ≤ 4800\n\na_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum possible number of different colors of the users, and the maximum possible number of different colors, with a space in between.\n\nSample Input 1\n\n4\n2100 2500 2700 2700\n\nSample Output 1\n\n2 2\n\nThe user with rating 2100 is \"yellow\", and the others are \"orange\". There are two different colors.\n\nSample Input 2\n\n5\n1100 1900 2800 3200 3200\n\nSample Output 2\n\n3 5\n\nThe user with rating 1100 is \"green\", the user with rating 1900 is blue and the user with rating 2800 is \"red\".\n\nIf the fourth user picks \"red\", and the fifth user picks \"blue\", there are three different colors. This is one possible scenario for the minimum number of colors.\n\nIf the fourth user picks \"purple\", and the fifth user picks \"black\", there are five different colors. This is one possible scenario for the maximum number of colors.\n\nSample Input 3\n\n20\n800 810 820 830 840 850 860 870 880 890 900 910 920 930 940 950 960 970 980 990\n\nSample Output 3\n\n1 1\n\nAll the users are \"green\", and thus there is one color.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 398, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s991877855", "group_id": "codeNet:p03696", "input_text": "let () = Scanf.scanf \"%d\\n%s\\n\" @@ fun n s ->\n  Array.init n (String.get s)\n  |> Array.fold_left (fun (minimum, h) -> function\n    | '(' -> (minimum, h + 1)\n    | ')' -> (min minimum (h - 1), h - 1)) (0, 0)\n  |> (fun (minimum, h) ->\n      let d = max 0 (~- minimum) in\n      Printf.printf \"%s%s%s\\n\" (String.make d '(') s (String.make (max 0 (d + h)) ')'))\n\n\n", "language": "OCaml", "metadata": {"date": 1531228223, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s991877855.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s991877855", "user_id": "u504158101"}, "prompt_components": {"gold_output": "(())\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n%s\\n\" @@ fun n s ->\n  Array.init n (String.get s)\n  |> Array.fold_left (fun (minimum, h) -> function\n    | '(' -> (minimum, h + 1)\n    | ')' -> (min minimum (h - 1), h - 1)) (0, 0)\n  |> (fun (minimum, h) ->\n      let d = max 0 (~- minimum) in\n      Printf.printf \"%s%s%s\\n\" (String.make d '(') s (String.make (max 0 (d + h)) ')'))\n\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of ( and ). Your task is to insert some number of ( and ) into S to obtain a correct bracket sequence.\n\nHere, a correct bracket sequence is defined as follows:\n\n() is a correct bracket sequence.\n\nIf X is a correct bracket sequence, the concatenation of (, X and ) in this order is also a correct bracket sequence.\n\nIf X and Y are correct bracket sequences, the concatenation of X and Y in this order is also a correct bracket sequence.\n\nEvery correct bracket sequence can be derived from the rules above.\n\nFind the shortest correct bracket sequence that can be obtained. If there is more than one such sequence, find the lexicographically smallest one.\n\nConstraints\n\nThe length of S is N.\n\n1 ≤ N ≤ 100\n\nS consists of ( and ).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the lexicographically smallest string among the shortest correct bracket sequences that can be obtained by inserting some number of ( and ) into S.\n\nSample Input 1\n\n3\n())\n\nSample Output 1\n\n(())\n\nSample Input 2\n\n6\n)))())\n\nSample Output 2\n\n(((()))())\n\nSample Input 3\n\n8\n))))((((\n\nSample Output 3\n\n(((())))(((())))", "sample_input": "3\n())\n"}, "reference_outputs": ["(())\n"], "source_document_id": "p03696", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of ( and ). Your task is to insert some number of ( and ) into S to obtain a correct bracket sequence.\n\nHere, a correct bracket sequence is defined as follows:\n\n() is a correct bracket sequence.\n\nIf X is a correct bracket sequence, the concatenation of (, X and ) in this order is also a correct bracket sequence.\n\nIf X and Y are correct bracket sequences, the concatenation of X and Y in this order is also a correct bracket sequence.\n\nEvery correct bracket sequence can be derived from the rules above.\n\nFind the shortest correct bracket sequence that can be obtained. If there is more than one such sequence, find the lexicographically smallest one.\n\nConstraints\n\nThe length of S is N.\n\n1 ≤ N ≤ 100\n\nS consists of ( and ).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the lexicographically smallest string among the shortest correct bracket sequences that can be obtained by inserting some number of ( and ) into S.\n\nSample Input 1\n\n3\n())\n\nSample Output 1\n\n(())\n\nSample Input 2\n\n6\n)))())\n\nSample Output 2\n\n(((()))())\n\nSample Input 3\n\n8\n))))((((\n\nSample Output 3\n\n(((())))(((())))", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 359, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s151782361", "group_id": "codeNet:p03696", "input_text": "let id x = x\nlet n = Scanf.scanf \"%d\\n\" id\nlet string = Scanf.scanf \"%s\\n\" id\n\nlet rec makestr str n =\n  if n = String.length str - 1 then str else\n    if str = \"()\" then \"\" else\n      if str.[n] = '(' && str.[n+1] = ')' then\n        makestr ((String.sub str 0 n) ^ (String.sub str (n+2) ((String.length str) - (n+2)))) 0 else makestr str (n+1)\n  \nlet str = makestr string 0\n\nlet rec count x y str n =\n  if n = String.length str then (x,y) else\n  match str.[n] with\n  | '(' -> count (x+1) y str (n+1)\n  | ')' -> count x (y+1) str (n+1)\n\nlet (x,y) = count 0 0 str 0\n\nlet xlist = String.make x ')'\nlet ylist = String.make y '('\n  \nlet () =\n  Printf.printf \"%s\\n\" (ylist ^ string ^ xlist)", "language": "OCaml", "metadata": {"date": 1497149689, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s151782361.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s151782361", "user_id": "u735499035"}, "prompt_components": {"gold_output": "(())\n", "input_to_evaluate": "let id x = x\nlet n = Scanf.scanf \"%d\\n\" id\nlet string = Scanf.scanf \"%s\\n\" id\n\nlet rec makestr str n =\n  if n = String.length str - 1 then str else\n    if str = \"()\" then \"\" else\n      if str.[n] = '(' && str.[n+1] = ')' then\n        makestr ((String.sub str 0 n) ^ (String.sub str (n+2) ((String.length str) - (n+2)))) 0 else makestr str (n+1)\n  \nlet str = makestr string 0\n\nlet rec count x y str n =\n  if n = String.length str then (x,y) else\n  match str.[n] with\n  | '(' -> count (x+1) y str (n+1)\n  | ')' -> count x (y+1) str (n+1)\n\nlet (x,y) = count 0 0 str 0\n\nlet xlist = String.make x ')'\nlet ylist = String.make y '('\n  \nlet () =\n  Printf.printf \"%s\\n\" (ylist ^ string ^ xlist)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of ( and ). Your task is to insert some number of ( and ) into S to obtain a correct bracket sequence.\n\nHere, a correct bracket sequence is defined as follows:\n\n() is a correct bracket sequence.\n\nIf X is a correct bracket sequence, the concatenation of (, X and ) in this order is also a correct bracket sequence.\n\nIf X and Y are correct bracket sequences, the concatenation of X and Y in this order is also a correct bracket sequence.\n\nEvery correct bracket sequence can be derived from the rules above.\n\nFind the shortest correct bracket sequence that can be obtained. If there is more than one such sequence, find the lexicographically smallest one.\n\nConstraints\n\nThe length of S is N.\n\n1 ≤ N ≤ 100\n\nS consists of ( and ).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the lexicographically smallest string among the shortest correct bracket sequences that can be obtained by inserting some number of ( and ) into S.\n\nSample Input 1\n\n3\n())\n\nSample Output 1\n\n(())\n\nSample Input 2\n\n6\n)))())\n\nSample Output 2\n\n(((()))())\n\nSample Input 3\n\n8\n))))((((\n\nSample Output 3\n\n(((())))(((())))", "sample_input": "3\n())\n"}, "reference_outputs": ["(())\n"], "source_document_id": "p03696", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of ( and ). Your task is to insert some number of ( and ) into S to obtain a correct bracket sequence.\n\nHere, a correct bracket sequence is defined as follows:\n\n() is a correct bracket sequence.\n\nIf X is a correct bracket sequence, the concatenation of (, X and ) in this order is also a correct bracket sequence.\n\nIf X and Y are correct bracket sequences, the concatenation of X and Y in this order is also a correct bracket sequence.\n\nEvery correct bracket sequence can be derived from the rules above.\n\nFind the shortest correct bracket sequence that can be obtained. If there is more than one such sequence, find the lexicographically smallest one.\n\nConstraints\n\nThe length of S is N.\n\n1 ≤ N ≤ 100\n\nS consists of ( and ).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the lexicographically smallest string among the shortest correct bracket sequences that can be obtained by inserting some number of ( and ) into S.\n\nSample Input 1\n\n3\n())\n\nSample Output 1\n\n(())\n\nSample Input 2\n\n6\n)))())\n\nSample Output 2\n\n(((()))())\n\nSample Input 3\n\n8\n))))((((\n\nSample Output 3\n\n(((())))(((())))", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 685, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s343440615", "group_id": "codeNet:p03697", "input_text": "let _ = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b ->\n  match a with\n  | a when a + b >= 10 -> print_endline \"error\"\n  | _ -> Printf.printf \"%d\\n\" (a + b)\n)", "language": "OCaml", "metadata": {"date": 1583853708, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s343440615.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s343440615", "user_id": "u511870776"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "let _ = Scanf.sscanf (read_line ()) \"%d %d\" (fun a b ->\n  match a with\n  | a when a + b >= 10 -> print_endline \"error\"\n  | _ -> Printf.printf \"%d\\n\" (a + b)\n)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B as the input. Output the value of A + B.\n\nHowever, if A + B is 10 or greater, output error instead.\n\nConstraints\n\nA and B are integers.\n\n1 ≤ A, B ≤ 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf A + B is 10 or greater, print the string error (case-sensitive); otherwise, print the value of A + B.\n\nSample Input 1\n\n6 3\n\nSample Output 1\n\n9\n\nSample Input 2\n\n6 4\n\nSample Output 2\n\nerror", "sample_input": "6 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03697", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B as the input. Output the value of A + B.\n\nHowever, if A + B is 10 or greater, output error instead.\n\nConstraints\n\nA and B are integers.\n\n1 ≤ A, B ≤ 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf A + B is 10 or greater, print the string error (case-sensitive); otherwise, print the value of A + B.\n\nSample Input 1\n\n6 3\n\nSample Output 1\n\n9\n\nSample Input 2\n\n6 4\n\nSample Output 2\n\nerror", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 158, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s044398267", "group_id": "codeNet:p03697", "input_text": "open Printf\nopen Scanf\n\nlet () =\n  let solve a b =\n    let x = a + b in\n    if x >= 10 then \"error\" else x |> string_of_int in\n  scanf \"%d %d\\n\" solve |> printf \"%s\\n\"\n\n", "language": "OCaml", "metadata": {"date": 1496600008, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s044398267.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s044398267", "user_id": "u388783188"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet () =\n  let solve a b =\n    let x = a + b in\n    if x >= 10 then \"error\" else x |> string_of_int in\n  scanf \"%d %d\\n\" solve |> printf \"%s\\n\"\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B as the input. Output the value of A + B.\n\nHowever, if A + B is 10 or greater, output error instead.\n\nConstraints\n\nA and B are integers.\n\n1 ≤ A, B ≤ 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf A + B is 10 or greater, print the string error (case-sensitive); otherwise, print the value of A + B.\n\nSample Input 1\n\n6 3\n\nSample Output 1\n\n9\n\nSample Input 2\n\n6 4\n\nSample Output 2\n\nerror", "sample_input": "6 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03697", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B as the input. Output the value of A + B.\n\nHowever, if A + B is 10 or greater, output error instead.\n\nConstraints\n\nA and B are integers.\n\n1 ≤ A, B ≤ 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf A + B is 10 or greater, print the string error (case-sensitive); otherwise, print the value of A + B.\n\nSample Input 1\n\n6 3\n\nSample Output 1\n\n9\n\nSample Input 2\n\n6 4\n\nSample Output 2\n\nerror", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 169, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s411918814", "group_id": "codeNet:p03699", "input_text": "let n = read_int ()\n\nlet ss =\n  let rec read i ls = \n    if i = n then ls else read (i + 1) (read_int () :: ls)\n  in\n  read 0 []\n\nlet rec find_min tmp = function\n  | [] -> tmp\n  | h :: tl ->\n    if h mod 10 = 0 then find_min tmp tl else find_min (min tmp h) tl\n\nlet () =\n  let sum = List.fold_left ( + ) 0 ss in\n  ( if sum mod 10 <> 0 then sum\n    else\n      let new_sum = sum - find_min max_int ss in\n      if new_sum mod 10 <> 0 then new_sum else 0 )\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1521867831, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03699.html", "problem_id": "p03699", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03699/input.txt", "sample_output_relpath": "derived/input_output/data/p03699/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03699/OCaml/s411918814.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s411918814", "user_id": "u987869509"}, "prompt_components": {"gold_output": "25\n", "input_to_evaluate": "let n = read_int ()\n\nlet ss =\n  let rec read i ls = \n    if i = n then ls else read (i + 1) (read_int () :: ls)\n  in\n  read 0 []\n\nlet rec find_min tmp = function\n  | [] -> tmp\n  | h :: tl ->\n    if h mod 10 = 0 then find_min tmp tl else find_min (min tmp h) tl\n\nlet () =\n  let sum = List.fold_left ( + ) 0 ss in\n  ( if sum mod 10 <> 0 then sum\n    else\n      let new_sum = sum - find_min max_int ss in\n      if new_sum mod 10 <> 0 then new_sum else 0 )\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are taking a computer-based examination. The examination consists of N questions, and the score allocated to the i-th question is s_i. Your answer to each question will be judged as either \"correct\" or \"incorrect\", and your grade will be the sum of the points allocated to questions that are answered correctly. When you finish answering the questions, your answers will be immediately judged and your grade will be displayed... if everything goes well.\n\nHowever, the examination system is actually flawed, and if your grade is a multiple of 10, the system displays 0 as your grade. Otherwise, your grade is displayed correctly. In this situation, what is the maximum value that can be displayed as your grade?\n\nConstraints\n\nAll input values are integers.\n\n1 ≤ N ≤ 100\n\n1 ≤ s_i ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the maximum value that can be displayed as your grade.\n\nSample Input 1\n\n3\n5\n10\n15\n\nSample Output 1\n\n25\n\nYour grade will be 25 if the 10-point and 15-point questions are answered correctly and the 5-point question is not, and this grade will be displayed correctly. Your grade will become 30 if the 5-point question is also answered correctly, but this grade will be incorrectly displayed as 0.\n\nSample Input 2\n\n3\n10\n10\n15\n\nSample Output 2\n\n35\n\nYour grade will be 35 if all the questions are answered correctly, and this grade will be displayed correctly.\n\nSample Input 3\n\n3\n10\n20\n30\n\nSample Output 3\n\n0\n\nRegardless of whether each question is answered correctly or not, your grade will be a multiple of 10 and displayed as 0.", "sample_input": "3\n5\n10\n15\n"}, "reference_outputs": ["25\n"], "source_document_id": "p03699", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are taking a computer-based examination. The examination consists of N questions, and the score allocated to the i-th question is s_i. Your answer to each question will be judged as either \"correct\" or \"incorrect\", and your grade will be the sum of the points allocated to questions that are answered correctly. When you finish answering the questions, your answers will be immediately judged and your grade will be displayed... if everything goes well.\n\nHowever, the examination system is actually flawed, and if your grade is a multiple of 10, the system displays 0 as your grade. Otherwise, your grade is displayed correctly. In this situation, what is the maximum value that can be displayed as your grade?\n\nConstraints\n\nAll input values are integers.\n\n1 ≤ N ≤ 100\n\n1 ≤ s_i ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the maximum value that can be displayed as your grade.\n\nSample Input 1\n\n3\n5\n10\n15\n\nSample Output 1\n\n25\n\nYour grade will be 25 if the 10-point and 15-point questions are answered correctly and the 5-point question is not, and this grade will be displayed correctly. Your grade will become 30 if the 5-point question is also answered correctly, but this grade will be incorrectly displayed as 0.\n\nSample Input 2\n\n3\n10\n10\n15\n\nSample Output 2\n\n35\n\nYour grade will be 35 if all the questions are answered correctly, and this grade will be displayed correctly.\n\nSample Input 3\n\n3\n10\n20\n30\n\nSample Output 3\n\n0\n\nRegardless of whether each question is answered correctly or not, your grade will be a multiple of 10 and displayed as 0.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 478, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s671925855", "group_id": "codeNet:p03699", "input_text": "let id x = x\nlet n = Scanf.scanf \"%d\\n\" id\n \nlet array = Array.init n (fun _ -> Scanf.scanf \"%d\\n\" id)\nlet l = Array.length array\nlet list' = Array.to_list array\nlet list = List.sort compare list'\n  \nlet rec pl i =\n  if i = l then 0 else\n    (List.nth list i) + pl (i+1)\n\nlet max = pl 0\n      \nlet rec func i =\n  if i = l then 0 else\n    if ((List.nth list i) mod 10) <> 0 then max - (List.nth list i) else\n      func (i+1)\n\nlet ans = if max mod 10 <> 0 then max else func 0\n\nlet () =\n  Printf.printf \"%d\\n\" ans", "language": "OCaml", "metadata": {"date": 1496543589, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03699.html", "problem_id": "p03699", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03699/input.txt", "sample_output_relpath": "derived/input_output/data/p03699/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03699/OCaml/s671925855.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s671925855", "user_id": "u735499035"}, "prompt_components": {"gold_output": "25\n", "input_to_evaluate": "let id x = x\nlet n = Scanf.scanf \"%d\\n\" id\n \nlet array = Array.init n (fun _ -> Scanf.scanf \"%d\\n\" id)\nlet l = Array.length array\nlet list' = Array.to_list array\nlet list = List.sort compare list'\n  \nlet rec pl i =\n  if i = l then 0 else\n    (List.nth list i) + pl (i+1)\n\nlet max = pl 0\n      \nlet rec func i =\n  if i = l then 0 else\n    if ((List.nth list i) mod 10) <> 0 then max - (List.nth list i) else\n      func (i+1)\n\nlet ans = if max mod 10 <> 0 then max else func 0\n\nlet () =\n  Printf.printf \"%d\\n\" ans", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are taking a computer-based examination. The examination consists of N questions, and the score allocated to the i-th question is s_i. Your answer to each question will be judged as either \"correct\" or \"incorrect\", and your grade will be the sum of the points allocated to questions that are answered correctly. When you finish answering the questions, your answers will be immediately judged and your grade will be displayed... if everything goes well.\n\nHowever, the examination system is actually flawed, and if your grade is a multiple of 10, the system displays 0 as your grade. Otherwise, your grade is displayed correctly. In this situation, what is the maximum value that can be displayed as your grade?\n\nConstraints\n\nAll input values are integers.\n\n1 ≤ N ≤ 100\n\n1 ≤ s_i ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the maximum value that can be displayed as your grade.\n\nSample Input 1\n\n3\n5\n10\n15\n\nSample Output 1\n\n25\n\nYour grade will be 25 if the 10-point and 15-point questions are answered correctly and the 5-point question is not, and this grade will be displayed correctly. Your grade will become 30 if the 5-point question is also answered correctly, but this grade will be incorrectly displayed as 0.\n\nSample Input 2\n\n3\n10\n10\n15\n\nSample Output 2\n\n35\n\nYour grade will be 35 if all the questions are answered correctly, and this grade will be displayed correctly.\n\nSample Input 3\n\n3\n10\n20\n30\n\nSample Output 3\n\n0\n\nRegardless of whether each question is answered correctly or not, your grade will be a multiple of 10 and displayed as 0.", "sample_input": "3\n5\n10\n15\n"}, "reference_outputs": ["25\n"], "source_document_id": "p03699", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are taking a computer-based examination. The examination consists of N questions, and the score allocated to the i-th question is s_i. Your answer to each question will be judged as either \"correct\" or \"incorrect\", and your grade will be the sum of the points allocated to questions that are answered correctly. When you finish answering the questions, your answers will be immediately judged and your grade will be displayed... if everything goes well.\n\nHowever, the examination system is actually flawed, and if your grade is a multiple of 10, the system displays 0 as your grade. Otherwise, your grade is displayed correctly. In this situation, what is the maximum value that can be displayed as your grade?\n\nConstraints\n\nAll input values are integers.\n\n1 ≤ N ≤ 100\n\n1 ≤ s_i ≤ 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1\ns_2\n:\ns_N\n\nOutput\n\nPrint the maximum value that can be displayed as your grade.\n\nSample Input 1\n\n3\n5\n10\n15\n\nSample Output 1\n\n25\n\nYour grade will be 25 if the 10-point and 15-point questions are answered correctly and the 5-point question is not, and this grade will be displayed correctly. Your grade will become 30 if the 5-point question is also answered correctly, but this grade will be incorrectly displayed as 0.\n\nSample Input 2\n\n3\n10\n10\n15\n\nSample Output 2\n\n35\n\nYour grade will be 35 if all the questions are answered correctly, and this grade will be displayed correctly.\n\nSample Input 3\n\n3\n10\n20\n30\n\nSample Output 3\n\n0\n\nRegardless of whether each question is answered correctly or not, your grade will be a multiple of 10 and displayed as 0.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 511, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s605603667", "group_id": "codeNet:p03711", "input_text": "let group1 = [1;3;5;7;8;10;12]\nlet group2 = [4;6;9;11]\nlet group3 = [2]\n\nlet _ = Scanf.sscanf (read_line()) \"%d %d\" (fun x y ->\n  if x = y then \"Yes\" else \n  if List.exists (fun a -> a = x) group1 && List.exists (fun a -> a = y) group1 then \"Yes\" else \n  if List.exists (fun a -> a = x) group2 && List.exists (fun a -> a = y) group2 then \"Yes\" else\n  if List.exists (fun a -> a = x) group3 && List.exists (fun a -> a = y) group3 then \"Yes\" else \"No\"\n) |> print_endline", "language": "OCaml", "metadata": {"date": 1584364980, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s605603667.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s605603667", "user_id": "u511870776"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let group1 = [1;3;5;7;8;10;12]\nlet group2 = [4;6;9;11]\nlet group3 = [2]\n\nlet _ = Scanf.sscanf (read_line()) \"%d %d\" (fun x y ->\n  if x = y then \"Yes\" else \n  if List.exists (fun a -> a = x) group1 && List.exists (fun a -> a = y) group1 then \"Yes\" else \n  if List.exists (fun a -> a = x) group2 && List.exists (fun a -> a = y) group2 then \"Yes\" else\n  if List.exists (fun a -> a = x) group3 && List.exists (fun a -> a = y) group3 then \"Yes\" else \"No\"\n) |> print_endline", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s623812247", "group_id": "codeNet:p03712", "input_text": "let h, w = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet a_ss = Array.init h @@ fun _ -> Scanf.scanf \" %s\" @@ fun s -> s\nlet s = String.make (w + 2) '#'\nlet _ =\n  print_endline s;\n  for i = 0 to h - 1 do print_char '#'; print_string a_ss.(i); print_endline \"#\" done;\n  print_endline s", "language": "OCaml", "metadata": {"date": 1562153317, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s623812247.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s623812247", "user_id": "u732304692"}, "prompt_components": {"gold_output": "#####\n#abc#\n#arc#\n#####\n", "input_to_evaluate": "let h, w = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet a_ss = Array.init h @@ fun _ -> Scanf.scanf \" %s\" @@ fun s -> s\nlet s = String.make (w + 2) '#'\nlet _ =\n  print_endline s;\n  for i = 0 to h - 1 do print_char '#'; print_string a_ss.(i); print_endline \"#\" done;\n  print_endline s", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a image with a height of H pixels and a width of W pixels.\nEach pixel is represented by a lowercase English letter.\nThe pixel at the i-th row from the top and j-th column from the left is a_{ij}.\n\nPut a box around this image and output the result. The box should consist of # and have a thickness of 1.\n\nConstraints\n\n1 ≤ H, W ≤ 100\n\na_{ij} is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{11} ... a_{1W}\n:\na_{H1} ... a_{HW}\n\nOutput\n\nPrint the image surrounded by a box that consists of # and has a thickness of 1.\n\nSample Input 1\n\n2 3\nabc\narc\n\nSample Output 1\n\n#####\n#abc#\n#arc#\n#####\n\nSample Input 2\n\n1 1\nz\n\nSample Output 2\n\n###\n#z#\n###", "sample_input": "2 3\nabc\narc\n"}, "reference_outputs": ["#####\n#abc#\n#arc#\n#####\n"], "source_document_id": "p03712", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a image with a height of H pixels and a width of W pixels.\nEach pixel is represented by a lowercase English letter.\nThe pixel at the i-th row from the top and j-th column from the left is a_{ij}.\n\nPut a box around this image and output the result. The box should consist of # and have a thickness of 1.\n\nConstraints\n\n1 ≤ H, W ≤ 100\n\na_{ij} is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{11} ... a_{1W}\n:\na_{H1} ... a_{HW}\n\nOutput\n\nPrint the image surrounded by a box that consists of # and has a thickness of 1.\n\nSample Input 1\n\n2 3\nabc\narc\n\nSample Output 1\n\n#####\n#abc#\n#arc#\n#####\n\nSample Input 2\n\n1 1\nz\n\nSample Output 2\n\n###\n#z#\n###", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 282, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s939184628", "group_id": "codeNet:p03712", "input_text": "let id x = x\nlet (h,w) = Scanf.scanf \"%d %d\" (fun h w -> (h,w))\n         \nlet repeat f n=\n    let rec loop acc =function\n        | 0->List.rev acc\n        | n -> loop (f ():: acc)(n -1) in\n    loop [] n\n\nlet list' = repeat (fun () -> Scanf.scanf \"%s\\n\" id) (h+1)\n\nlet list = List.tl list'         \n         \nlet rec makeshstr w str =\n               if w = 0 then str else makeshstr (w-1) (\"#\" ^ str)  \n\nlet shstr = makeshstr w \"##\"\n          \nlet () =\n  let rec pri list =\n    match list with\n    | [] -> Printf.printf \"%s\\n\" shstr\n    | ans :: rest -> (Printf.printf \"#%s#\\n\" ans) ; pri rest\n  in Printf.printf \"%s\\n\" shstr; pri list\n", "language": "OCaml", "metadata": {"date": 1495331426, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s939184628.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s939184628", "user_id": "u735499035"}, "prompt_components": {"gold_output": "#####\n#abc#\n#arc#\n#####\n", "input_to_evaluate": "let id x = x\nlet (h,w) = Scanf.scanf \"%d %d\" (fun h w -> (h,w))\n         \nlet repeat f n=\n    let rec loop acc =function\n        | 0->List.rev acc\n        | n -> loop (f ():: acc)(n -1) in\n    loop [] n\n\nlet list' = repeat (fun () -> Scanf.scanf \"%s\\n\" id) (h+1)\n\nlet list = List.tl list'         \n         \nlet rec makeshstr w str =\n               if w = 0 then str else makeshstr (w-1) (\"#\" ^ str)  \n\nlet shstr = makeshstr w \"##\"\n          \nlet () =\n  let rec pri list =\n    match list with\n    | [] -> Printf.printf \"%s\\n\" shstr\n    | ans :: rest -> (Printf.printf \"#%s#\\n\" ans) ; pri rest\n  in Printf.printf \"%s\\n\" shstr; pri list\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a image with a height of H pixels and a width of W pixels.\nEach pixel is represented by a lowercase English letter.\nThe pixel at the i-th row from the top and j-th column from the left is a_{ij}.\n\nPut a box around this image and output the result. The box should consist of # and have a thickness of 1.\n\nConstraints\n\n1 ≤ H, W ≤ 100\n\na_{ij} is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{11} ... a_{1W}\n:\na_{H1} ... a_{HW}\n\nOutput\n\nPrint the image surrounded by a box that consists of # and has a thickness of 1.\n\nSample Input 1\n\n2 3\nabc\narc\n\nSample Output 1\n\n#####\n#abc#\n#arc#\n#####\n\nSample Input 2\n\n1 1\nz\n\nSample Output 2\n\n###\n#z#\n###", "sample_input": "2 3\nabc\narc\n"}, "reference_outputs": ["#####\n#abc#\n#arc#\n#####\n"], "source_document_id": "p03712", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a image with a height of H pixels and a width of W pixels.\nEach pixel is represented by a lowercase English letter.\nThe pixel at the i-th row from the top and j-th column from the left is a_{ij}.\n\nPut a box around this image and output the result. The box should consist of # and have a thickness of 1.\n\nConstraints\n\n1 ≤ H, W ≤ 100\n\na_{ij} is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{11} ... a_{1W}\n:\na_{H1} ... a_{HW}\n\nOutput\n\nPrint the image surrounded by a box that consists of # and has a thickness of 1.\n\nSample Input 1\n\n2 3\nabc\narc\n\nSample Output 1\n\n#####\n#abc#\n#arc#\n#####\n\nSample Input 2\n\n1 1\nz\n\nSample Output 2\n\n###\n#z#\n###", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 635, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s746898022", "group_id": "codeNet:p03718", "input_text": "module DirectedGraph\n  (* 道の表現 *)\n  (Path : sig\n    type t\n    (* 辺の名前 *)\n    type edge\n    (* 長さ0の道 *)\n    val nil : t\n    (* 道の後ろに辺を付け足した道 *)\n    val snoc : t -> edge -> t\n  end) :\nsig\n  (* BFSにより，重みのないグラフの最短経路を求める *)\n  val bfs :\n    (* 頂点数（Hashtblを用いるので目安程度） *)\n    int ->\n    (* 辺の名前が付いた隣接リスト *)\n    ('v -> ('v * Path.edge) list) ->\n    (* 始点 *)\n    'v ->\n    (* 最短経路を返す関数 辿り着けなければNoneを返す） *)\n    ('v -> Path.t option)\nend = struct\n  let rec bfs_aux es d frontier t =\n    try Some (Hashtbl.find d t) with\n    | Not_found ->\n        match !frontier with\n        | [] -> None\n        | _ :: _ ->\n            frontier := List.fold_right (fun u ->\n              List.fold_right (fun (v, e) frontier ->\n                if Hashtbl.mem d v\n                then frontier\n                else (Hashtbl.add d v (Path.snoc (Hashtbl.find d u) e); v :: frontier))\n              (es u)) !frontier [];\n            bfs_aux es d frontier t\n\n  (*\n   * 終点に辿り着いた時点で探索を切り上げるが，\n   * 戻り値の関数を覚えておくと，途中まで探索した結果が再利用される\n   * （#trace bfs_aux すると分かりやすい）\n   *)\n  let bfs n es s =\n    let d = Hashtbl.create n in\n    Hashtbl.add d s Path.nil;\n    let frontier = ref [s] in\n    bfs_aux es d frontier\nend\n\nmodule FlowNetwork\n  (* 流量 *)\n  (Flow : sig\n    type t\n    val inf : t\n    val zero : t\n    val ( + ) : t -> t -> t\n    val ( - ) : t -> t -> t\n    val compare : t -> t -> int\n  end) :\nsig\n  val max_flow :\n    (* 頂点の数（Hashtblを用いるので目安程度） *)\n    int ->\n    (* 各辺とその逆辺の容量 *)\n    ('v * 'v * Flow.t * Flow.t) list ->\n    (* 始点 *)\n    'v ->\n    (* 終点 *)\n    'v ->\n    (* 最大フロー *)\n    Flow.t\nend =\nstruct\n  module G = DirectedGraph (struct\n    type t = int\n    type edge = unit\n    let nil = 0\n    let snoc t _ = t + 1\n  end)\n\n  (* 増加パスをDFSで探し，流せるだけ流していく *)\n  let rec dfs capacity add_edge iter level v t f =\n    if v = t then f\n    else begin\n      let rec find () =\n        match Hashtbl.find iter v with\n        | exception Not_found -> Flow.zero\n        | (u, i) ->\n            Hashtbl.remove iter v;\n            (* capacity i <= 0 *)\n            if Flow.compare (capacity i) Flow.zero <= 0 || level u <= level v then find ()\n            else begin\n              let d = dfs capacity add_edge iter level u t @@\n                (* min f (capacity i) *)\n                if Flow.compare f (capacity i) <= 0 then f else capacity i in\n              (* d <= 0 *)\n              if Flow.compare d Flow.zero <= 0 then find ()\n              else (add_edge i d; d)\n            end in find ()\n    end\n\n  let max_flow n es s t =\n    assert (s <> t);\n    (* 各辺に流せる流量 *)\n    let capacity = Array.make (2 * List.length es) Flow.zero in\n    (* 逆辺を張りつつ，隣接リスト形式に変換 *)\n    let adj = Hashtbl.create n in\n    List.iteri (fun i (u, v, c, c') ->\n      (* 各辺は番号で管理する *)\n      Hashtbl.add adj u (v, 2 * i);\n      (* 容量はcapacityを見てほしい *)\n      capacity.(2 * i) <- c;\n      (* 逆辺 *)\n      Hashtbl.add adj v (u, 2 * i + 1);\n      capacity.(2 * i + 1) <- c') es;\n    (* 番号iの辺にcだけフローを流す *)\n    let add_edge i c =\n      let open Flow in\n      capacity.(i) <- capacity.(i) - c;\n      (* 逆辺 *)\n      capacity.(i lxor 1) <- capacity.(i lxor 1) + c in\n    let rec outer flow =\n      let level = G.bfs n (fun v ->\n        List.concat @@ List.map (fun (u, i) ->\n          if Flow.compare capacity.(i) Flow.zero <= 0 then []\n          else [(u, ())]) @@ Hashtbl.find_all adj v) s in\n      if level t = None then flow\n      else\n        let iter = Hashtbl.copy adj in\n        let rec inner flow =\n          let f = dfs (fun i -> capacity.(i)) add_edge iter level s t Flow.inf in\n          if Flow.compare f Flow.zero <= 0 then flow\n          else inner (Flow.( + ) flow f) in\n        outer @@ inner flow in\n    outer Flow.zero\nend\n\nmodule G = FlowNetwork (struct\n  include Pervasives\n  type t = int\n  let zero = 0\n  let inf = max_int\nend)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun h w ->\n  let ass = Array.init h @@ fun _ -> Scanf.scanf \"%s\\n\" @@ fun s -> s in\n  let yxs =\n    List.concat @@ Array.to_list @@ Array.init h @@ fun y ->\n      Array.to_list @@ Array.init w @@ fun x -> y, x in\n  let [(sy, sx); (ty, tx)] =\n    List.map (fun c ->\n      List.find (fun (y, x) -> ass.(y).[x] = c) yxs) ['S'; 'T'] in\n  Printf.printf \"%d\\n\" @@\n  if sy = ty || sx = tx then -1\n  else G.max_flow (2 + h + w)\n    (List.concat @@ List.map (fun (y, x) ->\n      match ass.(y).[x] with\n      | '.' -> []\n      | 'S' -> [(`Source, `Col x, max_int, 0); (`Source, `Row y, max_int, 0)]\n      | 'T' -> [(`Sink, `Col x, 0, max_int); (`Sink, `Row y, 0, max_int)]\n      | 'o' -> [(`Col x, `Row y, 1, 1)]) yxs) `Source `Sink\n", "language": "OCaml", "metadata": {"date": 1546558958, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03718.html", "problem_id": "p03718", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03718/input.txt", "sample_output_relpath": "derived/input_output/data/p03718/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03718/OCaml/s746898022.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s746898022", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "module DirectedGraph\n  (* 道の表現 *)\n  (Path : sig\n    type t\n    (* 辺の名前 *)\n    type edge\n    (* 長さ0の道 *)\n    val nil : t\n    (* 道の後ろに辺を付け足した道 *)\n    val snoc : t -> edge -> t\n  end) :\nsig\n  (* BFSにより，重みのないグラフの最短経路を求める *)\n  val bfs :\n    (* 頂点数（Hashtblを用いるので目安程度） *)\n    int ->\n    (* 辺の名前が付いた隣接リスト *)\n    ('v -> ('v * Path.edge) list) ->\n    (* 始点 *)\n    'v ->\n    (* 最短経路を返す関数 辿り着けなければNoneを返す） *)\n    ('v -> Path.t option)\nend = struct\n  let rec bfs_aux es d frontier t =\n    try Some (Hashtbl.find d t) with\n    | Not_found ->\n        match !frontier with\n        | [] -> None\n        | _ :: _ ->\n            frontier := List.fold_right (fun u ->\n              List.fold_right (fun (v, e) frontier ->\n                if Hashtbl.mem d v\n                then frontier\n                else (Hashtbl.add d v (Path.snoc (Hashtbl.find d u) e); v :: frontier))\n              (es u)) !frontier [];\n            bfs_aux es d frontier t\n\n  (*\n   * 終点に辿り着いた時点で探索を切り上げるが，\n   * 戻り値の関数を覚えておくと，途中まで探索した結果が再利用される\n   * （#trace bfs_aux すると分かりやすい）\n   *)\n  let bfs n es s =\n    let d = Hashtbl.create n in\n    Hashtbl.add d s Path.nil;\n    let frontier = ref [s] in\n    bfs_aux es d frontier\nend\n\nmodule FlowNetwork\n  (* 流量 *)\n  (Flow : sig\n    type t\n    val inf : t\n    val zero : t\n    val ( + ) : t -> t -> t\n    val ( - ) : t -> t -> t\n    val compare : t -> t -> int\n  end) :\nsig\n  val max_flow :\n    (* 頂点の数（Hashtblを用いるので目安程度） *)\n    int ->\n    (* 各辺とその逆辺の容量 *)\n    ('v * 'v * Flow.t * Flow.t) list ->\n    (* 始点 *)\n    'v ->\n    (* 終点 *)\n    'v ->\n    (* 最大フロー *)\n    Flow.t\nend =\nstruct\n  module G = DirectedGraph (struct\n    type t = int\n    type edge = unit\n    let nil = 0\n    let snoc t _ = t + 1\n  end)\n\n  (* 増加パスをDFSで探し，流せるだけ流していく *)\n  let rec dfs capacity add_edge iter level v t f =\n    if v = t then f\n    else begin\n      let rec find () =\n        match Hashtbl.find iter v with\n        | exception Not_found -> Flow.zero\n        | (u, i) ->\n            Hashtbl.remove iter v;\n            (* capacity i <= 0 *)\n            if Flow.compare (capacity i) Flow.zero <= 0 || level u <= level v then find ()\n            else begin\n              let d = dfs capacity add_edge iter level u t @@\n                (* min f (capacity i) *)\n                if Flow.compare f (capacity i) <= 0 then f else capacity i in\n              (* d <= 0 *)\n              if Flow.compare d Flow.zero <= 0 then find ()\n              else (add_edge i d; d)\n            end in find ()\n    end\n\n  let max_flow n es s t =\n    assert (s <> t);\n    (* 各辺に流せる流量 *)\n    let capacity = Array.make (2 * List.length es) Flow.zero in\n    (* 逆辺を張りつつ，隣接リスト形式に変換 *)\n    let adj = Hashtbl.create n in\n    List.iteri (fun i (u, v, c, c') ->\n      (* 各辺は番号で管理する *)\n      Hashtbl.add adj u (v, 2 * i);\n      (* 容量はcapacityを見てほしい *)\n      capacity.(2 * i) <- c;\n      (* 逆辺 *)\n      Hashtbl.add adj v (u, 2 * i + 1);\n      capacity.(2 * i + 1) <- c') es;\n    (* 番号iの辺にcだけフローを流す *)\n    let add_edge i c =\n      let open Flow in\n      capacity.(i) <- capacity.(i) - c;\n      (* 逆辺 *)\n      capacity.(i lxor 1) <- capacity.(i lxor 1) + c in\n    let rec outer flow =\n      let level = G.bfs n (fun v ->\n        List.concat @@ List.map (fun (u, i) ->\n          if Flow.compare capacity.(i) Flow.zero <= 0 then []\n          else [(u, ())]) @@ Hashtbl.find_all adj v) s in\n      if level t = None then flow\n      else\n        let iter = Hashtbl.copy adj in\n        let rec inner flow =\n          let f = dfs (fun i -> capacity.(i)) add_edge iter level s t Flow.inf in\n          if Flow.compare f Flow.zero <= 0 then flow\n          else inner (Flow.( + ) flow f) in\n        outer @@ inner flow in\n    outer Flow.zero\nend\n\nmodule G = FlowNetwork (struct\n  include Pervasives\n  type t = int\n  let zero = 0\n  let inf = max_int\nend)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun h w ->\n  let ass = Array.init h @@ fun _ -> Scanf.scanf \"%s\\n\" @@ fun s -> s in\n  let yxs =\n    List.concat @@ Array.to_list @@ Array.init h @@ fun y ->\n      Array.to_list @@ Array.init w @@ fun x -> y, x in\n  let [(sy, sx); (ty, tx)] =\n    List.map (fun c ->\n      List.find (fun (y, x) -> ass.(y).[x] = c) yxs) ['S'; 'T'] in\n  Printf.printf \"%d\\n\" @@\n  if sy = ty || sx = tx then -1\n  else G.max_flow (2 + h + w)\n    (List.concat @@ List.map (fun (y, x) ->\n      match ass.(y).[x] with\n      | '.' -> []\n      | 'S' -> [(`Source, `Col x, max_int, 0); (`Source, `Row y, max_int, 0)]\n      | 'T' -> [(`Sink, `Col x, 0, max_int); (`Sink, `Row y, 0, max_int)]\n      | 'o' -> [(`Col x, `Row y, 1, 1)]) yxs) `Source `Sink\n", "problem_context": "Score : 800 points\n\nProblem Statement\n\nThere is a pond with a rectangular shape.\nThe pond is divided into a grid with H rows and W columns of squares.\nWe will denote the square at the i-th row from the top and j-th column from the left by (i,\\ j).\n\nSome of the squares in the pond contains a lotus leaf floating on the water.\nOn one of those leaves, S, there is a frog trying to get to another leaf T.\nThe state of square (i,\\ j) is given to you by a character a_{ij}, as follows:\n\n. : A square without a leaf.\n\no : A square with a leaf floating on the water.\n\nS : A square with the leaf S.\n\nT : A square with the leaf T.\n\nThe frog will repeatedly perform the following action to get to the leaf T: \"jump to a leaf that is in the same row or the same column as the leaf where the frog is currently located.\"\n\nSnuke is trying to remove some of the leaves, other than S and T, so that the frog cannot get to the leaf T.\nDetermine whether this objective is achievable. If it is achievable, find the minimum necessary number of leaves to remove.\n\nConstraints\n\n2 ≤ H, W ≤ 100\n\na_{ij} is ., o, S or T.\n\nThere is exactly one S among a_{ij}.\n\nThere is exactly one T among a_{ij}.\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\nIf the objective is achievable, print the minimum necessary number of leaves to remove.\nOtherwise, print -1 instead.\n\nSample Input 1\n\n3 3\nS.o\n.o.\no.T\n\nSample Output 1\n\n2\n\nRemove the upper-right and lower-left leaves.\n\nSample Input 2\n\n3 4\nS...\n.oo.\n...T\n\nSample Output 2\n\n0\n\nSample Input 3\n\n4 3\n.S.\n.o.\n.o.\n.T.\n\nSample Output 3\n\n-1\n\nSample Input 4\n\n10 10\n.o...o..o.\n....o.....\n....oo.oo.\n..oooo..o.\n....oo....\n..o..o....\no..o....So\no....T....\n....o.....\n........oo\n\nSample Output 4\n\n5", "sample_input": "3 3\nS.o\n.o.\no.T\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03718", "source_text": "Score : 800 points\n\nProblem Statement\n\nThere is a pond with a rectangular shape.\nThe pond is divided into a grid with H rows and W columns of squares.\nWe will denote the square at the i-th row from the top and j-th column from the left by (i,\\ j).\n\nSome of the squares in the pond contains a lotus leaf floating on the water.\nOn one of those leaves, S, there is a frog trying to get to another leaf T.\nThe state of square (i,\\ j) is given to you by a character a_{ij}, as follows:\n\n. : A square without a leaf.\n\no : A square with a leaf floating on the water.\n\nS : A square with the leaf S.\n\nT : A square with the leaf T.\n\nThe frog will repeatedly perform the following action to get to the leaf T: \"jump to a leaf that is in the same row or the same column as the leaf where the frog is currently located.\"\n\nSnuke is trying to remove some of the leaves, other than S and T, so that the frog cannot get to the leaf T.\nDetermine whether this objective is achievable. If it is achievable, find the minimum necessary number of leaves to remove.\n\nConstraints\n\n2 ≤ H, W ≤ 100\n\na_{ij} is ., o, S or T.\n\nThere is exactly one S among a_{ij}.\n\nThere is exactly one T among a_{ij}.\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\nIf the objective is achievable, print the minimum necessary number of leaves to remove.\nOtherwise, print -1 instead.\n\nSample Input 1\n\n3 3\nS.o\n.o.\no.T\n\nSample Output 1\n\n2\n\nRemove the upper-right and lower-left leaves.\n\nSample Input 2\n\n3 4\nS...\n.oo.\n...T\n\nSample Output 2\n\n0\n\nSample Input 3\n\n4 3\n.S.\n.o.\n.o.\n.T.\n\nSample Output 3\n\n-1\n\nSample Input 4\n\n10 10\n.o...o..o.\n....o.....\n....oo.oo.\n..oooo..o.\n....oo....\n..o..o....\no..o....So\no....T....\n....o.....\n........oo\n\nSample Output 4\n\n5", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 5087, "cpu_time_ms": 481, "memory_kb": 8832}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s624473147", "group_id": "codeNet:p03719", "input_text": "Scanf.scanf \"%d %d %d\" (fun a b c ->\n    print_endline @@ if c >= a && c <= b then \"Yes\" else \"No\"\n)", "language": "OCaml", "metadata": {"date": 1601004814, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s624473147.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s624473147", "user_id": "u342443598"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" (fun a b c ->\n    print_endline @@ if c >= a && c <= b then \"Yes\" else \"No\"\n)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers A, B and C.\nDetermine whether C is not less than A and not greater than B.\n\nConstraints\n\n-100≤A,B,C≤100\n\nA, B and C are all integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the condition is satisfied, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 3 2\n\nSample Output 1\n\nYes\n\nC=2 is not less than A=1 and not greater than B=3, and thus the output should be Yes.\n\nSample Input 2\n\n6 5 4\n\nSample Output 2\n\nNo\n\nC=4 is less than A=6, and thus the output should be No.\n\nSample Input 3\n\n2 2 2\n\nSample Output 3\n\nYes", "sample_input": "1 3 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03719", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers A, B and C.\nDetermine whether C is not less than A and not greater than B.\n\nConstraints\n\n-100≤A,B,C≤100\n\nA, B and C are all integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the condition is satisfied, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 3 2\n\nSample Output 1\n\nYes\n\nC=2 is not less than A=1 and not greater than B=3, and thus the output should be Yes.\n\nSample Input 2\n\n6 5 4\n\nSample Output 2\n\nNo\n\nC=4 is less than A=6, and thus the output should be No.\n\nSample Input 3\n\n2 2 2\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 100, "cpu_time_ms": 8, "memory_kb": 3704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s135691161", "group_id": "codeNet:p03719", "input_text": "let ()=\n  Scanf.scanf \"%d %d %d\" (fun a b c -> \n      (if a <= c && c <= b then \"Yes\" else \"No\") |> print_endline)", "language": "OCaml", "metadata": {"date": 1521887530, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s135691161.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s135691161", "user_id": "u987869509"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let ()=\n  Scanf.scanf \"%d %d %d\" (fun a b c -> \n      (if a <= c && c <= b then \"Yes\" else \"No\") |> print_endline)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers A, B and C.\nDetermine whether C is not less than A and not greater than B.\n\nConstraints\n\n-100≤A,B,C≤100\n\nA, B and C are all integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the condition is satisfied, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 3 2\n\nSample Output 1\n\nYes\n\nC=2 is not less than A=1 and not greater than B=3, and thus the output should be Yes.\n\nSample Input 2\n\n6 5 4\n\nSample Output 2\n\nNo\n\nC=4 is less than A=6, and thus the output should be No.\n\nSample Input 3\n\n2 2 2\n\nSample Output 3\n\nYes", "sample_input": "1 3 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03719", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers A, B and C.\nDetermine whether C is not less than A and not greater than B.\n\nConstraints\n\n-100≤A,B,C≤100\n\nA, B and C are all integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf the condition is satisfied, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 3 2\n\nSample Output 1\n\nYes\n\nC=2 is not less than A=1 and not greater than B=3, and thus the output should be Yes.\n\nSample Input 2\n\n6 5 4\n\nSample Output 2\n\nNo\n\nC=4 is less than A=6, and thus the output should be No.\n\nSample Input 3\n\n2 2 2\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 114, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s634932414", "group_id": "codeNet:p03720", "input_text": "open Batteries\nmodule Mymap = Map.Make(Int)\nlet () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  let m = Scanf.scanf \"%d \" (fun a -> a) in\n  let pair_lst = Array.to_list @@ Array.init m (fun _ -> Scanf.scanf \"%d %d \" (fun a b -> a,b)) in\n\n  let amap = List.fold_left (fun accum (x,y) -> \n      Mymap.modify_opt x (fun v_opt -> match v_opt with\n            Some v -> Some (v + 1)\n          | None -> Some 1\n        ) accum |>\n      Mymap.modify_opt y (fun v_opt -> match v_opt with\n            Some v -> Some (v + 1)\n          | None -> Some 1\n        ) \n    ) (Mymap.empty) pair_lst\n  in\n\n  let pair_lst = Mymap.bindings amap in\n  let pair_lst = List.sort compare pair_lst in\n  List.iter (fun (x,y) -> Printf.printf \"%d\\n\" y) pair_lst\n", "language": "OCaml", "metadata": {"date": 1529237775, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03720.html", "problem_id": "p03720", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03720/input.txt", "sample_output_relpath": "derived/input_output/data/p03720/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03720/OCaml/s634932414.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s634932414", "user_id": "u139013163"}, "prompt_components": {"gold_output": "2\n2\n1\n1\n", "input_to_evaluate": "open Batteries\nmodule Mymap = Map.Make(Int)\nlet () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  let m = Scanf.scanf \"%d \" (fun a -> a) in\n  let pair_lst = Array.to_list @@ Array.init m (fun _ -> Scanf.scanf \"%d %d \" (fun a b -> a,b)) in\n\n  let amap = List.fold_left (fun accum (x,y) -> \n      Mymap.modify_opt x (fun v_opt -> match v_opt with\n            Some v -> Some (v + 1)\n          | None -> Some 1\n        ) accum |>\n      Mymap.modify_opt y (fun v_opt -> match v_opt with\n            Some v -> Some (v + 1)\n          | None -> Some 1\n        ) \n    ) (Mymap.empty) pair_lst\n  in\n\n  let pair_lst = Mymap.bindings amap in\n  let pair_lst = List.sort compare pair_lst in\n  List.iter (fun (x,y) -> Printf.printf \"%d\\n\" y) pair_lst\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N cities and M roads.\nThe i-th road (1≤i≤M) connects two cities a_i and b_i (1≤a_i,b_i≤N) bidirectionally.\nThere may be more than one road that connects the same pair of two cities.\nFor each city, how many roads are connected to the city?\n\nConstraints\n\n2≤N,M≤50\n\n1≤a_i,b_i≤N\n\na_i ≠ b_i\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_M b_M\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line (1≤i≤N), print the number of roads connected to city i.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n1 4\n\nSample Output 1\n\n2\n2\n1\n1\n\nCity 1 is connected to the 1-st and 3-rd roads.\n\nCity 2 is connected to the 1-st and 2-nd roads.\n\nCity 3 is connected to the 2-nd road.\n\nCity 4 is connected to the 3-rd road.\n\nSample Input 2\n\n2 5\n1 2\n2 1\n1 2\n2 1\n1 2\n\nSample Output 2\n\n5\n5\n\nSample Input 3\n\n8 8\n1 2\n3 4\n1 5\n2 8\n3 7\n5 2\n4 1\n6 8\n\nSample Output 3\n\n3\n3\n2\n2\n2\n1\n1\n2", "sample_input": "4 3\n1 2\n2 3\n1 4\n"}, "reference_outputs": ["2\n2\n1\n1\n"], "source_document_id": "p03720", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N cities and M roads.\nThe i-th road (1≤i≤M) connects two cities a_i and b_i (1≤a_i,b_i≤N) bidirectionally.\nThere may be more than one road that connects the same pair of two cities.\nFor each city, how many roads are connected to the city?\n\nConstraints\n\n2≤N,M≤50\n\n1≤a_i,b_i≤N\n\na_i ≠ b_i\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_M b_M\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line (1≤i≤N), print the number of roads connected to city i.\n\nSample Input 1\n\n4 3\n1 2\n2 3\n1 4\n\nSample Output 1\n\n2\n2\n1\n1\n\nCity 1 is connected to the 1-st and 3-rd roads.\n\nCity 2 is connected to the 1-st and 2-nd roads.\n\nCity 3 is connected to the 2-nd road.\n\nCity 4 is connected to the 3-rd road.\n\nSample Input 2\n\n2 5\n1 2\n2 1\n1 2\n2 1\n1 2\n\nSample Output 2\n\n5\n5\n\nSample Input 3\n\n8 8\n1 2\n3 4\n1 5\n2 8\n3 7\n5 2\n4 1\n6 8\n\nSample Output 3\n\n3\n3\n2\n2\n2\n1\n1\n2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 1152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s903645157", "group_id": "codeNet:p03721", "input_text": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n    let a =\n        Array.init n @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun a b -> (a, b) in\n    Array.sort (fun (x, _) (y, _) -> x - y) a;\n    let rec f acc i =\n        if (snd a.(i)) + acc >= k then fst a.(i) else f ((snd a.(i)) + acc) (i+1)\n    in f 0 0 |> Printf.printf \"%d\"", "language": "OCaml", "metadata": {"date": 1543266737, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s903645157.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s903645157", "user_id": "u604818425"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n    let a =\n        Array.init n @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun a b -> (a, b) in\n    Array.sort (fun (x, _) (y, _) -> x - y) a;\n    let rec f acc i =\n        if (snd a.(i)) + acc >= k then fst a.(i) else f ((snd a.(i)) + acc) (i+1)\n    in f 0 0 |> Printf.printf \"%d\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is an empty array.\nThe following N operations will be performed to insert integers into the array.\nIn the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array.\nFind the K-th smallest integer in the array after the N operations.\nFor example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.\n\nConstraints\n\n1≤N≤10^5\n\n1≤a_i,b_i≤10^5\n\n1≤K≤b_1…+…b_n\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the K-th smallest integer in the array after the N operations.\n\nSample Input 1\n\n3 4\n1 1\n2 2\n3 3\n\nSample Output 1\n\n3\n\nThe resulting array is the same as the one in the problem statement.\n\nSample Input 2\n\n10 500000\n1 100000\n1 100000\n1 100000\n1 100000\n1 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n\nSample Output 2\n\n1", "sample_input": "3 4\n1 1\n2 2\n3 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03721", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is an empty array.\nThe following N operations will be performed to insert integers into the array.\nIn the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array.\nFind the K-th smallest integer in the array after the N operations.\nFor example, the 4-th smallest integer in the array \\{1,2,2,3,3,3\\} is 3.\n\nConstraints\n\n1≤N≤10^5\n\n1≤a_i,b_i≤10^5\n\n1≤K≤b_1…+…b_n\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint the K-th smallest integer in the array after the N operations.\n\nSample Input 1\n\n3 4\n1 1\n2 2\n3 3\n\nSample Output 1\n\n3\n\nThe resulting array is the same as the one in the problem statement.\n\nSample Input 2\n\n10 500000\n1 100000\n1 100000\n1 100000\n1 100000\n1 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n\nSample Output 2\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 321, "cpu_time_ms": 96, "memory_kb": 6784}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s435387972", "group_id": "codeNet:p03722", "input_text": "module WeightedDirectedGraph\n  (Weight : sig\n    type t\n    val inf : t\n    val zero : t\n    val neg_inf : t\n    val ( + ) : t -> t -> t\n    val compare : t -> t -> int\n  end) :\nsig\n  type 'a church_list = { fold : 'b. ('a -> 'b -> 'b) -> 'b -> 'b }\n\n  val bellman_ford :\n    (* 頂点数n *)\n    int ->\n    (* 辺のリスト\n       頂点は0からn-1までの整数でなくてはならない\n       2n回呼び出されるので，リストを作るのに時間がかかるならメモ化すること *)\n    (int * int * Weight.t) church_list ->\n    (* 始点 *)\n    int ->\n    (* 頂点を受け取り，そこまでの距離を返す関数\n       頂点に到達するパスが無ければinfを返し，\n       そこに到達するまでに負閉路があればneg_infを返す *)\n    (int -> Weight.t)\nend =\nstruct\n  type 'a church_list = { fold : 'b. ('a -> 'b -> 'b) -> 'b -> 'b }\n\n  let bellman_ford n es s =\n    (* 距離を覚えるやつ *)\n    let d = Array.make n Weight.inf in\n    (* 経路に負閉路が含まれる頂点を覚えるやつ *)\n    let neg = Array.make n false in\n    d.(s) <- Weight.zero;\n    for i = 1 to n - 1 do\n      es.fold (fun (u, v, c) () ->\n        let open Weight in\n        (* c は u から v への辺の重さ *)\n        (* d.(u) + c < d.(v) *)\n        if 0 < Weight.compare d.(v) (d.(u) + c) then\n          d.(v) <- d.(u) + c) ()\n    done;\n    (* 手動ループアンローリング *)\n    for i = n to 2 * n do\n      es.fold (fun (u, v, c) () ->\n        let open Weight in\n        if 0 < Weight.compare d.(v) (d.(u) + c) then\n          (* n 回目以降に変更が起こった場合，v までの経路に負閉路が含まれている *)\n          (d.(v) <- d.(u) + c; neg.(v) <- true)) ()\n    done;\n    fun v -> if neg.(v) then Weight.neg_inf else d.(v)\nend\n\nmodule G = WeightedDirectedGraph (struct\n  type t = int\n  let inf = -123456789012345678\n  let zero = 0\n  let neg_inf = 123456789012345678\n  let ( + ) = ( + )\n  let compare x y = compare y x\nend)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let abcs = Array.init m @@ fun _ -> Scanf.scanf \"%d %d %d\\n\" @@ fun a b c -> a - 1, b - 1, c in\n  let d = G.bellman_ford n { G.fold = fun f -> Array.fold_right f abcs } 0 (n - 1) in\n  if 123456789012345678 <= d\n  then print_endline \"inf\"\n  else Printf.printf \"%d\\n\" d\n", "language": "OCaml", "metadata": {"date": 1589399305, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s435387972.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s435387972", "user_id": "u504158101"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "module WeightedDirectedGraph\n  (Weight : sig\n    type t\n    val inf : t\n    val zero : t\n    val neg_inf : t\n    val ( + ) : t -> t -> t\n    val compare : t -> t -> int\n  end) :\nsig\n  type 'a church_list = { fold : 'b. ('a -> 'b -> 'b) -> 'b -> 'b }\n\n  val bellman_ford :\n    (* 頂点数n *)\n    int ->\n    (* 辺のリスト\n       頂点は0からn-1までの整数でなくてはならない\n       2n回呼び出されるので，リストを作るのに時間がかかるならメモ化すること *)\n    (int * int * Weight.t) church_list ->\n    (* 始点 *)\n    int ->\n    (* 頂点を受け取り，そこまでの距離を返す関数\n       頂点に到達するパスが無ければinfを返し，\n       そこに到達するまでに負閉路があればneg_infを返す *)\n    (int -> Weight.t)\nend =\nstruct\n  type 'a church_list = { fold : 'b. ('a -> 'b -> 'b) -> 'b -> 'b }\n\n  let bellman_ford n es s =\n    (* 距離を覚えるやつ *)\n    let d = Array.make n Weight.inf in\n    (* 経路に負閉路が含まれる頂点を覚えるやつ *)\n    let neg = Array.make n false in\n    d.(s) <- Weight.zero;\n    for i = 1 to n - 1 do\n      es.fold (fun (u, v, c) () ->\n        let open Weight in\n        (* c は u から v への辺の重さ *)\n        (* d.(u) + c < d.(v) *)\n        if 0 < Weight.compare d.(v) (d.(u) + c) then\n          d.(v) <- d.(u) + c) ()\n    done;\n    (* 手動ループアンローリング *)\n    for i = n to 2 * n do\n      es.fold (fun (u, v, c) () ->\n        let open Weight in\n        if 0 < Weight.compare d.(v) (d.(u) + c) then\n          (* n 回目以降に変更が起こった場合，v までの経路に負閉路が含まれている *)\n          (d.(v) <- d.(u) + c; neg.(v) <- true)) ()\n    done;\n    fun v -> if neg.(v) then Weight.neg_inf else d.(v)\nend\n\nmodule G = WeightedDirectedGraph (struct\n  type t = int\n  let inf = -123456789012345678\n  let zero = 0\n  let neg_inf = 123456789012345678\n  let ( + ) = ( + )\n  let compare x y = compare y x\nend)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let abcs = Array.init m @@ fun _ -> Scanf.scanf \"%d %d %d\\n\" @@ fun a b c -> a - 1, b - 1, c in\n  let d = G.bellman_ford n { G.fold = fun f -> Array.fold_right f abcs } 0 (n - 1) in\n  if 123456789012345678 <= d\n  then print_endline \"inf\"\n  else Printf.printf \"%d\\n\" d\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a directed graph with N vertices and M edges.\nThe i-th edge (1≤i≤M) points from vertex a_i to vertex b_i, and has a weight c_i.\nWe will play the following single-player game using this graph and a piece.\n\nInitially, the piece is placed at vertex 1, and the score of the player is set to 0.\nThe player can move the piece as follows:\n\nWhen the piece is placed at vertex a_i, move the piece along the i-th edge to vertex b_i. After this move, the score of the player is increased by c_i.\n\nThe player can end the game only when the piece is placed at vertex N.\nThe given graph guarantees that it is possible to traverse from vertex 1 to vertex N.\n\nWhen the player acts optimally to maximize the score at the end of the game, what will the score be?\nIf it is possible to increase the score indefinitely, print inf.\n\nConstraints\n\n2≤N≤1000\n\n1≤M≤min(N(N-1),2000)\n\n1≤a_i,b_i≤N (1≤i≤M)\n\na_i≠b_i (1≤i≤M)\n\na_i≠a_j or b_i≠b_j (1≤i<j≤M)\n\n-10^9≤c_i≤10^9 (1≤i≤M)\n\nc_i is an integer.\n\nIn the given graph, there exists a path from vertex 1 to vertex N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_M b_M c_M\n\nOutput\n\nPrint the maximum possible score at the end of the game, if it is finite. If it is possible to increase the score indefinitely, print inf.\n\nSample Input 1\n\n3 3\n1 2 4\n2 3 3\n1 3 5\n\nSample Output 1\n\n7\n\nThere are two ways to move the piece to vertex N=3:\n\nvertex 1 → vertex 2 → vertex 3 : score 4+3=7\n\nvertex 1 → vertex 3 : score 5\n\nThus, the maximum possible score at the end of the game is 7.\n\nSample Input 2\n\n2 2\n1 2 1\n2 1 1\n\nSample Output 2\n\ninf\n\nIt is possible to increase the score indefinitely by alternating between vertex 1 and 2.\n\nSample Input 3\n\n6 5\n1 2 -1000000000\n2 3 -1000000000\n3 4 -1000000000\n4 5 -1000000000\n5 6 -1000000000\n\nSample Output 3\n\n-5000000000", "sample_input": "3 3\n1 2 4\n2 3 3\n1 3 5\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03722", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere is a directed graph with N vertices and M edges.\nThe i-th edge (1≤i≤M) points from vertex a_i to vertex b_i, and has a weight c_i.\nWe will play the following single-player game using this graph and a piece.\n\nInitially, the piece is placed at vertex 1, and the score of the player is set to 0.\nThe player can move the piece as follows:\n\nWhen the piece is placed at vertex a_i, move the piece along the i-th edge to vertex b_i. After this move, the score of the player is increased by c_i.\n\nThe player can end the game only when the piece is placed at vertex N.\nThe given graph guarantees that it is possible to traverse from vertex 1 to vertex N.\n\nWhen the player acts optimally to maximize the score at the end of the game, what will the score be?\nIf it is possible to increase the score indefinitely, print inf.\n\nConstraints\n\n2≤N≤1000\n\n1≤M≤min(N(N-1),2000)\n\n1≤a_i,b_i≤N (1≤i≤M)\n\na_i≠b_i (1≤i≤M)\n\na_i≠a_j or b_i≠b_j (1≤i<j≤M)\n\n-10^9≤c_i≤10^9 (1≤i≤M)\n\nc_i is an integer.\n\nIn the given graph, there exists a path from vertex 1 to vertex N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_M b_M c_M\n\nOutput\n\nPrint the maximum possible score at the end of the game, if it is finite. If it is possible to increase the score indefinitely, print inf.\n\nSample Input 1\n\n3 3\n1 2 4\n2 3 3\n1 3 5\n\nSample Output 1\n\n7\n\nThere are two ways to move the piece to vertex N=3:\n\nvertex 1 → vertex 2 → vertex 3 : score 4+3=7\n\nvertex 1 → vertex 3 : score 5\n\nThus, the maximum possible score at the end of the game is 7.\n\nSample Input 2\n\n2 2\n1 2 1\n2 1 1\n\nSample Output 2\n\ninf\n\nIt is possible to increase the score indefinitely by alternating between vertex 1 and 2.\n\nSample Input 3\n\n6 5\n1 2 -1000000000\n2 3 -1000000000\n3 4 -1000000000\n4 5 -1000000000\n5 6 -1000000000\n\nSample Output 3\n\n-5000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2326, "cpu_time_ms": 115, "memory_kb": 2944}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s473859835", "group_id": "codeNet:p03722", "input_text": "let rec fold_n n f v = if n <= 0 then v else fold_n (n-1) f (f v)\nlet inf = 10101010101010\n\nlet () =\n  Scanf.scanf \"%d %d\" @@ fun n m ->\n  let a = Array.init m (fun _ -> Scanf.scanf \" %d %d %d\" (fun a b c -> a-1,b-1,c)) in\n\n  let reach = begin\n    let g = Array.init n (fun _ -> []) in\n    a |> Array.iter (fun (u,v,_) -> g.(v) <- u :: g.(v));\n    let vis = Array.make n false in\n    let rec f u =\n      vis.(u) <- true;\n      List.iter (fun v -> if not vis.(v) then f v) g.(u)\n    in f (n-1);\n    vis\n  end in\n\n  let sc = Array.make n (-inf) in sc.(0) <- 0;\n  let mem = Array.make n false in\n  let has_loop = true |> fold_n n (fun upd ->\n    if not upd then false else begin\n      Array.fill mem 0 n false;\n      Array.fold_left (fun b (u,v,c) ->\n        let b' = sc.(u) + c > sc.(v) in\n        if b' then (mem.(v) <- true; sc.(v) <- sc.(u) + c);\n        b || b'\n        ) false a\n    end)\n  in\n  let inf_loop = has_loop && begin\n    Array.init n (fun i -> reach.(i) && mem.(i)) |> Array.fold_left (||) false\n  end in\n\n  if inf_loop then\n    print_endline \"inf\"\n  else\n    Printf.printf \"%d\\n\" sc.(n-1)\n", "language": "OCaml", "metadata": {"date": 1532081794, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s473859835.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s473859835", "user_id": "u798181098"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "let rec fold_n n f v = if n <= 0 then v else fold_n (n-1) f (f v)\nlet inf = 10101010101010\n\nlet () =\n  Scanf.scanf \"%d %d\" @@ fun n m ->\n  let a = Array.init m (fun _ -> Scanf.scanf \" %d %d %d\" (fun a b c -> a-1,b-1,c)) in\n\n  let reach = begin\n    let g = Array.init n (fun _ -> []) in\n    a |> Array.iter (fun (u,v,_) -> g.(v) <- u :: g.(v));\n    let vis = Array.make n false in\n    let rec f u =\n      vis.(u) <- true;\n      List.iter (fun v -> if not vis.(v) then f v) g.(u)\n    in f (n-1);\n    vis\n  end in\n\n  let sc = Array.make n (-inf) in sc.(0) <- 0;\n  let mem = Array.make n false in\n  let has_loop = true |> fold_n n (fun upd ->\n    if not upd then false else begin\n      Array.fill mem 0 n false;\n      Array.fold_left (fun b (u,v,c) ->\n        let b' = sc.(u) + c > sc.(v) in\n        if b' then (mem.(v) <- true; sc.(v) <- sc.(u) + c);\n        b || b'\n        ) false a\n    end)\n  in\n  let inf_loop = has_loop && begin\n    Array.init n (fun i -> reach.(i) && mem.(i)) |> Array.fold_left (||) false\n  end in\n\n  if inf_loop then\n    print_endline \"inf\"\n  else\n    Printf.printf \"%d\\n\" sc.(n-1)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a directed graph with N vertices and M edges.\nThe i-th edge (1≤i≤M) points from vertex a_i to vertex b_i, and has a weight c_i.\nWe will play the following single-player game using this graph and a piece.\n\nInitially, the piece is placed at vertex 1, and the score of the player is set to 0.\nThe player can move the piece as follows:\n\nWhen the piece is placed at vertex a_i, move the piece along the i-th edge to vertex b_i. After this move, the score of the player is increased by c_i.\n\nThe player can end the game only when the piece is placed at vertex N.\nThe given graph guarantees that it is possible to traverse from vertex 1 to vertex N.\n\nWhen the player acts optimally to maximize the score at the end of the game, what will the score be?\nIf it is possible to increase the score indefinitely, print inf.\n\nConstraints\n\n2≤N≤1000\n\n1≤M≤min(N(N-1),2000)\n\n1≤a_i,b_i≤N (1≤i≤M)\n\na_i≠b_i (1≤i≤M)\n\na_i≠a_j or b_i≠b_j (1≤i<j≤M)\n\n-10^9≤c_i≤10^9 (1≤i≤M)\n\nc_i is an integer.\n\nIn the given graph, there exists a path from vertex 1 to vertex N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_M b_M c_M\n\nOutput\n\nPrint the maximum possible score at the end of the game, if it is finite. If it is possible to increase the score indefinitely, print inf.\n\nSample Input 1\n\n3 3\n1 2 4\n2 3 3\n1 3 5\n\nSample Output 1\n\n7\n\nThere are two ways to move the piece to vertex N=3:\n\nvertex 1 → vertex 2 → vertex 3 : score 4+3=7\n\nvertex 1 → vertex 3 : score 5\n\nThus, the maximum possible score at the end of the game is 7.\n\nSample Input 2\n\n2 2\n1 2 1\n2 1 1\n\nSample Output 2\n\ninf\n\nIt is possible to increase the score indefinitely by alternating between vertex 1 and 2.\n\nSample Input 3\n\n6 5\n1 2 -1000000000\n2 3 -1000000000\n3 4 -1000000000\n4 5 -1000000000\n5 6 -1000000000\n\nSample Output 3\n\n-5000000000", "sample_input": "3 3\n1 2 4\n2 3 3\n1 3 5\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03722", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere is a directed graph with N vertices and M edges.\nThe i-th edge (1≤i≤M) points from vertex a_i to vertex b_i, and has a weight c_i.\nWe will play the following single-player game using this graph and a piece.\n\nInitially, the piece is placed at vertex 1, and the score of the player is set to 0.\nThe player can move the piece as follows:\n\nWhen the piece is placed at vertex a_i, move the piece along the i-th edge to vertex b_i. After this move, the score of the player is increased by c_i.\n\nThe player can end the game only when the piece is placed at vertex N.\nThe given graph guarantees that it is possible to traverse from vertex 1 to vertex N.\n\nWhen the player acts optimally to maximize the score at the end of the game, what will the score be?\nIf it is possible to increase the score indefinitely, print inf.\n\nConstraints\n\n2≤N≤1000\n\n1≤M≤min(N(N-1),2000)\n\n1≤a_i,b_i≤N (1≤i≤M)\n\na_i≠b_i (1≤i≤M)\n\na_i≠a_j or b_i≠b_j (1≤i<j≤M)\n\n-10^9≤c_i≤10^9 (1≤i≤M)\n\nc_i is an integer.\n\nIn the given graph, there exists a path from vertex 1 to vertex N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_M b_M c_M\n\nOutput\n\nPrint the maximum possible score at the end of the game, if it is finite. If it is possible to increase the score indefinitely, print inf.\n\nSample Input 1\n\n3 3\n1 2 4\n2 3 3\n1 3 5\n\nSample Output 1\n\n7\n\nThere are two ways to move the piece to vertex N=3:\n\nvertex 1 → vertex 2 → vertex 3 : score 4+3=7\n\nvertex 1 → vertex 3 : score 5\n\nThus, the maximum possible score at the end of the game is 7.\n\nSample Input 2\n\n2 2\n1 2 1\n2 1 1\n\nSample Output 2\n\ninf\n\nIt is possible to increase the score indefinitely by alternating between vertex 1 and 2.\n\nSample Input 3\n\n6 5\n1 2 -1000000000\n2 3 -1000000000\n3 4 -1000000000\n4 5 -1000000000\n5 6 -1000000000\n\nSample Output 3\n\n-5000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1104, "cpu_time_ms": 32, "memory_kb": 3328}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s085135036", "group_id": "codeNet:p03722", "input_text": "module CoordComp\n  (* 座標の型 *)\n  (Coord : sig\n    type t\n    val compare : t -> t -> int\n  end) :\nsig\n  val compress :\n    (* 座標のリスト *)\n    Coord.t list ->\n    (* 座標の数，圧縮する関数と解凍する関数を返す *)\n    int * (Coord.t -> int) * (int -> Coord.t)\nend = struct\n  module IntMap = Map.Make (struct\n    type t = int\n    let compare = compare\n  end)\n  module CoordMap = Map.Make (Coord)\n\n  let compress cs =\n    let (n, comp, decomp) =\n      List.fold_left (fun (n, comp, decomp) c ->\n        if CoordMap.mem c comp then (n, comp, decomp)\n        else (n + 1, CoordMap.add c n comp, IntMap.add n c decomp))\n      (0, CoordMap.empty, IntMap.empty) cs in\n    (n, (fun c -> CoordMap.find c comp), (fun n -> IntMap.find n decomp))\nend\n\n(* 無限大の要素を付け足してトロピカル半環を作る *)\nmodule WithInf\n  (S : sig\n    type t\n    val zero : t\n    val ( + ) : t -> t -> t\n    val compare : t -> t -> int\n  end) :\nsig\n  (* Noneで無限大を表す *)\n  type t = S.t option\n  val inf : t\n  val zero : t\n  val ( + ) : t -> t -> t\n  val compare : t -> t -> int\nend =\nstruct\n  type t = S.t option\n  let inf = None\n  let zero = Some S.zero\n  let ( + ) x y =\n    match x, y with\n    | None, _ -> None\n    | _, None -> None\n    | Some m, Some n -> Some (S.( + ) m n)\n  let compare x y =\n    match x, y with\n    | None, None -> 0\n    | None, _ -> 1\n    | _, None -> -1\n    | Some m, Some n -> S.compare m n\nend\n\n\nmodule WeightedDirectedGraph\n  (Vertex : sig\n    type t\n    val compare : t -> t -> int\n  end)\n  (Weight : sig\n    type t\n    val zero : t\n    val ( + ) : t -> t -> t\n    val compare : t -> t -> int\n  end) :\nsig\n  (* 配列版の実装 *)\n  val raw_bellman_ford :\n    (* 頂点数n *)\n    int ->\n    (* 辺のリスト *)\n    (* 頂点は0からn-1までの整数でなくてはならない *)\n    (int * int * Weight.t) list ->\n    (* 始点 *)\n    int ->\n    (int -> [ `Weight of Weight.t | `Inf | `NegInf ])\n\n  (* 座標圧縮により様々な型を使えるようにしたバージョン *)\n  val bellman_ford :\n    (* 辺のリスト *)\n    (Vertex.t * Vertex.t * Weight.t) list ->\n    (* 始点 *)\n    Vertex.t ->\n    (Vertex.t -> [ `Weight of Weight.t | `Inf | `NegInf ])\nend =\nstruct\n  module CC = CoordComp (Vertex)\n  module Weight' = WithInf (Weight)\n\n  let raw_bellman_ford n es s =\n    (* 距離を覚えるやつ *)\n    (* Noneで無限を表す *)\n    let d = Array.make n None in\n    (* 経路に負閉路が含まれる頂点を覚えるやつ *)\n    let neg = Array.make n false in\n    d.(s) <- Some Weight.zero;\n    for i = 0 to 2 * n - 1 do\n      List.iter (fun (u, v, c) ->\n        let open Weight' in\n        (* c は u から v への辺の重さ *)\n        (* d.(u) + c < d.(v) *)\n        if 0 < compare d.(v) (d.(u) + Some c) then begin\n          d.(v) <- d.(u) + Some c;\n          if n - 1 <= i then\n            (* n 回目以降に変更が起こった場合，v までの経路に負閉路が含まれている *)\n            neg.(v) <- true\n        end) es\n    done;\n    fun v ->\n      if neg.(v) then `NegInf\n      else\n        match d.(v) with\n        | None -> `Inf\n        | Some d -> `Weight d\n\n  let bellman_ford es s =\n    let (n, comp, _) =\n      CC.compress @@\n        List.concat @@\n          List.map (fun (u, v, _) -> [u; v]) es in\n    match \n      raw_bellman_ford n\n        (List.map (fun (u, v, c) -> (comp u, comp v, c)) es) (comp s)\n    with\n    | exception Not_found -> (* 頂点から延びる辺がない *)\n        fun _ -> `Inf\n    | d ->\n        fun v -> try d (comp v) with Not_found -> `Inf\nend\n\n\n \nmodule Int = struct\n  type t = int\n  let zero = 0\n  let ( + ) = ( + )\n  let compare x y = compare y x\nend\n \nmodule G = WeightedDirectedGraph (Int) (Int)\n \nlet () = Scanf.scanf \"%d %d\\n\" (fun n m ->\n  let abcs = Array.init m (fun _ -> Scanf.scanf \"%d %d %d\\n\" (fun a b c -> a - 1, b - 1, c)) in\n  match G.bellman_ford (Array.to_list abcs) 0 (n - 1) with\n  | `NegInf -> print_endline \"inf\"\n  | `Weight c -> Printf.printf \"%d\\n\" c)\n", "language": "OCaml", "metadata": {"date": 1525648206, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s085135036.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s085135036", "user_id": "u504158101"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "module CoordComp\n  (* 座標の型 *)\n  (Coord : sig\n    type t\n    val compare : t -> t -> int\n  end) :\nsig\n  val compress :\n    (* 座標のリスト *)\n    Coord.t list ->\n    (* 座標の数，圧縮する関数と解凍する関数を返す *)\n    int * (Coord.t -> int) * (int -> Coord.t)\nend = struct\n  module IntMap = Map.Make (struct\n    type t = int\n    let compare = compare\n  end)\n  module CoordMap = Map.Make (Coord)\n\n  let compress cs =\n    let (n, comp, decomp) =\n      List.fold_left (fun (n, comp, decomp) c ->\n        if CoordMap.mem c comp then (n, comp, decomp)\n        else (n + 1, CoordMap.add c n comp, IntMap.add n c decomp))\n      (0, CoordMap.empty, IntMap.empty) cs in\n    (n, (fun c -> CoordMap.find c comp), (fun n -> IntMap.find n decomp))\nend\n\n(* 無限大の要素を付け足してトロピカル半環を作る *)\nmodule WithInf\n  (S : sig\n    type t\n    val zero : t\n    val ( + ) : t -> t -> t\n    val compare : t -> t -> int\n  end) :\nsig\n  (* Noneで無限大を表す *)\n  type t = S.t option\n  val inf : t\n  val zero : t\n  val ( + ) : t -> t -> t\n  val compare : t -> t -> int\nend =\nstruct\n  type t = S.t option\n  let inf = None\n  let zero = Some S.zero\n  let ( + ) x y =\n    match x, y with\n    | None, _ -> None\n    | _, None -> None\n    | Some m, Some n -> Some (S.( + ) m n)\n  let compare x y =\n    match x, y with\n    | None, None -> 0\n    | None, _ -> 1\n    | _, None -> -1\n    | Some m, Some n -> S.compare m n\nend\n\n\nmodule WeightedDirectedGraph\n  (Vertex : sig\n    type t\n    val compare : t -> t -> int\n  end)\n  (Weight : sig\n    type t\n    val zero : t\n    val ( + ) : t -> t -> t\n    val compare : t -> t -> int\n  end) :\nsig\n  (* 配列版の実装 *)\n  val raw_bellman_ford :\n    (* 頂点数n *)\n    int ->\n    (* 辺のリスト *)\n    (* 頂点は0からn-1までの整数でなくてはならない *)\n    (int * int * Weight.t) list ->\n    (* 始点 *)\n    int ->\n    (int -> [ `Weight of Weight.t | `Inf | `NegInf ])\n\n  (* 座標圧縮により様々な型を使えるようにしたバージョン *)\n  val bellman_ford :\n    (* 辺のリスト *)\n    (Vertex.t * Vertex.t * Weight.t) list ->\n    (* 始点 *)\n    Vertex.t ->\n    (Vertex.t -> [ `Weight of Weight.t | `Inf | `NegInf ])\nend =\nstruct\n  module CC = CoordComp (Vertex)\n  module Weight' = WithInf (Weight)\n\n  let raw_bellman_ford n es s =\n    (* 距離を覚えるやつ *)\n    (* Noneで無限を表す *)\n    let d = Array.make n None in\n    (* 経路に負閉路が含まれる頂点を覚えるやつ *)\n    let neg = Array.make n false in\n    d.(s) <- Some Weight.zero;\n    for i = 0 to 2 * n - 1 do\n      List.iter (fun (u, v, c) ->\n        let open Weight' in\n        (* c は u から v への辺の重さ *)\n        (* d.(u) + c < d.(v) *)\n        if 0 < compare d.(v) (d.(u) + Some c) then begin\n          d.(v) <- d.(u) + Some c;\n          if n - 1 <= i then\n            (* n 回目以降に変更が起こった場合，v までの経路に負閉路が含まれている *)\n            neg.(v) <- true\n        end) es\n    done;\n    fun v ->\n      if neg.(v) then `NegInf\n      else\n        match d.(v) with\n        | None -> `Inf\n        | Some d -> `Weight d\n\n  let bellman_ford es s =\n    let (n, comp, _) =\n      CC.compress @@\n        List.concat @@\n          List.map (fun (u, v, _) -> [u; v]) es in\n    match \n      raw_bellman_ford n\n        (List.map (fun (u, v, c) -> (comp u, comp v, c)) es) (comp s)\n    with\n    | exception Not_found -> (* 頂点から延びる辺がない *)\n        fun _ -> `Inf\n    | d ->\n        fun v -> try d (comp v) with Not_found -> `Inf\nend\n\n\n \nmodule Int = struct\n  type t = int\n  let zero = 0\n  let ( + ) = ( + )\n  let compare x y = compare y x\nend\n \nmodule G = WeightedDirectedGraph (Int) (Int)\n \nlet () = Scanf.scanf \"%d %d\\n\" (fun n m ->\n  let abcs = Array.init m (fun _ -> Scanf.scanf \"%d %d %d\\n\" (fun a b c -> a - 1, b - 1, c)) in\n  match G.bellman_ford (Array.to_list abcs) 0 (n - 1) with\n  | `NegInf -> print_endline \"inf\"\n  | `Weight c -> Printf.printf \"%d\\n\" c)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a directed graph with N vertices and M edges.\nThe i-th edge (1≤i≤M) points from vertex a_i to vertex b_i, and has a weight c_i.\nWe will play the following single-player game using this graph and a piece.\n\nInitially, the piece is placed at vertex 1, and the score of the player is set to 0.\nThe player can move the piece as follows:\n\nWhen the piece is placed at vertex a_i, move the piece along the i-th edge to vertex b_i. After this move, the score of the player is increased by c_i.\n\nThe player can end the game only when the piece is placed at vertex N.\nThe given graph guarantees that it is possible to traverse from vertex 1 to vertex N.\n\nWhen the player acts optimally to maximize the score at the end of the game, what will the score be?\nIf it is possible to increase the score indefinitely, print inf.\n\nConstraints\n\n2≤N≤1000\n\n1≤M≤min(N(N-1),2000)\n\n1≤a_i,b_i≤N (1≤i≤M)\n\na_i≠b_i (1≤i≤M)\n\na_i≠a_j or b_i≠b_j (1≤i<j≤M)\n\n-10^9≤c_i≤10^9 (1≤i≤M)\n\nc_i is an integer.\n\nIn the given graph, there exists a path from vertex 1 to vertex N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_M b_M c_M\n\nOutput\n\nPrint the maximum possible score at the end of the game, if it is finite. If it is possible to increase the score indefinitely, print inf.\n\nSample Input 1\n\n3 3\n1 2 4\n2 3 3\n1 3 5\n\nSample Output 1\n\n7\n\nThere are two ways to move the piece to vertex N=3:\n\nvertex 1 → vertex 2 → vertex 3 : score 4+3=7\n\nvertex 1 → vertex 3 : score 5\n\nThus, the maximum possible score at the end of the game is 7.\n\nSample Input 2\n\n2 2\n1 2 1\n2 1 1\n\nSample Output 2\n\ninf\n\nIt is possible to increase the score indefinitely by alternating between vertex 1 and 2.\n\nSample Input 3\n\n6 5\n1 2 -1000000000\n2 3 -1000000000\n3 4 -1000000000\n4 5 -1000000000\n5 6 -1000000000\n\nSample Output 3\n\n-5000000000", "sample_input": "3 3\n1 2 4\n2 3 3\n1 3 5\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03722", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere is a directed graph with N vertices and M edges.\nThe i-th edge (1≤i≤M) points from vertex a_i to vertex b_i, and has a weight c_i.\nWe will play the following single-player game using this graph and a piece.\n\nInitially, the piece is placed at vertex 1, and the score of the player is set to 0.\nThe player can move the piece as follows:\n\nWhen the piece is placed at vertex a_i, move the piece along the i-th edge to vertex b_i. After this move, the score of the player is increased by c_i.\n\nThe player can end the game only when the piece is placed at vertex N.\nThe given graph guarantees that it is possible to traverse from vertex 1 to vertex N.\n\nWhen the player acts optimally to maximize the score at the end of the game, what will the score be?\nIf it is possible to increase the score indefinitely, print inf.\n\nConstraints\n\n2≤N≤1000\n\n1≤M≤min(N(N-1),2000)\n\n1≤a_i,b_i≤N (1≤i≤M)\n\na_i≠b_i (1≤i≤M)\n\na_i≠a_j or b_i≠b_j (1≤i<j≤M)\n\n-10^9≤c_i≤10^9 (1≤i≤M)\n\nc_i is an integer.\n\nIn the given graph, there exists a path from vertex 1 to vertex N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_M b_M c_M\n\nOutput\n\nPrint the maximum possible score at the end of the game, if it is finite. If it is possible to increase the score indefinitely, print inf.\n\nSample Input 1\n\n3 3\n1 2 4\n2 3 3\n1 3 5\n\nSample Output 1\n\n7\n\nThere are two ways to move the piece to vertex N=3:\n\nvertex 1 → vertex 2 → vertex 3 : score 4+3=7\n\nvertex 1 → vertex 3 : score 5\n\nThus, the maximum possible score at the end of the game is 7.\n\nSample Input 2\n\n2 2\n1 2 1\n2 1 1\n\nSample Output 2\n\ninf\n\nIt is possible to increase the score indefinitely by alternating between vertex 1 and 2.\n\nSample Input 3\n\n6 5\n1 2 -1000000000\n2 3 -1000000000\n3 4 -1000000000\n4 5 -1000000000\n5 6 -1000000000\n\nSample Output 3\n\n-5000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4045, "cpu_time_ms": 123, "memory_kb": 5376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s895978639", "group_id": "codeNet:p03723", "input_text": "(*\nocamlfind ocamlopt -package batteries -linkpkg main.ml -o a.out\n*)\nopen Batteries\n\nlet i = ref 0\n\nlet rec f a b c =\n        if a mod 2 = 1 && b mod 2 = 1 && c mod 2 = 1 then\n                0\n        else if a = b && a = c && b = c then\n                -1\n        else if a mod 2 = 1 || b mod 2 = 1 || c mod 2 = 1 then\n                !i\n        else\n                let na = (b + c) / 2 in\n                let nb = (a + c) / 2 in\n                let nc = (a + b) / 2 in\n                        incr i;\n                        f na nb nc\n\nlet () =\n        Scanf.sscanf (read_line ()) \"%d %d %d\" (\n                fun a b c -> \n                        f a b c\n        ) |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1590113702, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s895978639.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s895978639", "user_id": "u280335093"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(*\nocamlfind ocamlopt -package batteries -linkpkg main.ml -o a.out\n*)\nopen Batteries\n\nlet i = ref 0\n\nlet rec f a b c =\n        if a mod 2 = 1 && b mod 2 = 1 && c mod 2 = 1 then\n                0\n        else if a = b && a = c && b = c then\n                -1\n        else if a mod 2 = 1 || b mod 2 = 1 || c mod 2 = 1 then\n                !i\n        else\n                let na = (b + c) / 2 in\n                let nb = (a + c) / 2 in\n                let nc = (a + b) / 2 in\n                        incr i;\n                        f na nb nc\n\nlet () =\n        Scanf.sscanf (read_line ()) \"%d %d %d\" (\n                fun a b c -> \n                        f a b c\n        ) |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi, Aoki and Snuke love cookies. They have A, B and C cookies, respectively. Now, they will exchange those cookies by repeating the action below:\n\nEach person simultaneously divides his cookies in half and gives one half to each of the other two persons.\n\nThis action will be repeated until there is a person with odd number of cookies in hand.\n\nHow many times will they repeat this action?\nNote that the answer may not be finite.\n\nConstraints\n\n1 ≤ A,B,C ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times the action will be performed by the three people, if this number is finite.\nIf it is infinite, print -1 instead.\n\nSample Input 1\n\n4 12 20\n\nSample Output 1\n\n3\n\nInitially, Takahashi, Aoki and Snuke have 4, 12 and 20 cookies. Then,\n\nAfter the first action, they have 16, 12 and 8.\n\nAfter the second action, they have 10, 12 and 14.\n\nAfter the third action, they have 13, 12 and 11.\n\nNow, Takahashi and Snuke have odd number of cookies, and therefore the answer is 3.\n\nSample Input 2\n\n14 14 14\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n454 414 444\n\nSample Output 3\n\n1", "sample_input": "4 12 20\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03723", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi, Aoki and Snuke love cookies. They have A, B and C cookies, respectively. Now, they will exchange those cookies by repeating the action below:\n\nEach person simultaneously divides his cookies in half and gives one half to each of the other two persons.\n\nThis action will be repeated until there is a person with odd number of cookies in hand.\n\nHow many times will they repeat this action?\nNote that the answer may not be finite.\n\nConstraints\n\n1 ≤ A,B,C ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times the action will be performed by the three people, if this number is finite.\nIf it is infinite, print -1 instead.\n\nSample Input 1\n\n4 12 20\n\nSample Output 1\n\n3\n\nInitially, Takahashi, Aoki and Snuke have 4, 12 and 20 cookies. Then,\n\nAfter the first action, they have 16, 12 and 8.\n\nAfter the second action, they have 10, 12 and 14.\n\nAfter the third action, they have 13, 12 and 11.\n\nNow, Takahashi and Snuke have odd number of cookies, and therefore the answer is 3.\n\nSample Input 2\n\n14 14 14\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n454 414 444\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 696, "cpu_time_ms": 2, "memory_kb": 1024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s194756535", "group_id": "codeNet:p03723", "input_text": "let a, b, c = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet f a b c = a mod 2 = 1 || b mod 2 = 1 || c mod 2 = 1\nlet rec g n a b c = if f a b c then n else g (n + 1) (b / 2 + c / 2) (c / 2 + a / 2) (a / 2 + b / 2)\nlet _ = Printf.printf \"%d\\n\" @@ if not @@ f a b c && a = b && b = c then -1 else g 0 a b c", "language": "OCaml", "metadata": {"date": 1571458456, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s194756535.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s194756535", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let a, b, c = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet f a b c = a mod 2 = 1 || b mod 2 = 1 || c mod 2 = 1\nlet rec g n a b c = if f a b c then n else g (n + 1) (b / 2 + c / 2) (c / 2 + a / 2) (a / 2 + b / 2)\nlet _ = Printf.printf \"%d\\n\" @@ if not @@ f a b c && a = b && b = c then -1 else g 0 a b c", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi, Aoki and Snuke love cookies. They have A, B and C cookies, respectively. Now, they will exchange those cookies by repeating the action below:\n\nEach person simultaneously divides his cookies in half and gives one half to each of the other two persons.\n\nThis action will be repeated until there is a person with odd number of cookies in hand.\n\nHow many times will they repeat this action?\nNote that the answer may not be finite.\n\nConstraints\n\n1 ≤ A,B,C ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times the action will be performed by the three people, if this number is finite.\nIf it is infinite, print -1 instead.\n\nSample Input 1\n\n4 12 20\n\nSample Output 1\n\n3\n\nInitially, Takahashi, Aoki and Snuke have 4, 12 and 20 cookies. Then,\n\nAfter the first action, they have 16, 12 and 8.\n\nAfter the second action, they have 10, 12 and 14.\n\nAfter the third action, they have 13, 12 and 11.\n\nNow, Takahashi and Snuke have odd number of cookies, and therefore the answer is 3.\n\nSample Input 2\n\n14 14 14\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n454 414 444\n\nSample Output 3\n\n1", "sample_input": "4 12 20\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03723", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi, Aoki and Snuke love cookies. They have A, B and C cookies, respectively. Now, they will exchange those cookies by repeating the action below:\n\nEach person simultaneously divides his cookies in half and gives one half to each of the other two persons.\n\nThis action will be repeated until there is a person with odd number of cookies in hand.\n\nHow many times will they repeat this action?\nNote that the answer may not be finite.\n\nConstraints\n\n1 ≤ A,B,C ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times the action will be performed by the three people, if this number is finite.\nIf it is infinite, print -1 instead.\n\nSample Input 1\n\n4 12 20\n\nSample Output 1\n\n3\n\nInitially, Takahashi, Aoki and Snuke have 4, 12 and 20 cookies. Then,\n\nAfter the first action, they have 16, 12 and 8.\n\nAfter the second action, they have 10, 12 and 14.\n\nAfter the third action, they have 13, 12 and 11.\n\nNow, Takahashi and Snuke have odd number of cookies, and therefore the answer is 3.\n\nSample Input 2\n\n14 14 14\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n454 414 444\n\nSample Output 3\n\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 309, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s160261740", "group_id": "codeNet:p03724", "input_text": "let (n, m) = Scanf.sscanf (read_line ()) \"%d %d\" @@ fun n m -> (n, m)\nlet ab = Array.init m @@ fun _ -> Scanf.sscanf (read_line ()) \"%d %d\" @@ fun a b -> (a, b)\n\nlet cnt = Array.make 100_001 0\n\nlet () =\n  Array.iter (fun (a, b) ->\n    cnt.(a) <- cnt.(a) + 1;\n    cnt.(b) <- cnt.(b) + 1\n  ) ab;\n  print_endline @@ if Array.for_all (fun cnt -> cnt mod 2 = 0) cnt then \"YES\" else \"NO\"", "language": "OCaml", "metadata": {"date": 1592521992, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03724.html", "problem_id": "p03724", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03724/input.txt", "sample_output_relpath": "derived/input_output/data/p03724/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03724/OCaml/s160261740.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s160261740", "user_id": "u811309788"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let (n, m) = Scanf.sscanf (read_line ()) \"%d %d\" @@ fun n m -> (n, m)\nlet ab = Array.init m @@ fun _ -> Scanf.sscanf (read_line ()) \"%d %d\" @@ fun a b -> (a, b)\n\nlet cnt = Array.make 100_001 0\n\nlet () =\n  Array.iter (fun (a, b) ->\n    cnt.(a) <- cnt.(a) + 1;\n    cnt.(b) <- cnt.(b) + 1\n  ) ab;\n  print_endline @@ if Array.for_all (fun cnt -> cnt mod 2 = 0) cnt then \"YES\" else \"NO\"", "problem_context": "Score : 500 points\n\nProblem Statement\n\nTakahashi is not good at problems about trees in programming contests, and Aoki is helping him practice.\n\nFirst, Takahashi created a tree with N vertices numbered 1 through N, and wrote 0 at each edge.\n\nThen, Aoki gave him M queries. The i-th of them is as follows:\n\nIncrement the number written at each edge along the path connecting vertices a_i and b_i, by one.\n\nAfter Takahashi executed all of the queries, he told Aoki that, for every edge, the written number became an even number.\nHowever, Aoki forgot to confirm that the graph Takahashi created was actually a tree, and it is possible that Takahashi made a mistake in creating a tree or executing queries.\n\nDetermine whether there exists a tree that has the property mentioned by Takahashi.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n1 ≤ M ≤ 10^5\n\n1 ≤ a_i,b_i ≤ N\n\na_i ≠ b_i\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 YES if there exists a tree that has the property mentioned by Takahashi; print NO otherwise.\n\nSample Input 1\n\n4 4\n1 2\n2 4\n1 3\n3 4\n\nSample Output 1\n\nYES\n\nFor example, Takahashi's graph has the property mentioned by him if it has the following edges: 1-2, 1-3 and 1-4.\nIn this case, the number written at every edge will become 2.\n\nSample Input 2\n\n5 5\n1 2\n3 5\n5 1\n3 4\n2 3\n\nSample Output 2\n\nNO", "sample_input": "4 4\n1 2\n2 4\n1 3\n3 4\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03724", "source_text": "Score : 500 points\n\nProblem Statement\n\nTakahashi is not good at problems about trees in programming contests, and Aoki is helping him practice.\n\nFirst, Takahashi created a tree with N vertices numbered 1 through N, and wrote 0 at each edge.\n\nThen, Aoki gave him M queries. The i-th of them is as follows:\n\nIncrement the number written at each edge along the path connecting vertices a_i and b_i, by one.\n\nAfter Takahashi executed all of the queries, he told Aoki that, for every edge, the written number became an even number.\nHowever, Aoki forgot to confirm that the graph Takahashi created was actually a tree, and it is possible that Takahashi made a mistake in creating a tree or executing queries.\n\nDetermine whether there exists a tree that has the property mentioned by Takahashi.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n1 ≤ M ≤ 10^5\n\n1 ≤ a_i,b_i ≤ N\n\na_i ≠ b_i\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 YES if there exists a tree that has the property mentioned by Takahashi; print NO otherwise.\n\nSample Input 1\n\n4 4\n1 2\n2 4\n1 3\n3 4\n\nSample Output 1\n\nYES\n\nFor example, Takahashi's graph has the property mentioned by him if it has the following edges: 1-2, 1-3 and 1-4.\nIn this case, the number written at every edge will become 2.\n\nSample Input 2\n\n5 5\n1 2\n3 5\n5 1\n3 4\n2 3\n\nSample Output 2\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 381, "cpu_time_ms": 75, "memory_kb": 10016}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s883996511", "group_id": "codeNet:p03729", "input_text": "module S = String\n\nlet solve a b c = if a.[(S.length a) - 1] == b.[0] && b.[(S.length b) - 1] == c.[0] then \"YES\" else \"NO\"\n\nlet () = Printf.printf \"%s\\n\" (Scanf.scanf \"%s %s %s\" solve)", "language": "OCaml", "metadata": {"date": 1496710490, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s883996511.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s883996511", "user_id": "u877969392"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "module S = String\n\nlet solve a b c = if a.[(S.length a) - 1] == b.[0] && b.[(S.length b) - 1] == c.[0] then \"YES\" else \"NO\"\n\nlet () = Printf.printf \"%s\\n\" (Scanf.scanf \"%s %s %s\" solve)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given three strings A, B and C. Check whether they form a word chain.\n\nMore formally, determine whether both of the following are true:\n\nThe last character in A and the initial character in B are the same.\n\nThe last character in B and the initial character in C are the same.\n\nIf both are true, print YES. Otherwise, print NO.\n\nConstraints\n\nA, B and C are all composed of lowercase English letters (a - z).\n\n1 ≤ |A|, |B|, |C| ≤ 10, where |A|, |B| and |C| are the lengths of A, B and C, respectively.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint YES or NO.\n\nSample Input 1\n\nrng gorilla apple\n\nSample Output 1\n\nYES\n\nThey form a word chain.\n\nSample Input 2\n\nyakiniku unagi sushi\n\nSample Output 2\n\nNO\n\nA and B form a word chain, but B and C do not.\n\nSample Input 3\n\na a a\n\nSample Output 3\n\nYES\n\nSample Input 4\n\naaaaaaaaab aaaaaaaaaa aaaaaaaaab\n\nSample Output 4\n\nNO", "sample_input": "rng gorilla apple\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03729", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given three strings A, B and C. Check whether they form a word chain.\n\nMore formally, determine whether both of the following are true:\n\nThe last character in A and the initial character in B are the same.\n\nThe last character in B and the initial character in C are the same.\n\nIf both are true, print YES. Otherwise, print NO.\n\nConstraints\n\nA, B and C are all composed of lowercase English letters (a - z).\n\n1 ≤ |A|, |B|, |C| ≤ 10, where |A|, |B| and |C| are the lengths of A, B and C, respectively.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint YES or NO.\n\nSample Input 1\n\nrng gorilla apple\n\nSample Output 1\n\nYES\n\nThey form a word chain.\n\nSample Input 2\n\nyakiniku unagi sushi\n\nSample Output 2\n\nNO\n\nA and B form a word chain, but B and C do not.\n\nSample Input 3\n\na a a\n\nSample Output 3\n\nYES\n\nSample Input 4\n\naaaaaaaaab aaaaaaaaaa aaaaaaaaab\n\nSample Output 4\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 185, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s522894779", "group_id": "codeNet:p03729", "input_text": "open Printf\nopen Scanf\n\nlet () =\n  let shiritori a b c =\n    if a.[String.length a - 1] = b.[0] && b.[String.length b - 1] = c.[0] then \"YES\" else \"NO\" in\n  let a, b, c = scanf \"%s %s %s\\n\" (fun x y z -> (x, y, z)) in\n  shiritori a b c |> printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1495159078, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s522894779.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s522894779", "user_id": "u388783188"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet () =\n  let shiritori a b c =\n    if a.[String.length a - 1] = b.[0] && b.[String.length b - 1] = c.[0] then \"YES\" else \"NO\" in\n  let a, b, c = scanf \"%s %s %s\\n\" (fun x y z -> (x, y, z)) in\n  shiritori a b c |> printf \"%s\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given three strings A, B and C. Check whether they form a word chain.\n\nMore formally, determine whether both of the following are true:\n\nThe last character in A and the initial character in B are the same.\n\nThe last character in B and the initial character in C are the same.\n\nIf both are true, print YES. Otherwise, print NO.\n\nConstraints\n\nA, B and C are all composed of lowercase English letters (a - z).\n\n1 ≤ |A|, |B|, |C| ≤ 10, where |A|, |B| and |C| are the lengths of A, B and C, respectively.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint YES or NO.\n\nSample Input 1\n\nrng gorilla apple\n\nSample Output 1\n\nYES\n\nThey form a word chain.\n\nSample Input 2\n\nyakiniku unagi sushi\n\nSample Output 2\n\nNO\n\nA and B form a word chain, but B and C do not.\n\nSample Input 3\n\na a a\n\nSample Output 3\n\nYES\n\nSample Input 4\n\naaaaaaaaab aaaaaaaaaa aaaaaaaaab\n\nSample Output 4\n\nNO", "sample_input": "rng gorilla apple\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03729", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given three strings A, B and C. Check whether they form a word chain.\n\nMore formally, determine whether both of the following are true:\n\nThe last character in A and the initial character in B are the same.\n\nThe last character in B and the initial character in C are the same.\n\nIf both are true, print YES. Otherwise, print NO.\n\nConstraints\n\nA, B and C are all composed of lowercase English letters (a - z).\n\n1 ≤ |A|, |B|, |C| ≤ 10, where |A|, |B| and |C| are the lengths of A, B and C, respectively.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint YES or NO.\n\nSample Input 1\n\nrng gorilla apple\n\nSample Output 1\n\nYES\n\nThey form a word chain.\n\nSample Input 2\n\nyakiniku unagi sushi\n\nSample Output 2\n\nNO\n\nA and B form a word chain, but B and C do not.\n\nSample Input 3\n\na a a\n\nSample Output 3\n\nYES\n\nSample Input 4\n\naaaaaaaaab aaaaaaaaaa aaaaaaaaab\n\nSample Output 4\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 253, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s452643432", "group_id": "codeNet:p03730", "input_text": "let a, b, c = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet _ = for i = 1 to b do if i * a mod b = c then (print_endline \"YES\"; exit 0) done; print_endline \"NO\"", "language": "OCaml", "metadata": {"date": 1562865690, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03730.html", "problem_id": "p03730", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03730/input.txt", "sample_output_relpath": "derived/input_output/data/p03730/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03730/OCaml/s452643432.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s452643432", "user_id": "u732304692"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let a, b, c = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet _ = for i = 1 to b do if i * a mod b = c then (print_endline \"YES\"; exit 0) done; print_endline \"NO\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe ask you to select some number of positive integers, and calculate the sum of them.\n\nIt is allowed to select as many integers as you like, and as large integers as you wish.\nYou have to follow these, however: each selected integer needs to be a multiple of A, and you need to select at least one integer.\n\nYour objective is to make the sum congruent to C modulo B.\nDetermine whether this is possible.\n\nIf the objective is achievable, print YES. Otherwise, print NO.\n\nConstraints\n\n1 ≤ A ≤ 100\n\n1 ≤ B ≤ 100\n\n0 ≤ C < B\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint YES or NO.\n\nSample Input 1\n\n7 5 1\n\nSample Output 1\n\nYES\n\nFor example, if you select 7 and 14, the sum 21 is congruent to 1 modulo 5.\n\nSample Input 2\n\n2 2 1\n\nSample Output 2\n\nNO\n\nThe sum of even numbers, no matter how many, is never odd.\n\nSample Input 3\n\n1 100 97\n\nSample Output 3\n\nYES\n\nYou can select 97, since you may select multiples of 1, that is, all integers.\n\nSample Input 4\n\n40 98 58\n\nSample Output 4\n\nYES\n\nSample Input 5\n\n77 42 36\n\nSample Output 5\n\nNO", "sample_input": "7 5 1\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03730", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe ask you to select some number of positive integers, and calculate the sum of them.\n\nIt is allowed to select as many integers as you like, and as large integers as you wish.\nYou have to follow these, however: each selected integer needs to be a multiple of A, and you need to select at least one integer.\n\nYour objective is to make the sum congruent to C modulo B.\nDetermine whether this is possible.\n\nIf the objective is achievable, print YES. Otherwise, print NO.\n\nConstraints\n\n1 ≤ A ≤ 100\n\n1 ≤ B ≤ 100\n\n0 ≤ C < B\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint YES or NO.\n\nSample Input 1\n\n7 5 1\n\nSample Output 1\n\nYES\n\nFor example, if you select 7 and 14, the sum 21 is congruent to 1 modulo 5.\n\nSample Input 2\n\n2 2 1\n\nSample Output 2\n\nNO\n\nThe sum of even numbers, no matter how many, is never odd.\n\nSample Input 3\n\n1 100 97\n\nSample Output 3\n\nYES\n\nYou can select 97, since you may select multiples of 1, that is, all integers.\n\nSample Input 4\n\n40 98 58\n\nSample Output 4\n\nYES\n\nSample Input 5\n\n77 42 36\n\nSample Output 5\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 166, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s056984401", "group_id": "codeNet:p03734", "input_text": "module IntMap = Map.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n wmax ->\n  let wvs = Array.init n @@ fun _ ->\n    Scanf.scanf \"%d %d\\n\" @@ fun w v -> w, v in\n  Array.fold_left (fun m (w, v) ->\n    IntMap.fold (fun w' v' m ->\n      if wmax < w + w' then m\n      else IntMap.add (w + w') (max (v + v') @@\n        try IntMap.find (w + w') m with Not_found -> min_int) m) m m) (IntMap.singleton 0 0) wvs\n  |> (fun m -> IntMap.fold (fun _ -> max) m min_int)\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1532176308, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s056984401.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s056984401", "user_id": "u504158101"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "module IntMap = Map.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n wmax ->\n  let wvs = Array.init n @@ fun _ ->\n    Scanf.scanf \"%d %d\\n\" @@ fun w v -> w, v in\n  Array.fold_left (fun m (w, v) ->\n    IntMap.fold (fun w' v' m ->\n      if wmax < w + w' then m\n      else IntMap.add (w + w') (max (v + v') @@\n        try IntMap.find (w + w') m with Not_found -> min_int) m) m m) (IntMap.singleton 0 0) wvs\n  |> (fun m -> IntMap.fold (fun _ -> max) m min_int)\n  |> Printf.printf \"%d\\n\"\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 532, "cpu_time_ms": 43, "memory_kb": 5504}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s735488665", "group_id": "codeNet:p03735", "input_text": "let rec solve acc rmax rmin bmax bmin xys =\n  if acc <= (rmax - rmin) * (bmax - bmin) then acc\n  else\n    match xys with\n    | [] -> (rmax - rmin) * (bmax - bmin)\n    | (x, y) :: rest ->\n        solve\n          (solve acc\n            (max x rmax) (min x rmin)\n            (max y bmax) (min y bmin) rest)\n          (max y rmax) (min y rmin)\n          (max x bmax) (min x bmin) rest\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let xys = Array.to_list @@ Array.init n @@ fun _ ->\n    Scanf.scanf \"%d %d\\n\" @@ fun x y -> x, y in\n  Printf.printf \"%d\\n\" @@ solve max_int 1 1000000000 1 1000000000 xys\n", "language": "OCaml", "metadata": {"date": 1539320820, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03735.html", "problem_id": "p03735", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03735/input.txt", "sample_output_relpath": "derived/input_output/data/p03735/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03735/OCaml/s735488665.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s735488665", "user_id": "u504158101"}, "prompt_components": {"gold_output": "15\n", "input_to_evaluate": "let rec solve acc rmax rmin bmax bmin xys =\n  if acc <= (rmax - rmin) * (bmax - bmin) then acc\n  else\n    match xys with\n    | [] -> (rmax - rmin) * (bmax - bmin)\n    | (x, y) :: rest ->\n        solve\n          (solve acc\n            (max x rmax) (min x rmin)\n            (max y bmax) (min y bmin) rest)\n          (max y rmax) (min y rmin)\n          (max x bmax) (min x bmin) rest\n\nlet () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let xys = Array.to_list @@ Array.init n @@ fun _ ->\n    Scanf.scanf \"%d %d\\n\" @@ fun x y -> x, y in\n  Printf.printf \"%d\\n\" @@ solve max_int 1 1000000000 1 1000000000 xys\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nThere are N bags, each containing two white balls. The i-th box contains two balls with integers x_i and y_i written on them, respectively.\n\nFor each of these bags, you will paint one of the balls red, and paint the other blue.\n\nAfterwards, the 2N balls will be classified according to color.\n\nThen, we will define the following:\n\nR_{max}: the maximum integer written on a ball painted in red\n\nR_{min}: the minimum integer written on a ball painted in red\n\nB_{max}: the maximum integer written on a ball painted in blue\n\nB_{min}: the minimum integer written on a ball painted in blue\n\nFind the minimum possible value of (R_{max} - R_{min}) \\times (B_{max} - B_{min}).\n\nConstraints\n\n1 ≤ N ≤ 200,000\n\n1 ≤ x_i, y_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n:\nx_N y_N\n\nOutput\n\nPrint the minimum possible value.\n\nSample Input 1\n\n3\n1 2\n3 4\n5 6\n\nSample Output 1\n\n15\n\nThe optimal solution is to paint the balls with x_1, x_2, y_3 red, and paint the balls with y_1, y_2, x_3 blue.\n\nSample Input 2\n\n3\n1010 10\n1000 1\n20 1020\n\nSample Output 2\n\n380\n\nSample Input 3\n\n2\n1 1\n1000000000 1000000000\n\nSample Output 3\n\n999999998000000001", "sample_input": "3\n1 2\n3 4\n5 6\n"}, "reference_outputs": ["15\n"], "source_document_id": "p03735", "source_text": "Score : 700 points\n\nProblem Statement\n\nThere are N bags, each containing two white balls. The i-th box contains two balls with integers x_i and y_i written on them, respectively.\n\nFor each of these bags, you will paint one of the balls red, and paint the other blue.\n\nAfterwards, the 2N balls will be classified according to color.\n\nThen, we will define the following:\n\nR_{max}: the maximum integer written on a ball painted in red\n\nR_{min}: the minimum integer written on a ball painted in red\n\nB_{max}: the maximum integer written on a ball painted in blue\n\nB_{min}: the minimum integer written on a ball painted in blue\n\nFind the minimum possible value of (R_{max} - R_{min}) \\times (B_{max} - B_{min}).\n\nConstraints\n\n1 ≤ N ≤ 200,000\n\n1 ≤ x_i, y_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n:\nx_N y_N\n\nOutput\n\nPrint the minimum possible value.\n\nSample Input 1\n\n3\n1 2\n3 4\n5 6\n\nSample Output 1\n\n15\n\nThe optimal solution is to paint the balls with x_1, x_2, y_3 red, and paint the balls with y_1, y_2, x_3 blue.\n\nSample Input 2\n\n3\n1010 10\n1000 1\n20 1020\n\nSample Output 2\n\n380\n\nSample Input 3\n\n2\n1 1\n1000000000 1000000000\n\nSample Output 3\n\n999999998000000001", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2109, "memory_kb": 39580}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s245700950", "group_id": "codeNet:p03737", "input_text": "Scanf.scanf \"%s %s %s\" (fun s1 s2 s3 ->\n    let c s = String.capitalize (String.sub s 0 1) in\n    Printf.printf \"%s%s%s\\n\" (c s1) (c s2) (c s3)\n)", "language": "OCaml", "metadata": {"date": 1585708181, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s245700950.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s245700950", "user_id": "u342443598"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "Scanf.scanf \"%s %s %s\" (fun s1 s2 s3 ->\n    let c s = String.capitalize (String.sub s 0 1) in\n    Printf.printf \"%s%s%s\\n\" (c s1) (c s2) (c s3)\n)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between.\nPrint the acronym formed from the uppercased initial letters of the words.\n\nConstraints\n\ns_1, s_2 and s_3 are composed of lowercase English letters.\n\n1 ≤ |s_i| ≤ 10 (1≤i≤3)\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_1 s_2 s_3\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\natcoder beginner contest\n\nSample Output 1\n\nABC\n\nThe initial letters of atcoder, beginner and contest are a, b and c. Uppercase and concatenate them to obtain ABC.\n\nSample Input 2\n\nresident register number\n\nSample Output 2\n\nRRN\n\nSample Input 3\n\nk nearest neighbor\n\nSample Output 3\n\nKNN\n\nSample Input 4\n\nasync layered coding\n\nSample Output 4\n\nALC", "sample_input": "atcoder beginner contest\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03737", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between.\nPrint the acronym formed from the uppercased initial letters of the words.\n\nConstraints\n\ns_1, s_2 and s_3 are composed of lowercase English letters.\n\n1 ≤ |s_i| ≤ 10 (1≤i≤3)\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_1 s_2 s_3\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\natcoder beginner contest\n\nSample Output 1\n\nABC\n\nThe initial letters of atcoder, beginner and contest are a, b and c. Uppercase and concatenate them to obtain ABC.\n\nSample Input 2\n\nresident register number\n\nSample Output 2\n\nRRN\n\nSample Input 3\n\nk nearest neighbor\n\nSample Output 3\n\nKNN\n\nSample Input 4\n\nasync layered coding\n\nSample Output 4\n\nALC", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 145, "cpu_time_ms": 2, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s605170398", "group_id": "codeNet:p03737", "input_text": "let up c = String.uppercase (Char.escaped c)\nlet () =\n  Scanf.scanf \"%s %s %s\" (fun s1 s2 s3 -> \n      (up s1.[0]) ^ (up s2.[0]) ^ (up s3.[0]))\n  |> print_endline", "language": "OCaml", "metadata": {"date": 1521964803, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s605170398.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s605170398", "user_id": "u987869509"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "let up c = String.uppercase (Char.escaped c)\nlet () =\n  Scanf.scanf \"%s %s %s\" (fun s1 s2 s3 -> \n      (up s1.[0]) ^ (up s2.[0]) ^ (up s3.[0]))\n  |> print_endline", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between.\nPrint the acronym formed from the uppercased initial letters of the words.\n\nConstraints\n\ns_1, s_2 and s_3 are composed of lowercase English letters.\n\n1 ≤ |s_i| ≤ 10 (1≤i≤3)\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_1 s_2 s_3\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\natcoder beginner contest\n\nSample Output 1\n\nABC\n\nThe initial letters of atcoder, beginner and contest are a, b and c. Uppercase and concatenate them to obtain ABC.\n\nSample Input 2\n\nresident register number\n\nSample Output 2\n\nRRN\n\nSample Input 3\n\nk nearest neighbor\n\nSample Output 3\n\nKNN\n\nSample Input 4\n\nasync layered coding\n\nSample Output 4\n\nALC", "sample_input": "atcoder beginner contest\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03737", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between.\nPrint the acronym formed from the uppercased initial letters of the words.\n\nConstraints\n\ns_1, s_2 and s_3 are composed of lowercase English letters.\n\n1 ≤ |s_i| ≤ 10 (1≤i≤3)\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns_1 s_2 s_3\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\natcoder beginner contest\n\nSample Output 1\n\nABC\n\nThe initial letters of atcoder, beginner and contest are a, b and c. Uppercase and concatenate them to obtain ABC.\n\nSample Input 2\n\nresident register number\n\nSample Output 2\n\nRRN\n\nSample Input 3\n\nk nearest neighbor\n\nSample Output 3\n\nKNN\n\nSample Input 4\n\nasync layered coding\n\nSample Output 4\n\nALC", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 162, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s330085505", "group_id": "codeNet:p03738", "input_text": "let e = \"EQUAL\" and g = \"GREATER\" and l = \"LESS\"\n\nlet f s1 s2 =\n  let rec aux i =\n    if i = String.length s1 then e\n    else if s1.[i] > s2.[i] then g\n    else if s1.[i] < s2.[i] then l\n    else aux (i + i)\n  in\n  aux 0\n\nlet () =\n  let a = read_line () and b = read_line () in\n  ( if String.length a > String.length b then g\n  else if String.length a < String.length b then l\n  else f a b )\n  |> print_endline", "language": "OCaml", "metadata": {"date": 1521965783, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s330085505.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s330085505", "user_id": "u987869509"}, "prompt_components": {"gold_output": "GREATER\n", "input_to_evaluate": "let e = \"EQUAL\" and g = \"GREATER\" and l = \"LESS\"\n\nlet f s1 s2 =\n  let rec aux i =\n    if i = String.length s1 then e\n    else if s1.[i] > s2.[i] then g\n    else if s1.[i] < s2.[i] then l\n    else aux (i + i)\n  in\n  aux 0\n\nlet () =\n  let a = read_line () and b = read_line () in\n  ( if String.length a > String.length b then g\n  else if String.length a < String.length b then l\n  else f a b )\n  |> print_endline", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two positive integers A and B. Compare the magnitudes of these numbers.\n\nConstraints\n\n1 ≤ A, B ≤ 10^{100}\n\nNeither A nor B begins with a 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\n\nOutput\n\nPrint GREATER if A>B, LESS if A<B and EQUAL if A=B.\n\nSample Input 1\n\n36\n24\n\nSample Output 1\n\nGREATER\n\nSince 36>24, print GREATER.\n\nSample Input 2\n\n850\n3777\n\nSample Output 2\n\nLESS\n\nSample Input 3\n\n9720246\n22516266\n\nSample Output 3\n\nLESS\n\nSample Input 4\n\n123456789012345678901234567890\n234567890123456789012345678901\n\nSample Output 4\n\nLESS", "sample_input": "36\n24\n"}, "reference_outputs": ["GREATER\n"], "source_document_id": "p03738", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two positive integers A and B. Compare the magnitudes of these numbers.\n\nConstraints\n\n1 ≤ A, B ≤ 10^{100}\n\nNeither A nor B begins with a 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\n\nOutput\n\nPrint GREATER if A>B, LESS if A<B and EQUAL if A=B.\n\nSample Input 1\n\n36\n24\n\nSample Output 1\n\nGREATER\n\nSince 36>24, print GREATER.\n\nSample Input 2\n\n850\n3777\n\nSample Output 2\n\nLESS\n\nSample Input 3\n\n9720246\n22516266\n\nSample Output 3\n\nLESS\n\nSample Input 4\n\n123456789012345678901234567890\n234567890123456789012345678901\n\nSample Output 4\n\nLESS", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 410, "cpu_time_ms": 2103, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s253459096", "group_id": "codeNet:p03739", "input_text": "open Batteries\nlet () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  let a_lst = Array.to_list @@ Array.init n (fun _ -> Scanf.scanf \"%d \" (fun a -> a)) in\n\n  let rec aux sum sign cnt l =\n    match l with\n    | [] -> cnt\n    | hd :: tl -> match sign with\n      | `Plus -> \n        if sum + hd <= 0 then aux sum sign (cnt+1) (hd+1::tl) else aux (sum+hd) `Minus cnt tl\n      | `Minus -> \n        if sum + hd >= 0 then aux sum sign (cnt+1) (hd-1::tl) else aux (sum+hd) `Plus cnt tl\n  in\n\n  Printf.printf \"%d\\n\" @@\n  aux 0 (if List.hd a_lst > 0 then `Plus else `Minus) 0 a_lst\n", "language": "OCaml", "metadata": {"date": 1530602852, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03739.html", "problem_id": "p03739", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03739/input.txt", "sample_output_relpath": "derived/input_output/data/p03739/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03739/OCaml/s253459096.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s253459096", "user_id": "u139013163"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "open Batteries\nlet () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  let a_lst = Array.to_list @@ Array.init n (fun _ -> Scanf.scanf \"%d \" (fun a -> a)) in\n\n  let rec aux sum sign cnt l =\n    match l with\n    | [] -> cnt\n    | hd :: tl -> match sign with\n      | `Plus -> \n        if sum + hd <= 0 then aux sum sign (cnt+1) (hd+1::tl) else aux (sum+hd) `Minus cnt tl\n      | `Minus -> \n        if sum + hd >= 0 then aux sum sign (cnt+1) (hd-1::tl) else aux (sum+hd) `Plus cnt tl\n  in\n\n  Printf.printf \"%d\\n\" @@\n  aux 0 (if List.hd a_lst > 0 then `Plus else `Minus) 0 a_lst\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length N. The i-th term in the sequence is a_i.\nIn one operation, you can select a term and either increment or decrement it by one.\n\nAt least how many operations are necessary to satisfy the following conditions?\n\nFor every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.\n\nFor every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.\n\nConstraints\n\n2 ≤ n ≤ 10^5\n\n|a_i| ≤ 10^9\n\nEach a_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\na_1 a_2 ... a_n\n\nOutput\n\nPrint the minimum necessary count of operations.\n\nSample Input 1\n\n4\n1 -3 1 0\n\nSample Output 1\n\n4\n\nFor example, the given sequence can be transformed into 1, -2, 2, -2 by four operations. The sums of the first one, two, three and four terms are 1, -1, 1 and -1, respectively, which satisfy the conditions.\n\nSample Input 2\n\n5\n3 -6 4 -5 7\n\nSample Output 2\n\n0\n\nThe given sequence already satisfies the conditions.\n\nSample Input 3\n\n6\n-1 4 3 2 -5 4\n\nSample Output 3\n\n8", "sample_input": "4\n1 -3 1 0\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03739", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length N. The i-th term in the sequence is a_i.\nIn one operation, you can select a term and either increment or decrement it by one.\n\nAt least how many operations are necessary to satisfy the following conditions?\n\nFor every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.\n\nFor every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.\n\nConstraints\n\n2 ≤ n ≤ 10^5\n\n|a_i| ≤ 10^9\n\nEach a_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn\na_1 a_2 ... a_n\n\nOutput\n\nPrint the minimum necessary count of operations.\n\nSample Input 1\n\n4\n1 -3 1 0\n\nSample Output 1\n\n4\n\nFor example, the given sequence can be transformed into 1, -2, 2, -2 by four operations. The sums of the first one, two, three and four terms are 1, -1, 1 and -1, respectively, which satisfy the conditions.\n\nSample Input 2\n\n5\n3 -6 4 -5 7\n\nSample Output 2\n\n0\n\nThe given sequence already satisfies the conditions.\n\nSample Input 3\n\n6\n-1 4 3 2 -5 4\n\nSample Output 3\n\n8", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2104, "memory_kb": 8320}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s777056910", "group_id": "codeNet:p03745", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n\n    let rec loop i mode acc =\n        if i = n then acc else\n            match mode with\n            | 0 -> if a.(i) < a.(i - 1) then loop (i + 1) (-1) acc else\n                   if a.(i) > a.(i - 1) then loop (i + 1) (+1) acc else\n                                             loop (i + 1) mode acc\n            | 1 -> if a.(i) > a.(i - 1) then loop (i + 1) mode acc else\n                                             loop (i + 1) 0 (acc + 1)\n            | _ -> if a.(i) < a.(i - 1) then loop (i + 1) mode acc else\n                                             loop (i + 1) 0 (acc + 1)\n    in\n    loop 1 0 1 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1597377408, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03745.html", "problem_id": "p03745", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03745/input.txt", "sample_output_relpath": "derived/input_output/data/p03745/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03745/OCaml/s777056910.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s777056910", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n\n    let rec loop i mode acc =\n        if i = n then acc else\n            match mode with\n            | 0 -> if a.(i) < a.(i - 1) then loop (i + 1) (-1) acc else\n                   if a.(i) > a.(i - 1) then loop (i + 1) (+1) acc else\n                                             loop (i + 1) mode acc\n            | 1 -> if a.(i) > a.(i - 1) then loop (i + 1) mode acc else\n                                             loop (i + 1) 0 (acc + 1)\n            | _ -> if a.(i) < a.(i - 1) then loop (i + 1) mode acc else\n                                             loop (i + 1) 0 (acc + 1)\n    in\n    loop 1 0 1 |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an array A of length N.\nYour task is to divide it into several contiguous subarrays.\nHere, all subarrays obtained must be sorted in either non-decreasing or non-increasing order.\nAt least how many subarrays do you need to divide A into?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nEach A_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible number of subarrays after division of A.\n\nSample Input 1\n\n6\n1 2 3 2 2 1\n\nSample Output 1\n\n2\n\nOne optimal solution is to divide the array into [1,2,3] and [2,2,1].\n\nSample Input 2\n\n9\n1 2 1 2 1 2 1 2 1\n\nSample Output 2\n\n5\n\nSample Input 3\n\n7\n1 2 3 2 1 999999999 1000000000\n\nSample Output 3\n\n3", "sample_input": "6\n1 2 3 2 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03745", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an array A of length N.\nYour task is to divide it into several contiguous subarrays.\nHere, all subarrays obtained must be sorted in either non-decreasing or non-increasing order.\nAt least how many subarrays do you need to divide A into?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nEach A_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible number of subarrays after division of A.\n\nSample Input 1\n\n6\n1 2 3 2 2 1\n\nSample Output 1\n\n2\n\nOne optimal solution is to divide the array into [1,2,3] and [2,2,1].\n\nSample Input 2\n\n9\n1 2 1 2 1 2 1 2 1\n\nSample Output 2\n\n5\n\nSample Input 3\n\n7\n1 2 3 2 1 999999999 1000000000\n\nSample Output 3\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 729, "cpu_time_ms": 38, "memory_kb": 6692}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s465687771", "group_id": "codeNet:p03745", "input_text": "let rec remove value lst =\n\tlet rec remove_sub rel value lst =\n\t\tmatch lst with\n\t\t| []      -> []\n\t\t| x :: xs ->\n\t\t\tif rel value x then remove_sub rel x xs\n\t\t\telse x :: xs\n\tin\n\tmatch lst with\n\t| []      -> []\n\t| x :: xs ->\n\t\tif value < x then remove_sub (<=) x xs\n\t\telse if value > x then remove_sub (>=) x xs\n\t\telse remove x xs\n\nlet rec solve count lst =\n\tmatch lst with\n\t| []      -> count\n\t| x :: xs -> solve (count + 1) (remove x xs)\n\nlet () =\n\tlet n = read_int () in\n\tlet a =\n\t\tread_line ()\n\t\t|> Str.split (Str.regexp \" \")\n\t\t|> List.map int_of_string\n\tin\n\tsolve 0 a\n\t|> print_int\n\t|> print_newline\n", "language": "OCaml", "metadata": {"date": 1492369006, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03745.html", "problem_id": "p03745", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03745/input.txt", "sample_output_relpath": "derived/input_output/data/p03745/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03745/OCaml/s465687771.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s465687771", "user_id": "u420267469"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let rec remove value lst =\n\tlet rec remove_sub rel value lst =\n\t\tmatch lst with\n\t\t| []      -> []\n\t\t| x :: xs ->\n\t\t\tif rel value x then remove_sub rel x xs\n\t\t\telse x :: xs\n\tin\n\tmatch lst with\n\t| []      -> []\n\t| x :: xs ->\n\t\tif value < x then remove_sub (<=) x xs\n\t\telse if value > x then remove_sub (>=) x xs\n\t\telse remove x xs\n\nlet rec solve count lst =\n\tmatch lst with\n\t| []      -> count\n\t| x :: xs -> solve (count + 1) (remove x xs)\n\nlet () =\n\tlet n = read_int () in\n\tlet a =\n\t\tread_line ()\n\t\t|> Str.split (Str.regexp \" \")\n\t\t|> List.map int_of_string\n\tin\n\tsolve 0 a\n\t|> print_int\n\t|> print_newline\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an array A of length N.\nYour task is to divide it into several contiguous subarrays.\nHere, all subarrays obtained must be sorted in either non-decreasing or non-increasing order.\nAt least how many subarrays do you need to divide A into?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nEach A_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible number of subarrays after division of A.\n\nSample Input 1\n\n6\n1 2 3 2 2 1\n\nSample Output 1\n\n2\n\nOne optimal solution is to divide the array into [1,2,3] and [2,2,1].\n\nSample Input 2\n\n9\n1 2 1 2 1 2 1 2 1\n\nSample Output 2\n\n5\n\nSample Input 3\n\n7\n1 2 3 2 1 999999999 1000000000\n\nSample Output 3\n\n3", "sample_input": "6\n1 2 3 2 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03745", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an array A of length N.\nYour task is to divide it into several contiguous subarrays.\nHere, all subarrays obtained must be sorted in either non-decreasing or non-increasing order.\nAt least how many subarrays do you need to divide A into?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nEach A_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum possible number of subarrays after division of A.\n\nSample Input 1\n\n6\n1 2 3 2 2 1\n\nSample Output 1\n\n2\n\nOne optimal solution is to divide the array into [1,2,3] and [2,2,1].\n\nSample Input 2\n\n9\n1 2 1 2 1 2 1 2 1\n\nSample Output 2\n\n5\n\nSample Input 3\n\n7\n1 2 3 2 1 999999999 1000000000\n\nSample Output 3\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 41, "memory_kb": 16000}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s045190596", "group_id": "codeNet:p03752", "input_text": "open Batteries\nopen Tuple\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\n\nlet dbg x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\n\nlet (++) n m = List.range n `To m\nlet (++^) n m = List.range n `To (pred m)\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then Enum.empty ()\n  else\n    List.map (fun _ -> scan fmt f) (List.range 1 `To n)\n    |> List.enum\n\nlet scan_list cnv =\n  String.split_on_char ' ' @@ read_line ()\n  |> List.map cnv\n\nlet scan_array = Array.of_list % scan_list\n\nlet scan_matrix n m e conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (List.range 0 `To (pred n))\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet (n,k) = scan \"%d %d\" Tuple2.make\nlet m = scan_array Int.of_string\n\nlet () =\n  let sets = powerset (0 --^ n) in\n  EnumL.map sets ~f:(fun set ->\n      if Enum.count @@ Enum.clone set = k then\n        let i = Enum.get_exn (Enum.clone set) in\n        EnumL.fold set\n          ~init:((try Array.max @@ Array.left m i with Invalid_argument _ -> 0), 0) ~f:(fun (h, acc) i ->\n              if m.(i) > h then (m.(i), acc) else (h+1, acc+h+1 - m.(i)))\n        |> Tuple2.second\n      else\n        Int.max_num)\n  |> Enum.reduce min\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1587096394, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03752.html", "problem_id": "p03752", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03752/input.txt", "sample_output_relpath": "derived/input_output/data/p03752/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03752/OCaml/s045190596.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s045190596", "user_id": "u802614675"}, "prompt_components": {"gold_output": "1541\n", "input_to_evaluate": "open Batteries\nopen Tuple\nmodule EnumL = Enum.Labels\nmodule ListL = List.Labels\n\nlet dbg x = Printf.eprintf \"[debug]%s\\n\" @@ dump x\n\nlet (++) n m = List.range n `To m\nlet (++^) n m = List.range n `To (pred m)\n\nlet scan fmt = Scanf.sscanf (read_line ()) fmt\n\nlet scan_lines n fmt f =\n  if n = 0 then Enum.empty ()\n  else\n    List.map (fun _ -> scan fmt f) (List.range 1 `To n)\n    |> List.enum\n\nlet scan_list cnv =\n  String.split_on_char ' ' @@ read_line ()\n  |> List.map cnv\n\nlet scan_array = Array.of_list % scan_list\n\nlet scan_matrix n m e conv =\n  let arr = Array.make_matrix n m e in\n  ListL.iter (List.range 0 `To (pred n))\n    ~f:(fun i -> arr.(i) <- Array.of_list @@ scan_list conv);\n  arr\n\nlet rec powerset e =\n  match Enum.get e with\n  | None -> Enum.singleton @@ Enum.empty ()\n  | Some v ->\n    let f = powerset e in\n    let g = Enum.clone f in\n    EnumL.map f ~f:(fun x -> let y = Enum.clone x in push y v; y)\n    |>  Enum.append g\n\nlet intersection l =\n  EnumL.filter ~f:(fun x -> EnumL.exists ~f:((=) x) @@ Enum.clone l)\n\nlet (n,k) = scan \"%d %d\" Tuple2.make\nlet m = scan_array Int.of_string\n\nlet () =\n  let sets = powerset (0 --^ n) in\n  EnumL.map sets ~f:(fun set ->\n      if Enum.count @@ Enum.clone set = k then\n        let i = Enum.get_exn (Enum.clone set) in\n        EnumL.fold set\n          ~init:((try Array.max @@ Array.left m i with Invalid_argument _ -> 0), 0) ~f:(fun (h, acc) i ->\n              if m.(i) > h then (m.(i), acc) else (h+1, acc+h+1 - m.(i)))\n        |> Tuple2.second\n      else\n        Int.max_num)\n  |> Enum.reduce min\n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Max Score: 350 Points\n\nProblem Statement\n\nThere are N buildings along the line. The i-th building from the left is colored in color i, and its height is currently a_i meters.\n\nChokudai is a mayor of the city, and he loves colorful thigs. And now he wants to see at least K buildings from the left.\n\nYou can increase height of buildings, but it costs 1 yens to increase 1 meters. It means you cannot make building that height is not integer.\n\nYou cannot decrease height of buildings.\n\nCalculate the minimum cost of satisfying Chokudai's objective.\n\nNote: \"Building i can see from the left\" means there are no j exists that (height of building j) ≥ (height of building i) and j < i.\n\nInput Format\n\nN K\na_1 a_2 a_3 ... a_N\n\nOutput Format\n\nPrint the minimum cost in one line. In the end put a line break.\n\nConstraints\n\n1 ≤ K ≤ N ≤ 15\n\n1 ≤ a_i ≤ 10^9\n\nScoring\n\nSubtask 1 [120 points]\n\nN = K\n\nSubtask 2 [90 points]\n\nN ≤ 5\n\na_i ≤ 7\n\nSubtask 3 [140 points]\n\nThere are no additional constraints.\n\nSample Input 1\n\n5 5\n3949 3774 3598 3469 3424\n\nSample Output 1\n\n1541\n\nThe optimal solution is (height of buildings from the left) = [3949, 3950, 3951, 3952, 3953].\n\nSample Input 2\n\n5 3\n7 4 2 6 4\n\nSample Output 2\n\n7\n\nThe optimal solution is (height of buildings from the left) = [7, 8, 2, 9, 4].", "sample_input": "5 5\n3949 3774 3598 3469 3424\n"}, "reference_outputs": ["1541\n"], "source_document_id": "p03752", "source_text": "Max Score: 350 Points\n\nProblem Statement\n\nThere are N buildings along the line. The i-th building from the left is colored in color i, and its height is currently a_i meters.\n\nChokudai is a mayor of the city, and he loves colorful thigs. And now he wants to see at least K buildings from the left.\n\nYou can increase height of buildings, but it costs 1 yens to increase 1 meters. It means you cannot make building that height is not integer.\n\nYou cannot decrease height of buildings.\n\nCalculate the minimum cost of satisfying Chokudai's objective.\n\nNote: \"Building i can see from the left\" means there are no j exists that (height of building j) ≥ (height of building i) and j < i.\n\nInput Format\n\nN K\na_1 a_2 a_3 ... a_N\n\nOutput Format\n\nPrint the minimum cost in one line. In the end put a line break.\n\nConstraints\n\n1 ≤ K ≤ N ≤ 15\n\n1 ≤ a_i ≤ 10^9\n\nScoring\n\nSubtask 1 [120 points]\n\nN = K\n\nSubtask 2 [90 points]\n\nN ≤ 5\n\na_i ≤ 7\n\nSubtask 3 [140 points]\n\nThere are no additional constraints.\n\nSample Input 1\n\n5 5\n3949 3774 3598 3469 3424\n\nSample Output 1\n\n1541\n\nThe optimal solution is (height of buildings from the left) = [3949, 3950, 3951, 3952, 3953].\n\nSample Input 2\n\n5 3\n7 4 2 6 4\n\nSample Output 2\n\n7\n\nThe optimal solution is (height of buildings from the left) = [7, 8, 2, 9, 4].", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1585, "cpu_time_ms": 95, "memory_kb": 23296}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s946578694", "group_id": "codeNet:p03759", "input_text": "open Scanf\nopen Printf\n\nlet () = scanf \"%d %d %d\" (fun a b c->\n  if b - a = c - b then \"YES\" else \"NO\"\n  ) |> printf \"%s\\n\"", "language": "OCaml", "metadata": {"date": 1595973495, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s946578694.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s946578694", "user_id": "u272377260"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet () = scanf \"%d %d %d\" (fun a b c->\n  if b - a = c - b then \"YES\" else \"NO\"\n  ) |> printf \"%s\\n\"", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 3720}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s249712433", "group_id": "codeNet:p03760", "input_text": "let () =\n  let o = read_line () in\n  let e = read_line () in\n  print_endline @@ String.init (String.length o + String.length e) @@ fun i ->\n    if i mod 2 = 0 then o.[i / 2] else e.[i / 2]\n", "language": "OCaml", "metadata": {"date": 1530681933, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03760.html", "problem_id": "p03760", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03760/input.txt", "sample_output_relpath": "derived/input_output/data/p03760/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03760/OCaml/s249712433.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s249712433", "user_id": "u504158101"}, "prompt_components": {"gold_output": "xaybzc\n", "input_to_evaluate": "let () =\n  let o = read_line () in\n  let e = read_line () in\n  print_endline @@ String.init (String.length o + String.length e) @@ fun i ->\n    if i mod 2 = 0 then o.[i / 2] else e.[i / 2]\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke signed up for a new website which holds programming competitions.\nHe worried that he might forget his password, and he took notes of it.\nSince directly recording his password would cause him trouble if stolen,\nhe took two notes: one contains the characters at the odd-numbered positions, and the other contains the characters at the even-numbered positions.\n\nYou are given two strings O and E. O contains the characters at the odd-numbered positions retaining their relative order, and E contains the characters at the even-numbered positions retaining their relative order.\nRestore the original password.\n\nConstraints\n\nO and E consists of lowercase English letters (a - z).\n\n1 \\leq |O|,|E| \\leq 50\n\n|O| - |E| is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nO\nE\n\nOutput\n\nPrint the original password.\n\nSample Input 1\n\nxyz\nabc\n\nSample Output 1\n\nxaybzc\n\nThe original password is xaybzc. Extracting the characters at the odd-numbered positions results in xyz, and extracting the characters at the even-numbered positions results in abc.\n\nSample Input 2\n\natcoderbeginnercontest\natcoderregularcontest\n\nSample Output 2\n\naattccooddeerrbreeggiunlnaerrccoonntteesstt", "sample_input": "xyz\nabc\n"}, "reference_outputs": ["xaybzc\n"], "source_document_id": "p03760", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke signed up for a new website which holds programming competitions.\nHe worried that he might forget his password, and he took notes of it.\nSince directly recording his password would cause him trouble if stolen,\nhe took two notes: one contains the characters at the odd-numbered positions, and the other contains the characters at the even-numbered positions.\n\nYou are given two strings O and E. O contains the characters at the odd-numbered positions retaining their relative order, and E contains the characters at the even-numbered positions retaining their relative order.\nRestore the original password.\n\nConstraints\n\nO and E consists of lowercase English letters (a - z).\n\n1 \\leq |O|,|E| \\leq 50\n\n|O| - |E| is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nO\nE\n\nOutput\n\nPrint the original password.\n\nSample Input 1\n\nxyz\nabc\n\nSample Output 1\n\nxaybzc\n\nThe original password is xaybzc. Extracting the characters at the odd-numbered positions results in xyz, and extracting the characters at the even-numbered positions results in abc.\n\nSample Input 2\n\natcoderbeginnercontest\natcoderregularcontest\n\nSample Output 2\n\naattccooddeerrbreeggiunlnaerrccoonntteesstt", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 189, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s730897232", "group_id": "codeNet:p03760", "input_text": "let () =\n  let o,e = Scanf.scanf \"%s %s \" (fun a b -> a,b) in\n  let o = Batteries.String.to_list o in\n  let e = Batteries.String.to_list e in\n\n  let rec aux l1 l2 res =\n    match l1,l2 with\n    | (hd1 :: tl1), (hd2 :: tl2) -> aux tl1 tl2 (res @ [hd1;hd2])\n    | (hd1 :: tl1), [] -> res @ [hd1]\n    | [], [] -> res\n  in\n\n  Printf.printf \"%s\\n\" @@\n  Batteries.String.of_list (aux o e [])\n\n", "language": "OCaml", "metadata": {"date": 1529161202, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03760.html", "problem_id": "p03760", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03760/input.txt", "sample_output_relpath": "derived/input_output/data/p03760/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03760/OCaml/s730897232.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s730897232", "user_id": "u139013163"}, "prompt_components": {"gold_output": "xaybzc\n", "input_to_evaluate": "let () =\n  let o,e = Scanf.scanf \"%s %s \" (fun a b -> a,b) in\n  let o = Batteries.String.to_list o in\n  let e = Batteries.String.to_list e in\n\n  let rec aux l1 l2 res =\n    match l1,l2 with\n    | (hd1 :: tl1), (hd2 :: tl2) -> aux tl1 tl2 (res @ [hd1;hd2])\n    | (hd1 :: tl1), [] -> res @ [hd1]\n    | [], [] -> res\n  in\n\n  Printf.printf \"%s\\n\" @@\n  Batteries.String.of_list (aux o e [])\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke signed up for a new website which holds programming competitions.\nHe worried that he might forget his password, and he took notes of it.\nSince directly recording his password would cause him trouble if stolen,\nhe took two notes: one contains the characters at the odd-numbered positions, and the other contains the characters at the even-numbered positions.\n\nYou are given two strings O and E. O contains the characters at the odd-numbered positions retaining their relative order, and E contains the characters at the even-numbered positions retaining their relative order.\nRestore the original password.\n\nConstraints\n\nO and E consists of lowercase English letters (a - z).\n\n1 \\leq |O|,|E| \\leq 50\n\n|O| - |E| is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nO\nE\n\nOutput\n\nPrint the original password.\n\nSample Input 1\n\nxyz\nabc\n\nSample Output 1\n\nxaybzc\n\nThe original password is xaybzc. Extracting the characters at the odd-numbered positions results in xyz, and extracting the characters at the even-numbered positions results in abc.\n\nSample Input 2\n\natcoderbeginnercontest\natcoderregularcontest\n\nSample Output 2\n\naattccooddeerrbreeggiunlnaerrccoonntteesstt", "sample_input": "xyz\nabc\n"}, "reference_outputs": ["xaybzc\n"], "source_document_id": "p03760", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke signed up for a new website which holds programming competitions.\nHe worried that he might forget his password, and he took notes of it.\nSince directly recording his password would cause him trouble if stolen,\nhe took two notes: one contains the characters at the odd-numbered positions, and the other contains the characters at the even-numbered positions.\n\nYou are given two strings O and E. O contains the characters at the odd-numbered positions retaining their relative order, and E contains the characters at the even-numbered positions retaining their relative order.\nRestore the original password.\n\nConstraints\n\nO and E consists of lowercase English letters (a - z).\n\n1 \\leq |O|,|E| \\leq 50\n\n|O| - |E| is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nO\nE\n\nOutput\n\nPrint the original password.\n\nSample Input 1\n\nxyz\nabc\n\nSample Output 1\n\nxaybzc\n\nThe original password is xaybzc. Extracting the characters at the odd-numbered positions results in xyz, and extracting the characters at the even-numbered positions results in abc.\n\nSample Input 2\n\natcoderbeginnercontest\natcoderregularcontest\n\nSample Output 2\n\naattccooddeerrbreeggiunlnaerrccoonntteesstt", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 387, "cpu_time_ms": 7, "memory_kb": 1664}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s335711493", "group_id": "codeNet:p03764", "input_text": "let base = 1000000007\n\nlet rec input n =\n    if n <= 0\n    then []\n    else Scanf.scanf \" %d\" (fun x -> x :: (input (n - 1)))\n\nlet calc a n = List.fold_left (fun x y -> (x + y) mod base) 0 (List.mapi (fun i x -> (x * (n - 1 - 2 * i)) mod base) a)\n\nlet () =\n    let (n, m) = Scanf.scanf \"%d %d\" (fun x y -> x, y) in\n    let xs = input n in\n    let ys = input m in\n    let x_combi = calc xs n in\n    let y_combi = calc ys m in\n    print_int ((x_combi * y_combi) mod base);\n    print_newline ();;\n", "language": "OCaml", "metadata": {"date": 1543778482, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03764.html", "problem_id": "p03764", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03764/input.txt", "sample_output_relpath": "derived/input_output/data/p03764/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03764/OCaml/s335711493.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s335711493", "user_id": "u280512618"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "let base = 1000000007\n\nlet rec input n =\n    if n <= 0\n    then []\n    else Scanf.scanf \" %d\" (fun x -> x :: (input (n - 1)))\n\nlet calc a n = List.fold_left (fun x y -> (x + y) mod base) 0 (List.mapi (fun i x -> (x * (n - 1 - 2 * i)) mod base) a)\n\nlet () =\n    let (n, m) = Scanf.scanf \"%d %d\" (fun x y -> x, y) in\n    let xs = input n in\n    let ys = input m in\n    let x_combi = calc xs n in\n    let y_combi = calc ys m in\n    print_int ((x_combi * y_combi) mod base);\n    print_newline ();;\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nOn a two-dimensional plane, there are m lines drawn parallel to the x axis, and n lines drawn parallel to the y axis.\nAmong the lines parallel to the x axis, the i-th from the bottom is represented by y = y_i.\nSimilarly, among the lines parallel to the y axis, the i-th from the left is represented by x = x_i.\n\nFor every rectangle that is formed by these lines, find its area, and print the total area modulo 10^9+7.\n\nThat is, for every quadruple (i,j,k,l) satisfying 1\\leq i < j\\leq n and 1\\leq k < l\\leq m, find the area of the rectangle formed by the lines x=x_i, x=x_j, y=y_k and y=y_l, and print the sum of these areas modulo 10^9+7.\n\nConstraints\n\n2 \\leq n,m \\leq 10^5\n\n-10^9 \\leq x_1 < ... < x_n \\leq 10^9\n\n-10^9 \\leq y_1 < ... < y_m \\leq 10^9\n\nx_i and y_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m\nx_1 x_2 ... x_n\ny_1 y_2 ... y_m\n\nOutput\n\nPrint the total area of the rectangles, modulo 10^9+7.\n\nSample Input 1\n\n3 3\n1 3 4\n1 3 6\n\nSample Output 1\n\n60\n\nThe following figure illustrates this input:\n\nThe total area of the nine rectangles A, B, ..., I shown in the following figure, is 60.\n\nSample Input 2\n\n6 5\n-790013317 -192321079 95834122 418379342 586260100 802780784\n-253230108 193944314 363756450 712662868 735867677\n\nSample Output 2\n\n835067060", "sample_input": "3 3\n1 3 4\n1 3 6\n"}, "reference_outputs": ["60\n"], "source_document_id": "p03764", "source_text": "Score : 500 points\n\nProblem Statement\n\nOn a two-dimensional plane, there are m lines drawn parallel to the x axis, and n lines drawn parallel to the y axis.\nAmong the lines parallel to the x axis, the i-th from the bottom is represented by y = y_i.\nSimilarly, among the lines parallel to the y axis, the i-th from the left is represented by x = x_i.\n\nFor every rectangle that is formed by these lines, find its area, and print the total area modulo 10^9+7.\n\nThat is, for every quadruple (i,j,k,l) satisfying 1\\leq i < j\\leq n and 1\\leq k < l\\leq m, find the area of the rectangle formed by the lines x=x_i, x=x_j, y=y_k and y=y_l, and print the sum of these areas modulo 10^9+7.\n\nConstraints\n\n2 \\leq n,m \\leq 10^5\n\n-10^9 \\leq x_1 < ... < x_n \\leq 10^9\n\n-10^9 \\leq y_1 < ... < y_m \\leq 10^9\n\nx_i and y_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m\nx_1 x_2 ... x_n\ny_1 y_2 ... y_m\n\nOutput\n\nPrint the total area of the rectangles, modulo 10^9+7.\n\nSample Input 1\n\n3 3\n1 3 4\n1 3 6\n\nSample Output 1\n\n60\n\nThe following figure illustrates this input:\n\nThe total area of the nine rectangles A, B, ..., I shown in the following figure, is 60.\n\nSample Input 2\n\n6 5\n-790013317 -192321079 95834122 418379342 586260100 802780784\n-253230108 193944314 363756450 712662868 735867677\n\nSample Output 2\n\n835067060", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 494, "cpu_time_ms": 128, "memory_kb": 16512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s373885638", "group_id": "codeNet:p03767", "input_text": "let comp x y =\n    if x = y then 0\n    else if x < y then 1\n    else -1\n\nlet rec input xs n =\n    if n = 0 then\n        xs\n    else\n        let a = Scanf.scanf \"%d \" (fun a -> a) in\n        input (a :: xs) (n-1)\n\nlet rec solve xs n res\n    = if n = 0 then\n          Printf.printf \"%d\\n\" res\n      else\n          solve xs (n-1) (res + (List.nth xs (1 + (n-1)*2)))\n        \nlet _ =\n    let xs = Scanf.scanf \"%d \" (fun n -> 3 * n) |> input [] |> List.sort comp in\n    solve xs ((List.length xs) / 3) 0\n \n", "language": "OCaml", "metadata": {"date": 1493482091, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03767.html", "problem_id": "p03767", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03767/input.txt", "sample_output_relpath": "derived/input_output/data/p03767/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03767/OCaml/s373885638.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s373885638", "user_id": "u733618878"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let comp x y =\n    if x = y then 0\n    else if x < y then 1\n    else -1\n\nlet rec input xs n =\n    if n = 0 then\n        xs\n    else\n        let a = Scanf.scanf \"%d \" (fun a -> a) in\n        input (a :: xs) (n-1)\n\nlet rec solve xs n res\n    = if n = 0 then\n          Printf.printf \"%d\\n\" res\n      else\n          solve xs (n-1) (res + (List.nth xs (1 + (n-1)*2)))\n        \nlet _ =\n    let xs = Scanf.scanf \"%d \" (fun n -> 3 * n) |> input [] |> List.sort comp in\n    solve xs ((List.length xs) / 3) 0\n \n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are 3N participants in AtCoder Group Contest.\nThe strength of the i-th participant is represented by an integer a_i.\nThey will form N teams, each consisting of three participants.\nNo participant may belong to multiple teams.\n\nThe strength of a team is defined as the second largest strength among its members.\nFor example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.\n\nFind the maximum possible sum of the strengths of N teams.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ 10^{9}\n\na_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2\n5 2 8 5 1 5\n\nSample Output 1\n\n10\n\nThe following is one formation of teams that maximizes the sum of the strengths of teams:\n\nTeam 1: consists of the first, fourth and fifth participants.\n\nTeam 2: consists of the second, third and sixth participants.\n\nSample Input 2\n\n10\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 2\n\n10000000000\n\nThe sum of the strengths can be quite large.", "sample_input": "2\n5 2 8 5 1 5\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03767", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are 3N participants in AtCoder Group Contest.\nThe strength of the i-th participant is represented by an integer a_i.\nThey will form N teams, each consisting of three participants.\nNo participant may belong to multiple teams.\n\nThe strength of a team is defined as the second largest strength among its members.\nFor example, a team of participants of strength 1, 5, 2 has a strength 2, and a team of three participants of strength 3, 2, 3 has a strength 3.\n\nFind the maximum possible sum of the strengths of N teams.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ 10^{9}\n\na_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2\n5 2 8 5 1 5\n\nSample Output 1\n\n10\n\nThe following is one formation of teams that maximizes the sum of the strengths of teams:\n\nTeam 1: consists of the first, fourth and fifth participants.\n\nTeam 2: consists of the second, third and sixth participants.\n\nSample Input 2\n\n10\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 2\n\n10000000000\n\nThe sum of the strengths can be quite large.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2105, "memory_kb": 21760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s462752857", "group_id": "codeNet:p03768", "input_text": "let fst3 (a,b,c) = a\nlet () = Scanf.scanf \"%d %d\" @@ fun n m ->\n  let es = Array.init m (fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> a-1, b-1) in\n  Scanf.scanf \" %d\" @@ fun q ->\n\n  let qa =\n    let t = Array.init 11 (fun _ -> []) in\n    for i = 0 to q-1 do\n      Scanf.scanf \" %d %d %d\" @@ fun v d c ->\n      t.(10-d) <- (i, v-1, c) :: t.(10-d)\n    done;\n    Array.map List.rev t\n  in\n\n  let color = Array.make n (-1, 0, -1) in\n  qa.(0) |> List.iter (fun (i, v, c) -> color.(v) <- i, c, 0);\n  for r = 1 to 10 do\n    Array.sort (fun (a,b) (c,d) ->\n      min (fst3 color.(a)) (fst3 color.(b)) - min (fst3 color.(c)) (fst3 color.(d))) es;\n    Array.iter (fun (u, v) ->\n      let iu, cu, ru = color.(u) in\n      let iv, cv, rv = color.(v) in\n      if iu > iv && ru < r then color.(v) <- (iu, cu, ru+1);\n      if iv > iu && rv < r then color.(u) <- (iv, cv, rv+1);\n    ) es;\n    qa.(r) |> List.iter (fun (i, v, c) ->\n      let ia, _, _ = color.(v) in\n      if i > ia then color.(v) <- (i, c, r));\n  done;\n\n  Array.iter (fun (_, c, _) -> Printf.printf \"%d\\n\" c) color", "language": "OCaml", "metadata": {"date": 1534601999, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03768.html", "problem_id": "p03768", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03768/input.txt", "sample_output_relpath": "derived/input_output/data/p03768/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03768/OCaml/s462752857.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s462752857", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2\n2\n2\n2\n2\n1\n0\n", "input_to_evaluate": "let fst3 (a,b,c) = a\nlet () = Scanf.scanf \"%d %d\" @@ fun n m ->\n  let es = Array.init m (fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> a-1, b-1) in\n  Scanf.scanf \" %d\" @@ fun q ->\n\n  let qa =\n    let t = Array.init 11 (fun _ -> []) in\n    for i = 0 to q-1 do\n      Scanf.scanf \" %d %d %d\" @@ fun v d c ->\n      t.(10-d) <- (i, v-1, c) :: t.(10-d)\n    done;\n    Array.map List.rev t\n  in\n\n  let color = Array.make n (-1, 0, -1) in\n  qa.(0) |> List.iter (fun (i, v, c) -> color.(v) <- i, c, 0);\n  for r = 1 to 10 do\n    Array.sort (fun (a,b) (c,d) ->\n      min (fst3 color.(a)) (fst3 color.(b)) - min (fst3 color.(c)) (fst3 color.(d))) es;\n    Array.iter (fun (u, v) ->\n      let iu, cu, ru = color.(u) in\n      let iv, cv, rv = color.(v) in\n      if iu > iv && ru < r then color.(v) <- (iu, cu, ru+1);\n      if iv > iu && rv < r then color.(u) <- (iv, cv, rv+1);\n    ) es;\n    qa.(r) |> List.iter (fun (i, v, c) ->\n      let ia, _, _ = color.(v) in\n      if i > ia then color.(v) <- (i, c, r));\n  done;\n\n  Array.iter (fun (_, c, _) -> Printf.printf \"%d\\n\" c) color", "problem_context": "Score : 700 points\n\nProblem Statement\n\nSquid loves painting vertices in graphs.\n\nThere is a simple undirected graph consisting of N vertices numbered 1 through N, and M edges.\nInitially, all the vertices are painted in color 0. The i-th edge bidirectionally connects two vertices a_i and b_i. The length of every edge is 1.\n\nSquid performed Q operations on this graph. In the i-th operation, he repaints all the vertices within a distance of d_i from vertex v_i, in color c_i.\n\nFind the color of each vertex after the Q operations.\n\nConstraints\n\n1 ≤ N,M,Q ≤ 10^5\n\n1 ≤ a_i,b_i,v_i ≤ N\n\na_i ≠ b_i\n\n0 ≤ d_i ≤ 10\n\n1 ≤ c_i ≤10^5\n\nd_i and c_i are all integers.\n\nThere are no self-loops or multiple edges in the given graph.\n\nPartial Score\n\n200 points will be awarded for passing the testset satisfying 1 ≤ N,M,Q ≤ 2{,}000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_{M} b_{M}\nQ\nv_1 d_1 c_1\n:\nv_{Q} d_{Q} c_{Q}\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line, print the color of vertex i after the Q operations.\n\nSample Input 1\n\n7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n\nSample Output 1\n\n2\n2\n2\n2\n2\n1\n0\n\nInitially, each vertex is painted in color 0.\nIn the first operation, vertices 5 and 6 are repainted in color 1.\nIn the second operation, vertices 1, 2, 3, 4 and 5 are repainted in color 2.\n\nSample Input 2\n\n14 10\n1 4\n5 7\n7 11\n4 10\n14 7\n14 3\n6 14\n8 11\n5 13\n8 3\n8\n8 6 2\n9 7 85\n6 9 3\n6 7 5\n10 3 1\n12 9 4\n9 6 6\n8 2 3\n\nSample Output 2\n\n1\n0\n3\n1\n5\n5\n3\n3\n6\n1\n3\n4\n5\n3\n\nThe given graph may not be connected.", "sample_input": "7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n"}, "reference_outputs": ["2\n2\n2\n2\n2\n1\n0\n"], "source_document_id": "p03768", "source_text": "Score : 700 points\n\nProblem Statement\n\nSquid loves painting vertices in graphs.\n\nThere is a simple undirected graph consisting of N vertices numbered 1 through N, and M edges.\nInitially, all the vertices are painted in color 0. The i-th edge bidirectionally connects two vertices a_i and b_i. The length of every edge is 1.\n\nSquid performed Q operations on this graph. In the i-th operation, he repaints all the vertices within a distance of d_i from vertex v_i, in color c_i.\n\nFind the color of each vertex after the Q operations.\n\nConstraints\n\n1 ≤ N,M,Q ≤ 10^5\n\n1 ≤ a_i,b_i,v_i ≤ N\n\na_i ≠ b_i\n\n0 ≤ d_i ≤ 10\n\n1 ≤ c_i ≤10^5\n\nd_i and c_i are all integers.\n\nThere are no self-loops or multiple edges in the given graph.\n\nPartial Score\n\n200 points will be awarded for passing the testset satisfying 1 ≤ N,M,Q ≤ 2{,}000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_{M} b_{M}\nQ\nv_1 d_1 c_1\n:\nv_{Q} d_{Q} c_{Q}\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line, print the color of vertex i after the Q operations.\n\nSample Input 1\n\n7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n\nSample Output 1\n\n2\n2\n2\n2\n2\n1\n0\n\nInitially, each vertex is painted in color 0.\nIn the first operation, vertices 5 and 6 are repainted in color 1.\nIn the second operation, vertices 1, 2, 3, 4 and 5 are repainted in color 2.\n\nSample Input 2\n\n14 10\n1 4\n5 7\n7 11\n4 10\n14 7\n14 3\n6 14\n8 11\n5 13\n8 3\n8\n8 6 2\n9 7 85\n6 9 3\n6 7 5\n10 3 1\n12 9 4\n9 6 6\n8 2 3\n\nSample Output 2\n\n1\n0\n3\n1\n5\n5\n3\n3\n6\n1\n3\n4\n5\n3\n\nThe given graph may not be connected.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1061, "cpu_time_ms": 1837, "memory_kb": 28160}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s380577505", "group_id": "codeNet:p03768", "input_text": "Scanf.scanf \"%d %d\" @@ fun n m ->\n  let es = Array.init m (fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> a-1, b-1) in\n  Scanf.scanf \" %d\" @@ fun q ->\n\n  let qa = Array.init 11 (fun _ -> []) in\n  for i = 0 to q-1 do\n    Scanf.scanf \" %d %d %d\" @@ fun v d c ->\n    qa.(10-d) <- (i, v-1, c) :: qa.(10-d)\n  done;\n  Array.iteri (fun i s -> qa.(i) <- List.rev s) qa;\n\n  let cl = Array.make n (0, 0, 0) in\n  qa.(0) |> List.iter (fun (i, v, c) -> cl.(v) <- i, c, 0);\n  for r = 1 to 10 do\n    Array.iter (fun (u, v) ->\n      let iu, cu, ru = cl.(u) in\n      let iv, cv, rv = cl.(v) in\n      if ru > -r then cl.(v) <- max cl.(v) (iu, cu, ru-1);\n      if rv > -r then cl.(u) <- max cl.(u) (iv, cv, rv-1);\n    ) es;\n    qa.(r) |> List.iter (fun (i, v, c) -> cl.(v) <- max cl.(v) (i, c, -r));\n  done;\n\n  Array.iter (fun (_, v, _) -> Printf.printf \"%d\\n\" v) cl\n", "language": "OCaml", "metadata": {"date": 1534593613, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03768.html", "problem_id": "p03768", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03768/input.txt", "sample_output_relpath": "derived/input_output/data/p03768/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03768/OCaml/s380577505.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s380577505", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2\n2\n2\n2\n2\n1\n0\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" @@ fun n m ->\n  let es = Array.init m (fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> a-1, b-1) in\n  Scanf.scanf \" %d\" @@ fun q ->\n\n  let qa = Array.init 11 (fun _ -> []) in\n  for i = 0 to q-1 do\n    Scanf.scanf \" %d %d %d\" @@ fun v d c ->\n    qa.(10-d) <- (i, v-1, c) :: qa.(10-d)\n  done;\n  Array.iteri (fun i s -> qa.(i) <- List.rev s) qa;\n\n  let cl = Array.make n (0, 0, 0) in\n  qa.(0) |> List.iter (fun (i, v, c) -> cl.(v) <- i, c, 0);\n  for r = 1 to 10 do\n    Array.iter (fun (u, v) ->\n      let iu, cu, ru = cl.(u) in\n      let iv, cv, rv = cl.(v) in\n      if ru > -r then cl.(v) <- max cl.(v) (iu, cu, ru-1);\n      if rv > -r then cl.(u) <- max cl.(u) (iv, cv, rv-1);\n    ) es;\n    qa.(r) |> List.iter (fun (i, v, c) -> cl.(v) <- max cl.(v) (i, c, -r));\n  done;\n\n  Array.iter (fun (_, v, _) -> Printf.printf \"%d\\n\" v) cl\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nSquid loves painting vertices in graphs.\n\nThere is a simple undirected graph consisting of N vertices numbered 1 through N, and M edges.\nInitially, all the vertices are painted in color 0. The i-th edge bidirectionally connects two vertices a_i and b_i. The length of every edge is 1.\n\nSquid performed Q operations on this graph. In the i-th operation, he repaints all the vertices within a distance of d_i from vertex v_i, in color c_i.\n\nFind the color of each vertex after the Q operations.\n\nConstraints\n\n1 ≤ N,M,Q ≤ 10^5\n\n1 ≤ a_i,b_i,v_i ≤ N\n\na_i ≠ b_i\n\n0 ≤ d_i ≤ 10\n\n1 ≤ c_i ≤10^5\n\nd_i and c_i are all integers.\n\nThere are no self-loops or multiple edges in the given graph.\n\nPartial Score\n\n200 points will be awarded for passing the testset satisfying 1 ≤ N,M,Q ≤ 2{,}000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_{M} b_{M}\nQ\nv_1 d_1 c_1\n:\nv_{Q} d_{Q} c_{Q}\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line, print the color of vertex i after the Q operations.\n\nSample Input 1\n\n7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n\nSample Output 1\n\n2\n2\n2\n2\n2\n1\n0\n\nInitially, each vertex is painted in color 0.\nIn the first operation, vertices 5 and 6 are repainted in color 1.\nIn the second operation, vertices 1, 2, 3, 4 and 5 are repainted in color 2.\n\nSample Input 2\n\n14 10\n1 4\n5 7\n7 11\n4 10\n14 7\n14 3\n6 14\n8 11\n5 13\n8 3\n8\n8 6 2\n9 7 85\n6 9 3\n6 7 5\n10 3 1\n12 9 4\n9 6 6\n8 2 3\n\nSample Output 2\n\n1\n0\n3\n1\n5\n5\n3\n3\n6\n1\n3\n4\n5\n3\n\nThe given graph may not be connected.", "sample_input": "7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n"}, "reference_outputs": ["2\n2\n2\n2\n2\n1\n0\n"], "source_document_id": "p03768", "source_text": "Score : 700 points\n\nProblem Statement\n\nSquid loves painting vertices in graphs.\n\nThere is a simple undirected graph consisting of N vertices numbered 1 through N, and M edges.\nInitially, all the vertices are painted in color 0. The i-th edge bidirectionally connects two vertices a_i and b_i. The length of every edge is 1.\n\nSquid performed Q operations on this graph. In the i-th operation, he repaints all the vertices within a distance of d_i from vertex v_i, in color c_i.\n\nFind the color of each vertex after the Q operations.\n\nConstraints\n\n1 ≤ N,M,Q ≤ 10^5\n\n1 ≤ a_i,b_i,v_i ≤ N\n\na_i ≠ b_i\n\n0 ≤ d_i ≤ 10\n\n1 ≤ c_i ≤10^5\n\nd_i and c_i are all integers.\n\nThere are no self-loops or multiple edges in the given graph.\n\nPartial Score\n\n200 points will be awarded for passing the testset satisfying 1 ≤ N,M,Q ≤ 2{,}000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_{M} b_{M}\nQ\nv_1 d_1 c_1\n:\nv_{Q} d_{Q} c_{Q}\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line, print the color of vertex i after the Q operations.\n\nSample Input 1\n\n7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n\nSample Output 1\n\n2\n2\n2\n2\n2\n1\n0\n\nInitially, each vertex is painted in color 0.\nIn the first operation, vertices 5 and 6 are repainted in color 1.\nIn the second operation, vertices 1, 2, 3, 4 and 5 are repainted in color 2.\n\nSample Input 2\n\n14 10\n1 4\n5 7\n7 11\n4 10\n14 7\n14 3\n6 14\n8 11\n5 13\n8 3\n8\n8 6 2\n9 7 85\n6 9 3\n6 7 5\n10 3 1\n12 9 4\n9 6 6\n8 2 3\n\nSample Output 2\n\n1\n0\n3\n1\n5\n5\n3\n3\n6\n1\n3\n4\n5\n3\n\nThe given graph may not be connected.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 289, "memory_kb": 24960}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s287386878", "group_id": "codeNet:p03768", "input_text": "Scanf.scanf \"%d %d\" @@ fun n m ->\n  let es = Array.init m (fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> a-1, b-1) in\n  Scanf.scanf \" %d\" @@ fun q ->\n\n  let qa = Array.init 11 (fun _ -> []) in\n  for i = 0 to q-1 do\n    Scanf.scanf \" %d %d %d\" @@ fun v d c ->\n    qa.(10-d) <- (i, v-1, c) :: qa.(10-d)\n  done;\n  Array.iteri (fun i s -> qa.(i) <- List.rev s) qa;\n\n  let cl = Array.make n (0, 0, 0) in\n  qa.(0) |> List.iter (fun (i, v, c) -> cl.(v) <- i, c, 0);\n  for r = 1 to 10 do\n    Array.iter (fun (u, v) ->\n      let iu, cu, ru = cl.(u) in\n      let iv, cv, rv = cl.(v) in\n      if ru < r then cl.(v) <- max cl.(v) (iu, cu, ru+1);\n      if rv < r then cl.(u) <- max cl.(u) (iv, cv, rv+1);\n    ) es;\n    qa.(r) |> List.iter (fun (i, v, c) -> cl.(v) <- max cl.(v) (i, c, r));\n  done;\n\n  Array.iter (fun (_, v, _) -> Printf.printf \"%d\\n\" v) cl", "language": "OCaml", "metadata": {"date": 1534593307, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03768.html", "problem_id": "p03768", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03768/input.txt", "sample_output_relpath": "derived/input_output/data/p03768/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03768/OCaml/s287386878.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s287386878", "user_id": "u798181098"}, "prompt_components": {"gold_output": "2\n2\n2\n2\n2\n1\n0\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" @@ fun n m ->\n  let es = Array.init m (fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> a-1, b-1) in\n  Scanf.scanf \" %d\" @@ fun q ->\n\n  let qa = Array.init 11 (fun _ -> []) in\n  for i = 0 to q-1 do\n    Scanf.scanf \" %d %d %d\" @@ fun v d c ->\n    qa.(10-d) <- (i, v-1, c) :: qa.(10-d)\n  done;\n  Array.iteri (fun i s -> qa.(i) <- List.rev s) qa;\n\n  let cl = Array.make n (0, 0, 0) in\n  qa.(0) |> List.iter (fun (i, v, c) -> cl.(v) <- i, c, 0);\n  for r = 1 to 10 do\n    Array.iter (fun (u, v) ->\n      let iu, cu, ru = cl.(u) in\n      let iv, cv, rv = cl.(v) in\n      if ru < r then cl.(v) <- max cl.(v) (iu, cu, ru+1);\n      if rv < r then cl.(u) <- max cl.(u) (iv, cv, rv+1);\n    ) es;\n    qa.(r) |> List.iter (fun (i, v, c) -> cl.(v) <- max cl.(v) (i, c, r));\n  done;\n\n  Array.iter (fun (_, v, _) -> Printf.printf \"%d\\n\" v) cl", "problem_context": "Score : 700 points\n\nProblem Statement\n\nSquid loves painting vertices in graphs.\n\nThere is a simple undirected graph consisting of N vertices numbered 1 through N, and M edges.\nInitially, all the vertices are painted in color 0. The i-th edge bidirectionally connects two vertices a_i and b_i. The length of every edge is 1.\n\nSquid performed Q operations on this graph. In the i-th operation, he repaints all the vertices within a distance of d_i from vertex v_i, in color c_i.\n\nFind the color of each vertex after the Q operations.\n\nConstraints\n\n1 ≤ N,M,Q ≤ 10^5\n\n1 ≤ a_i,b_i,v_i ≤ N\n\na_i ≠ b_i\n\n0 ≤ d_i ≤ 10\n\n1 ≤ c_i ≤10^5\n\nd_i and c_i are all integers.\n\nThere are no self-loops or multiple edges in the given graph.\n\nPartial Score\n\n200 points will be awarded for passing the testset satisfying 1 ≤ N,M,Q ≤ 2{,}000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_{M} b_{M}\nQ\nv_1 d_1 c_1\n:\nv_{Q} d_{Q} c_{Q}\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line, print the color of vertex i after the Q operations.\n\nSample Input 1\n\n7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n\nSample Output 1\n\n2\n2\n2\n2\n2\n1\n0\n\nInitially, each vertex is painted in color 0.\nIn the first operation, vertices 5 and 6 are repainted in color 1.\nIn the second operation, vertices 1, 2, 3, 4 and 5 are repainted in color 2.\n\nSample Input 2\n\n14 10\n1 4\n5 7\n7 11\n4 10\n14 7\n14 3\n6 14\n8 11\n5 13\n8 3\n8\n8 6 2\n9 7 85\n6 9 3\n6 7 5\n10 3 1\n12 9 4\n9 6 6\n8 2 3\n\nSample Output 2\n\n1\n0\n3\n1\n5\n5\n3\n3\n6\n1\n3\n4\n5\n3\n\nThe given graph may not be connected.", "sample_input": "7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n"}, "reference_outputs": ["2\n2\n2\n2\n2\n1\n0\n"], "source_document_id": "p03768", "source_text": "Score : 700 points\n\nProblem Statement\n\nSquid loves painting vertices in graphs.\n\nThere is a simple undirected graph consisting of N vertices numbered 1 through N, and M edges.\nInitially, all the vertices are painted in color 0. The i-th edge bidirectionally connects two vertices a_i and b_i. The length of every edge is 1.\n\nSquid performed Q operations on this graph. In the i-th operation, he repaints all the vertices within a distance of d_i from vertex v_i, in color c_i.\n\nFind the color of each vertex after the Q operations.\n\nConstraints\n\n1 ≤ N,M,Q ≤ 10^5\n\n1 ≤ a_i,b_i,v_i ≤ N\n\na_i ≠ b_i\n\n0 ≤ d_i ≤ 10\n\n1 ≤ c_i ≤10^5\n\nd_i and c_i are all integers.\n\nThere are no self-loops or multiple edges in the given graph.\n\nPartial Score\n\n200 points will be awarded for passing the testset satisfying 1 ≤ N,M,Q ≤ 2{,}000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_{M} b_{M}\nQ\nv_1 d_1 c_1\n:\nv_{Q} d_{Q} c_{Q}\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line, print the color of vertex i after the Q operations.\n\nSample Input 1\n\n7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n\nSample Output 1\n\n2\n2\n2\n2\n2\n1\n0\n\nInitially, each vertex is painted in color 0.\nIn the first operation, vertices 5 and 6 are repainted in color 1.\nIn the second operation, vertices 1, 2, 3, 4 and 5 are repainted in color 2.\n\nSample Input 2\n\n14 10\n1 4\n5 7\n7 11\n4 10\n14 7\n14 3\n6 14\n8 11\n5 13\n8 3\n8\n8 6 2\n9 7 85\n6 9 3\n6 7 5\n10 3 1\n12 9 4\n9 6 6\n8 2 3\n\nSample Output 2\n\n1\n0\n3\n1\n5\n5\n3\n3\n6\n1\n3\n4\n5\n3\n\nThe given graph may not be connected.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 841, "cpu_time_ms": 310, "memory_kb": 31616}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s414170743", "group_id": "codeNet:p03773", "input_text": "let a, b = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet _ = Printf.printf \"%d\\n\" @@ (a + b) mod 24", "language": "OCaml", "metadata": {"date": 1565184161, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s414170743.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s414170743", "user_id": "u732304692"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "let a, b = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet _ = Printf.printf \"%d\\n\" @@ (a + b) mod 24", "problem_context": "Score : 100 points\n\nProblem Statement\n\nDolphin loves programming contests. Today, he will take part in a contest in AtCoder.\n\nIn this country, 24-hour clock is used. For example, 9:00 p.m. is referred to as \"21 o'clock\".\n\nThe current time is A o'clock, and a contest will begin in exactly B hours.\nWhen will the contest begin? Answer in 24-hour time.\n\nConstraints\n\n0 \\leq A,B \\leq 23\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the hour of the starting time of the contest in 24-hour time.\n\nSample Input 1\n\n9 12\n\nSample Output 1\n\n21\n\nIn this input, the current time is 9 o'clock, and 12 hours later it will be 21 o'clock in 24-hour time.\n\nSample Input 2\n\n19 0\n\nSample Output 2\n\n19\n\nThe contest has just started.\n\nSample Input 3\n\n23 2\n\nSample Output 3\n\n1\n\nThe contest will begin at 1 o'clock the next day.", "sample_input": "9 12\n"}, "reference_outputs": ["21\n"], "source_document_id": "p03773", "source_text": "Score : 100 points\n\nProblem Statement\n\nDolphin loves programming contests. Today, he will take part in a contest in AtCoder.\n\nIn this country, 24-hour clock is used. For example, 9:00 p.m. is referred to as \"21 o'clock\".\n\nThe current time is A o'clock, and a contest will begin in exactly B hours.\nWhen will the contest begin? Answer in 24-hour time.\n\nConstraints\n\n0 \\leq A,B \\leq 23\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the hour of the starting time of the contest in 24-hour time.\n\nSample Input 1\n\n9 12\n\nSample Output 1\n\n21\n\nIn this input, the current time is 9 o'clock, and 12 hours later it will be 21 o'clock in 24-hour time.\n\nSample Input 2\n\n19 0\n\nSample Output 2\n\n19\n\nThe contest has just started.\n\nSample Input 3\n\n23 2\n\nSample Output 3\n\n1\n\nThe contest will begin at 1 o'clock the next day.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s308205192", "group_id": "codeNet:p03773", "input_text": "let () = Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d %d\" (fun a b -> (a + b) mod 24)\n", "language": "OCaml", "metadata": {"date": 1530682413, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s308205192.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s308205192", "user_id": "u504158101"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "let () = Printf.printf \"%d\\n\" @@ Scanf.scanf \"%d %d\" (fun a b -> (a + b) mod 24)\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s131577396", "group_id": "codeNet:p03773", "input_text": "let () =\n  let a,b = Scanf.scanf \"%d %d \" (fun a b -> a,b) in\n\n  Printf.printf \"%d\\n\" @@\n    (a + b) mod 24\n\n\n", "language": "OCaml", "metadata": {"date": 1528866540, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s131577396.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s131577396", "user_id": "u139013163"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "let () =\n  let a,b = Scanf.scanf \"%d %d \" (fun a b -> a,b) in\n\n  Printf.printf \"%d\\n\" @@\n    (a + b) mod 24\n\n\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 110, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s492935439", "group_id": "codeNet:p03773", "input_text": "let () =\n  Scanf.scanf \"%d %d\" (fun a b -> Printf.printf \"%d\\n\" ((a + b) mod 24))", "language": "OCaml", "metadata": {"date": 1525693358, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s492935439.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s492935439", "user_id": "u987869509"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d\" (fun a b -> Printf.printf \"%d\\n\" ((a + b) mod 24))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nDolphin loves programming contests. Today, he will take part in a contest in AtCoder.\n\nIn this country, 24-hour clock is used. For example, 9:00 p.m. is referred to as \"21 o'clock\".\n\nThe current time is A o'clock, and a contest will begin in exactly B hours.\nWhen will the contest begin? Answer in 24-hour time.\n\nConstraints\n\n0 \\leq A,B \\leq 23\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the hour of the starting time of the contest in 24-hour time.\n\nSample Input 1\n\n9 12\n\nSample Output 1\n\n21\n\nIn this input, the current time is 9 o'clock, and 12 hours later it will be 21 o'clock in 24-hour time.\n\nSample Input 2\n\n19 0\n\nSample Output 2\n\n19\n\nThe contest has just started.\n\nSample Input 3\n\n23 2\n\nSample Output 3\n\n1\n\nThe contest will begin at 1 o'clock the next day.", "sample_input": "9 12\n"}, "reference_outputs": ["21\n"], "source_document_id": "p03773", "source_text": "Score : 100 points\n\nProblem Statement\n\nDolphin loves programming contests. Today, he will take part in a contest in AtCoder.\n\nIn this country, 24-hour clock is used. For example, 9:00 p.m. is referred to as \"21 o'clock\".\n\nThe current time is A o'clock, and a contest will begin in exactly B hours.\nWhen will the contest begin? Answer in 24-hour time.\n\nConstraints\n\n0 \\leq A,B \\leq 23\n\nA and B are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the hour of the starting time of the contest in 24-hour time.\n\nSample Input 1\n\n9 12\n\nSample Output 1\n\n21\n\nIn this input, the current time is 9 o'clock, and 12 hours later it will be 21 o'clock in 24-hour time.\n\nSample Input 2\n\n19 0\n\nSample Output 2\n\n19\n\nThe contest has just started.\n\nSample Input 3\n\n23 2\n\nSample Output 3\n\n1\n\nThe contest will begin at 1 o'clock the next day.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s488664967", "group_id": "codeNet:p03774", "input_text": "let n, m = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet ab_s = Array.init n @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet cds = Array.init m @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet f (a, b) = let m = ref (max_int, -1) in Array.iteri (fun i (c, d) -> m := min !m @@ (abs (a - c) + abs (b - d), i + 1)) cds; Printf.printf \"%d\\n\" @@ snd !m\nlet _ = Array.iter f ab_s", "language": "OCaml", "metadata": {"date": 1566954626, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03774.html", "problem_id": "p03774", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03774/input.txt", "sample_output_relpath": "derived/input_output/data/p03774/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03774/OCaml/s488664967.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s488664967", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n1\n", "input_to_evaluate": "let n, m = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet ab_s = Array.init n @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet cds = Array.init m @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet f (a, b) = let m = ref (max_int, -1) in Array.iteri (fun i (c, d) -> m := min !m @@ (abs (a - c) + abs (b - d), i + 1)) cds; Printf.printf \"%d\\n\" @@ snd !m\nlet _ = Array.iter f ab_s", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N students and M checkpoints on the xy-plane.\n\nThe coordinates of the i-th student (1 \\leq i \\leq N) is (a_i,b_i), and the coordinates of the checkpoint numbered j (1 \\leq j \\leq M) is (c_j,d_j).\n\nWhen the teacher gives a signal, each student has to go to the nearest checkpoint measured in Manhattan distance.\n\nThe Manhattan distance between two points (x_1,y_1) and (x_2,y_2) is |x_1-x_2|+|y_1-y_2|.\n\nHere, |x| denotes the absolute value of x.\n\nIf there are multiple nearest checkpoints for a student, he/she will select the checkpoint with the smallest index.\n\nWhich checkpoint will each student go to?\n\nConstraints\n\n1 \\leq N,M \\leq 50\n\n-10^8 \\leq a_i,b_i,c_j,d_j \\leq 10^8\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_N b_N\nc_1 d_1\n:\nc_M d_M\n\nOutput\n\nPrint N lines.\n\nThe i-th line (1 \\leq i \\leq N) should contain the index of the checkpoint for the i-th student to go.\n\nSample Input 1\n\n2 2\n2 0\n0 0\n-1 0\n1 0\n\nSample Output 1\n\n2\n1\n\nThe Manhattan distance between the first student and each checkpoint is:\n\nFor checkpoint 1: |2-(-1)|+|0-0|=3\n\nFor checkpoint 2: |2-1|+|0-0|=1\n\nThe nearest checkpoint is checkpoint 2. Thus, the first line in the output should contain 2.\n\nThe Manhattan distance between the second student and each checkpoint is:\n\nFor checkpoint 1: |0-(-1)|+|0-0|=1\n\nFor checkpoint 2: |0-1|+|0-0|=1\n\nWhen there are multiple nearest checkpoints, the student will go to the checkpoint with the smallest index. Thus, the second line in the output should contain 1.\n\nSample Input 2\n\n3 4\n10 10\n-10 -10\n3 3\n1 2\n2 3\n3 5\n3 5\n\nSample Output 2\n\n3\n1\n2\n\nThere can be multiple checkpoints at the same coordinates.\n\nSample Input 3\n\n5 5\n-100000000 -100000000\n-100000000 100000000\n100000000 -100000000\n100000000 100000000\n0 0\n0 0\n100000000 100000000\n100000000 -100000000\n-100000000 100000000\n-100000000 -100000000\n\nSample Output 3\n\n5\n4\n3\n2\n1", "sample_input": "2 2\n2 0\n0 0\n-1 0\n1 0\n"}, "reference_outputs": ["2\n1\n"], "source_document_id": "p03774", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N students and M checkpoints on the xy-plane.\n\nThe coordinates of the i-th student (1 \\leq i \\leq N) is (a_i,b_i), and the coordinates of the checkpoint numbered j (1 \\leq j \\leq M) is (c_j,d_j).\n\nWhen the teacher gives a signal, each student has to go to the nearest checkpoint measured in Manhattan distance.\n\nThe Manhattan distance between two points (x_1,y_1) and (x_2,y_2) is |x_1-x_2|+|y_1-y_2|.\n\nHere, |x| denotes the absolute value of x.\n\nIf there are multiple nearest checkpoints for a student, he/she will select the checkpoint with the smallest index.\n\nWhich checkpoint will each student go to?\n\nConstraints\n\n1 \\leq N,M \\leq 50\n\n-10^8 \\leq a_i,b_i,c_j,d_j \\leq 10^8\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_N b_N\nc_1 d_1\n:\nc_M d_M\n\nOutput\n\nPrint N lines.\n\nThe i-th line (1 \\leq i \\leq N) should contain the index of the checkpoint for the i-th student to go.\n\nSample Input 1\n\n2 2\n2 0\n0 0\n-1 0\n1 0\n\nSample Output 1\n\n2\n1\n\nThe Manhattan distance between the first student and each checkpoint is:\n\nFor checkpoint 1: |2-(-1)|+|0-0|=3\n\nFor checkpoint 2: |2-1|+|0-0|=1\n\nThe nearest checkpoint is checkpoint 2. Thus, the first line in the output should contain 2.\n\nThe Manhattan distance between the second student and each checkpoint is:\n\nFor checkpoint 1: |0-(-1)|+|0-0|=1\n\nFor checkpoint 2: |0-1|+|0-0|=1\n\nWhen there are multiple nearest checkpoints, the student will go to the checkpoint with the smallest index. Thus, the second line in the output should contain 1.\n\nSample Input 2\n\n3 4\n10 10\n-10 -10\n3 3\n1 2\n2 3\n3 5\n3 5\n\nSample Output 2\n\n3\n1\n2\n\nThere can be multiple checkpoints at the same coordinates.\n\nSample Input 3\n\n5 5\n-100000000 -100000000\n-100000000 100000000\n100000000 -100000000\n100000000 100000000\n0 0\n0 0\n100000000 100000000\n100000000 -100000000\n-100000000 100000000\n-100000000 -100000000\n\nSample Output 3\n\n5\n4\n3\n2\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 387, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s076853919", "group_id": "codeNet:p03775", "input_text": "let digits n =\n  let rec aux m ans =\n    if m < 1 then ans else aux (m / 10) (succ ans)\n  in\n  aux n 0\n\nlet solve n =\n  let b = sqrt n |> int_of_float in\n  let intn = int_of_float n in\n  let rec aux b' =\n    if intn mod b' = 0 then max (digits b') (digits (intn / b'))\n    else aux (pred b')\n  in\n  aux b\n\nlet () = Scanf.scanf \"%f\\n\" solve |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1525857967, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s076853919.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s076853919", "user_id": "u987869509"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let digits n =\n  let rec aux m ans =\n    if m < 1 then ans else aux (m / 10) (succ ans)\n  in\n  aux n 0\n\nlet solve n =\n  let b = sqrt n |> int_of_float in\n  let intn = int_of_float n in\n  let rec aux b' =\n    if intn mod b' = 0 then max (digits b') (digits (intn / b'))\n    else aux (pred b')\n  in\n  aux b\n\nlet () = Scanf.scanf \"%f\\n\" solve |> Printf.printf \"%d\\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s823999695", "group_id": "codeNet:p03776", "input_text": "let dp = Array.make_matrix (50 + 1) (50 + 1) ~-1\nlet rec c n k = if dp.(n).(k) > -1 then dp.(n).(k) else (dp.(n).(k) <- if n < k then 0 else if n = k then 1 else if k = 0 then 1 else c (n - 1) (k - 1) + c (n - 1) k; dp.(n).(k))\nlet n, a, b = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b - 1, c - 1\nlet vs = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet m = Array.(sort (fun x y -> y - x) vs; vs.(0))\nlet j, k = ref ~-1, ref (b + 1)\nlet _ = Array.(iteri (fun i v -> if a <= i && i < !k && v < m then k := i; if i > 0 && i <= b && v <> vs.(i - 1) then j := i) vs; if a < !k then decr k; let t = fold_left (fun c v -> if v = vs.(!k) then c + 1 else c) 0 vs in\n  Printf.printf \"%.6f\\n%d\\n\" (float (sub vs 0 (!k + 1) |> fold_left (+) 0) /. (float !k +. 1.)) @@ if vs.(!k) = m then let s = ref 0 in for i = a + 1 to b + 1 do s := !s + c t i done; !s else c t (!k - !j + 1))", "language": "OCaml", "metadata": {"date": 1583412219, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s823999695.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s823999695", "user_id": "u732304692"}, "prompt_components": {"gold_output": "4.500000\n1\n", "input_to_evaluate": "let dp = Array.make_matrix (50 + 1) (50 + 1) ~-1\nlet rec c n k = if dp.(n).(k) > -1 then dp.(n).(k) else (dp.(n).(k) <- if n < k then 0 else if n = k then 1 else if k = 0 then 1 else c (n - 1) (k - 1) + c (n - 1) k; dp.(n).(k))\nlet n, a, b = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b - 1, c - 1\nlet vs = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet m = Array.(sort (fun x y -> y - x) vs; vs.(0))\nlet j, k = ref ~-1, ref (b + 1)\nlet _ = Array.(iteri (fun i v -> if a <= i && i < !k && v < m then k := i; if i > 0 && i <= b && v <> vs.(i - 1) then j := i) vs; if a < !k then decr k; let t = fold_left (fun c v -> if v = vs.(!k) then c + 1 else c) 0 vs in\n  Printf.printf \"%.6f\\n%d\\n\" (float (sub vs 0 (!k + 1) |> fold_left (+) 0) /. (float !k +. 1.)) @@ if vs.(!k) = m then let s = ref 0 in for i = a + 1 to b + 1 do s := !s + c t i done; !s else c t (!k - !j + 1))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given N items.\n\nThe value of the i-th item (1 \\leq i \\leq N) is v_i.\n\nYour have to select at least A and at most B of these items.\n\nUnder this condition, find the maximum possible arithmetic mean of the values of selected items.\n\nAdditionally, find the number of ways to select items so that the mean of the values of selected items is maximized.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq A,B \\leq N\n\n1 \\leq v_i \\leq 10^{15}\n\nEach v_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN A B\nv_1\nv_2\n...\nv_N\n\nOutput\n\nPrint two lines.\n\nThe first line should contain the maximum possible arithmetic mean of the values of selected items. The output should be considered correct if the absolute or relative error is at most 10^{-6}.\n\nThe second line should contain the number of ways to select items so that the mean of the values of selected items is maximized.\n\nSample Input 1\n\n5 2 2\n1 2 3 4 5\n\nSample Output 1\n\n4.500000\n1\n\nThe mean of the values of selected items will be maximized when selecting the fourth and fifth items. Hence, the first line of the output should contain 4.5.\n\nThere is no other way to select items so that the mean of the values will be 4.5, and thus the second line of the output should contain 1.\n\nSample Input 2\n\n4 2 3\n10 20 10 10\n\nSample Output 2\n\n15.000000\n3\n\nThere can be multiple ways to select items so that the mean of the values will be maximized.\n\nSample Input 3\n\n5 1 5\n1000000000000000 999999999999999 999999999999998 999999999999997 999999999999996\n\nSample Output 3\n\n1000000000000000.000000\n1", "sample_input": "5 2 2\n1 2 3 4 5\n"}, "reference_outputs": ["4.500000\n1\n"], "source_document_id": "p03776", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given N items.\n\nThe value of the i-th item (1 \\leq i \\leq N) is v_i.\n\nYour have to select at least A and at most B of these items.\n\nUnder this condition, find the maximum possible arithmetic mean of the values of selected items.\n\nAdditionally, find the number of ways to select items so that the mean of the values of selected items is maximized.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq A,B \\leq N\n\n1 \\leq v_i \\leq 10^{15}\n\nEach v_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN A B\nv_1\nv_2\n...\nv_N\n\nOutput\n\nPrint two lines.\n\nThe first line should contain the maximum possible arithmetic mean of the values of selected items. The output should be considered correct if the absolute or relative error is at most 10^{-6}.\n\nThe second line should contain the number of ways to select items so that the mean of the values of selected items is maximized.\n\nSample Input 1\n\n5 2 2\n1 2 3 4 5\n\nSample Output 1\n\n4.500000\n1\n\nThe mean of the values of selected items will be maximized when selecting the fourth and fifth items. Hence, the first line of the output should contain 4.5.\n\nThere is no other way to select items so that the mean of the values will be 4.5, and thus the second line of the output should contain 1.\n\nSample Input 2\n\n4 2 3\n10 20 10 10\n\nSample Output 2\n\n15.000000\n3\n\nThere can be multiple ways to select items so that the mean of the values will be maximized.\n\nSample Input 3\n\n5 1 5\n1000000000000000 999999999999999 999999999999998 999999999999997 999999999999996\n\nSample Output 3\n\n1000000000000000.000000\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 874, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s883050418", "group_id": "codeNet:p03776", "input_text": "let dp = Array.make_matrix (50 + 1) (50 + 1) ~-1\nlet rec c n k = if dp.(n).(k) > -1 then dp.(n).(k) else (dp.(n).(k) <- if n < k then 0 else if n = k then 1 else if k = 0 then 1 else c (n - 1) (k - 1) + c (n - 1) k; dp.(n).(k))\nlet n, a, b = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b - 1, c - 1\nlet vs = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet m = Array.(sort (fun x y -> y - x) vs; vs.(0))\nlet j, k = ref ~-1, ref (b + 1)\nlet _ = Array.(iteri (fun i v -> if a <= i && i < !k && v < m then k := i; if i > 0 && i <= b && v <> vs.(i - 1) then j := i) vs; if a < !k then decr k;\n  Printf.printf \"%.6f\\n%d\\n\" (float (sub vs 0 (!k + 1) |> fold_left (+) 0) /. (float !k +. 1.)) @@ if vs.(!k) = m then 1 lsl (!k + 1) - 1 else c (fold_left (fun c v -> if v = vs.(!k) then c + 1 else c) 0 vs) (!k - !j + 1))", "language": "OCaml", "metadata": {"date": 1583409419, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s883050418.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s883050418", "user_id": "u732304692"}, "prompt_components": {"gold_output": "4.500000\n1\n", "input_to_evaluate": "let dp = Array.make_matrix (50 + 1) (50 + 1) ~-1\nlet rec c n k = if dp.(n).(k) > -1 then dp.(n).(k) else (dp.(n).(k) <- if n < k then 0 else if n = k then 1 else if k = 0 then 1 else c (n - 1) (k - 1) + c (n - 1) k; dp.(n).(k))\nlet n, a, b = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b - 1, c - 1\nlet vs = Array.init n @@ fun _ -> Scanf.scanf \" %d\" (+) 0\nlet m = Array.(sort (fun x y -> y - x) vs; vs.(0))\nlet j, k = ref ~-1, ref (b + 1)\nlet _ = Array.(iteri (fun i v -> if a <= i && i < !k && v < m then k := i; if i > 0 && i <= b && v <> vs.(i - 1) then j := i) vs; if a < !k then decr k;\n  Printf.printf \"%.6f\\n%d\\n\" (float (sub vs 0 (!k + 1) |> fold_left (+) 0) /. (float !k +. 1.)) @@ if vs.(!k) = m then 1 lsl (!k + 1) - 1 else c (fold_left (fun c v -> if v = vs.(!k) then c + 1 else c) 0 vs) (!k - !j + 1))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given N items.\n\nThe value of the i-th item (1 \\leq i \\leq N) is v_i.\n\nYour have to select at least A and at most B of these items.\n\nUnder this condition, find the maximum possible arithmetic mean of the values of selected items.\n\nAdditionally, find the number of ways to select items so that the mean of the values of selected items is maximized.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq A,B \\leq N\n\n1 \\leq v_i \\leq 10^{15}\n\nEach v_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN A B\nv_1\nv_2\n...\nv_N\n\nOutput\n\nPrint two lines.\n\nThe first line should contain the maximum possible arithmetic mean of the values of selected items. The output should be considered correct if the absolute or relative error is at most 10^{-6}.\n\nThe second line should contain the number of ways to select items so that the mean of the values of selected items is maximized.\n\nSample Input 1\n\n5 2 2\n1 2 3 4 5\n\nSample Output 1\n\n4.500000\n1\n\nThe mean of the values of selected items will be maximized when selecting the fourth and fifth items. Hence, the first line of the output should contain 4.5.\n\nThere is no other way to select items so that the mean of the values will be 4.5, and thus the second line of the output should contain 1.\n\nSample Input 2\n\n4 2 3\n10 20 10 10\n\nSample Output 2\n\n15.000000\n3\n\nThere can be multiple ways to select items so that the mean of the values will be maximized.\n\nSample Input 3\n\n5 1 5\n1000000000000000 999999999999999 999999999999998 999999999999997 999999999999996\n\nSample Output 3\n\n1000000000000000.000000\n1", "sample_input": "5 2 2\n1 2 3 4 5\n"}, "reference_outputs": ["4.500000\n1\n"], "source_document_id": "p03776", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given N items.\n\nThe value of the i-th item (1 \\leq i \\leq N) is v_i.\n\nYour have to select at least A and at most B of these items.\n\nUnder this condition, find the maximum possible arithmetic mean of the values of selected items.\n\nAdditionally, find the number of ways to select items so that the mean of the values of selected items is maximized.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq A,B \\leq N\n\n1 \\leq v_i \\leq 10^{15}\n\nEach v_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN A B\nv_1\nv_2\n...\nv_N\n\nOutput\n\nPrint two lines.\n\nThe first line should contain the maximum possible arithmetic mean of the values of selected items. The output should be considered correct if the absolute or relative error is at most 10^{-6}.\n\nThe second line should contain the number of ways to select items so that the mean of the values of selected items is maximized.\n\nSample Input 1\n\n5 2 2\n1 2 3 4 5\n\nSample Output 1\n\n4.500000\n1\n\nThe mean of the values of selected items will be maximized when selecting the fourth and fifth items. Hence, the first line of the output should contain 4.5.\n\nThere is no other way to select items so that the mean of the values will be 4.5, and thus the second line of the output should contain 1.\n\nSample Input 2\n\n4 2 3\n10 20 10 10\n\nSample Output 2\n\n15.000000\n3\n\nThere can be multiple ways to select items so that the mean of the values will be maximized.\n\nSample Input 3\n\n5 1 5\n1000000000000000 999999999999999 999999999999998 999999999999997 999999999999996\n\nSample Output 3\n\n1000000000000000.000000\n1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 814, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s281211181", "group_id": "codeNet:p03777", "input_text": "let a, b = Scanf.scanf \"%s %s\\n\" @@ fun a b -> a, b\nlet ans = if a = \"H\" then b else if b = \"H\" then  \"D\" else \"H\"\nlet () = print_endline ans", "language": "OCaml", "metadata": {"date": 1588432421, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s281211181.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s281211181", "user_id": "u307426615"}, "prompt_components": {"gold_output": "H\n", "input_to_evaluate": "let a, b = Scanf.scanf \"%s %s\\n\" @@ fun a b -> a, b\nlet ans = if a = \"H\" then b else if b = \"H\" then  \"D\" else \"H\"\nlet () = print_endline ans", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTwo deer, AtCoDeer and TopCoDeer, are playing a game called Honest or Dishonest.\nIn this game, an honest player always tells the truth, and an dishonest player always tell lies.\nYou are given two characters a and b as the input. Each of them is either H or D, and carries the following information:\n\nIf a=H, AtCoDeer is honest; if a=D, AtCoDeer is dishonest.\nIf b=H, AtCoDeer is saying that TopCoDeer is honest; if b=D, AtCoDeer is saying that TopCoDeer is dishonest.\n\nGiven this information, determine whether TopCoDeer is honest.\n\nConstraints\n\na=H or a=D.\n\nb=H or b=D.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf TopCoDeer is honest, print H. If he is dishonest, print D.\n\nSample Input 1\n\nH H\n\nSample Output 1\n\nH\n\nIn this input, AtCoDeer is honest. Hence, as he says, TopCoDeer is honest.\n\nSample Input 2\n\nD H\n\nSample Output 2\n\nD\n\nIn this input, AtCoDeer is dishonest. Hence, contrary to what he says, TopCoDeer is dishonest.\n\nSample Input 3\n\nD D\n\nSample Output 3\n\nH", "sample_input": "H H\n"}, "reference_outputs": ["H\n"], "source_document_id": "p03777", "source_text": "Score : 100 points\n\nProblem Statement\n\nTwo deer, AtCoDeer and TopCoDeer, are playing a game called Honest or Dishonest.\nIn this game, an honest player always tells the truth, and an dishonest player always tell lies.\nYou are given two characters a and b as the input. Each of them is either H or D, and carries the following information:\n\nIf a=H, AtCoDeer is honest; if a=D, AtCoDeer is dishonest.\nIf b=H, AtCoDeer is saying that TopCoDeer is honest; if b=D, AtCoDeer is saying that TopCoDeer is dishonest.\n\nGiven this information, determine whether TopCoDeer is honest.\n\nConstraints\n\na=H or a=D.\n\nb=H or b=D.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf TopCoDeer is honest, print H. If he is dishonest, print D.\n\nSample Input 1\n\nH H\n\nSample Output 1\n\nH\n\nIn this input, AtCoDeer is honest. Hence, as he says, TopCoDeer is honest.\n\nSample Input 2\n\nD H\n\nSample Output 2\n\nD\n\nIn this input, AtCoDeer is dishonest. Hence, contrary to what he says, TopCoDeer is dishonest.\n\nSample Input 3\n\nD D\n\nSample Output 3\n\nH", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 141, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s355214560", "group_id": "codeNet:p03777", "input_text": "let () =\n  Scanf.scanf \"%c %c\" (fun a b ->\n      if a = 'H' then b else match b with 'H' -> 'D' | _ -> 'H' )\n  |> Printf.printf \"%c\\n\"", "language": "OCaml", "metadata": {"date": 1525945234, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s355214560.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s355214560", "user_id": "u987869509"}, "prompt_components": {"gold_output": "H\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%c %c\" (fun a b ->\n      if a = 'H' then b else match b with 'H' -> 'D' | _ -> 'H' )\n  |> Printf.printf \"%c\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTwo deer, AtCoDeer and TopCoDeer, are playing a game called Honest or Dishonest.\nIn this game, an honest player always tells the truth, and an dishonest player always tell lies.\nYou are given two characters a and b as the input. Each of them is either H or D, and carries the following information:\n\nIf a=H, AtCoDeer is honest; if a=D, AtCoDeer is dishonest.\nIf b=H, AtCoDeer is saying that TopCoDeer is honest; if b=D, AtCoDeer is saying that TopCoDeer is dishonest.\n\nGiven this information, determine whether TopCoDeer is honest.\n\nConstraints\n\na=H or a=D.\n\nb=H or b=D.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf TopCoDeer is honest, print H. If he is dishonest, print D.\n\nSample Input 1\n\nH H\n\nSample Output 1\n\nH\n\nIn this input, AtCoDeer is honest. Hence, as he says, TopCoDeer is honest.\n\nSample Input 2\n\nD H\n\nSample Output 2\n\nD\n\nIn this input, AtCoDeer is dishonest. Hence, contrary to what he says, TopCoDeer is dishonest.\n\nSample Input 3\n\nD D\n\nSample Output 3\n\nH", "sample_input": "H H\n"}, "reference_outputs": ["H\n"], "source_document_id": "p03777", "source_text": "Score : 100 points\n\nProblem Statement\n\nTwo deer, AtCoDeer and TopCoDeer, are playing a game called Honest or Dishonest.\nIn this game, an honest player always tells the truth, and an dishonest player always tell lies.\nYou are given two characters a and b as the input. Each of them is either H or D, and carries the following information:\n\nIf a=H, AtCoDeer is honest; if a=D, AtCoDeer is dishonest.\nIf b=H, AtCoDeer is saying that TopCoDeer is honest; if b=D, AtCoDeer is saying that TopCoDeer is dishonest.\n\nGiven this information, determine whether TopCoDeer is honest.\n\nConstraints\n\na=H or a=D.\n\nb=H or b=D.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf TopCoDeer is honest, print H. If he is dishonest, print D.\n\nSample Input 1\n\nH H\n\nSample Output 1\n\nH\n\nIn this input, AtCoDeer is honest. Hence, as he says, TopCoDeer is honest.\n\nSample Input 2\n\nD H\n\nSample Output 2\n\nD\n\nIn this input, AtCoDeer is dishonest. Hence, contrary to what he says, TopCoDeer is dishonest.\n\nSample Input 3\n\nD D\n\nSample Output 3\n\nH", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 134, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s307496952", "group_id": "codeNet:p03778", "input_text": "let () = Scanf.scanf \"%d %d %d\" @@ fun w a b ->\n  Printf.printf \"%d\\n\" @@\n  if a <= b\n  then max 0 (b - a - w)\n  else max 0 (a - b - w)\n", "language": "OCaml", "metadata": {"date": 1530682772, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s307496952.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s307496952", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" @@ fun w a b ->\n  Printf.printf \"%d\\n\" @@\n  if a <= b\n  then max 0 (b - a - w)\n  else max 0 (a - b - w)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer found two rectangles lying on the table, each with height 1 and width W.\nIf we consider the surface of the desk as a two-dimensional plane, the first rectangle covers the vertical range of [0,1] and the horizontal range of [a,a+W], and the second rectangle covers the vertical range of [1,2] and the horizontal range of [b,b+W], as shown in the following figure:\n\nAtCoDeer will move the second rectangle horizontally so that it connects with the first rectangle.\nFind the minimum distance it needs to be moved.\n\nConstraints\n\nAll input values are integers.\n\n1≤W≤10^5\n\n1≤a,b≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nW a b\n\nOutput\n\nPrint the minimum distance the second rectangle needs to be moved.\n\nSample Input 1\n\n3 2 6\n\nSample Output 1\n\n1\n\nThis input corresponds to the figure in the statement. In this case, the second rectangle should be moved to the left by a distance of 1.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n0\n\nThe rectangles are already connected, and thus no move is needed.\n\nSample Input 3\n\n5 10 1\n\nSample Output 3\n\n4", "sample_input": "3 2 6\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03778", "source_text": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer found two rectangles lying on the table, each with height 1 and width W.\nIf we consider the surface of the desk as a two-dimensional plane, the first rectangle covers the vertical range of [0,1] and the horizontal range of [a,a+W], and the second rectangle covers the vertical range of [1,2] and the horizontal range of [b,b+W], as shown in the following figure:\n\nAtCoDeer will move the second rectangle horizontally so that it connects with the first rectangle.\nFind the minimum distance it needs to be moved.\n\nConstraints\n\nAll input values are integers.\n\n1≤W≤10^5\n\n1≤a,b≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nW a b\n\nOutput\n\nPrint the minimum distance the second rectangle needs to be moved.\n\nSample Input 1\n\n3 2 6\n\nSample Output 1\n\n1\n\nThis input corresponds to the figure in the statement. In this case, the second rectangle should be moved to the left by a distance of 1.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n0\n\nThe rectangles are already connected, and thus no move is needed.\n\nSample Input 3\n\n5 10 1\n\nSample Output 3\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s314837390", "group_id": "codeNet:p03778", "input_text": "let () =\n  let w,a,b = Scanf.scanf \"%d %d %d \" (fun a b c -> a,b,c) in\n\n  let t = if a < b then\n      b-a-w\n    else if a > b then\n      a-b-w\n    else 0\n  in\n  Printf.printf \"%d\\n\" @@\n    if t <= 0 then 0 else t\n", "language": "OCaml", "metadata": {"date": 1528856728, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s314837390.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s314837390", "user_id": "u139013163"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () =\n  let w,a,b = Scanf.scanf \"%d %d %d \" (fun a b c -> a,b,c) in\n\n  let t = if a < b then\n      b-a-w\n    else if a > b then\n      a-b-w\n    else 0\n  in\n  Printf.printf \"%d\\n\" @@\n    if t <= 0 then 0 else t\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer found two rectangles lying on the table, each with height 1 and width W.\nIf we consider the surface of the desk as a two-dimensional plane, the first rectangle covers the vertical range of [0,1] and the horizontal range of [a,a+W], and the second rectangle covers the vertical range of [1,2] and the horizontal range of [b,b+W], as shown in the following figure:\n\nAtCoDeer will move the second rectangle horizontally so that it connects with the first rectangle.\nFind the minimum distance it needs to be moved.\n\nConstraints\n\nAll input values are integers.\n\n1≤W≤10^5\n\n1≤a,b≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nW a b\n\nOutput\n\nPrint the minimum distance the second rectangle needs to be moved.\n\nSample Input 1\n\n3 2 6\n\nSample Output 1\n\n1\n\nThis input corresponds to the figure in the statement. In this case, the second rectangle should be moved to the left by a distance of 1.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n0\n\nThe rectangles are already connected, and thus no move is needed.\n\nSample Input 3\n\n5 10 1\n\nSample Output 3\n\n4", "sample_input": "3 2 6\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03778", "source_text": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer found two rectangles lying on the table, each with height 1 and width W.\nIf we consider the surface of the desk as a two-dimensional plane, the first rectangle covers the vertical range of [0,1] and the horizontal range of [a,a+W], and the second rectangle covers the vertical range of [1,2] and the horizontal range of [b,b+W], as shown in the following figure:\n\nAtCoDeer will move the second rectangle horizontally so that it connects with the first rectangle.\nFind the minimum distance it needs to be moved.\n\nConstraints\n\nAll input values are integers.\n\n1≤W≤10^5\n\n1≤a,b≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nW a b\n\nOutput\n\nPrint the minimum distance the second rectangle needs to be moved.\n\nSample Input 1\n\n3 2 6\n\nSample Output 1\n\n1\n\nThis input corresponds to the figure in the statement. In this case, the second rectangle should be moved to the left by a distance of 1.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n0\n\nThe rectangles are already connected, and thus no move is needed.\n\nSample Input 3\n\n5 10 1\n\nSample Output 3\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 213, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s004931083", "group_id": "codeNet:p03778", "input_text": "let () =\n  Scanf.scanf \"%d %d %d\" (fun w a b -> max 0 (max (b-a-w) (a-b-w)))\n  |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1519785354, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s004931083.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s004931083", "user_id": "u798181098"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"%d %d %d\" (fun w a b -> max 0 (max (b-a-w) (a-b-w)))\n  |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer found two rectangles lying on the table, each with height 1 and width W.\nIf we consider the surface of the desk as a two-dimensional plane, the first rectangle covers the vertical range of [0,1] and the horizontal range of [a,a+W], and the second rectangle covers the vertical range of [1,2] and the horizontal range of [b,b+W], as shown in the following figure:\n\nAtCoDeer will move the second rectangle horizontally so that it connects with the first rectangle.\nFind the minimum distance it needs to be moved.\n\nConstraints\n\nAll input values are integers.\n\n1≤W≤10^5\n\n1≤a,b≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nW a b\n\nOutput\n\nPrint the minimum distance the second rectangle needs to be moved.\n\nSample Input 1\n\n3 2 6\n\nSample Output 1\n\n1\n\nThis input corresponds to the figure in the statement. In this case, the second rectangle should be moved to the left by a distance of 1.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n0\n\nThe rectangles are already connected, and thus no move is needed.\n\nSample Input 3\n\n5 10 1\n\nSample Output 3\n\n4", "sample_input": "3 2 6\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03778", "source_text": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer found two rectangles lying on the table, each with height 1 and width W.\nIf we consider the surface of the desk as a two-dimensional plane, the first rectangle covers the vertical range of [0,1] and the horizontal range of [a,a+W], and the second rectangle covers the vertical range of [1,2] and the horizontal range of [b,b+W], as shown in the following figure:\n\nAtCoDeer will move the second rectangle horizontally so that it connects with the first rectangle.\nFind the minimum distance it needs to be moved.\n\nConstraints\n\nAll input values are integers.\n\n1≤W≤10^5\n\n1≤a,b≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nW a b\n\nOutput\n\nPrint the minimum distance the second rectangle needs to be moved.\n\nSample Input 1\n\n3 2 6\n\nSample Output 1\n\n1\n\nThis input corresponds to the figure in the statement. In this case, the second rectangle should be moved to the left by a distance of 1.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n0\n\nThe rectangles are already connected, and thus no move is needed.\n\nSample Input 3\n\n5 10 1\n\nSample Output 3\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s497493407", "group_id": "codeNet:p03779", "input_text": "Scanf.scanf \"%d\" (fun x ->\n    let rec loop i acc =\n        let acc = acc + i in\n        if acc >= x then i else loop (i + 1) acc\n    in\n    loop 1 0 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1600660138, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s497493407.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s497493407", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun x ->\n    let rec loop i acc =\n        let acc = acc + i in\n        if acc >= x then i else loop (i + 1) acc\n    in\n    loop 1 0 |> Printf.printf \"%d\\n\"\n)", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 3812}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s622177786", "group_id": "codeNet:p03779", "input_text": "let f x = int_of_float (ceil ((-1. +. sqrt (1. +. 8. *. x)) /. 2.))\n\nlet () = Scanf.scanf \"%f\" (fun x -> print_int (f x))", "language": "OCaml", "metadata": {"date": 1585893422, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s622177786.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s622177786", "user_id": "u752907799"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let f x = int_of_float (ceil ((-1. +. sqrt (1. +. 8. *. x)) /. 2.))\n\nlet () = Scanf.scanf \"%f\" (fun x -> print_int (f x))", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 121, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s761712916", "group_id": "codeNet:p03779", "input_text": "let x = read_int ()\nlet i = ref 1\nlet _ = while !i * (!i + 1) / 2 < x do incr i done; Printf.printf \"%d\\n\" @@ !i", "language": "OCaml", "metadata": {"date": 1568941470, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s761712916.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s761712916", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let x = read_int ()\nlet i = ref 1\nlet _ = while !i * (!i + 1) / 2 < x do incr i done; Printf.printf \"%d\\n\" @@ !i", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s147192973", "group_id": "codeNet:p03779", "input_text": "let () =\n  let x = Scanf.scanf \"%d \" (fun a -> a) in\n\n  let rec aux i res =\n    if res >= x then i-1\n    else aux (i+1) (res+i)\n  in\n\n  Printf.printf \"%d\\n\" @@\n  aux 1 0\n", "language": "OCaml", "metadata": {"date": 1529157593, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s147192973.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s147192973", "user_id": "u139013163"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let () =\n  let x = Scanf.scanf \"%d \" (fun a -> a) in\n\n  let rec aux i res =\n    if res >= x then i-1\n    else aux (i+1) (res+i)\n  in\n\n  Printf.printf \"%d\\n\" @@\n  aux 1 0\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 170, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s100521614", "group_id": "codeNet:p03783", "input_text": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let lrs = Array.init n @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun l r -> l, r in\n  let f x = Array.fold_right (fun (l, r) -> ( + ) @@\n    if x < l then l - x\n    else if r < x then x - r\n    else 0) lrs 0 in\n  let l = Array.fold_right (fun (l, _) -> min l) lrs max_int in\n  let r = Array.fold_right (fun (_, r) -> max r) lrs min_int in\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left min max_int @@\n  Array.init (r - l + 1) @@ fun i -> f @@ i + l\n", "language": "OCaml", "metadata": {"date": 1537587335, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03783.html", "problem_id": "p03783", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03783/input.txt", "sample_output_relpath": "derived/input_output/data/p03783/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03783/OCaml/s100521614.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s100521614", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\\n\" @@ fun n ->\n  let lrs = Array.init n @@ fun _ -> Scanf.scanf \"%d %d\\n\" @@ fun l r -> l, r in\n  let f x = Array.fold_right (fun (l, r) -> ( + ) @@\n    if x < l then l - x\n    else if r < x then x - r\n    else 0) lrs 0 in\n  let l = Array.fold_right (fun (l, _) -> min l) lrs max_int in\n  let r = Array.fold_right (fun (_, r) -> max r) lrs min_int in\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left min max_int @@\n  Array.init (r - l + 1) @@ fun i -> f @@ i + l\n", "problem_context": "Score : 1000 points\n\nProblem Statement\n\nAtCoDeer the deer found N rectangle lying on the table, each with height 1.\nIf we consider the surface of the desk as a two-dimensional plane, the i-th rectangle i(1≤i≤N) covers the vertical range of [i-1,i] and the horizontal range of [l_i,r_i], as shown in the following figure:\n\nAtCoDeer will move these rectangles horizontally so that all the rectangles are connected.\nFor each rectangle, the cost to move it horizontally by a distance of x, is x.\nFind the minimum cost to achieve connectivity.\nIt can be proved that this value is always an integer under the constraints of the problem.\n\nConstraints\n\nAll input values are integers.\n\n1≤N≤10^5\n\n1≤l_i<r_i≤10^9\n\nPartial Score\n\n300 points will be awarded for passing the test set satisfying 1≤N≤400 and 1≤l_i<r_i≤400.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nl_1 r_1\nl_2 r_2\n:\nl_N r_N\n\nOutput\n\nPrint the minimum cost to achieve connectivity.\n\nSample Input 1\n\n3\n1 3\n5 7\n1 3\n\nSample Output 1\n\n2\n\nThe second rectangle should be moved to the left by a distance of 2.\n\nSample Input 2\n\n3\n2 5\n4 6\n1 4\n\nSample Output 2\n\n0\n\nThe rectangles are already connected, and thus no move is needed.\n\nSample Input 3\n\n5\n999999999 1000000000\n1 2\n314 315\n500000 500001\n999999999 1000000000\n\nSample Output 3\n\n1999999680\n\nSample Input 4\n\n5\n123456 789012\n123 456\n12 345678901\n123456 789012\n1 23\n\nSample Output 4\n\n246433\n\nSample Input 5\n\n1\n1 400\n\nSample Output 5\n\n0", "sample_input": "3\n1 3\n5 7\n1 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03783", "source_text": "Score : 1000 points\n\nProblem Statement\n\nAtCoDeer the deer found N rectangle lying on the table, each with height 1.\nIf we consider the surface of the desk as a two-dimensional plane, the i-th rectangle i(1≤i≤N) covers the vertical range of [i-1,i] and the horizontal range of [l_i,r_i], as shown in the following figure:\n\nAtCoDeer will move these rectangles horizontally so that all the rectangles are connected.\nFor each rectangle, the cost to move it horizontally by a distance of x, is x.\nFind the minimum cost to achieve connectivity.\nIt can be proved that this value is always an integer under the constraints of the problem.\n\nConstraints\n\nAll input values are integers.\n\n1≤N≤10^5\n\n1≤l_i<r_i≤10^9\n\nPartial Score\n\n300 points will be awarded for passing the test set satisfying 1≤N≤400 and 1≤l_i<r_i≤400.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nl_1 r_1\nl_2 r_2\n:\nl_N r_N\n\nOutput\n\nPrint the minimum cost to achieve connectivity.\n\nSample Input 1\n\n3\n1 3\n5 7\n1 3\n\nSample Output 1\n\n2\n\nThe second rectangle should be moved to the left by a distance of 2.\n\nSample Input 2\n\n3\n2 5\n4 6\n1 4\n\nSample Output 2\n\n0\n\nThe rectangles are already connected, and thus no move is needed.\n\nSample Input 3\n\n5\n999999999 1000000000\n1 2\n314 315\n500000 500001\n999999999 1000000000\n\nSample Output 3\n\n1999999680\n\nSample Input 4\n\n5\n123456 789012\n123 456\n12 345678901\n123456 789012\n1 23\n\nSample Output 4\n\n246433\n\nSample Input 5\n\n1\n1 400\n\nSample Output 5\n\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 483, "cpu_time_ms": 70, "memory_kb": 6656}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s304172078", "group_id": "codeNet:p03785", "input_text": "let n, c, k = Scanf.scanf \"%d %d %d\" (fun n c k -> n, c, k)\nlet t = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun i -> i))\n\nlet rec f i t' p b =\n  if i = n then b\n  else if t' < t.(i) || p = c then f (i + 1) (t.(i) + k) 1 (b + 1)\n  else f (i + 1) t' (p + 1) b\n\nlet () =\n  Array.sort (fun x y -> x - y) t;\n  let ans = f 0 0 0 0 in\n  Printf.printf \"%d\\n\" ans\n", "language": "OCaml", "metadata": {"date": 1599457236, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03785.html", "problem_id": "p03785", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03785/input.txt", "sample_output_relpath": "derived/input_output/data/p03785/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03785/OCaml/s304172078.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s304172078", "user_id": "u752907799"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let n, c, k = Scanf.scanf \"%d %d %d\" (fun n c k -> n, c, k)\nlet t = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun i -> i))\n\nlet rec f i t' p b =\n  if i = n then b\n  else if t' < t.(i) || p = c then f (i + 1) (t.(i) + k) 1 (b + 1)\n  else f (i + 1) t' (p + 1) b\n\nlet () =\n  Array.sort (fun x y -> x - y) t;\n  let ans = f 0 0 0 0 in\n  Printf.printf \"%d\\n\" ans\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nEvery day, N passengers arrive at Takahashi Airport.\nThe i-th passenger arrives at time T_i.\n\nEvery passenger arrived at Takahashi airport travels to the city by bus. Each bus can accommodate up to C passengers.\nNaturally, a passenger cannot take a bus that departs earlier than the airplane arrives at the airport.\nAlso, a passenger will get angry if he/she is still unable to take a bus K units of time after the arrival of the airplane.\nFor that reason, it is necessary to arrange buses so that the i-th passenger can take a bus departing at time between T_i and T_i + K (inclusive).\n\nWhen setting the departure times for buses under this condition, find the minimum required number of buses.\nHere, the departure time for each bus does not need to be an integer, and there may be multiple buses that depart at the same time.\n\nConstraints\n\n2 \\leq N \\leq 100000\n\n1 \\leq C \\leq 10^9\n\n1 \\leq K \\leq 10^9\n\n1 \\leq T_i \\leq 10^9\n\nC, K and T_i are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN C K\nT_1\nT_2\n:\nT_N\n\nOutput\n\nPrint the minimum required number of buses.\n\nSample Input 1\n\n5 3 5\n1\n2\n3\n6\n12\n\nSample Output 1\n\n3\n\nFor example, the following three buses are enough:\n\nA bus departing at time 4.5, that carries the passengers arriving at time 2 and 3.\n\nA bus departing at time 6, that carries the passengers arriving at time 1 and 6.\n\nA bus departing at time 12, that carries the passenger arriving at time 12.\n\nSample Input 2\n\n6 3 3\n7\n6\n2\n8\n10\n6\n\nSample Output 2\n\n3", "sample_input": "5 3 5\n1\n2\n3\n6\n12\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03785", "source_text": "Score : 300 points\n\nProblem Statement\n\nEvery day, N passengers arrive at Takahashi Airport.\nThe i-th passenger arrives at time T_i.\n\nEvery passenger arrived at Takahashi airport travels to the city by bus. Each bus can accommodate up to C passengers.\nNaturally, a passenger cannot take a bus that departs earlier than the airplane arrives at the airport.\nAlso, a passenger will get angry if he/she is still unable to take a bus K units of time after the arrival of the airplane.\nFor that reason, it is necessary to arrange buses so that the i-th passenger can take a bus departing at time between T_i and T_i + K (inclusive).\n\nWhen setting the departure times for buses under this condition, find the minimum required number of buses.\nHere, the departure time for each bus does not need to be an integer, and there may be multiple buses that depart at the same time.\n\nConstraints\n\n2 \\leq N \\leq 100000\n\n1 \\leq C \\leq 10^9\n\n1 \\leq K \\leq 10^9\n\n1 \\leq T_i \\leq 10^9\n\nC, K and T_i are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN C K\nT_1\nT_2\n:\nT_N\n\nOutput\n\nPrint the minimum required number of buses.\n\nSample Input 1\n\n5 3 5\n1\n2\n3\n6\n12\n\nSample Output 1\n\n3\n\nFor example, the following three buses are enough:\n\nA bus departing at time 4.5, that carries the passengers arriving at time 2 and 3.\n\nA bus departing at time 6, that carries the passengers arriving at time 1 and 6.\n\nA bus departing at time 12, that carries the passenger arriving at time 12.\n\nSample Input 2\n\n6 3 3\n7\n6\n2\n8\n10\n6\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 62, "memory_kb": 6696}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s726351561", "group_id": "codeNet:p03785", "input_text": "(* O(n log n) *)\nlet n, c, k = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet ts = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet rec loop acc i r m =\n  if i >= n then acc\n  else if m >= c || r < ts.(i) then loop (acc + 1) (i + 1) (ts.(i) + k) 1\n  else loop acc (i + 1) r (m + 1)\nlet _ =\n  Array.sort (-) ts;\n  loop 1 1 (ts.(0) + k) 1 |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1560419415, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03785.html", "problem_id": "p03785", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03785/input.txt", "sample_output_relpath": "derived/input_output/data/p03785/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03785/OCaml/s726351561.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s726351561", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "(* O(n log n) *)\nlet n, c, k = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet ts = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet rec loop acc i r m =\n  if i >= n then acc\n  else if m >= c || r < ts.(i) then loop (acc + 1) (i + 1) (ts.(i) + k) 1\n  else loop acc (i + 1) r (m + 1)\nlet _ =\n  Array.sort (-) ts;\n  loop 1 1 (ts.(0) + k) 1 |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nEvery day, N passengers arrive at Takahashi Airport.\nThe i-th passenger arrives at time T_i.\n\nEvery passenger arrived at Takahashi airport travels to the city by bus. Each bus can accommodate up to C passengers.\nNaturally, a passenger cannot take a bus that departs earlier than the airplane arrives at the airport.\nAlso, a passenger will get angry if he/she is still unable to take a bus K units of time after the arrival of the airplane.\nFor that reason, it is necessary to arrange buses so that the i-th passenger can take a bus departing at time between T_i and T_i + K (inclusive).\n\nWhen setting the departure times for buses under this condition, find the minimum required number of buses.\nHere, the departure time for each bus does not need to be an integer, and there may be multiple buses that depart at the same time.\n\nConstraints\n\n2 \\leq N \\leq 100000\n\n1 \\leq C \\leq 10^9\n\n1 \\leq K \\leq 10^9\n\n1 \\leq T_i \\leq 10^9\n\nC, K and T_i are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN C K\nT_1\nT_2\n:\nT_N\n\nOutput\n\nPrint the minimum required number of buses.\n\nSample Input 1\n\n5 3 5\n1\n2\n3\n6\n12\n\nSample Output 1\n\n3\n\nFor example, the following three buses are enough:\n\nA bus departing at time 4.5, that carries the passengers arriving at time 2 and 3.\n\nA bus departing at time 6, that carries the passengers arriving at time 1 and 6.\n\nA bus departing at time 12, that carries the passenger arriving at time 12.\n\nSample Input 2\n\n6 3 3\n7\n6\n2\n8\n10\n6\n\nSample Output 2\n\n3", "sample_input": "5 3 5\n1\n2\n3\n6\n12\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03785", "source_text": "Score : 300 points\n\nProblem Statement\n\nEvery day, N passengers arrive at Takahashi Airport.\nThe i-th passenger arrives at time T_i.\n\nEvery passenger arrived at Takahashi airport travels to the city by bus. Each bus can accommodate up to C passengers.\nNaturally, a passenger cannot take a bus that departs earlier than the airplane arrives at the airport.\nAlso, a passenger will get angry if he/she is still unable to take a bus K units of time after the arrival of the airplane.\nFor that reason, it is necessary to arrange buses so that the i-th passenger can take a bus departing at time between T_i and T_i + K (inclusive).\n\nWhen setting the departure times for buses under this condition, find the minimum required number of buses.\nHere, the departure time for each bus does not need to be an integer, and there may be multiple buses that depart at the same time.\n\nConstraints\n\n2 \\leq N \\leq 100000\n\n1 \\leq C \\leq 10^9\n\n1 \\leq K \\leq 10^9\n\n1 \\leq T_i \\leq 10^9\n\nC, K and T_i are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN C K\nT_1\nT_2\n:\nT_N\n\nOutput\n\nPrint the minimum required number of buses.\n\nSample Input 1\n\n5 3 5\n1\n2\n3\n6\n12\n\nSample Output 1\n\n3\n\nFor example, the following three buses are enough:\n\nA bus departing at time 4.5, that carries the passengers arriving at time 2 and 3.\n\nA bus departing at time 6, that carries the passengers arriving at time 1 and 6.\n\nA bus departing at time 12, that carries the passenger arriving at time 12.\n\nSample Input 2\n\n6 3 3\n7\n6\n2\n8\n10\n6\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 64, "memory_kb": 5376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s147471122", "group_id": "codeNet:p03785", "input_text": "let id x = x\n\nlet (n,c,k) = Scanf.scanf \"%d %d %d\\n\" (fun n c k -> (n,c,k))\n  \nlet repeat f =\n  let rec loop acc = function\n    | 0 -> List.rev acc\n    | n -> loop (f () :: acc) (n-1) in\n  loop []\n\nlet t = repeat (fun () -> Scanf.scanf \"%d\\n\" id) n\n\nlet rec partition n a b = function\n  [] -> (a, b)\n| x::xs -> if x < n then partition n (x::a) b xs\n              else partition n a (x::b) xs\n\nlet rec quick_sort = function\n  [] -> []\n| x::xs ->\n    let (m, n) = partition x [] [] xs in\n    quick_sort m @ (x :: quick_sort n)\n\nlet tlist = quick_sort t\n\nlet check' tlist c k =\nlet rec check tlist ans t' d cnt =\n  match tlist with\n  | [] -> ans\n  | hd :: rest -> if hd > t' then check tlist ans hd d cnt else\n     match cnt with\n     | 0 -> check rest ans t' (hd+k) (cnt+1)\n     | _ -> if t' > d || cnt = c then check tlist (ans + 1) t' d 0\n             else check rest ans t' d (cnt+1)\nin check tlist 1 1 0 0\n\nlet ans = check' tlist c k\n\nlet () = Printf.printf \"%d\\n\" ans", "language": "OCaml", "metadata": {"date": 1489371525, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03785.html", "problem_id": "p03785", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03785/input.txt", "sample_output_relpath": "derived/input_output/data/p03785/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03785/OCaml/s147471122.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s147471122", "user_id": "u735499035"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let id x = x\n\nlet (n,c,k) = Scanf.scanf \"%d %d %d\\n\" (fun n c k -> (n,c,k))\n  \nlet repeat f =\n  let rec loop acc = function\n    | 0 -> List.rev acc\n    | n -> loop (f () :: acc) (n-1) in\n  loop []\n\nlet t = repeat (fun () -> Scanf.scanf \"%d\\n\" id) n\n\nlet rec partition n a b = function\n  [] -> (a, b)\n| x::xs -> if x < n then partition n (x::a) b xs\n              else partition n a (x::b) xs\n\nlet rec quick_sort = function\n  [] -> []\n| x::xs ->\n    let (m, n) = partition x [] [] xs in\n    quick_sort m @ (x :: quick_sort n)\n\nlet tlist = quick_sort t\n\nlet check' tlist c k =\nlet rec check tlist ans t' d cnt =\n  match tlist with\n  | [] -> ans\n  | hd :: rest -> if hd > t' then check tlist ans hd d cnt else\n     match cnt with\n     | 0 -> check rest ans t' (hd+k) (cnt+1)\n     | _ -> if t' > d || cnt = c then check tlist (ans + 1) t' d 0\n             else check rest ans t' d (cnt+1)\nin check tlist 1 1 0 0\n\nlet ans = check' tlist c k\n\nlet () = Printf.printf \"%d\\n\" ans", "problem_context": "Score : 300 points\n\nProblem Statement\n\nEvery day, N passengers arrive at Takahashi Airport.\nThe i-th passenger arrives at time T_i.\n\nEvery passenger arrived at Takahashi airport travels to the city by bus. Each bus can accommodate up to C passengers.\nNaturally, a passenger cannot take a bus that departs earlier than the airplane arrives at the airport.\nAlso, a passenger will get angry if he/she is still unable to take a bus K units of time after the arrival of the airplane.\nFor that reason, it is necessary to arrange buses so that the i-th passenger can take a bus departing at time between T_i and T_i + K (inclusive).\n\nWhen setting the departure times for buses under this condition, find the minimum required number of buses.\nHere, the departure time for each bus does not need to be an integer, and there may be multiple buses that depart at the same time.\n\nConstraints\n\n2 \\leq N \\leq 100000\n\n1 \\leq C \\leq 10^9\n\n1 \\leq K \\leq 10^9\n\n1 \\leq T_i \\leq 10^9\n\nC, K and T_i are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN C K\nT_1\nT_2\n:\nT_N\n\nOutput\n\nPrint the minimum required number of buses.\n\nSample Input 1\n\n5 3 5\n1\n2\n3\n6\n12\n\nSample Output 1\n\n3\n\nFor example, the following three buses are enough:\n\nA bus departing at time 4.5, that carries the passengers arriving at time 2 and 3.\n\nA bus departing at time 6, that carries the passengers arriving at time 1 and 6.\n\nA bus departing at time 12, that carries the passenger arriving at time 12.\n\nSample Input 2\n\n6 3 3\n7\n6\n2\n8\n10\n6\n\nSample Output 2\n\n3", "sample_input": "5 3 5\n1\n2\n3\n6\n12\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03785", "source_text": "Score : 300 points\n\nProblem Statement\n\nEvery day, N passengers arrive at Takahashi Airport.\nThe i-th passenger arrives at time T_i.\n\nEvery passenger arrived at Takahashi airport travels to the city by bus. Each bus can accommodate up to C passengers.\nNaturally, a passenger cannot take a bus that departs earlier than the airplane arrives at the airport.\nAlso, a passenger will get angry if he/she is still unable to take a bus K units of time after the arrival of the airplane.\nFor that reason, it is necessary to arrange buses so that the i-th passenger can take a bus departing at time between T_i and T_i + K (inclusive).\n\nWhen setting the departure times for buses under this condition, find the minimum required number of buses.\nHere, the departure time for each bus does not need to be an integer, and there may be multiple buses that depart at the same time.\n\nConstraints\n\n2 \\leq N \\leq 100000\n\n1 \\leq C \\leq 10^9\n\n1 \\leq K \\leq 10^9\n\n1 \\leq T_i \\leq 10^9\n\nC, K and T_i are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN C K\nT_1\nT_2\n:\nT_N\n\nOutput\n\nPrint the minimum required number of buses.\n\nSample Input 1\n\n5 3 5\n1\n2\n3\n6\n12\n\nSample Output 1\n\n3\n\nFor example, the following three buses are enough:\n\nA bus departing at time 4.5, that carries the passengers arriving at time 2 and 3.\n\nA bus departing at time 6, that carries the passengers arriving at time 1 and 6.\n\nA bus departing at time 12, that carries the passenger arriving at time 12.\n\nSample Input 2\n\n6 3 3\n7\n6\n2\n8\n10\n6\n\nSample Output 2\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 970, "cpu_time_ms": 150, "memory_kb": 21376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s817790349", "group_id": "codeNet:p03786", "input_text": "let split_string ?(pattern=\" \") = Str.split @@ Str.regexp pattern\n\nlet n = Scanf.sscanf (read_line ()) \"%d\" @@ fun n -> n\nlet a = Array.of_list @@ List.map int_of_string @@ split_string @@ read_line ()\n\nlet () =\n  Array.sort (fun a b -> a - b) a;\n  let sum = ref a.(0) in\n  for i = 1 to n - 1 do\n    if !sum * 2 < a.(i) then begin\n      Printf.printf \"%d\\n\" (n - i);\n      exit 0;\n    end;\n    sum := !sum + a.(i)\n  done;\n  Printf.printf \"%d\\n\" n\n", "language": "OCaml", "metadata": {"date": 1589585714, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s817790349.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s817790349", "user_id": "u811309788"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let split_string ?(pattern=\" \") = Str.split @@ Str.regexp pattern\n\nlet n = Scanf.sscanf (read_line ()) \"%d\" @@ fun n -> n\nlet a = Array.of_list @@ List.map int_of_string @@ split_string @@ read_line ()\n\nlet () =\n  Array.sort (fun a b -> a - b) a;\n  let sum = ref a.(0) in\n  for i = 1 to n - 1 do\n    if !sum * 2 < a.(i) then begin\n      Printf.printf \"%d\\n\" (n - i);\n      exit 0;\n    end;\n    sum := !sum + a.(i)\n  done;\n  Printf.printf \"%d\\n\" n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke found N strange creatures.\nEach creature has a fixed color and size. The color and size of the i-th creature are represented by i and A_i, respectively.\n\nEvery creature can absorb another creature whose size is at most twice the size of itself.\nWhen a creature of size A and color B absorbs another creature of size C and color D (C \\leq 2 \\times A), they will merge into one creature of size A+C and color B.\nHere, depending on the sizes of two creatures, it is possible that both of them can absorb the other.\n\nSnuke has been watching these creatures merge over and over and ultimately become one creature.\nFind the number of the possible colors of this creature.\n\nConstraints\n\n2 \\leq N \\leq 100000\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 … A_N\n\nOutput\n\nPrint the number of the possible colors of the last remaining creature after the N creatures repeatedly merge and ultimately become one creature.\n\nSample Input 1\n\n3\n3 1 4\n\nSample Output 1\n\n2\n\nThe possible colors of the last remaining creature are colors 1 and 3.\nFor example, when the creature of color 3 absorbs the creature of color 2, then the creature of color 1 absorbs the creature of color 3, the color of the last remaining creature will be color 1.\n\nSample Input 2\n\n5\n1 1 1 1 1\n\nSample Output 2\n\n5\n\nThere may be multiple creatures of the same size.\n\nSample Input 3\n\n6\n40 1 30 2 7 20\n\nSample Output 3\n\n4", "sample_input": "3\n3 1 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03786", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke found N strange creatures.\nEach creature has a fixed color and size. The color and size of the i-th creature are represented by i and A_i, respectively.\n\nEvery creature can absorb another creature whose size is at most twice the size of itself.\nWhen a creature of size A and color B absorbs another creature of size C and color D (C \\leq 2 \\times A), they will merge into one creature of size A+C and color B.\nHere, depending on the sizes of two creatures, it is possible that both of them can absorb the other.\n\nSnuke has been watching these creatures merge over and over and ultimately become one creature.\nFind the number of the possible colors of this creature.\n\nConstraints\n\n2 \\leq N \\leq 100000\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 … A_N\n\nOutput\n\nPrint the number of the possible colors of the last remaining creature after the N creatures repeatedly merge and ultimately become one creature.\n\nSample Input 1\n\n3\n3 1 4\n\nSample Output 1\n\n2\n\nThe possible colors of the last remaining creature are colors 1 and 3.\nFor example, when the creature of color 3 absorbs the creature of color 2, then the creature of color 1 absorbs the creature of color 3, the color of the last remaining creature will be color 1.\n\nSample Input 2\n\n5\n1 1 1 1 1\n\nSample Output 2\n\n5\n\nThere may be multiple creatures of the same size.\n\nSample Input 3\n\n6\n40 1 30 2 7 20\n\nSample Output 3\n\n4", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 447, "cpu_time_ms": 73, "memory_kb": 16768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s740172522", "group_id": "codeNet:p03795", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    Printf.printf \"%d\\n\" @@ (n * 800 - (n / 15) * 200)\n)", "language": "OCaml", "metadata": {"date": 1600400992, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p03795.html", "problem_id": "p03795", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03795/input.txt", "sample_output_relpath": "derived/input_output/data/p03795/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03795/OCaml/s740172522.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s740172522", "user_id": "u342443598"}, "prompt_components": {"gold_output": "15800\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    Printf.printf \"%d\\n\" @@ (n * 800 - (n / 15) * 200)\n)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a favorite restaurant.\n\nThe price of any meal served at the restaurant is 800 yen (the currency of Japan), and each time a customer orders 15 meals, the restaurant pays 200 yen back to the customer.\n\nSo far, Snuke has ordered N meals at the restaurant.\nLet the amount of money Snuke has paid to the restaurant be x yen, and let the amount of money the restaurant has paid back to Snuke be y yen.\nFind x-y.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n15800\n\nSo far, Snuke has paid 16000 yen, and the restaurant has paid back 200 yen. Thus, the answer is 15800.\n\nSample Input 2\n\n60\n\nSample Output 2\n\n47200\n\nSnuke has paid 48000 yen for 60 meals, and the restaurant has paid back 800 yen.", "sample_input": "20\n"}, "reference_outputs": ["15800\n"], "source_document_id": "p03795", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a favorite restaurant.\n\nThe price of any meal served at the restaurant is 800 yen (the currency of Japan), and each time a customer orders 15 meals, the restaurant pays 200 yen back to the customer.\n\nSo far, Snuke has ordered N meals at the restaurant.\nLet the amount of money Snuke has paid to the restaurant be x yen, and let the amount of money the restaurant has paid back to Snuke be y yen.\nFind x-y.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n15800\n\nSo far, Snuke has paid 16000 yen, and the restaurant has paid back 200 yen. Thus, the answer is 15800.\n\nSample Input 2\n\n60\n\nSample Output 2\n\n47200\n\nSnuke has paid 48000 yen for 60 meals, and the restaurant has paid back 800 yen.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 83, "cpu_time_ms": 10, "memory_kb": 3788}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s263101008", "group_id": "codeNet:p03795", "input_text": "let n = read_int ()\nlet _ = Printf.printf \"%d\\n\" @@ 800 * n - n / 15 * 200", "language": "OCaml", "metadata": {"date": 1565184351, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03795.html", "problem_id": "p03795", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03795/input.txt", "sample_output_relpath": "derived/input_output/data/p03795/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03795/OCaml/s263101008.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s263101008", "user_id": "u732304692"}, "prompt_components": {"gold_output": "15800\n", "input_to_evaluate": "let n = read_int ()\nlet _ = Printf.printf \"%d\\n\" @@ 800 * n - n / 15 * 200", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a favorite restaurant.\n\nThe price of any meal served at the restaurant is 800 yen (the currency of Japan), and each time a customer orders 15 meals, the restaurant pays 200 yen back to the customer.\n\nSo far, Snuke has ordered N meals at the restaurant.\nLet the amount of money Snuke has paid to the restaurant be x yen, and let the amount of money the restaurant has paid back to Snuke be y yen.\nFind x-y.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n15800\n\nSo far, Snuke has paid 16000 yen, and the restaurant has paid back 200 yen. Thus, the answer is 15800.\n\nSample Input 2\n\n60\n\nSample Output 2\n\n47200\n\nSnuke has paid 48000 yen for 60 meals, and the restaurant has paid back 800 yen.", "sample_input": "20\n"}, "reference_outputs": ["15800\n"], "source_document_id": "p03795", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a favorite restaurant.\n\nThe price of any meal served at the restaurant is 800 yen (the currency of Japan), and each time a customer orders 15 meals, the restaurant pays 200 yen back to the customer.\n\nSo far, Snuke has ordered N meals at the restaurant.\nLet the amount of money Snuke has paid to the restaurant be x yen, and let the amount of money the restaurant has paid back to Snuke be y yen.\nFind x-y.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n15800\n\nSo far, Snuke has paid 16000 yen, and the restaurant has paid back 200 yen. Thus, the answer is 15800.\n\nSample Input 2\n\n60\n\nSample Output 2\n\n47200\n\nSnuke has paid 48000 yen for 60 meals, and the restaurant has paid back 800 yen.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 74, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s437960930", "group_id": "codeNet:p03795", "input_text": "let () = Scanf.scanf \"%d\" @@ fun n ->\n  Printf.printf \"%d\\n\" @@ 800 * n - n / 15 * 200\n", "language": "OCaml", "metadata": {"date": 1530682974, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03795.html", "problem_id": "p03795", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03795/input.txt", "sample_output_relpath": "derived/input_output/data/p03795/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03795/OCaml/s437960930.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s437960930", "user_id": "u504158101"}, "prompt_components": {"gold_output": "15800\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\" @@ fun n ->\n  Printf.printf \"%d\\n\" @@ 800 * n - n / 15 * 200\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke has a favorite restaurant.\n\nThe price of any meal served at the restaurant is 800 yen (the currency of Japan), and each time a customer orders 15 meals, the restaurant pays 200 yen back to the customer.\n\nSo far, Snuke has ordered N meals at the restaurant.\nLet the amount of money Snuke has paid to the restaurant be x yen, and let the amount of money the restaurant has paid back to Snuke be y yen.\nFind x-y.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n15800\n\nSo far, Snuke has paid 16000 yen, and the restaurant has paid back 200 yen. Thus, the answer is 15800.\n\nSample Input 2\n\n60\n\nSample Output 2\n\n47200\n\nSnuke has paid 48000 yen for 60 meals, and the restaurant has paid back 800 yen.", "sample_input": "20\n"}, "reference_outputs": ["15800\n"], "source_document_id": "p03795", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke has a favorite restaurant.\n\nThe price of any meal served at the restaurant is 800 yen (the currency of Japan), and each time a customer orders 15 meals, the restaurant pays 200 yen back to the customer.\n\nSo far, Snuke has ordered N meals at the restaurant.\nLet the amount of money Snuke has paid to the restaurant be x yen, and let the amount of money the restaurant has paid back to Snuke be y yen.\nFind x-y.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n20\n\nSample Output 1\n\n15800\n\nSo far, Snuke has paid 16000 yen, and the restaurant has paid back 200 yen. Thus, the answer is 15800.\n\nSample Input 2\n\n60\n\nSample Output 2\n\n47200\n\nSnuke has paid 48000 yen for 60 meals, and the restaurant has paid back 800 yen.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 87, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s218048151", "group_id": "codeNet:p03796", "input_text": "let n = read_int () in\nlet p = ref 1 in\nfor i = 1 to n do\n  p := !p * i mod 1_000_000_007\ndone;\nPrintf.printf \"%d\\n\" !p", "language": "OCaml", "metadata": {"date": 1559533248, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s218048151.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s218048151", "user_id": "u732304692"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let n = read_int () in\nlet p = ref 1 in\nfor i = 1 to n do\n  p := !p * i mod 1_000_000_007\ndone;\nPrintf.printf \"%d\\n\" !p", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke loves working out. He is now exercising N times.\n\nBefore he starts exercising, his power is 1. After he exercises for the i-th time, his power gets multiplied by i.\n\nFind Snuke's power after he exercises N times. Since the answer can be extremely large, print the answer modulo 10^{9}+7.\n\nConstraints\n\n1 ≤ N ≤ 10^{5}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^{9}+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\nAfter Snuke exercises for the first time, his power gets multiplied by 1 and becomes 1.\n\nAfter Snuke exercises for the second time, his power gets multiplied by 2 and becomes 2.\n\nAfter Snuke exercises for the third time, his power gets multiplied by 3 and becomes 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n3628800\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n457992974\n\nPrint the answer modulo 10^{9}+7.", "sample_input": "3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03796", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke loves working out. He is now exercising N times.\n\nBefore he starts exercising, his power is 1. After he exercises for the i-th time, his power gets multiplied by i.\n\nFind Snuke's power after he exercises N times. Since the answer can be extremely large, print the answer modulo 10^{9}+7.\n\nConstraints\n\n1 ≤ N ≤ 10^{5}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^{9}+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\nAfter Snuke exercises for the first time, his power gets multiplied by 1 and becomes 1.\n\nAfter Snuke exercises for the second time, his power gets multiplied by 2 and becomes 2.\n\nAfter Snuke exercises for the third time, his power gets multiplied by 3 and becomes 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n3628800\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n457992974\n\nPrint the answer modulo 10^{9}+7.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 119, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s587987832", "group_id": "codeNet:p03796", "input_text": "let () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  \n  let rec fact n res =\n    if n=1 then res\n    else fact (n-1) ((n*res) mod 1000000007)\n  in\n  \n  Printf.printf \"%d\\n\" @@\n    (fact n 1)\n", "language": "OCaml", "metadata": {"date": 1528854967, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s587987832.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s587987832", "user_id": "u139013163"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  \n  let rec fact n res =\n    if n=1 then res\n    else fact (n-1) ((n*res) mod 1000000007)\n  in\n  \n  Printf.printf \"%d\\n\" @@\n    (fact n 1)\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke loves working out. He is now exercising N times.\n\nBefore he starts exercising, his power is 1. After he exercises for the i-th time, his power gets multiplied by i.\n\nFind Snuke's power after he exercises N times. Since the answer can be extremely large, print the answer modulo 10^{9}+7.\n\nConstraints\n\n1 ≤ N ≤ 10^{5}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^{9}+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\nAfter Snuke exercises for the first time, his power gets multiplied by 1 and becomes 1.\n\nAfter Snuke exercises for the second time, his power gets multiplied by 2 and becomes 2.\n\nAfter Snuke exercises for the third time, his power gets multiplied by 3 and becomes 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n3628800\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n457992974\n\nPrint the answer modulo 10^{9}+7.", "sample_input": "3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03796", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke loves working out. He is now exercising N times.\n\nBefore he starts exercising, his power is 1. After he exercises for the i-th time, his power gets multiplied by i.\n\nFind Snuke's power after he exercises N times. Since the answer can be extremely large, print the answer modulo 10^{9}+7.\n\nConstraints\n\n1 ≤ N ≤ 10^{5}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^{9}+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\nAfter Snuke exercises for the first time, his power gets multiplied by 1 and becomes 1.\n\nAfter Snuke exercises for the second time, his power gets multiplied by 2 and becomes 2.\n\nAfter Snuke exercises for the third time, his power gets multiplied by 3 and becomes 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n3628800\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n457992974\n\nPrint the answer modulo 10^{9}+7.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 193, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s306909131", "group_id": "codeNet:p03796", "input_text": "let f n =\n  let m = 1000000007 in\n  let rec aux i tmp =\n    if i >= n then tmp\n    else aux (succ i) ((tmp * (i + 1)) mod m)\n  in\n  aux 1 1\n\nlet () =\n  f @@ read_int () |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1526083863, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s306909131.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s306909131", "user_id": "u987869509"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "let f n =\n  let m = 1000000007 in\n  let rec aux i tmp =\n    if i >= n then tmp\n    else aux (succ i) ((tmp * (i + 1)) mod m)\n  in\n  aux 1 1\n\nlet () =\n  f @@ read_int () |> Printf.printf \"%d\\n\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke loves working out. He is now exercising N times.\n\nBefore he starts exercising, his power is 1. After he exercises for the i-th time, his power gets multiplied by i.\n\nFind Snuke's power after he exercises N times. Since the answer can be extremely large, print the answer modulo 10^{9}+7.\n\nConstraints\n\n1 ≤ N ≤ 10^{5}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^{9}+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\nAfter Snuke exercises for the first time, his power gets multiplied by 1 and becomes 1.\n\nAfter Snuke exercises for the second time, his power gets multiplied by 2 and becomes 2.\n\nAfter Snuke exercises for the third time, his power gets multiplied by 3 and becomes 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n3628800\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n457992974\n\nPrint the answer modulo 10^{9}+7.", "sample_input": "3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03796", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke loves working out. He is now exercising N times.\n\nBefore he starts exercising, his power is 1. After he exercises for the i-th time, his power gets multiplied by i.\n\nFind Snuke's power after he exercises N times. Since the answer can be extremely large, print the answer modulo 10^{9}+7.\n\nConstraints\n\n1 ≤ N ≤ 10^{5}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer modulo 10^{9}+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\nAfter Snuke exercises for the first time, his power gets multiplied by 1 and becomes 1.\n\nAfter Snuke exercises for the second time, his power gets multiplied by 2 and becomes 2.\n\nAfter Snuke exercises for the third time, his power gets multiplied by 3 and becomes 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n3628800\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n457992974\n\nPrint the answer modulo 10^{9}+7.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 192, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s937133619", "group_id": "codeNet:p03797", "input_text": "let get_2_ints () = Scanf.scanf \"%d %d \" (fun u v -> u,v)\n\nlet () =\n  let (n,m) = get_2_ints ()\n  in \n  let scc,c_left = n,m-n*2\n  in let s_new = c_left / 4\n  in\n  let scc = scc + s_new\n  in \n  scc |> string_of_int |> print_endline", "language": "OCaml", "metadata": {"date": 1530782125, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03797.html", "problem_id": "p03797", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03797/input.txt", "sample_output_relpath": "derived/input_output/data/p03797/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03797/OCaml/s937133619.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s937133619", "user_id": "u481480055"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let get_2_ints () = Scanf.scanf \"%d %d \" (fun u v -> u,v)\n\nlet () =\n  let (n,m) = get_2_ints ()\n  in \n  let scc,c_left = n,m-n*2\n  in let s_new = c_left / 4\n  in\n  let scc = scc + s_new\n  in \n  scc |> string_of_int |> print_endline", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke loves puzzles.\n\nToday, he is working on a puzzle using S- and c-shaped pieces.\nIn this puzzle, you can combine two c-shaped pieces into one S-shaped piece, as shown in the figure below:\n\nSnuke decided to create as many Scc groups as possible by putting together one S-shaped piece and two c-shaped pieces.\n\nFind the maximum number of Scc groups that can be created when Snuke has N S-shaped pieces and M c-shaped pieces.\n\nConstraints\n\n1 ≤ N,M ≤ 10^{12}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 6\n\nSample Output 1\n\n2\n\nTwo Scc groups can be created as follows:\n\nCombine two c-shaped pieces into one S-shaped piece\n\nCreate two Scc groups, each from one S-shaped piece and two c-shaped pieces\n\nSample Input 2\n\n12345 678901\n\nSample Output 2\n\n175897", "sample_input": "1 6\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03797", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke loves puzzles.\n\nToday, he is working on a puzzle using S- and c-shaped pieces.\nIn this puzzle, you can combine two c-shaped pieces into one S-shaped piece, as shown in the figure below:\n\nSnuke decided to create as many Scc groups as possible by putting together one S-shaped piece and two c-shaped pieces.\n\nFind the maximum number of Scc groups that can be created when Snuke has N S-shaped pieces and M c-shaped pieces.\n\nConstraints\n\n1 ≤ N,M ≤ 10^{12}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 6\n\nSample Output 1\n\n2\n\nTwo Scc groups can be created as follows:\n\nCombine two c-shaped pieces into one S-shaped piece\n\nCreate two Scc groups, each from one S-shaped piece and two c-shaped pieces\n\nSample Input 2\n\n12345 678901\n\nSample Output 2\n\n175897", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 231, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s411358605", "group_id": "codeNet:p03798", "input_text": "let first_some f =\n  List.fold_left (fun v e -> match v with None -> f e | _ -> v) None\n\nlet nb a b r =\n  let f b = if b then 1 else 0 in\n  [|'W';'S'|].((f (b = 'S') + f (r = 'o') + f (a = 'S')) mod 2)\n\nlet () =\n  Scanf.scanf \"%d %s\" @@ fun n s ->\n  [('S','S'); ('S','W'); ('W','S'); ('W','W')]\n  |> first_some (fun (h0, h1) ->\n      let h = Array.make n '0' in\n      h.(0) <- h0; h.(1) <- h1;\n\n      let t = String.init n (fun i ->\n        if i < 2 then h.(i)\n        else\n          let v = nb h.(i-2) h.(i-1) s.[i-1] in\n          h.(i) <- v; v)\n      in\n\n      if nb h.(n-2) h.(n-1) s.[n-1] = h.(0) && nb h.(n-1) h.(0) s.[0] = h.(1) then\n        Some t\n      else None)\n  |> (function Some x -> x | _ -> \"-1\") |> print_endline", "language": "OCaml", "metadata": {"date": 1531999140, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s411358605.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s411358605", "user_id": "u798181098"}, "prompt_components": {"gold_output": "SSSWWS\n", "input_to_evaluate": "let first_some f =\n  List.fold_left (fun v e -> match v with None -> f e | _ -> v) None\n\nlet nb a b r =\n  let f b = if b then 1 else 0 in\n  [|'W';'S'|].((f (b = 'S') + f (r = 'o') + f (a = 'S')) mod 2)\n\nlet () =\n  Scanf.scanf \"%d %s\" @@ fun n s ->\n  [('S','S'); ('S','W'); ('W','S'); ('W','W')]\n  |> first_some (fun (h0, h1) ->\n      let h = Array.make n '0' in\n      h.(0) <- h0; h.(1) <- h1;\n\n      let t = String.init n (fun i ->\n        if i < 2 then h.(i)\n        else\n          let v = nb h.(i-2) h.(i-1) s.[i-1] in\n          h.(i) <- v; v)\n      in\n\n      if nb h.(n-2) h.(n-1) s.[n-1] = h.(0) && nb h.(n-1) h.(0) s.[0] = h.(1) then\n        Some t\n      else None)\n  |> (function Some x -> x | _ -> \"-1\") |> print_endline", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 728, "cpu_time_ms": 12, "memory_kb": 6528}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s628778915", "group_id": "codeNet:p03798", "input_text": "open Printf\nlet input_int_array n =\n\tArray.init n (fun _ -> Scanf.scanf \" %d\" (fun v -> v))\n\nlet get_int () = Scanf.scanf \" %d\" (fun v -> v)\nlet get_2_ints () = Scanf.scanf \" %d %d\" (fun u v -> u,v)\nlet get_3_ints () = Scanf.scanf \" %d %d %d\" (fun u v w -> u,v,w)\nlet get_4_ints () = Scanf.scanf \" %d %d %d %d\" (fun u v w x -> u,v,w,x)\nlet get_5_ints () = Scanf.scanf \" %d %d %d %d %d\" (fun u v w x y -> u,v,w,x,y)\n\nlet () =\n\tlet n = get_int ()\n\tin let a = \n\t\tArray.init n (fun _ -> Scanf.scanf \" %c\" (fun v -> v))\n\tin let b = Array.make n 0\n\tin\n\tlet f,i,e = ref true,ref 0,[|0,0;0,1;1,1;1,0|] in\n\twhile !f && !i<4 do\n\t\tlet e0,e1 = e.(!i) in\n\t\tb.(0) <- e0; b.(1) <- e1;\n\t\tfor j=2 to n-1 do\n\t\t\tb.(j) <- match b.(j-1),a.(j-1) with\n\t\t\t\t| 0,'o' | 1,'x' -> b.(j-2)\n\t\t\t\t| 0,'x' | 1,'o' -> 1-b.(j-2)\n\t\t\t\t| _ -> failwith \"\"\n\t\tdone;\n\t\tf := not (\n\t\t\tb.(0) = (\n\t\t\t\tmatch b.(n-1),a.(n-1) with\n\t\t\t\t| 0,'o' | 1,'x' -> b.(n-2)\n\t\t\t\t| 0,'x' | 1,'o' -> 1-b.(n-2)\n\t\t\t\t| _ -> failwith \"\"\n\t\t\t)\n\t\t\t&&\n\t\t\tb.(1) = match b.(0),a.(0) with\n\t\t\t| 0,'o' | 1,'x' -> b.(n-1)\n\t\t\t| 0,'x' | 1,'o' -> 1-b.(n-1)\n\t\t\t| _ -> failwith \"\"\n\t\t);\n;\t\ti := !i+1;\n\tdone;\n\tif not !f then (\n\t\tArray.iter (fun v -> print_string @@ if v=0 then \"S\" else \"W\") b; print_newline ()\n\t) else printf \"-1\\n\"", "language": "OCaml", "metadata": {"date": 1531214237, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s628778915.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s628778915", "user_id": "u481480055"}, "prompt_components": {"gold_output": "SSSWWS\n", "input_to_evaluate": "open Printf\nlet input_int_array n =\n\tArray.init n (fun _ -> Scanf.scanf \" %d\" (fun v -> v))\n\nlet get_int () = Scanf.scanf \" %d\" (fun v -> v)\nlet get_2_ints () = Scanf.scanf \" %d %d\" (fun u v -> u,v)\nlet get_3_ints () = Scanf.scanf \" %d %d %d\" (fun u v w -> u,v,w)\nlet get_4_ints () = Scanf.scanf \" %d %d %d %d\" (fun u v w x -> u,v,w,x)\nlet get_5_ints () = Scanf.scanf \" %d %d %d %d %d\" (fun u v w x y -> u,v,w,x,y)\n\nlet () =\n\tlet n = get_int ()\n\tin let a = \n\t\tArray.init n (fun _ -> Scanf.scanf \" %c\" (fun v -> v))\n\tin let b = Array.make n 0\n\tin\n\tlet f,i,e = ref true,ref 0,[|0,0;0,1;1,1;1,0|] in\n\twhile !f && !i<4 do\n\t\tlet e0,e1 = e.(!i) in\n\t\tb.(0) <- e0; b.(1) <- e1;\n\t\tfor j=2 to n-1 do\n\t\t\tb.(j) <- match b.(j-1),a.(j-1) with\n\t\t\t\t| 0,'o' | 1,'x' -> b.(j-2)\n\t\t\t\t| 0,'x' | 1,'o' -> 1-b.(j-2)\n\t\t\t\t| _ -> failwith \"\"\n\t\tdone;\n\t\tf := not (\n\t\t\tb.(0) = (\n\t\t\t\tmatch b.(n-1),a.(n-1) with\n\t\t\t\t| 0,'o' | 1,'x' -> b.(n-2)\n\t\t\t\t| 0,'x' | 1,'o' -> 1-b.(n-2)\n\t\t\t\t| _ -> failwith \"\"\n\t\t\t)\n\t\t\t&&\n\t\t\tb.(1) = match b.(0),a.(0) with\n\t\t\t| 0,'o' | 1,'x' -> b.(n-1)\n\t\t\t| 0,'x' | 1,'o' -> 1-b.(n-1)\n\t\t\t| _ -> failwith \"\"\n\t\t);\n;\t\ti := !i+1;\n\tdone;\n\tif not !f then (\n\t\tArray.iter (fun v -> print_string @@ if v=0 then \"S\" else \"W\") b; print_newline ()\n\t) else printf \"-1\\n\"", "problem_context": "Score : 500 points\n\nProblem Statement\n\nSnuke, who loves animals, built a zoo.\n\nThere are N animals in this zoo. They are conveniently numbered 1 through N, and arranged in a circle.\nThe animal numbered i (2≤i≤N-1) is adjacent to the animals numbered i-1 and i+1. Also, the animal numbered 1 is adjacent to the animals numbered 2 and N, and the animal numbered N is adjacent to the animals numbered N-1 and 1.\n\nThere are two kinds of animals in this zoo: honest sheep that only speak the truth, and lying wolves that only tell lies.\n\nSnuke cannot tell the difference between these two species, and asked each animal the following question: \"Are your neighbors of the same species?\" The animal numbered i answered s_i. Here, if s_i is o, the animal said that the two neighboring animals are of the same species, and if s_i is x, the animal said that the two neighboring animals are of different species.\n\nMore formally, a sheep answered o if the two neighboring animals are both sheep or both wolves, and answered x otherwise.\nSimilarly, a wolf answered x if the two neighboring animals are both sheep or both wolves, and answered o otherwise.\n\nSnuke is wondering whether there is a valid assignment of species to the animals that is consistent with these responses. If there is such an assignment, show one such assignment. Otherwise, print -1.\n\nConstraints\n\n3 ≤ N ≤ 10^{5}\n\ns is a string of length N consisting of o and x.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\ns\n\nOutput\n\nIf there does not exist an valid assignment that is consistent with s, print -1.\nOtherwise, print an string t in the following format. The output is considered correct if the assignment described by t is consistent with s.\n\nt is a string of length N consisting of S and W.\n\nIf t_i is S, it indicates that the animal numbered i is a sheep. If t_i is W, it indicates that the animal numbered i is a wolf.\n\nSample Input 1\n\n6\nooxoox\n\nSample Output 1\n\nSSSWWS\n\nFor example, if the animals numbered 1, 2, 3, 4, 5 and 6 are respectively a sheep, sheep, sheep, wolf, wolf, and sheep, it is consistent with their responses. Besides, there is another valid assignment of species: a wolf, sheep, wolf, sheep, wolf and wolf.\n\nLet us remind you: if the neiboring animals are of the same species, a sheep answers o and a wolf answers x. If the neiboring animals are of different species, a sheep answers x and a wolf answers o.\n\nSample Input 2\n\n3\noox\n\nSample Output 2\n\n-1\n\nPrint -1 if there is no valid assignment of species.\n\nSample Input 3\n\n10\noxooxoxoox\n\nSample Output 3\n\nSSWWSSSWWS", "sample_input": "6\nooxoox\n"}, "reference_outputs": ["SSSWWS\n"], "source_document_id": "p03798", "source_text": "Score : 500 points\n\nProblem Statement\n\nSnuke, who loves animals, built a zoo.\n\nThere are N animals in this zoo. They are conveniently numbered 1 through N, and arranged in a circle.\nThe animal numbered i (2≤i≤N-1) is adjacent to the animals numbered i-1 and i+1. Also, the animal numbered 1 is adjacent to the animals numbered 2 and N, and the animal numbered N is adjacent to the animals numbered N-1 and 1.\n\nThere are two kinds of animals in this zoo: honest sheep that only speak the truth, and lying wolves that only tell lies.\n\nSnuke cannot tell the difference between these two species, and asked each animal the following question: \"Are your neighbors of the same species?\" The animal numbered i answered s_i. Here, if s_i is o, the animal said that the two neighboring animals are of the same species, and if s_i is x, the animal said that the two neighboring animals are of different species.\n\nMore formally, a sheep answered o if the two neighboring animals are both sheep or both wolves, and answered x otherwise.\nSimilarly, a wolf answered x if the two neighboring animals are both sheep or both wolves, and answered o otherwise.\n\nSnuke is wondering whether there is a valid assignment of species to the animals that is consistent with these responses. If there is such an assignment, show one such assignment. Otherwise, print -1.\n\nConstraints\n\n3 ≤ N ≤ 10^{5}\n\ns is a string of length N consisting of o and x.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\ns\n\nOutput\n\nIf there does not exist an valid assignment that is consistent with s, print -1.\nOtherwise, print an string t in the following format. The output is considered correct if the assignment described by t is consistent with s.\n\nt is a string of length N consisting of S and W.\n\nIf t_i is S, it indicates that the animal numbered i is a sheep. If t_i is W, it indicates that the animal numbered i is a wolf.\n\nSample Input 1\n\n6\nooxoox\n\nSample Output 1\n\nSSSWWS\n\nFor example, if the animals numbered 1, 2, 3, 4, 5 and 6 are respectively a sheep, sheep, sheep, wolf, wolf, and sheep, it is consistent with their responses. Besides, there is another valid assignment of species: a wolf, sheep, wolf, sheep, wolf and wolf.\n\nLet us remind you: if the neiboring animals are of the same species, a sheep answers o and a wolf answers x. If the neiboring animals are of different species, a sheep answers x and a wolf answers o.\n\nSample Input 2\n\n3\noox\n\nSample Output 2\n\n-1\n\nPrint -1 if there is no valid assignment of species.\n\nSample Input 3\n\n10\noxooxoxoox\n\nSample Output 3\n\nSSWWSSSWWS", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1247, "cpu_time_ms": 18, "memory_kb": 5888}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s751167572", "group_id": "codeNet:p03798", "input_text": "let string_to_list str =\n  let rec loop i limit =\n    if i = limit then []\n    else (String.get str i) :: (loop (i + 1) limit)\n  in\n  loop 0 (String.length str)\n\nlet fwd arr_length n = if n = (arr_length - 1) then 0 else n+1\nlet prev arr_length n = if n = 0 then arr_length - 1 else n-1\nlet flip c = if c = 'S' then 'W' else 'S'\nlet print_chars arr = Array.iter (fun x -> Printf.printf \"%c\" x) arr; Printf.printf \"\\n\"\n           \nlet fill arr arr_length n by =\n  arr.(fwd arr_length n) <- \n    if (arr.(n) == 'S' && by = 'o') || (arr.(n) == 'W' && by = 'x') then\n      arr.(prev arr_length n)\n    else\n      flip arr.(prev arr_length n)\n\nlet rec extend answers ans_length cursor ret = match answers with\n  | [] -> ret\n  | x::rest ->\n     fill ret ans_length cursor x;\n     extend rest ans_length (cursor+1) ret\n\nlet check arr arr_length by n =\n  if (arr.(n) == 'S' && by = 'o') || (arr.(n) == 'W' && by = 'x') then\n    arr.(fwd arr_length n) = arr.(prev arr_length n)\n  else\n    arr.(fwd arr_length n) <> arr.(prev arr_length n)\n\nlet make_list f t step =\n  let rec make_list_inner c t lst =\n    if c >= t then lst else make_list_inner (c+step) t (c::lst)\n  in\n  List.rev (make_list_inner f t [])\n\nlet check_all pos_ans length pairs =\n  let checks = List.map (fun (x,y) -> check pos_ans length y x) pairs in\n  List.fold_left (fun x y -> x && y) true checks\n\nlet array_make length a b =\n  let ret = (Array.make length a) in\n  ret.(length - 1) <- b;\n  ret\n\nlet solve str =\n  let str_list = (string_to_list str) in\n  let length = List.length str_list in\n  let pairs = List.combine (make_list 0 length 1) str_list in\n  let pos_ans = extend str_list length 0 (array_make length 'S' 'S') in\n  if check_all pos_ans length pairs then pos_ans else\n    let pos_ans = extend str_list length 0 (array_make length 'S' 'W') in\n    if check_all pos_ans length pairs then pos_ans else\n      let pos_ans = extend str_list length 0 (array_make length 'W' 'W') in\n      if check_all pos_ans length pairs then pos_ans else\n        let pos_ans = extend str_list length 0 (array_make length 'W' 'S') in\n        if check_all pos_ans length pairs then pos_ans else\n          [||]\n  \nlet () =\n  let _ = read_int() in\n  let str = read_line () in\n  let ans = solve str in\n  if ans = [||] then\n    Printf.printf (\"-1\")\n  else\n    Array.iter (fun x -> Printf.printf \"%c\" x) ans;\n  Printf.printf \"\\n\"\n;;\n", "language": "OCaml", "metadata": {"date": 1487476376, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s751167572.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s751167572", "user_id": "u980152513"}, "prompt_components": {"gold_output": "SSSWWS\n", "input_to_evaluate": "let string_to_list str =\n  let rec loop i limit =\n    if i = limit then []\n    else (String.get str i) :: (loop (i + 1) limit)\n  in\n  loop 0 (String.length str)\n\nlet fwd arr_length n = if n = (arr_length - 1) then 0 else n+1\nlet prev arr_length n = if n = 0 then arr_length - 1 else n-1\nlet flip c = if c = 'S' then 'W' else 'S'\nlet print_chars arr = Array.iter (fun x -> Printf.printf \"%c\" x) arr; Printf.printf \"\\n\"\n           \nlet fill arr arr_length n by =\n  arr.(fwd arr_length n) <- \n    if (arr.(n) == 'S' && by = 'o') || (arr.(n) == 'W' && by = 'x') then\n      arr.(prev arr_length n)\n    else\n      flip arr.(prev arr_length n)\n\nlet rec extend answers ans_length cursor ret = match answers with\n  | [] -> ret\n  | x::rest ->\n     fill ret ans_length cursor x;\n     extend rest ans_length (cursor+1) ret\n\nlet check arr arr_length by n =\n  if (arr.(n) == 'S' && by = 'o') || (arr.(n) == 'W' && by = 'x') then\n    arr.(fwd arr_length n) = arr.(prev arr_length n)\n  else\n    arr.(fwd arr_length n) <> arr.(prev arr_length n)\n\nlet make_list f t step =\n  let rec make_list_inner c t lst =\n    if c >= t then lst else make_list_inner (c+step) t (c::lst)\n  in\n  List.rev (make_list_inner f t [])\n\nlet check_all pos_ans length pairs =\n  let checks = List.map (fun (x,y) -> check pos_ans length y x) pairs in\n  List.fold_left (fun x y -> x && y) true checks\n\nlet array_make length a b =\n  let ret = (Array.make length a) in\n  ret.(length - 1) <- b;\n  ret\n\nlet solve str =\n  let str_list = (string_to_list str) in\n  let length = List.length str_list in\n  let pairs = List.combine (make_list 0 length 1) str_list in\n  let pos_ans = extend str_list length 0 (array_make length 'S' 'S') in\n  if check_all pos_ans length pairs then pos_ans else\n    let pos_ans = extend str_list length 0 (array_make length 'S' 'W') in\n    if check_all pos_ans length pairs then pos_ans else\n      let pos_ans = extend str_list length 0 (array_make length 'W' 'W') in\n      if check_all pos_ans length pairs then pos_ans else\n        let pos_ans = extend str_list length 0 (array_make length 'W' 'S') in\n        if check_all pos_ans length pairs then pos_ans else\n          [||]\n  \nlet () =\n  let _ = read_int() in\n  let str = read_line () in\n  let ans = solve str in\n  if ans = [||] then\n    Printf.printf (\"-1\")\n  else\n    Array.iter (fun x -> Printf.printf \"%c\" x) ans;\n  Printf.printf \"\\n\"\n;;\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nSnuke, who loves animals, built a zoo.\n\nThere are N animals in this zoo. They are conveniently numbered 1 through N, and arranged in a circle.\nThe animal numbered i (2≤i≤N-1) is adjacent to the animals numbered i-1 and i+1. Also, the animal numbered 1 is adjacent to the animals numbered 2 and N, and the animal numbered N is adjacent to the animals numbered N-1 and 1.\n\nThere are two kinds of animals in this zoo: honest sheep that only speak the truth, and lying wolves that only tell lies.\n\nSnuke cannot tell the difference between these two species, and asked each animal the following question: \"Are your neighbors of the same species?\" The animal numbered i answered s_i. Here, if s_i is o, the animal said that the two neighboring animals are of the same species, and if s_i is x, the animal said that the two neighboring animals are of different species.\n\nMore formally, a sheep answered o if the two neighboring animals are both sheep or both wolves, and answered x otherwise.\nSimilarly, a wolf answered x if the two neighboring animals are both sheep or both wolves, and answered o otherwise.\n\nSnuke is wondering whether there is a valid assignment of species to the animals that is consistent with these responses. If there is such an assignment, show one such assignment. Otherwise, print -1.\n\nConstraints\n\n3 ≤ N ≤ 10^{5}\n\ns is a string of length N consisting of o and x.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\ns\n\nOutput\n\nIf there does not exist an valid assignment that is consistent with s, print -1.\nOtherwise, print an string t in the following format. The output is considered correct if the assignment described by t is consistent with s.\n\nt is a string of length N consisting of S and W.\n\nIf t_i is S, it indicates that the animal numbered i is a sheep. If t_i is W, it indicates that the animal numbered i is a wolf.\n\nSample Input 1\n\n6\nooxoox\n\nSample Output 1\n\nSSSWWS\n\nFor example, if the animals numbered 1, 2, 3, 4, 5 and 6 are respectively a sheep, sheep, sheep, wolf, wolf, and sheep, it is consistent with their responses. Besides, there is another valid assignment of species: a wolf, sheep, wolf, sheep, wolf and wolf.\n\nLet us remind you: if the neiboring animals are of the same species, a sheep answers o and a wolf answers x. If the neiboring animals are of different species, a sheep answers x and a wolf answers o.\n\nSample Input 2\n\n3\noox\n\nSample Output 2\n\n-1\n\nPrint -1 if there is no valid assignment of species.\n\nSample Input 3\n\n10\noxooxoxoox\n\nSample Output 3\n\nSSWWSSSWWS", "sample_input": "6\nooxoox\n"}, "reference_outputs": ["SSSWWS\n"], "source_document_id": "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2373, "cpu_time_ms": 68, "memory_kb": 24960}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s192338208", "group_id": "codeNet:p03798", "input_text": "let string_to_list str =\n  let rec loop i limit =\n    if i = limit then []\n    else (String.get str i) :: (loop (i + 1) limit)\n  in\n  loop 0 (String.length str)\n\n\nlet fwd arr_length n = if n = (arr_length - 1) then 0 else n+1\nlet prev arr_length n = if n = 0 then arr_length - 1 else n-1\nlet flip c = if c = 'S' then 'W' else 'S'\nlet print_chars arr = Array.iter (fun x -> Printf.printf \"%c\" x) arr; Printf.printf \"\\n\"\n           \nlet fill arr arr_length n by =\n  if (arr.(n) == 'S' && by = 'o') || (arr.(n) == 'W' && by = 'x') then\n    begin\n      arr.(fwd arr_length n) <- arr.(prev arr_length n);\n    end\n  else\n    begin\n      arr.(fwd arr_length n) <- flip arr.(prev arr_length n);\n    end    \n\nlet rec extend answers ans_length cursor ret = match answers with\n  | [] -> ret\n  | 'o'::rest ->\n     fill ret ans_length cursor 'o';\n     extend rest ans_length (cursor+1) ret\n  | 'x'::rest ->\n     fill ret ans_length cursor 'x';\n     extend rest ans_length (cursor+1) ret\n  | _ -> ret\n\nlet check arr arr_length by n =\n  if (arr.(n) == 'S' && by = 'o') || (arr.(n) == 'W' && by = 'x') then\n    arr.(fwd arr_length n) = arr.(prev arr_length n)\n  else\n    arr.(fwd arr_length n) <> arr.(prev arr_length n)\n\nlet make_list f t step =\n  let rec make_list_inner c t lst =\n    if c >= t then lst else make_list_inner (c+step) t (c::lst)\n  in\n  List.rev (make_list_inner f t [])\n\nlet check_all pos_ans length pairs =\n  let checks = List.map (fun (x,y) -> check pos_ans length y x) pairs in\n  List.fold_left (fun x y -> x && y) true checks\n\nlet array_make length a b =\n  let ret = (Array.make length a) in\n  ret.(1) <- b;\n  ret\n\nlet solve str =\n  let str_list = (string_to_list str) in\n  let length = List.length str_list in\n  let pairs = List.combine (make_list 0 length 1) str_list in\n  let pos_ans = extend str_list length 0 (array_make length 'S' 'S') in\n  if check_all pos_ans length pairs then pos_ans else\n    let pos_ans = extend str_list length 0 (array_make length 'S' 'W') in\n    if check_all pos_ans length pairs then pos_ans else\n      let pos_ans = extend str_list length 0 (array_make length 'W' 'W') in\n      if check_all pos_ans length pairs then pos_ans else\n        let pos_ans = extend str_list length 0 (array_make length 'W' 'S') in\n        if check_all pos_ans length pairs then pos_ans else\n          [||]\n  \nlet () =\n  let _ = read_int() in\n  let str = read_line () in\n  let ans = solve str in\n  if ans = [||] then\n    Printf.printf (\"-1\")\n  else\n    Array.iter (fun x -> Printf.printf \"%c\" x) ans;\n  Printf.printf \"\\n\"\n;;\n", "language": "OCaml", "metadata": {"date": 1487475870, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s192338208.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s192338208", "user_id": "u980152513"}, "prompt_components": {"gold_output": "SSSWWS\n", "input_to_evaluate": "let string_to_list str =\n  let rec loop i limit =\n    if i = limit then []\n    else (String.get str i) :: (loop (i + 1) limit)\n  in\n  loop 0 (String.length str)\n\n\nlet fwd arr_length n = if n = (arr_length - 1) then 0 else n+1\nlet prev arr_length n = if n = 0 then arr_length - 1 else n-1\nlet flip c = if c = 'S' then 'W' else 'S'\nlet print_chars arr = Array.iter (fun x -> Printf.printf \"%c\" x) arr; Printf.printf \"\\n\"\n           \nlet fill arr arr_length n by =\n  if (arr.(n) == 'S' && by = 'o') || (arr.(n) == 'W' && by = 'x') then\n    begin\n      arr.(fwd arr_length n) <- arr.(prev arr_length n);\n    end\n  else\n    begin\n      arr.(fwd arr_length n) <- flip arr.(prev arr_length n);\n    end    \n\nlet rec extend answers ans_length cursor ret = match answers with\n  | [] -> ret\n  | 'o'::rest ->\n     fill ret ans_length cursor 'o';\n     extend rest ans_length (cursor+1) ret\n  | 'x'::rest ->\n     fill ret ans_length cursor 'x';\n     extend rest ans_length (cursor+1) ret\n  | _ -> ret\n\nlet check arr arr_length by n =\n  if (arr.(n) == 'S' && by = 'o') || (arr.(n) == 'W' && by = 'x') then\n    arr.(fwd arr_length n) = arr.(prev arr_length n)\n  else\n    arr.(fwd arr_length n) <> arr.(prev arr_length n)\n\nlet make_list f t step =\n  let rec make_list_inner c t lst =\n    if c >= t then lst else make_list_inner (c+step) t (c::lst)\n  in\n  List.rev (make_list_inner f t [])\n\nlet check_all pos_ans length pairs =\n  let checks = List.map (fun (x,y) -> check pos_ans length y x) pairs in\n  List.fold_left (fun x y -> x && y) true checks\n\nlet array_make length a b =\n  let ret = (Array.make length a) in\n  ret.(1) <- b;\n  ret\n\nlet solve str =\n  let str_list = (string_to_list str) in\n  let length = List.length str_list in\n  let pairs = List.combine (make_list 0 length 1) str_list in\n  let pos_ans = extend str_list length 0 (array_make length 'S' 'S') in\n  if check_all pos_ans length pairs then pos_ans else\n    let pos_ans = extend str_list length 0 (array_make length 'S' 'W') in\n    if check_all pos_ans length pairs then pos_ans else\n      let pos_ans = extend str_list length 0 (array_make length 'W' 'W') in\n      if check_all pos_ans length pairs then pos_ans else\n        let pos_ans = extend str_list length 0 (array_make length 'W' 'S') in\n        if check_all pos_ans length pairs then pos_ans else\n          [||]\n  \nlet () =\n  let _ = read_int() in\n  let str = read_line () in\n  let ans = solve str in\n  if ans = [||] then\n    Printf.printf (\"-1\")\n  else\n    Array.iter (fun x -> Printf.printf \"%c\" x) ans;\n  Printf.printf \"\\n\"\n;;\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nSnuke, who loves animals, built a zoo.\n\nThere are N animals in this zoo. They are conveniently numbered 1 through N, and arranged in a circle.\nThe animal numbered i (2≤i≤N-1) is adjacent to the animals numbered i-1 and i+1. Also, the animal numbered 1 is adjacent to the animals numbered 2 and N, and the animal numbered N is adjacent to the animals numbered N-1 and 1.\n\nThere are two kinds of animals in this zoo: honest sheep that only speak the truth, and lying wolves that only tell lies.\n\nSnuke cannot tell the difference between these two species, and asked each animal the following question: \"Are your neighbors of the same species?\" The animal numbered i answered s_i. Here, if s_i is o, the animal said that the two neighboring animals are of the same species, and if s_i is x, the animal said that the two neighboring animals are of different species.\n\nMore formally, a sheep answered o if the two neighboring animals are both sheep or both wolves, and answered x otherwise.\nSimilarly, a wolf answered x if the two neighboring animals are both sheep or both wolves, and answered o otherwise.\n\nSnuke is wondering whether there is a valid assignment of species to the animals that is consistent with these responses. If there is such an assignment, show one such assignment. Otherwise, print -1.\n\nConstraints\n\n3 ≤ N ≤ 10^{5}\n\ns is a string of length N consisting of o and x.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\ns\n\nOutput\n\nIf there does not exist an valid assignment that is consistent with s, print -1.\nOtherwise, print an string t in the following format. The output is considered correct if the assignment described by t is consistent with s.\n\nt is a string of length N consisting of S and W.\n\nIf t_i is S, it indicates that the animal numbered i is a sheep. If t_i is W, it indicates that the animal numbered i is a wolf.\n\nSample Input 1\n\n6\nooxoox\n\nSample Output 1\n\nSSSWWS\n\nFor example, if the animals numbered 1, 2, 3, 4, 5 and 6 are respectively a sheep, sheep, sheep, wolf, wolf, and sheep, it is consistent with their responses. Besides, there is another valid assignment of species: a wolf, sheep, wolf, sheep, wolf and wolf.\n\nLet us remind you: if the neiboring animals are of the same species, a sheep answers o and a wolf answers x. If the neiboring animals are of different species, a sheep answers x and a wolf answers o.\n\nSample Input 2\n\n3\noox\n\nSample Output 2\n\n-1\n\nPrint -1 if there is no valid assignment of species.\n\nSample Input 3\n\n10\noxooxoxoox\n\nSample Output 3\n\nSSWWSSSWWS", "sample_input": "6\nooxoox\n"}, "reference_outputs": ["SSSWWS\n"], "source_document_id": "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2540, "cpu_time_ms": 66, "memory_kb": 24832}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s530702857", "group_id": "codeNet:p03798", "input_text": "let string_to_list str =\n  let rec loop i limit =\n    if i = limit then []\n    else (String.get str i) :: (loop (i + 1) limit)\n  in\n  loop 0 (String.length str)\n\n\nlet fwd arr_length n = if n = (arr_length - 1) then 0 else n+1\nlet prev arr_length n = if n = 0 then arr_length - 1 else n-1\nlet flip c = if c = 'S' then 'W' else 'S'\nlet print_chars arr = Array.iter (fun x -> Printf.printf \"%c\" x) arr; Printf.printf \"\\n\"\n           \nlet fill arr arr_length n by =\n  if (arr.(n) == 'S' && by = 'o') || (arr.(n) == 'W' && by = 'x') then\n    begin\n      arr.(fwd arr_length n) <- arr.(prev arr_length n);\n    end\n  else\n    begin\n      arr.(fwd arr_length n) <- flip arr.(prev arr_length n);\n    end    \n\nlet rec extend answers ans_length cursor ret = match answers with\n  | [] -> ret\n  | 'o'::rest ->\n     fill ret ans_length cursor 'o';\n     extend rest ans_length (cursor+1) ret\n  | 'x'::rest ->\n     fill ret ans_length cursor 'x';\n     extend rest ans_length (cursor+1) ret\n  | _ -> ret\n\nlet check arr arr_length by =\n  let n = arr_length - 1 in\n  if (arr.(n) == 'S' && by = 'o') || (arr.(n) == 'W' && by = 'x') then\n    arr.(0) = arr.(n-2)\n  else\n    arr.(0) <> arr.(n-2)\n\nlet solve str =\n  let str_list = (string_to_list str) in\n  let length = List.length str_list in\n  let pos_ans = extend str_list length 0 (Array.make length 'S') in\n  if check pos_ans length (List.hd @@ List.rev str_list) then pos_ans else\n    let pos_ans = extend str_list length 0 (Array.make length 'S') in\n    if check pos_ans length (List.hd @@ List.rev str_list) then pos_ans else\n      [||]\n  \nlet () =\n  let _ = read_int() in\n  let str = read_line () in\n  let ans = solve str in\n  if ans = [||] then\n    Printf.printf (\"-1\")\n  else\n    Array.iter (fun x -> Printf.printf \"%c\" x) ans;\n  Printf.printf \"\\n\"\n;;\n", "language": "OCaml", "metadata": {"date": 1487474346, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s530702857.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s530702857", "user_id": "u980152513"}, "prompt_components": {"gold_output": "SSSWWS\n", "input_to_evaluate": "let string_to_list str =\n  let rec loop i limit =\n    if i = limit then []\n    else (String.get str i) :: (loop (i + 1) limit)\n  in\n  loop 0 (String.length str)\n\n\nlet fwd arr_length n = if n = (arr_length - 1) then 0 else n+1\nlet prev arr_length n = if n = 0 then arr_length - 1 else n-1\nlet flip c = if c = 'S' then 'W' else 'S'\nlet print_chars arr = Array.iter (fun x -> Printf.printf \"%c\" x) arr; Printf.printf \"\\n\"\n           \nlet fill arr arr_length n by =\n  if (arr.(n) == 'S' && by = 'o') || (arr.(n) == 'W' && by = 'x') then\n    begin\n      arr.(fwd arr_length n) <- arr.(prev arr_length n);\n    end\n  else\n    begin\n      arr.(fwd arr_length n) <- flip arr.(prev arr_length n);\n    end    \n\nlet rec extend answers ans_length cursor ret = match answers with\n  | [] -> ret\n  | 'o'::rest ->\n     fill ret ans_length cursor 'o';\n     extend rest ans_length (cursor+1) ret\n  | 'x'::rest ->\n     fill ret ans_length cursor 'x';\n     extend rest ans_length (cursor+1) ret\n  | _ -> ret\n\nlet check arr arr_length by =\n  let n = arr_length - 1 in\n  if (arr.(n) == 'S' && by = 'o') || (arr.(n) == 'W' && by = 'x') then\n    arr.(0) = arr.(n-2)\n  else\n    arr.(0) <> arr.(n-2)\n\nlet solve str =\n  let str_list = (string_to_list str) in\n  let length = List.length str_list in\n  let pos_ans = extend str_list length 0 (Array.make length 'S') in\n  if check pos_ans length (List.hd @@ List.rev str_list) then pos_ans else\n    let pos_ans = extend str_list length 0 (Array.make length 'S') in\n    if check pos_ans length (List.hd @@ List.rev str_list) then pos_ans else\n      [||]\n  \nlet () =\n  let _ = read_int() in\n  let str = read_line () in\n  let ans = solve str in\n  if ans = [||] then\n    Printf.printf (\"-1\")\n  else\n    Array.iter (fun x -> Printf.printf \"%c\" x) ans;\n  Printf.printf \"\\n\"\n;;\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nSnuke, who loves animals, built a zoo.\n\nThere are N animals in this zoo. They are conveniently numbered 1 through N, and arranged in a circle.\nThe animal numbered i (2≤i≤N-1) is adjacent to the animals numbered i-1 and i+1. Also, the animal numbered 1 is adjacent to the animals numbered 2 and N, and the animal numbered N is adjacent to the animals numbered N-1 and 1.\n\nThere are two kinds of animals in this zoo: honest sheep that only speak the truth, and lying wolves that only tell lies.\n\nSnuke cannot tell the difference between these two species, and asked each animal the following question: \"Are your neighbors of the same species?\" The animal numbered i answered s_i. Here, if s_i is o, the animal said that the two neighboring animals are of the same species, and if s_i is x, the animal said that the two neighboring animals are of different species.\n\nMore formally, a sheep answered o if the two neighboring animals are both sheep or both wolves, and answered x otherwise.\nSimilarly, a wolf answered x if the two neighboring animals are both sheep or both wolves, and answered o otherwise.\n\nSnuke is wondering whether there is a valid assignment of species to the animals that is consistent with these responses. If there is such an assignment, show one such assignment. Otherwise, print -1.\n\nConstraints\n\n3 ≤ N ≤ 10^{5}\n\ns is a string of length N consisting of o and x.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\ns\n\nOutput\n\nIf there does not exist an valid assignment that is consistent with s, print -1.\nOtherwise, print an string t in the following format. The output is considered correct if the assignment described by t is consistent with s.\n\nt is a string of length N consisting of S and W.\n\nIf t_i is S, it indicates that the animal numbered i is a sheep. If t_i is W, it indicates that the animal numbered i is a wolf.\n\nSample Input 1\n\n6\nooxoox\n\nSample Output 1\n\nSSSWWS\n\nFor example, if the animals numbered 1, 2, 3, 4, 5 and 6 are respectively a sheep, sheep, sheep, wolf, wolf, and sheep, it is consistent with their responses. Besides, there is another valid assignment of species: a wolf, sheep, wolf, sheep, wolf and wolf.\n\nLet us remind you: if the neiboring animals are of the same species, a sheep answers o and a wolf answers x. If the neiboring animals are of different species, a sheep answers x and a wolf answers o.\n\nSample Input 2\n\n3\noox\n\nSample Output 2\n\n-1\n\nPrint -1 if there is no valid assignment of species.\n\nSample Input 3\n\n10\noxooxoxoox\n\nSample Output 3\n\nSSWWSSSWWS", "sample_input": "6\nooxoox\n"}, "reference_outputs": ["SSSWWS\n"], "source_document_id": "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1789, "cpu_time_ms": 19, "memory_kb": 13056}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s962267410", "group_id": "codeNet:p03804", "input_text": "(* unihernandez22\n * https://atcoder.jp/contests/abc054/tasks/abc054_b\n * implementation\n * *)\n\nScanf.scanf \"%d %d\\n\" @@ fun n m ->\n    let a = Array.init n @@ fun _ -> String.trim @@ read_line() in\n    let b = Array.init m @@ fun _ -> String.trim @@ read_line() in\n\n    let valid = ref true in\n    let ans = ref \"No\\n\" in\n    for i = 0 to n-m do\n        for j = 0 to n-m do\n            valid := true;\n            for y = 0 to m-1 do\n                if not (String.sub a.(i+y) j m = b.(y)) then\n                    valid := false;\n            done;\n            if !valid then\n                ans := \"Yes\\n\";\n        done;\n    done;\n    print_string !ans;;\n\n", "language": "OCaml", "metadata": {"date": 1593839634, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s962267410.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s962267410", "user_id": "u878654696"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(* unihernandez22\n * https://atcoder.jp/contests/abc054/tasks/abc054_b\n * implementation\n * *)\n\nScanf.scanf \"%d %d\\n\" @@ fun n m ->\n    let a = Array.init n @@ fun _ -> String.trim @@ read_line() in\n    let b = Array.init m @@ fun _ -> String.trim @@ read_line() in\n\n    let valid = ref true in\n    let ans = ref \"No\\n\" in\n    for i = 0 to n-m do\n        for j = 0 to n-m do\n            valid := true;\n            for y = 0 to m-1 do\n                if not (String.sub a.(i+y) j m = b.(y)) then\n                    valid := false;\n            done;\n            if !valid then\n                ans := \"Yes\\n\";\n        done;\n    done;\n    print_string !ans;;\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an image A composed of N rows and N columns of pixels, and a template image B composed of M rows and M columns of pixels.\n\nA pixel is the smallest element of an image, and in this problem it is a square of size 1×1.\n\nAlso, the given images are binary images, and the color of each pixel is either white or black.\n\nIn the input, every pixel is represented by a character: . corresponds to a white pixel, and # corresponds to a black pixel.\n\nThe image A is given as N strings A_1,...,A_N.\n\nThe j-th character in the string A_i corresponds to the pixel at the i-th row and j-th column of the image A (1≦i,j≦N).\n\nSimilarly, the template image B is given as M strings B_1,...,B_M.\n\nThe j-th character in the string B_i corresponds to the pixel at the i-th row and j-th column of the template image B (1≦i,j≦M).\n\nDetermine whether the template image B is contained in the image A when only parallel shifts can be applied to the images.\n\nConstraints\n\n1≦M≦N≦50\n\nA_i is a string of length N consisting of # and ..\n\nB_i is a string of length M consisting of # and ..\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nA_1\nA_2\n:\nA_N\nB_1\nB_2\n:\nB_M\n\nOutput\n\nPrint Yes if the template image B is contained in the image A. Print No otherwise.\n\nSample Input 1\n\n3 2\n#.#\n.#.\n#.#\n#.\n.#\n\nSample Output 1\n\nYes\n\nThe template image B is identical to the upper-left 2 × 2 subimage and the lower-right 2 × 2 subimage of A. Thus, the output should be Yes.\n\nSample Input 2\n\n4 1\n....\n....\n....\n....\n#\n\nSample Output 2\n\nNo\n\nThe template image B, composed of a black pixel, is not contained in the image A composed of white pixels.", "sample_input": "3 2\n#.#\n.#.\n#.#\n#.\n.#\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03804", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an image A composed of N rows and N columns of pixels, and a template image B composed of M rows and M columns of pixels.\n\nA pixel is the smallest element of an image, and in this problem it is a square of size 1×1.\n\nAlso, the given images are binary images, and the color of each pixel is either white or black.\n\nIn the input, every pixel is represented by a character: . corresponds to a white pixel, and # corresponds to a black pixel.\n\nThe image A is given as N strings A_1,...,A_N.\n\nThe j-th character in the string A_i corresponds to the pixel at the i-th row and j-th column of the image A (1≦i,j≦N).\n\nSimilarly, the template image B is given as M strings B_1,...,B_M.\n\nThe j-th character in the string B_i corresponds to the pixel at the i-th row and j-th column of the template image B (1≦i,j≦M).\n\nDetermine whether the template image B is contained in the image A when only parallel shifts can be applied to the images.\n\nConstraints\n\n1≦M≦N≦50\n\nA_i is a string of length N consisting of # and ..\n\nB_i is a string of length M consisting of # and ..\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nA_1\nA_2\n:\nA_N\nB_1\nB_2\n:\nB_M\n\nOutput\n\nPrint Yes if the template image B is contained in the image A. Print No otherwise.\n\nSample Input 1\n\n3 2\n#.#\n.#.\n#.#\n#.\n.#\n\nSample Output 1\n\nYes\n\nThe template image B is identical to the upper-left 2 × 2 subimage and the lower-right 2 × 2 subimage of A. Thus, the output should be Yes.\n\nSample Input 2\n\n4 1\n....\n....\n....\n....\n#\n\nSample Output 2\n\nNo\n\nThe template image B, composed of a black pixel, is not contained in the image A composed of white pixels.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 657, "cpu_time_ms": 3, "memory_kb": 3704}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s943491153", "group_id": "codeNet:p03804", "input_text": "let n, m = Scanf.scanf \"%d %d\\n\" (fun n m -> n, m)\nlet a = Array.init n (fun i -> read_line ())\nlet b = Array.init m (fun i -> read_line ())\n\nlet c = n - m + 1\n\nlet rec ans i j k l =\n  if i = c then \"No\"\n  else if j = c then ans (i + 1) 0 0 0\n  else if k = m then \"Yes\"\n  else if l = m then ans i j (k + 1) 0\n  else if a.(i + k).[j + l] <> b.(k).[l] then ans i (j + 1) 0 0\n  else ans i j k (l + 1)\n\nlet () = print_endline (ans 0 0 0 0)", "language": "OCaml", "metadata": {"date": 1585632280, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s943491153.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s943491153", "user_id": "u752907799"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let n, m = Scanf.scanf \"%d %d\\n\" (fun n m -> n, m)\nlet a = Array.init n (fun i -> read_line ())\nlet b = Array.init m (fun i -> read_line ())\n\nlet c = n - m + 1\n\nlet rec ans i j k l =\n  if i = c then \"No\"\n  else if j = c then ans (i + 1) 0 0 0\n  else if k = m then \"Yes\"\n  else if l = m then ans i j (k + 1) 0\n  else if a.(i + k).[j + l] <> b.(k).[l] then ans i (j + 1) 0 0\n  else ans i j k (l + 1)\n\nlet () = print_endline (ans 0 0 0 0)", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s430742850", "group_id": "codeNet:p03805", "input_text": "let scan_words () = Scanf.scanf \"%d %d\\n\" (fun a b -> (a, b))\nmodule Is = Set.Make (struct type t = int let compare = compare end)\nlet h = Hashtbl.create 8\nlet n, m = scan_words ()\n\nlet rec solve now set =\n  if Is.mem now set then 0\n  else if Is.cardinal set = (n - 1) then 1\n  else match Hashtbl.find_all h now with\n    | [] -> 0\n    | ls ->\n      List.fold_left (fun acc pos -> acc + solve pos (Is.add now set)) 0 ls\n\nlet () =\n  for i = 1 to m do\n    let a, b = scan_words () in\n    Hashtbl.add h a b ; Hashtbl.add h b a\n  done ;\n  Printf.printf \"%d\\n\" (solve 1 Is.empty)", "language": "OCaml", "metadata": {"date": 1526379247, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03805.html", "problem_id": "p03805", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03805/input.txt", "sample_output_relpath": "derived/input_output/data/p03805/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03805/OCaml/s430742850.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s430742850", "user_id": "u987869509"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let scan_words () = Scanf.scanf \"%d %d\\n\" (fun a b -> (a, b))\nmodule Is = Set.Make (struct type t = int let compare = compare end)\nlet h = Hashtbl.create 8\nlet n, m = scan_words ()\n\nlet rec solve now set =\n  if Is.mem now set then 0\n  else if Is.cardinal set = (n - 1) then 1\n  else match Hashtbl.find_all h now with\n    | [] -> 0\n    | ls ->\n      List.fold_left (fun acc pos -> acc + solve pos (Is.add now set)) 0 ls\n\nlet () =\n  for i = 1 to m do\n    let a, b = scan_words () in\n    Hashtbl.add h a b ; Hashtbl.add h b a\n  done ;\n  Printf.printf \"%d\\n\" (solve 1 Is.empty)", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an undirected unweighted graph with N vertices and M edges that contains neither self-loops nor double edges.\n\nHere, a self-loop is an edge where a_i = b_i (1≤i≤M), and double edges are two edges where (a_i,b_i)=(a_j,b_j) or (a_i,b_i)=(b_j,a_j) (1≤i<j≤M).\n\nHow many different paths start from vertex 1 and visit all the vertices exactly once?\n\nHere, the endpoints of a path are considered visited.\n\nFor example, let us assume that the following undirected graph shown in Figure 1 is given.\n\nFigure 1: an example of an undirected graph\n\nThe following path shown in Figure 2 satisfies the condition.\n\nFigure 2: an example of a path that satisfies the condition\n\nHowever, the following path shown in Figure 3 does not satisfy the condition, because it does not visit all the vertices.\n\nFigure 3: an example of a path that does not satisfy the condition\n\nNeither the following path shown in Figure 4, because it does not start from vertex 1.\n\nFigure 4: another example of a path that does not satisfy the condition\n\nConstraints\n\n2≦N≦8\n\n0≦M≦N(N-1)/2\n\n1≦a_i<b_i≦N\n\nThe given graph contains neither self-loops nor double edges.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nOutput\n\nPrint the number of the different paths that start from vertex 1 and visit all the vertices exactly once.\n\nSample Input 1\n\n3 3\n1 2\n1 3\n2 3\n\nSample Output 1\n\n2\n\nThe given graph is shown in the following figure:\n\nThe following two paths satisfy the condition:\n\nSample Input 2\n\n7 7\n1 3\n2 7\n3 4\n4 5\n4 6\n5 6\n6 7\n\nSample Output 2\n\n1\n\nThis test case is the same as the one described in the problem statement.", "sample_input": "3 3\n1 2\n1 3\n2 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03805", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an undirected unweighted graph with N vertices and M edges that contains neither self-loops nor double edges.\n\nHere, a self-loop is an edge where a_i = b_i (1≤i≤M), and double edges are two edges where (a_i,b_i)=(a_j,b_j) or (a_i,b_i)=(b_j,a_j) (1≤i<j≤M).\n\nHow many different paths start from vertex 1 and visit all the vertices exactly once?\n\nHere, the endpoints of a path are considered visited.\n\nFor example, let us assume that the following undirected graph shown in Figure 1 is given.\n\nFigure 1: an example of an undirected graph\n\nThe following path shown in Figure 2 satisfies the condition.\n\nFigure 2: an example of a path that satisfies the condition\n\nHowever, the following path shown in Figure 3 does not satisfy the condition, because it does not visit all the vertices.\n\nFigure 3: an example of a path that does not satisfy the condition\n\nNeither the following path shown in Figure 4, because it does not start from vertex 1.\n\nFigure 4: another example of a path that does not satisfy the condition\n\nConstraints\n\n2≦N≦8\n\n0≦M≦N(N-1)/2\n\n1≦a_i<b_i≦N\n\nThe given graph contains neither self-loops nor double edges.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\na_1 b_1\na_2 b_2\n:\na_M b_M\n\nOutput\n\nPrint the number of the different paths that start from vertex 1 and visit all the vertices exactly once.\n\nSample Input 1\n\n3 3\n1 2\n1 3\n2 3\n\nSample Output 1\n\n2\n\nThe given graph is shown in the following figure:\n\nThe following two paths satisfy the condition:\n\nSample Input 2\n\n7 7\n1 3\n2 7\n3 4\n4 5\n4 6\n5 6\n6 7\n\nSample Output 2\n\n1\n\nThis test case is the same as the one described in the problem statement.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 573, "cpu_time_ms": 11, "memory_kb": 2560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s004681104", "group_id": "codeNet:p03806", "input_text": "Scanf.scanf \"%d %d %d\" (fun n ma mb ->\n    let module M = Map.Make (struct type t = int * int let compare = compare end) in\n    let map =\n        let rec loop i map =\n            if i = n then map else\n                let map =\n                    Scanf.scanf \" %d %d %d\" (fun a b c ->\n                        M.fold (fun (ka, kb) v next ->\n                            let key = (ka + a, kb + b) in\n                            M.add key (min (v + c) (try M.find key next with _ -> max_int)) next\n                        ) map map\n                    )\n                in\n                loop (i + 1) map\n        in\n        loop 0 (M.add (0, 0) 0 M.empty)\n    in\n    let rec loop i mi =\n        if i = 500 then (if mi = max_int then -1 else mi) else\n            let key = (ma * i, mb * i) in\n            let mi = min mi (try M.find key map with _ -> max_int) in\n            loop (i + 1) mi\n    in\n    loop 1 max_int |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1592276524, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03806.html", "problem_id": "p03806", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03806/input.txt", "sample_output_relpath": "derived/input_output/data/p03806/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03806/OCaml/s004681104.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s004681104", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" (fun n ma mb ->\n    let module M = Map.Make (struct type t = int * int let compare = compare end) in\n    let map =\n        let rec loop i map =\n            if i = n then map else\n                let map =\n                    Scanf.scanf \" %d %d %d\" (fun a b c ->\n                        M.fold (fun (ka, kb) v next ->\n                            let key = (ka + a, kb + b) in\n                            M.add key (min (v + c) (try M.find key next with _ -> max_int)) next\n                        ) map map\n                    )\n                in\n                loop (i + 1) map\n        in\n        loop 0 (M.add (0, 0) 0 M.empty)\n    in\n    let rec loop i mi =\n        if i = 500 then (if mi = max_int then -1 else mi) else\n            let key = (ma * i, mb * i) in\n            let mi = min mi (try M.find key map with _ -> max_int) in\n            loop (i + 1) mi\n    in\n    loop 1 max_int |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nDolphin is planning to generate a small amount of a certain chemical substance C.\n\nIn order to generate the substance C, he must prepare a solution which is a mixture of two substances A and B in the ratio of M_a:M_b.\n\nHe does not have any stock of chemicals, however, so he will purchase some chemicals at a local pharmacy.\n\nThe pharmacy sells N kinds of chemicals. For each kind of chemical, there is exactly one package of that chemical in stock.\n\nThe package of chemical i contains a_i grams of the substance A and b_i grams of the substance B, and is sold for c_i yen (the currency of Japan).\n\nDolphin will purchase some of these packages. For some reason, he must use all contents of the purchased packages to generate the substance C.\n\nFind the minimum amount of money required to generate the substance C.\n\nIf it is not possible to generate the substance C by purchasing any combination of packages at the pharmacy, report that fact.\n\nConstraints\n\n1≦N≦40\n\n1≦a_i,b_i≦10\n\n1≦c_i≦100\n\n1≦M_a,M_b≦10\n\ngcd(M_a,M_b)=1\n\na_i, b_i, c_i, M_a and M_b are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M_a M_b\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the minimum amount of money required to generate the substance C. If it is not possible to generate the substance C, print -1 instead.\n\nSample Input 1\n\n3 1 1\n1 2 1\n2 1 2\n3 3 10\n\nSample Output 1\n\n3\n\nThe amount of money spent will be minimized by purchasing the packages of chemicals 1 and 2.\n\nIn this case, the mixture of the purchased chemicals will contain 3 grams of the substance A and 3 grams of the substance B, which are in the desired ratio: 3:3=1:1.\n\nThe total price of these packages is 3 yen.\n\nSample Input 2\n\n1 1 10\n10 10 10\n\nSample Output 2\n\n-1\n\nThe ratio 1:10 of the two substances A and B cannot be satisfied by purchasing any combination of the packages. Thus, the output should be -1.", "sample_input": "3 1 1\n1 2 1\n2 1 2\n3 3 10\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03806", "source_text": "Score : 400 points\n\nProblem Statement\n\nDolphin is planning to generate a small amount of a certain chemical substance C.\n\nIn order to generate the substance C, he must prepare a solution which is a mixture of two substances A and B in the ratio of M_a:M_b.\n\nHe does not have any stock of chemicals, however, so he will purchase some chemicals at a local pharmacy.\n\nThe pharmacy sells N kinds of chemicals. For each kind of chemical, there is exactly one package of that chemical in stock.\n\nThe package of chemical i contains a_i grams of the substance A and b_i grams of the substance B, and is sold for c_i yen (the currency of Japan).\n\nDolphin will purchase some of these packages. For some reason, he must use all contents of the purchased packages to generate the substance C.\n\nFind the minimum amount of money required to generate the substance C.\n\nIf it is not possible to generate the substance C by purchasing any combination of packages at the pharmacy, report that fact.\n\nConstraints\n\n1≦N≦40\n\n1≦a_i,b_i≦10\n\n1≦c_i≦100\n\n1≦M_a,M_b≦10\n\ngcd(M_a,M_b)=1\n\na_i, b_i, c_i, M_a and M_b are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M_a M_b\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the minimum amount of money required to generate the substance C. If it is not possible to generate the substance C, print -1 instead.\n\nSample Input 1\n\n3 1 1\n1 2 1\n2 1 2\n3 3 10\n\nSample Output 1\n\n3\n\nThe amount of money spent will be minimized by purchasing the packages of chemicals 1 and 2.\n\nIn this case, the mixture of the purchased chemicals will contain 3 grams of the substance A and 3 grams of the substance B, which are in the desired ratio: 3:3=1:1.\n\nThe total price of these packages is 3 yen.\n\nSample Input 2\n\n1 1 10\n10 10 10\n\nSample Output 2\n\n-1\n\nThe ratio 1:10 of the two substances A and B cannot be satisfied by purchasing any combination of the packages. Thus, the output should be -1.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 306, "memory_kb": 7168}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s095480272", "group_id": "codeNet:p03806", "input_text": "Scanf.scanf \"%d %d %d\" (fun n ma mb ->\n    let module M = Map.Make (struct type t = int * int let compare = compare end) in\n    let map =\n        let rec loop i map =\n            if i = n then map else\n                let map =\n                    Scanf.scanf \" %d %d %d\" (fun a b c ->\n                        M.fold (fun (ka, kb) v next ->\n                            let key = (ka + a, kb + b) in\n                            M.add key (min (v + c) (try M.find key next with _ -> max_int)) next\n                        ) map map\n                    )\n                in\n                loop (i + 1) map\n        in\n        loop 0 (M.add (0, 0) 0 M.empty)\n    in\n    let rec loop i =\n        if i = 500 then (-1) else\n            let key = (ma * i, mb * i) in\n            if M.mem key map then M.find key map else loop (i + 1)\n    in\n    loop 1 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1592276356, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03806.html", "problem_id": "p03806", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03806/input.txt", "sample_output_relpath": "derived/input_output/data/p03806/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03806/OCaml/s095480272.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s095480272", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" (fun n ma mb ->\n    let module M = Map.Make (struct type t = int * int let compare = compare end) in\n    let map =\n        let rec loop i map =\n            if i = n then map else\n                let map =\n                    Scanf.scanf \" %d %d %d\" (fun a b c ->\n                        M.fold (fun (ka, kb) v next ->\n                            let key = (ka + a, kb + b) in\n                            M.add key (min (v + c) (try M.find key next with _ -> max_int)) next\n                        ) map map\n                    )\n                in\n                loop (i + 1) map\n        in\n        loop 0 (M.add (0, 0) 0 M.empty)\n    in\n    let rec loop i =\n        if i = 500 then (-1) else\n            let key = (ma * i, mb * i) in\n            if M.mem key map then M.find key map else loop (i + 1)\n    in\n    loop 1 |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nDolphin is planning to generate a small amount of a certain chemical substance C.\n\nIn order to generate the substance C, he must prepare a solution which is a mixture of two substances A and B in the ratio of M_a:M_b.\n\nHe does not have any stock of chemicals, however, so he will purchase some chemicals at a local pharmacy.\n\nThe pharmacy sells N kinds of chemicals. For each kind of chemical, there is exactly one package of that chemical in stock.\n\nThe package of chemical i contains a_i grams of the substance A and b_i grams of the substance B, and is sold for c_i yen (the currency of Japan).\n\nDolphin will purchase some of these packages. For some reason, he must use all contents of the purchased packages to generate the substance C.\n\nFind the minimum amount of money required to generate the substance C.\n\nIf it is not possible to generate the substance C by purchasing any combination of packages at the pharmacy, report that fact.\n\nConstraints\n\n1≦N≦40\n\n1≦a_i,b_i≦10\n\n1≦c_i≦100\n\n1≦M_a,M_b≦10\n\ngcd(M_a,M_b)=1\n\na_i, b_i, c_i, M_a and M_b are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M_a M_b\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the minimum amount of money required to generate the substance C. If it is not possible to generate the substance C, print -1 instead.\n\nSample Input 1\n\n3 1 1\n1 2 1\n2 1 2\n3 3 10\n\nSample Output 1\n\n3\n\nThe amount of money spent will be minimized by purchasing the packages of chemicals 1 and 2.\n\nIn this case, the mixture of the purchased chemicals will contain 3 grams of the substance A and 3 grams of the substance B, which are in the desired ratio: 3:3=1:1.\n\nThe total price of these packages is 3 yen.\n\nSample Input 2\n\n1 1 10\n10 10 10\n\nSample Output 2\n\n-1\n\nThe ratio 1:10 of the two substances A and B cannot be satisfied by purchasing any combination of the packages. Thus, the output should be -1.", "sample_input": "3 1 1\n1 2 1\n2 1 2\n3 3 10\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03806", "source_text": "Score : 400 points\n\nProblem Statement\n\nDolphin is planning to generate a small amount of a certain chemical substance C.\n\nIn order to generate the substance C, he must prepare a solution which is a mixture of two substances A and B in the ratio of M_a:M_b.\n\nHe does not have any stock of chemicals, however, so he will purchase some chemicals at a local pharmacy.\n\nThe pharmacy sells N kinds of chemicals. For each kind of chemical, there is exactly one package of that chemical in stock.\n\nThe package of chemical i contains a_i grams of the substance A and b_i grams of the substance B, and is sold for c_i yen (the currency of Japan).\n\nDolphin will purchase some of these packages. For some reason, he must use all contents of the purchased packages to generate the substance C.\n\nFind the minimum amount of money required to generate the substance C.\n\nIf it is not possible to generate the substance C by purchasing any combination of packages at the pharmacy, report that fact.\n\nConstraints\n\n1≦N≦40\n\n1≦a_i,b_i≦10\n\n1≦c_i≦100\n\n1≦M_a,M_b≦10\n\ngcd(M_a,M_b)=1\n\na_i, b_i, c_i, M_a and M_b are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M_a M_b\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the minimum amount of money required to generate the substance C. If it is not possible to generate the substance C, print -1 instead.\n\nSample Input 1\n\n3 1 1\n1 2 1\n2 1 2\n3 3 10\n\nSample Output 1\n\n3\n\nThe amount of money spent will be minimized by purchasing the packages of chemicals 1 and 2.\n\nIn this case, the mixture of the purchased chemicals will contain 3 grams of the substance A and 3 grams of the substance B, which are in the desired ratio: 3:3=1:1.\n\nThe total price of these packages is 3 yen.\n\nSample Input 2\n\n1 1 10\n10 10 10\n\nSample Output 2\n\n-1\n\nThe ratio 1:10 of the two substances A and B cannot be satisfied by purchasing any combination of the packages. Thus, the output should be -1.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 869, "cpu_time_ms": 311, "memory_kb": 7168}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s471993097", "group_id": "codeNet:p03806", "input_text": "let inf = 1 lsl 40\nlet n, ma, mb = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet abcs = Array.init n @@ fun _ -> Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet dp = Array.(init (n + 1) @@ fun _ -> make_matrix 411 411 inf)\nlet a, b, c = abcs.(0)\nlet ans = ref inf\nlet _ = dp.(0).(0).(0) <- 0; for i = 0 to n - 1 do let a, b, c = abcs.(i) in for j = 0 to 400 do for k = 0 to 400 do dp.(i + 1).(j).(k) <- min dp.(i + 1).(j).(k) dp.(i).(j).(k); dp.(i + 1).(j + a).(k + b) <- min dp.(i + 1).(j + a).(k + b) (dp.(i).(j).(k) + c) done done done; Array.(iter (iteri (fun i -> (iter (fun j -> if i > 0 && j > 0 && i * mb = j * ma then ans := min !ans dp.(n).(i).(j))))) dp); Printf.printf \"%d\\n\" @@ if !ans = inf then -1 else !ans", "language": "OCaml", "metadata": {"date": 1582673290, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03806.html", "problem_id": "p03806", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03806/input.txt", "sample_output_relpath": "derived/input_output/data/p03806/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03806/OCaml/s471993097.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s471993097", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let inf = 1 lsl 40\nlet n, ma, mb = Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet abcs = Array.init n @@ fun _ -> Scanf.scanf \" %d %d %d\" @@ fun a b c -> a, b, c\nlet dp = Array.(init (n + 1) @@ fun _ -> make_matrix 411 411 inf)\nlet a, b, c = abcs.(0)\nlet ans = ref inf\nlet _ = dp.(0).(0).(0) <- 0; for i = 0 to n - 1 do let a, b, c = abcs.(i) in for j = 0 to 400 do for k = 0 to 400 do dp.(i + 1).(j).(k) <- min dp.(i + 1).(j).(k) dp.(i).(j).(k); dp.(i + 1).(j + a).(k + b) <- min dp.(i + 1).(j + a).(k + b) (dp.(i).(j).(k) + c) done done done; Array.(iter (iteri (fun i -> (iter (fun j -> if i > 0 && j > 0 && i * mb = j * ma then ans := min !ans dp.(n).(i).(j))))) dp); Printf.printf \"%d\\n\" @@ if !ans = inf then -1 else !ans", "problem_context": "Score : 400 points\n\nProblem Statement\n\nDolphin is planning to generate a small amount of a certain chemical substance C.\n\nIn order to generate the substance C, he must prepare a solution which is a mixture of two substances A and B in the ratio of M_a:M_b.\n\nHe does not have any stock of chemicals, however, so he will purchase some chemicals at a local pharmacy.\n\nThe pharmacy sells N kinds of chemicals. For each kind of chemical, there is exactly one package of that chemical in stock.\n\nThe package of chemical i contains a_i grams of the substance A and b_i grams of the substance B, and is sold for c_i yen (the currency of Japan).\n\nDolphin will purchase some of these packages. For some reason, he must use all contents of the purchased packages to generate the substance C.\n\nFind the minimum amount of money required to generate the substance C.\n\nIf it is not possible to generate the substance C by purchasing any combination of packages at the pharmacy, report that fact.\n\nConstraints\n\n1≦N≦40\n\n1≦a_i,b_i≦10\n\n1≦c_i≦100\n\n1≦M_a,M_b≦10\n\ngcd(M_a,M_b)=1\n\na_i, b_i, c_i, M_a and M_b are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M_a M_b\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the minimum amount of money required to generate the substance C. If it is not possible to generate the substance C, print -1 instead.\n\nSample Input 1\n\n3 1 1\n1 2 1\n2 1 2\n3 3 10\n\nSample Output 1\n\n3\n\nThe amount of money spent will be minimized by purchasing the packages of chemicals 1 and 2.\n\nIn this case, the mixture of the purchased chemicals will contain 3 grams of the substance A and 3 grams of the substance B, which are in the desired ratio: 3:3=1:1.\n\nThe total price of these packages is 3 yen.\n\nSample Input 2\n\n1 1 10\n10 10 10\n\nSample Output 2\n\n-1\n\nThe ratio 1:10 of the two substances A and B cannot be satisfied by purchasing any combination of the packages. Thus, the output should be -1.", "sample_input": "3 1 1\n1 2 1\n2 1 2\n3 3 10\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03806", "source_text": "Score : 400 points\n\nProblem Statement\n\nDolphin is planning to generate a small amount of a certain chemical substance C.\n\nIn order to generate the substance C, he must prepare a solution which is a mixture of two substances A and B in the ratio of M_a:M_b.\n\nHe does not have any stock of chemicals, however, so he will purchase some chemicals at a local pharmacy.\n\nThe pharmacy sells N kinds of chemicals. For each kind of chemical, there is exactly one package of that chemical in stock.\n\nThe package of chemical i contains a_i grams of the substance A and b_i grams of the substance B, and is sold for c_i yen (the currency of Japan).\n\nDolphin will purchase some of these packages. For some reason, he must use all contents of the purchased packages to generate the substance C.\n\nFind the minimum amount of money required to generate the substance C.\n\nIf it is not possible to generate the substance C by purchasing any combination of packages at the pharmacy, report that fact.\n\nConstraints\n\n1≦N≦40\n\n1≦a_i,b_i≦10\n\n1≦c_i≦100\n\n1≦M_a,M_b≦10\n\ngcd(M_a,M_b)=1\n\na_i, b_i, c_i, M_a and M_b are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M_a M_b\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the minimum amount of money required to generate the substance C. If it is not possible to generate the substance C, print -1 instead.\n\nSample Input 1\n\n3 1 1\n1 2 1\n2 1 2\n3 3 10\n\nSample Output 1\n\n3\n\nThe amount of money spent will be minimized by purchasing the packages of chemicals 1 and 2.\n\nIn this case, the mixture of the purchased chemicals will contain 3 grams of the substance A and 3 grams of the substance B, which are in the desired ratio: 3:3=1:1.\n\nThe total price of these packages is 3 yen.\n\nSample Input 2\n\n1 1 10\n10 10 10\n\nSample Output 2\n\n-1\n\nThe ratio 1:10 of the two substances A and B cannot be satisfied by purchasing any combination of the packages. Thus, the output should be -1.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 299, "memory_kb": 56700}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s392768293", "group_id": "codeNet:p03807", "input_text": "(* O(n) *)\nlet n = Scanf.scanf \" %d\" @@ (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet _ = print_endline @@ if Array.fold_left (fun acc a -> (acc + a) mod 2) 0 a_s = 0 then \"YES\" else \"NO\"", "language": "OCaml", "metadata": {"date": 1560607093, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s392768293.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s392768293", "user_id": "u732304692"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "(* O(n) *)\nlet n = Scanf.scanf \" %d\" @@ (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" @@ (+) 0\nlet _ = print_endline @@ if Array.fold_left (fun acc a -> (acc + a) mod 2) 0 a_s = 0 then \"YES\" else \"NO\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers written on a blackboard. The i-th integer is A_i.\n\nTakahashi will repeatedly perform the following operation on these numbers:\n\nSelect a pair of integers, A_i and A_j, that have the same parity (that is, both are even or both are odd) and erase them.\n\nThen, write a new integer on the blackboard that is equal to the sum of those integers, A_i+A_j.\n\nDetermine whether it is possible to have only one integer on the blackboard.\n\nConstraints\n\n2 ≦ N ≦ 10^5\n\n1 ≦ A_i ≦ 10^9\n\nA_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 … A_N\n\nOutput\n\nIf it is possible to have only one integer on the blackboard, print YES. Otherwise, print NO.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYES\n\nIt is possible to have only one integer on the blackboard, as follows:\n\nErase 1 and 3 from the blackboard, then write 4. Now, there are two integers on the blackboard: 2 and 4.\n\nErase 2 and 4 from the blackboard, then write 6. Now, there is only one integer on the blackboard: 6.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\nNO", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03807", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers written on a blackboard. The i-th integer is A_i.\n\nTakahashi will repeatedly perform the following operation on these numbers:\n\nSelect a pair of integers, A_i and A_j, that have the same parity (that is, both are even or both are odd) and erase them.\n\nThen, write a new integer on the blackboard that is equal to the sum of those integers, A_i+A_j.\n\nDetermine whether it is possible to have only one integer on the blackboard.\n\nConstraints\n\n2 ≦ N ≦ 10^5\n\n1 ≦ A_i ≦ 10^9\n\nA_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 … A_N\n\nOutput\n\nIf it is possible to have only one integer on the blackboard, print YES. Otherwise, print NO.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYES\n\nIt is possible to have only one integer on the blackboard, as follows:\n\nErase 1 and 3 from the blackboard, then write 4. Now, there are two integers on the blackboard: 2 and 4.\n\nErase 2 and 4 from the blackboard, then write 6. Now, there is only one integer on the blackboard: 6.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 213, "cpu_time_ms": 31, "memory_kb": 5376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s105522752", "group_id": "codeNet:p03807", "input_text": "let get_int () = Scanf.scanf \"%d \" (fun v -> v)\nlet input_int_array n =\n\tArray.init n (fun _ -> Scanf.scanf \"%d \" (fun v -> v))\n\nlet () =\n  let n = get_int ()\n  in let ls = input_int_array n |> Array.to_list\n  in \n  List.filter (fun v -> v mod 2 = 1) ls\n  |> List.length\n  |> (fun v -> if v mod 2 = 0 then \"YES\" else \"NO\")\n  |> print_endline", "language": "OCaml", "metadata": {"date": 1530490821, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s105522752.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s105522752", "user_id": "u481480055"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let get_int () = Scanf.scanf \"%d \" (fun v -> v)\nlet input_int_array n =\n\tArray.init n (fun _ -> Scanf.scanf \"%d \" (fun v -> v))\n\nlet () =\n  let n = get_int ()\n  in let ls = input_int_array n |> Array.to_list\n  in \n  List.filter (fun v -> v mod 2 = 1) ls\n  |> List.length\n  |> (fun v -> if v mod 2 = 0 then \"YES\" else \"NO\")\n  |> print_endline", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers written on a blackboard. The i-th integer is A_i.\n\nTakahashi will repeatedly perform the following operation on these numbers:\n\nSelect a pair of integers, A_i and A_j, that have the same parity (that is, both are even or both are odd) and erase them.\n\nThen, write a new integer on the blackboard that is equal to the sum of those integers, A_i+A_j.\n\nDetermine whether it is possible to have only one integer on the blackboard.\n\nConstraints\n\n2 ≦ N ≦ 10^5\n\n1 ≦ A_i ≦ 10^9\n\nA_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 … A_N\n\nOutput\n\nIf it is possible to have only one integer on the blackboard, print YES. Otherwise, print NO.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYES\n\nIt is possible to have only one integer on the blackboard, as follows:\n\nErase 1 and 3 from the blackboard, then write 4. Now, there are two integers on the blackboard: 2 and 4.\n\nErase 2 and 4 from the blackboard, then write 6. Now, there is only one integer on the blackboard: 6.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\nNO", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03807", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers written on a blackboard. The i-th integer is A_i.\n\nTakahashi will repeatedly perform the following operation on these numbers:\n\nSelect a pair of integers, A_i and A_j, that have the same parity (that is, both are even or both are odd) and erase them.\n\nThen, write a new integer on the blackboard that is equal to the sum of those integers, A_i+A_j.\n\nDetermine whether it is possible to have only one integer on the blackboard.\n\nConstraints\n\n2 ≦ N ≦ 10^5\n\n1 ≦ A_i ≦ 10^9\n\nA_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 … A_N\n\nOutput\n\nIf it is possible to have only one integer on the blackboard, print YES. Otherwise, print NO.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYES\n\nIt is possible to have only one integer on the blackboard, as follows:\n\nErase 1 and 3 from the blackboard, then write 4. Now, there are two integers on the blackboard: 2 and 4.\n\nErase 2 and 4 from the blackboard, then write 6. Now, there is only one integer on the blackboard: 6.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 341, "cpu_time_ms": 36, "memory_kb": 6272}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s070594356", "group_id": "codeNet:p03813", "input_text": "print_endline @@ if read_int () < 1200 then \"ABC\" else \"ARC\"", "language": "OCaml", "metadata": {"date": 1598846271, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s070594356.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s070594356", "user_id": "u342443598"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "print_endline @@ if read_int () < 1200 then \"ABC\" else \"ARC\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSmeke has decided to participate in AtCoder Beginner Contest (ABC) if his current rating is less than 1200, and participate in AtCoder Regular Contest (ARC) otherwise.\n\nYou are given Smeke's current rating, x. Print ABC if Smeke will participate in ABC, and print ARC otherwise.\n\nConstraints\n\n1 ≦ x ≦ 3{,}000\n\nx is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1000\n\nSample Output 1\n\nABC\n\nSmeke's current rating is less than 1200, thus the output should be ABC.\n\nSample Input 2\n\n2000\n\nSample Output 2\n\nARC\n\nSmeke's current rating is not less than 1200, thus the output should be ARC.", "sample_input": "1000\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03813", "source_text": "Score : 100 points\n\nProblem Statement\n\nSmeke has decided to participate in AtCoder Beginner Contest (ABC) if his current rating is less than 1200, and participate in AtCoder Regular Contest (ARC) otherwise.\n\nYou are given Smeke's current rating, x. Print ABC if Smeke will participate in ABC, and print ARC otherwise.\n\nConstraints\n\n1 ≦ x ≦ 3{,}000\n\nx is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1000\n\nSample Output 1\n\nABC\n\nSmeke's current rating is less than 1200, thus the output should be ABC.\n\nSample Input 2\n\n2000\n\nSample Output 2\n\nARC\n\nSmeke's current rating is not less than 1200, thus the output should be ARC.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 60, "cpu_time_ms": 9, "memory_kb": 3520}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s437673880", "group_id": "codeNet:p03813", "input_text": "print_endline (if read_int () < 1200 then \"ABC\" else \"ARC\") ", "language": "OCaml", "metadata": {"date": 1585595102, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s437673880.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s437673880", "user_id": "u752907799"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "print_endline (if read_int () < 1200 then \"ABC\" else \"ARC\") ", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSmeke has decided to participate in AtCoder Beginner Contest (ABC) if his current rating is less than 1200, and participate in AtCoder Regular Contest (ARC) otherwise.\n\nYou are given Smeke's current rating, x. Print ABC if Smeke will participate in ABC, and print ARC otherwise.\n\nConstraints\n\n1 ≦ x ≦ 3{,}000\n\nx is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1000\n\nSample Output 1\n\nABC\n\nSmeke's current rating is less than 1200, thus the output should be ABC.\n\nSample Input 2\n\n2000\n\nSample Output 2\n\nARC\n\nSmeke's current rating is not less than 1200, thus the output should be ARC.", "sample_input": "1000\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03813", "source_text": "Score : 100 points\n\nProblem Statement\n\nSmeke has decided to participate in AtCoder Beginner Contest (ABC) if his current rating is less than 1200, and participate in AtCoder Regular Contest (ARC) otherwise.\n\nYou are given Smeke's current rating, x. Print ABC if Smeke will participate in ABC, and print ARC otherwise.\n\nConstraints\n\n1 ≦ x ≦ 3{,}000\n\nx is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1000\n\nSample Output 1\n\nABC\n\nSmeke's current rating is less than 1200, thus the output should be ABC.\n\nSample Input 2\n\n2000\n\nSample Output 2\n\nARC\n\nSmeke's current rating is not less than 1200, thus the output should be ARC.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 60, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s131789959", "group_id": "codeNet:p03816", "input_text": "let k = List.(Array.(init (read_int ()) (fun _ -> Scanf.scanf \" %d\" (+) 0) |> to_list) |> sort_uniq (-) |> length)\nlet _ = Printf.printf \"%d\\n\" @@ k - (k + 1) mod 2", "language": "OCaml", "metadata": {"date": 1581233313, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03816.html", "problem_id": "p03816", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03816/input.txt", "sample_output_relpath": "derived/input_output/data/p03816/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03816/OCaml/s131789959.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s131789959", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let k = List.(Array.(init (read_int ()) (fun _ -> Scanf.scanf \" %d\" (+) 0) |> to_list) |> sort_uniq (-) |> length)\nlet _ = Printf.printf \"%d\\n\" @@ k - (k + 1) mod 2", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has decided to play a game using cards.\nHe has a deck consisting of N cards. On the i-th card from the top, an integer A_i is written.\n\nHe will perform the operation described below zero or more times, so that the values written on the remaining cards will be pairwise distinct. Find the maximum possible number of remaining cards. Here, N is odd, which guarantees that at least one card can be kept.\n\nOperation: Take out three arbitrary cards from the deck. Among those three cards, eat two: one with the largest value, and another with the smallest value. Then, return the remaining one card to the deck.\n\nConstraints\n\n3 ≦ N ≦ 10^{5}\n\nN is odd.\n\n1 ≦ A_i ≦ 10^{5}\n\nA_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 A_3 ... A_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n1 2 1 3 7\n\nSample Output 1\n\n3\n\nOne optimal solution is to perform the operation once, taking out two cards with 1 and one card with 2. One card with 1 and another with 2 will be eaten, and the remaining card with 1 will be returned to deck. Then, the values written on the remaining cards in the deck will be pairwise distinct: 1, 3 and 7.\n\nSample Input 2\n\n15\n1 3 5 2 1 3 2 8 8 6 2 6 11 1 1\n\nSample Output 2\n\n7", "sample_input": "5\n1 2 1 3 7\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03816", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has decided to play a game using cards.\nHe has a deck consisting of N cards. On the i-th card from the top, an integer A_i is written.\n\nHe will perform the operation described below zero or more times, so that the values written on the remaining cards will be pairwise distinct. Find the maximum possible number of remaining cards. Here, N is odd, which guarantees that at least one card can be kept.\n\nOperation: Take out three arbitrary cards from the deck. Among those three cards, eat two: one with the largest value, and another with the smallest value. Then, return the remaining one card to the deck.\n\nConstraints\n\n3 ≦ N ≦ 10^{5}\n\nN is odd.\n\n1 ≦ A_i ≦ 10^{5}\n\nA_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 A_3 ... A_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n1 2 1 3 7\n\nSample Output 1\n\n3\n\nOne optimal solution is to perform the operation once, taking out two cards with 1 and one card with 2. One card with 1 and another with 2 will be eaten, and the remaining card with 1 will be returned to deck. Then, the values written on the remaining cards in the deck will be pairwise distinct: 1, 3 and 7.\n\nSample Input 2\n\n15\n1 3 5 2 1 3 2 8 8 6 2 6 11 1 1\n\nSample Output 2\n\n7", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 68, "memory_kb": 9760}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s223632379", "group_id": "codeNet:p03816", "input_text": "let cs, a_s = Array.(make 100001 0, init (read_int ()) @@ fun _ -> Scanf.scanf \" %d\" (+) 0)\nlet _ = Array.(iter (fun a -> cs.(a) <- cs.(a) + 1) a_s; List.(length @@ sort_uniq (-) @@ to_list a_s) - if (fold_left (fun s c -> if c > 0 && c mod 2 = 0 then s + 1 else s) 0 cs) mod 2 = 1 then 1 else 0) |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1578513099, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03816.html", "problem_id": "p03816", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03816/input.txt", "sample_output_relpath": "derived/input_output/data/p03816/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03816/OCaml/s223632379.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s223632379", "user_id": "u732304692"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let cs, a_s = Array.(make 100001 0, init (read_int ()) @@ fun _ -> Scanf.scanf \" %d\" (+) 0)\nlet _ = Array.(iter (fun a -> cs.(a) <- cs.(a) + 1) a_s; List.(length @@ sort_uniq (-) @@ to_list a_s) - if (fold_left (fun s c -> if c > 0 && c mod 2 = 0 then s + 1 else s) 0 cs) mod 2 = 1 then 1 else 0) |> Printf.printf \"%d\\n\"", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has decided to play a game using cards.\nHe has a deck consisting of N cards. On the i-th card from the top, an integer A_i is written.\n\nHe will perform the operation described below zero or more times, so that the values written on the remaining cards will be pairwise distinct. Find the maximum possible number of remaining cards. Here, N is odd, which guarantees that at least one card can be kept.\n\nOperation: Take out three arbitrary cards from the deck. Among those three cards, eat two: one with the largest value, and another with the smallest value. Then, return the remaining one card to the deck.\n\nConstraints\n\n3 ≦ N ≦ 10^{5}\n\nN is odd.\n\n1 ≦ A_i ≦ 10^{5}\n\nA_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 A_3 ... A_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n1 2 1 3 7\n\nSample Output 1\n\n3\n\nOne optimal solution is to perform the operation once, taking out two cards with 1 and one card with 2. One card with 1 and another with 2 will be eaten, and the remaining card with 1 will be returned to deck. Then, the values written on the remaining cards in the deck will be pairwise distinct: 1, 3 and 7.\n\nSample Input 2\n\n15\n1 3 5 2 1 3 2 8 8 6 2 6 11 1 1\n\nSample Output 2\n\n7", "sample_input": "5\n1 2 1 3 7\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03816", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has decided to play a game using cards.\nHe has a deck consisting of N cards. On the i-th card from the top, an integer A_i is written.\n\nHe will perform the operation described below zero or more times, so that the values written on the remaining cards will be pairwise distinct. Find the maximum possible number of remaining cards. Here, N is odd, which guarantees that at least one card can be kept.\n\nOperation: Take out three arbitrary cards from the deck. Among those three cards, eat two: one with the largest value, and another with the smallest value. Then, return the remaining one card to the deck.\n\nConstraints\n\n3 ≦ N ≦ 10^{5}\n\nN is odd.\n\n1 ≦ A_i ≦ 10^{5}\n\nA_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 A_3 ... A_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n1 2 1 3 7\n\nSample Output 1\n\n3\n\nOne optimal solution is to perform the operation once, taking out two cards with 1 and one card with 2. One card with 1 and another with 2 will be eaten, and the remaining card with 1 will be returned to deck. Then, the values written on the remaining cards in the deck will be pairwise distinct: 1, 3 and 7.\n\nSample Input 2\n\n15\n1 3 5 2 1 3 2 8 8 6 2 6 11 1 1\n\nSample Output 2\n\n7", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 320, "cpu_time_ms": 64, "memory_kb": 11648}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s536670215", "group_id": "codeNet:p03817", "input_text": "let n = read_int () in\nlet c = (n / 11) * 2 in\nlet n = n mod 11 in\nPrintf.printf \"%d\\n\" @@\n    if n = 0 then c else if n <= 6 then c + 1 else c + 2", "language": "OCaml", "metadata": {"date": 1584162476, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s536670215.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s536670215", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let n = read_int () in\nlet c = (n / 11) * 2 in\nlet n = n mod 11 in\nPrintf.printf \"%d\\n\" @@\n    if n = 0 then c else if n <= 6 then c + 1 else c + 2", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has decided to play with a six-sided die. Each of its six sides shows an integer 1 through 6, and two numbers on opposite sides always add up to 7.\n\nSnuke will first put the die on the table with an arbitrary side facing upward, then repeatedly perform the following operation:\n\nOperation: Rotate the die 90° toward one of the following directions: left, right, front (the die will come closer) and back (the die will go farther). Then, obtain y points where y is the number written in the side facing upward.\n\nFor example, let us consider the situation where the side showing 1 faces upward, the near side shows 5 and the right side shows 4, as illustrated in the figure.\nIf the die is rotated toward the right as shown in the figure, the side showing 3 will face upward.\nBesides, the side showing 4 will face upward if the die is rotated toward the left, the side showing 2 will face upward if the die is rotated toward the front, and the side showing 5 will face upward if the die is rotated toward the back.\n\nFind the minimum number of operation Snuke needs to perform in order to score at least x points in total.\n\nConstraints\n\n1 ≦ x ≦ 10^{15}\n\nx is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n2\n\nSample Input 2\n\n149696127901\n\nSample Output 2\n\n27217477801", "sample_input": "7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03817", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has decided to play with a six-sided die. Each of its six sides shows an integer 1 through 6, and two numbers on opposite sides always add up to 7.\n\nSnuke will first put the die on the table with an arbitrary side facing upward, then repeatedly perform the following operation:\n\nOperation: Rotate the die 90° toward one of the following directions: left, right, front (the die will come closer) and back (the die will go farther). Then, obtain y points where y is the number written in the side facing upward.\n\nFor example, let us consider the situation where the side showing 1 faces upward, the near side shows 5 and the right side shows 4, as illustrated in the figure.\nIf the die is rotated toward the right as shown in the figure, the side showing 3 will face upward.\nBesides, the side showing 4 will face upward if the die is rotated toward the left, the side showing 2 will face upward if the die is rotated toward the front, and the side showing 5 will face upward if the die is rotated toward the back.\n\nFind the minimum number of operation Snuke needs to perform in order to score at least x points in total.\n\nConstraints\n\n1 ≦ x ≦ 10^{15}\n\nx is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n2\n\nSample Input 2\n\n149696127901\n\nSample Output 2\n\n27217477801", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 147, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s561370818", "group_id": "codeNet:p03817", "input_text": "let () = Scanf.scanf \"%d\" (fun x ->\n  Printf.printf \"%d\\n\" @@ (x + 4) / 11 * 2 + min 1 ((x + 4) mod 11))", "language": "OCaml", "metadata": {"date": 1510515130, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s561370818.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s561370818", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d\" (fun x ->\n  Printf.printf \"%d\\n\" @@ (x + 4) / 11 * 2 + min 1 ((x + 4) mod 11))", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has decided to play with a six-sided die. Each of its six sides shows an integer 1 through 6, and two numbers on opposite sides always add up to 7.\n\nSnuke will first put the die on the table with an arbitrary side facing upward, then repeatedly perform the following operation:\n\nOperation: Rotate the die 90° toward one of the following directions: left, right, front (the die will come closer) and back (the die will go farther). Then, obtain y points where y is the number written in the side facing upward.\n\nFor example, let us consider the situation where the side showing 1 faces upward, the near side shows 5 and the right side shows 4, as illustrated in the figure.\nIf the die is rotated toward the right as shown in the figure, the side showing 3 will face upward.\nBesides, the side showing 4 will face upward if the die is rotated toward the left, the side showing 2 will face upward if the die is rotated toward the front, and the side showing 5 will face upward if the die is rotated toward the back.\n\nFind the minimum number of operation Snuke needs to perform in order to score at least x points in total.\n\nConstraints\n\n1 ≦ x ≦ 10^{15}\n\nx is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n2\n\nSample Input 2\n\n149696127901\n\nSample Output 2\n\n27217477801", "sample_input": "7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03817", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has decided to play with a six-sided die. Each of its six sides shows an integer 1 through 6, and two numbers on opposite sides always add up to 7.\n\nSnuke will first put the die on the table with an arbitrary side facing upward, then repeatedly perform the following operation:\n\nOperation: Rotate the die 90° toward one of the following directions: left, right, front (the die will come closer) and back (the die will go farther). Then, obtain y points where y is the number written in the side facing upward.\n\nFor example, let us consider the situation where the side showing 1 faces upward, the near side shows 5 and the right side shows 4, as illustrated in the figure.\nIf the die is rotated toward the right as shown in the figure, the side showing 3 will face upward.\nBesides, the side showing 4 will face upward if the die is rotated toward the left, the side showing 2 will face upward if the die is rotated toward the front, and the side showing 5 will face upward if the die is rotated toward the back.\n\nFind the minimum number of operation Snuke needs to perform in order to score at least x points in total.\n\nConstraints\n\n1 ≦ x ≦ 10^{15}\n\nx is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n2\n\nSample Input 2\n\n149696127901\n\nSample Output 2\n\n27217477801", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 104, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s709033911", "group_id": "codeNet:p03817", "input_text": "let solve n = max ((n / 11) * 2 + (if n mod 11 = 0 then 0 else 1)) 2\n\nlet () =\n  let rec read () =\n    try let ans = (Scanf.scanf \"%d\\n\" solve) in\n        Printf.printf \"%d\\n\" ans\n    with End_of_file -> ()\n  in\n  read ()\n;;\n", "language": "OCaml", "metadata": {"date": 1487909785, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s709033911.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s709033911", "user_id": "u980152513"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let solve n = max ((n / 11) * 2 + (if n mod 11 = 0 then 0 else 1)) 2\n\nlet () =\n  let rec read () =\n    try let ans = (Scanf.scanf \"%d\\n\" solve) in\n        Printf.printf \"%d\\n\" ans\n    with End_of_file -> ()\n  in\n  read ()\n;;\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has decided to play with a six-sided die. Each of its six sides shows an integer 1 through 6, and two numbers on opposite sides always add up to 7.\n\nSnuke will first put the die on the table with an arbitrary side facing upward, then repeatedly perform the following operation:\n\nOperation: Rotate the die 90° toward one of the following directions: left, right, front (the die will come closer) and back (the die will go farther). Then, obtain y points where y is the number written in the side facing upward.\n\nFor example, let us consider the situation where the side showing 1 faces upward, the near side shows 5 and the right side shows 4, as illustrated in the figure.\nIf the die is rotated toward the right as shown in the figure, the side showing 3 will face upward.\nBesides, the side showing 4 will face upward if the die is rotated toward the left, the side showing 2 will face upward if the die is rotated toward the front, and the side showing 5 will face upward if the die is rotated toward the back.\n\nFind the minimum number of operation Snuke needs to perform in order to score at least x points in total.\n\nConstraints\n\n1 ≦ x ≦ 10^{15}\n\nx is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n2\n\nSample Input 2\n\n149696127901\n\nSample Output 2\n\n27217477801", "sample_input": "7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03817", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has decided to play with a six-sided die. Each of its six sides shows an integer 1 through 6, and two numbers on opposite sides always add up to 7.\n\nSnuke will first put the die on the table with an arbitrary side facing upward, then repeatedly perform the following operation:\n\nOperation: Rotate the die 90° toward one of the following directions: left, right, front (the die will come closer) and back (the die will go farther). Then, obtain y points where y is the number written in the side facing upward.\n\nFor example, let us consider the situation where the side showing 1 faces upward, the near side shows 5 and the right side shows 4, as illustrated in the figure.\nIf the die is rotated toward the right as shown in the figure, the side showing 3 will face upward.\nBesides, the side showing 4 will face upward if the die is rotated toward the left, the side showing 2 will face upward if the die is rotated toward the front, and the side showing 5 will face upward if the die is rotated toward the back.\n\nFind the minimum number of operation Snuke needs to perform in order to score at least x points in total.\n\nConstraints\n\n1 ≦ x ≦ 10^{15}\n\nx is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n2\n\nSample Input 2\n\n149696127901\n\nSample Output 2\n\n27217477801", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 225, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s907431469", "group_id": "codeNet:p03821", "input_text": "let n = Scanf.scanf \" %d\" (+) 0\nlet ab_s = Array.to_list @@ Array.init n @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet f a b = if a mod b = 0 then 0 else (a + b - 1) / b * b - a\nlet _ = List.fold_left (fun c (a, b) -> c + f (a + c) b) 0 @@ List.rev ab_s |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1566154165, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03821.html", "problem_id": "p03821", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03821/input.txt", "sample_output_relpath": "derived/input_output/data/p03821/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03821/OCaml/s907431469.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s907431469", "user_id": "u732304692"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "let n = Scanf.scanf \" %d\" (+) 0\nlet ab_s = Array.to_list @@ Array.init n @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet f a b = if a mod b = 0 then 0 else (a + b - 1) / b * b - a\nlet _ = List.fold_left (fun c (a, b) -> c + f (a + c) b) 0 @@ List.rev ab_s |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are an integer sequence A_1,...,A_N consisting of N terms, and N buttons.\nWhen the i-th (1 ≦ i ≦ N) button is pressed, the values of the i terms from the first through the i-th are all incremented by 1.\n\nThere is also another integer sequence B_1,...,B_N. Takahashi will push the buttons some number of times so that for every i, A_i will be a multiple of B_i.\n\nFind the minimum number of times Takahashi will press the buttons.\n\nConstraints\n\nAll input values are integers.\n\n1 ≦ N ≦ 10^5\n\n0 ≦ A_i ≦ 10^9(1 ≦ i ≦ N)\n\n1 ≦ B_i ≦ 10^9(1 ≦ i ≦ N)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint an integer representing the minimum number of times Takahashi will press the buttons.\n\nSample Input 1\n\n3\n3 5\n2 7\n9 4\n\nSample Output 1\n\n7\n\nPress the first button twice, the second button twice and the third button three times.\n\nSample Input 2\n\n7\n3 1\n4 1\n5 9\n2 6\n5 3\n5 8\n9 7\n\nSample Output 2\n\n22", "sample_input": "3\n3 5\n2 7\n9 4\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03821", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are an integer sequence A_1,...,A_N consisting of N terms, and N buttons.\nWhen the i-th (1 ≦ i ≦ N) button is pressed, the values of the i terms from the first through the i-th are all incremented by 1.\n\nThere is also another integer sequence B_1,...,B_N. Takahashi will push the buttons some number of times so that for every i, A_i will be a multiple of B_i.\n\nFind the minimum number of times Takahashi will press the buttons.\n\nConstraints\n\nAll input values are integers.\n\n1 ≦ N ≦ 10^5\n\n0 ≦ A_i ≦ 10^9(1 ≦ i ≦ N)\n\n1 ≦ B_i ≦ 10^9(1 ≦ i ≦ N)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint an integer representing the minimum number of times Takahashi will press the buttons.\n\nSample Input 1\n\n3\n3 5\n2 7\n9 4\n\nSample Output 1\n\n7\n\nPress the first button twice, the second button twice and the third button three times.\n\nSample Input 2\n\n7\n3 1\n4 1\n5 9\n2 6\n5 3\n5 8\n9 7\n\nSample Output 2\n\n22", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 287, "cpu_time_ms": 79, "memory_kb": 10624}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s745995338", "group_id": "codeNet:p03821", "input_text": "let n = Scanf.scanf \" %d\" (+) 0\nlet ab_s = Array.init n @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet f a b = if a < b then b - a else if a mod b = 0 then 0 else (a + b - 1) / b * b - a\nlet ans = ref 0\nlet _ = for i = n - 1 downto 0 do ans := !ans + f (fst ab_s.(i) + !ans) (snd ab_s.(i)) done; Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1566152204, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03821.html", "problem_id": "p03821", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03821/input.txt", "sample_output_relpath": "derived/input_output/data/p03821/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03821/OCaml/s745995338.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s745995338", "user_id": "u732304692"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "let n = Scanf.scanf \" %d\" (+) 0\nlet ab_s = Array.init n @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet f a b = if a < b then b - a else if a mod b = 0 then 0 else (a + b - 1) / b * b - a\nlet ans = ref 0\nlet _ = for i = n - 1 downto 0 do ans := !ans + f (fst ab_s.(i) + !ans) (snd ab_s.(i)) done; Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are an integer sequence A_1,...,A_N consisting of N terms, and N buttons.\nWhen the i-th (1 ≦ i ≦ N) button is pressed, the values of the i terms from the first through the i-th are all incremented by 1.\n\nThere is also another integer sequence B_1,...,B_N. Takahashi will push the buttons some number of times so that for every i, A_i will be a multiple of B_i.\n\nFind the minimum number of times Takahashi will press the buttons.\n\nConstraints\n\nAll input values are integers.\n\n1 ≦ N ≦ 10^5\n\n0 ≦ A_i ≦ 10^9(1 ≦ i ≦ N)\n\n1 ≦ B_i ≦ 10^9(1 ≦ i ≦ N)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint an integer representing the minimum number of times Takahashi will press the buttons.\n\nSample Input 1\n\n3\n3 5\n2 7\n9 4\n\nSample Output 1\n\n7\n\nPress the first button twice, the second button twice and the third button three times.\n\nSample Input 2\n\n7\n3 1\n4 1\n5 9\n2 6\n5 3\n5 8\n9 7\n\nSample Output 2\n\n22", "sample_input": "3\n3 5\n2 7\n9 4\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03821", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are an integer sequence A_1,...,A_N consisting of N terms, and N buttons.\nWhen the i-th (1 ≦ i ≦ N) button is pressed, the values of the i terms from the first through the i-th are all incremented by 1.\n\nThere is also another integer sequence B_1,...,B_N. Takahashi will push the buttons some number of times so that for every i, A_i will be a multiple of B_i.\n\nFind the minimum number of times Takahashi will press the buttons.\n\nConstraints\n\nAll input values are integers.\n\n1 ≦ N ≦ 10^5\n\n0 ≦ A_i ≦ 10^9(1 ≦ i ≦ N)\n\n1 ≦ B_i ≦ 10^9(1 ≦ i ≦ N)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint an integer representing the minimum number of times Takahashi will press the buttons.\n\nSample Input 1\n\n3\n3 5\n2 7\n9 4\n\nSample Output 1\n\n7\n\nPress the first button twice, the second button twice and the third button three times.\n\nSample Input 2\n\n7\n3 1\n4 1\n5 9\n2 6\n5 3\n5 8\n9 7\n\nSample Output 2\n\n22", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 330, "cpu_time_ms": 67, "memory_kb": 6784}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s876376853", "group_id": "codeNet:p03821", "input_text": "Scanf.scanf \"%d\" @@ fun n ->\n  let ab = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x,y)) in\n  let ab = Array.init n (fun i -> ab.(n-1-i)) in\n  Array.fold_left (fun (s,d) (x,y) ->\n    let p = ((x+d+y-1)/y*y - (x+d)) mod y in (s+p, d+p)) (0,0) ab\n  |> fst |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1534473462, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03821.html", "problem_id": "p03821", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03821/input.txt", "sample_output_relpath": "derived/input_output/data/p03821/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03821/OCaml/s876376853.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s876376853", "user_id": "u798181098"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "Scanf.scanf \"%d\" @@ fun n ->\n  let ab = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x,y)) in\n  let ab = Array.init n (fun i -> ab.(n-1-i)) in\n  Array.fold_left (fun (s,d) (x,y) ->\n    let p = ((x+d+y-1)/y*y - (x+d)) mod y in (s+p, d+p)) (0,0) ab\n  |> fst |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are an integer sequence A_1,...,A_N consisting of N terms, and N buttons.\nWhen the i-th (1 ≦ i ≦ N) button is pressed, the values of the i terms from the first through the i-th are all incremented by 1.\n\nThere is also another integer sequence B_1,...,B_N. Takahashi will push the buttons some number of times so that for every i, A_i will be a multiple of B_i.\n\nFind the minimum number of times Takahashi will press the buttons.\n\nConstraints\n\nAll input values are integers.\n\n1 ≦ N ≦ 10^5\n\n0 ≦ A_i ≦ 10^9(1 ≦ i ≦ N)\n\n1 ≦ B_i ≦ 10^9(1 ≦ i ≦ N)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint an integer representing the minimum number of times Takahashi will press the buttons.\n\nSample Input 1\n\n3\n3 5\n2 7\n9 4\n\nSample Output 1\n\n7\n\nPress the first button twice, the second button twice and the third button three times.\n\nSample Input 2\n\n7\n3 1\n4 1\n5 9\n2 6\n5 3\n5 8\n9 7\n\nSample Output 2\n\n22", "sample_input": "3\n3 5\n2 7\n9 4\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03821", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are an integer sequence A_1,...,A_N consisting of N terms, and N buttons.\nWhen the i-th (1 ≦ i ≦ N) button is pressed, the values of the i terms from the first through the i-th are all incremented by 1.\n\nThere is also another integer sequence B_1,...,B_N. Takahashi will push the buttons some number of times so that for every i, A_i will be a multiple of B_i.\n\nFind the minimum number of times Takahashi will press the buttons.\n\nConstraints\n\nAll input values are integers.\n\n1 ≦ N ≦ 10^5\n\n0 ≦ A_i ≦ 10^9(1 ≦ i ≦ N)\n\n1 ≦ B_i ≦ 10^9(1 ≦ i ≦ N)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint an integer representing the minimum number of times Takahashi will press the buttons.\n\nSample Input 1\n\n3\n3 5\n2 7\n9 4\n\nSample Output 1\n\n7\n\nPress the first button twice, the second button twice and the third button three times.\n\nSample Input 2\n\n7\n3 1\n4 1\n5 9\n2 6\n5 3\n5 8\n9 7\n\nSample Output 2\n\n22", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 290, "cpu_time_ms": 72, "memory_kb": 7424}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s031119698", "group_id": "codeNet:p03822", "input_text": "let rec make_tournament losers winner =\n  List.map (make_tournament losers) (losers winner)\n    |> List.sort compare\n    |> List.fold_left (fun d d' -> 1 + max d d') 0\n\nlet () =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let as_ = Array.init (n - 1) (fun _ -> Scanf.scanf \"%d\\n\" (fun a -> a)) in\n  let losers = Array.make n [] in\n  Array.iteri (fun i a ->\n    losers.(a - 1) <- i + 1 :: losers.(a - 1)) as_;\n  Printf.printf \"%d\\n\" (make_tournament (fun i -> losers.(i)) 0)\n", "language": "OCaml", "metadata": {"date": 1485144887, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03822.html", "problem_id": "p03822", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03822/input.txt", "sample_output_relpath": "derived/input_output/data/p03822/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03822/OCaml/s031119698.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s031119698", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let rec make_tournament losers winner =\n  List.map (make_tournament losers) (losers winner)\n    |> List.sort compare\n    |> List.fold_left (fun d d' -> 1 + max d d') 0\n\nlet () =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let as_ = Array.init (n - 1) (fun _ -> Scanf.scanf \"%d\\n\" (fun a -> a)) in\n  let losers = Array.make n [] in\n  Array.iteri (fun i a ->\n    losers.(a - 1) <- i + 1 :: losers.(a - 1)) as_;\n  Printf.printf \"%d\\n\" (make_tournament (fun i -> losers.(i)) 0)\n", "problem_context": "Score : 800 points\n\nProblem Statement\n\nN contestants participated in a competition. The total of N-1 matches were played in a knockout tournament.\nFor some reasons, the tournament may not be \"fair\" for all the contestants.\nThat is, the number of the matches that must be played in order to win the championship may be different for each contestant. The structure of the tournament is formally described at the end of this statement.\n\nAfter each match, there were always one winner and one loser. The last contestant standing was declared the champion.\n\nFigure: an example of a tournament\n\nFor convenience, the contestants were numbered 1 through N. The contestant numbered 1 was the champion, and the contestant numbered i(2 ≦ i ≦ N) was defeated in a match against the contestant numbered a_i.\n\nWe will define the depth of the tournament as the maximum number of the matches that must be played in order to win the championship over all the contestants.\n\nFind the minimum possible depth of the tournament.\n\nThe formal description of the structure of the tournament is as follows. In the i-th match, one of the following played against each other:\n\nTwo predetermined contestants\n\nOne predetermined contestant and the winner of the j-th match, where j(j<i) was predetermined\n\nThe winner of the j-th match and the winner of the k-th match, where j and k (j,k<i, j ≠ k) were predetermined\n\nSuch structure is valid structure of the tournament, if and only if no contestant who has already been defeated in a match will never play in a match, regardless of the outcome of the matches.\n\nConstraints\n\n2 ≦ N ≦ 10^5\n\n1 ≦ a_i ≦ N(2 ≦ i ≦ N)\n\nIt is guaranteed that the input is consistent (that is, there exists at least one tournament that matches the given information).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_2\n:\na_N\n\nOutput\n\nPrint the minimum possible depth of the tournament.\n\nSample Input 1\n\n5\n1\n1\n2\n4\n\nSample Output 1\n\n3\n\nThe following tournament and the result of the matches are consistent with the given information:\n\nIn the first match, contestants 4 and 5 played against each other, and contestant 4 won.\n\nIn the second match, contestants 2 and 4 played against each other, and contestant 2 won.\n\nIn the third match, contestants 1 and 3 played against each other, and contestant 1 won.\n\nIn the fourth match, contestants 1 and 2 played against each other, and contestant 1 won.\n\nThe depth of this tournament is 3, since contestant 5 must play three matches in order to win the championship.\nThere is no tournament with depth 2 or less that is consistent with the given information, thus the output should be 3.\n\nSample Input 2\n\n7\n1\n2\n1\n3\n1\n4\n\nSample Output 2\n\n3\n\nSample Input 3\n\n4\n4\n4\n1\n\nSample Output 3\n\n3", "sample_input": "5\n1\n1\n2\n4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03822", "source_text": "Score : 800 points\n\nProblem Statement\n\nN contestants participated in a competition. The total of N-1 matches were played in a knockout tournament.\nFor some reasons, the tournament may not be \"fair\" for all the contestants.\nThat is, the number of the matches that must be played in order to win the championship may be different for each contestant. The structure of the tournament is formally described at the end of this statement.\n\nAfter each match, there were always one winner and one loser. The last contestant standing was declared the champion.\n\nFigure: an example of a tournament\n\nFor convenience, the contestants were numbered 1 through N. The contestant numbered 1 was the champion, and the contestant numbered i(2 ≦ i ≦ N) was defeated in a match against the contestant numbered a_i.\n\nWe will define the depth of the tournament as the maximum number of the matches that must be played in order to win the championship over all the contestants.\n\nFind the minimum possible depth of the tournament.\n\nThe formal description of the structure of the tournament is as follows. In the i-th match, one of the following played against each other:\n\nTwo predetermined contestants\n\nOne predetermined contestant and the winner of the j-th match, where j(j<i) was predetermined\n\nThe winner of the j-th match and the winner of the k-th match, where j and k (j,k<i, j ≠ k) were predetermined\n\nSuch structure is valid structure of the tournament, if and only if no contestant who has already been defeated in a match will never play in a match, regardless of the outcome of the matches.\n\nConstraints\n\n2 ≦ N ≦ 10^5\n\n1 ≦ a_i ≦ N(2 ≦ i ≦ N)\n\nIt is guaranteed that the input is consistent (that is, there exists at least one tournament that matches the given information).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_2\n:\na_N\n\nOutput\n\nPrint the minimum possible depth of the tournament.\n\nSample Input 1\n\n5\n1\n1\n2\n4\n\nSample Output 1\n\n3\n\nThe following tournament and the result of the matches are consistent with the given information:\n\nIn the first match, contestants 4 and 5 played against each other, and contestant 4 won.\n\nIn the second match, contestants 2 and 4 played against each other, and contestant 2 won.\n\nIn the third match, contestants 1 and 3 played against each other, and contestant 1 won.\n\nIn the fourth match, contestants 1 and 2 played against each other, and contestant 1 won.\n\nThe depth of this tournament is 3, since contestant 5 must play three matches in order to win the championship.\nThere is no tournament with depth 2 or less that is consistent with the given information, thus the output should be 3.\n\nSample Input 2\n\n7\n1\n2\n1\n3\n1\n4\n\nSample Output 2\n\n3\n\nSample Input 3\n\n4\n4\n4\n1\n\nSample Output 3\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 477, "cpu_time_ms": 88, "memory_kb": 17280}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s769474564", "group_id": "codeNet:p03826", "input_text": "Scanf.scanf \"%d %d %d %d\" (fun a b c d -> print_int (max (a * b) (c * d)))\n", "language": "OCaml", "metadata": {"date": 1582777372, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s769474564.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s769474564", "user_id": "u752907799"}, "prompt_components": {"gold_output": "15\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d %d\" (fun a b c d -> print_int (max (a * b) (c * d)))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are two rectangles.\nThe lengths of the vertical sides of the first rectangle are A, and the lengths of the horizontal sides of the first rectangle are B.\nThe lengths of the vertical sides of the second rectangle are C, and the lengths of the horizontal sides of the second rectangle are D.\n\nPrint the area of the rectangle with the larger area.\nIf the two rectangles have equal areas, print that area.\n\nConstraints\n\nAll input values are integers.\n\n1≤A≤10^4\n\n1≤B≤10^4\n\n1≤C≤10^4\n\n1≤D≤10^4\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint the area of the rectangle with the larger area.\nIf the two rectangles have equal areas, print that area.\n\nSample Input 1\n\n3 5 2 7\n\nSample Output 1\n\n15\n\nThe first rectangle has an area of 3×5=15, and the second rectangle has an area of 2×7=14.\nThus, the output should be 15, the larger area.\n\nSample Input 2\n\n100 600 200 300\n\nSample Output 2\n\n60000", "sample_input": "3 5 2 7\n"}, "reference_outputs": ["15\n"], "source_document_id": "p03826", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are two rectangles.\nThe lengths of the vertical sides of the first rectangle are A, and the lengths of the horizontal sides of the first rectangle are B.\nThe lengths of the vertical sides of the second rectangle are C, and the lengths of the horizontal sides of the second rectangle are D.\n\nPrint the area of the rectangle with the larger area.\nIf the two rectangles have equal areas, print that area.\n\nConstraints\n\nAll input values are integers.\n\n1≤A≤10^4\n\n1≤B≤10^4\n\n1≤C≤10^4\n\n1≤D≤10^4\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint the area of the rectangle with the larger area.\nIf the two rectangles have equal areas, print that area.\n\nSample Input 1\n\n3 5 2 7\n\nSample Output 1\n\n15\n\nThe first rectangle has an area of 3×5=15, and the second rectangle has an area of 2×7=14.\nThus, the output should be 15, the larger area.\n\nSample Input 2\n\n100 600 200 300\n\nSample Output 2\n\n60000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 75, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s928267311", "group_id": "codeNet:p03826", "input_text": "let () = Scanf.scanf \"%d %d %d %d\\n\"\n    (fun a b c d -> Printf.printf \"%d\\n\" (max (a*b) (c*d)))", "language": "OCaml", "metadata": {"date": 1582123555, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s928267311.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s928267311", "user_id": "u307426615"}, "prompt_components": {"gold_output": "15\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d %d\\n\"\n    (fun a b c d -> Printf.printf \"%d\\n\" (max (a*b) (c*d)))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are two rectangles.\nThe lengths of the vertical sides of the first rectangle are A, and the lengths of the horizontal sides of the first rectangle are B.\nThe lengths of the vertical sides of the second rectangle are C, and the lengths of the horizontal sides of the second rectangle are D.\n\nPrint the area of the rectangle with the larger area.\nIf the two rectangles have equal areas, print that area.\n\nConstraints\n\nAll input values are integers.\n\n1≤A≤10^4\n\n1≤B≤10^4\n\n1≤C≤10^4\n\n1≤D≤10^4\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint the area of the rectangle with the larger area.\nIf the two rectangles have equal areas, print that area.\n\nSample Input 1\n\n3 5 2 7\n\nSample Output 1\n\n15\n\nThe first rectangle has an area of 3×5=15, and the second rectangle has an area of 2×7=14.\nThus, the output should be 15, the larger area.\n\nSample Input 2\n\n100 600 200 300\n\nSample Output 2\n\n60000", "sample_input": "3 5 2 7\n"}, "reference_outputs": ["15\n"], "source_document_id": "p03826", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are two rectangles.\nThe lengths of the vertical sides of the first rectangle are A, and the lengths of the horizontal sides of the first rectangle are B.\nThe lengths of the vertical sides of the second rectangle are C, and the lengths of the horizontal sides of the second rectangle are D.\n\nPrint the area of the rectangle with the larger area.\nIf the two rectangles have equal areas, print that area.\n\nConstraints\n\nAll input values are integers.\n\n1≤A≤10^4\n\n1≤B≤10^4\n\n1≤C≤10^4\n\n1≤D≤10^4\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint the area of the rectangle with the larger area.\nIf the two rectangles have equal areas, print that area.\n\nSample Input 1\n\n3 5 2 7\n\nSample Output 1\n\n15\n\nThe first rectangle has an area of 3×5=15, and the second rectangle has an area of 2×7=14.\nThus, the output should be 15, the larger area.\n\nSample Input 2\n\n100 600 200 300\n\nSample Output 2\n\n60000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 96, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s524031282", "group_id": "codeNet:p03826", "input_text": "let (a,b,c,d) = Scanf.scanf \"%d %d %d %d\\n\" (fun a b c d -> (a,b,c,d))\nlet str = if a*b = c*d then a*b else if a*b > c*d then a*b else c*d\nlet () = Printf.printf \"%d\\n\" str\n", "language": "OCaml", "metadata": {"date": 1485649320, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s524031282.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s524031282", "user_id": "u735499035"}, "prompt_components": {"gold_output": "15\n", "input_to_evaluate": "let (a,b,c,d) = Scanf.scanf \"%d %d %d %d\\n\" (fun a b c d -> (a,b,c,d))\nlet str = if a*b = c*d then a*b else if a*b > c*d then a*b else c*d\nlet () = Printf.printf \"%d\\n\" str\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are two rectangles.\nThe lengths of the vertical sides of the first rectangle are A, and the lengths of the horizontal sides of the first rectangle are B.\nThe lengths of the vertical sides of the second rectangle are C, and the lengths of the horizontal sides of the second rectangle are D.\n\nPrint the area of the rectangle with the larger area.\nIf the two rectangles have equal areas, print that area.\n\nConstraints\n\nAll input values are integers.\n\n1≤A≤10^4\n\n1≤B≤10^4\n\n1≤C≤10^4\n\n1≤D≤10^4\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint the area of the rectangle with the larger area.\nIf the two rectangles have equal areas, print that area.\n\nSample Input 1\n\n3 5 2 7\n\nSample Output 1\n\n15\n\nThe first rectangle has an area of 3×5=15, and the second rectangle has an area of 2×7=14.\nThus, the output should be 15, the larger area.\n\nSample Input 2\n\n100 600 200 300\n\nSample Output 2\n\n60000", "sample_input": "3 5 2 7\n"}, "reference_outputs": ["15\n"], "source_document_id": "p03826", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are two rectangles.\nThe lengths of the vertical sides of the first rectangle are A, and the lengths of the horizontal sides of the first rectangle are B.\nThe lengths of the vertical sides of the second rectangle are C, and the lengths of the horizontal sides of the second rectangle are D.\n\nPrint the area of the rectangle with the larger area.\nIf the two rectangles have equal areas, print that area.\n\nConstraints\n\nAll input values are integers.\n\n1≤A≤10^4\n\n1≤B≤10^4\n\n1≤C≤10^4\n\n1≤D≤10^4\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint the area of the rectangle with the larger area.\nIf the two rectangles have equal areas, print that area.\n\nSample Input 1\n\n3 5 2 7\n\nSample Output 1\n\n15\n\nThe first rectangle has an area of 3×5=15, and the second rectangle has an area of 2×7=14.\nThus, the output should be 15, the larger area.\n\nSample Input 2\n\n100 600 200 300\n\nSample Output 2\n\n60000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 173, "cpu_time_ms": 3, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s014761321", "group_id": "codeNet:p03827", "input_text": "let n, s = Scanf.scanf \" %d %s\" @@ fun a b -> a, b\nlet ans, acc = ref 0, ref 0\nlet _ =\n  String.iter (fun c -> if c = 'I' then incr acc else decr acc; ans := max !ans !acc) s;\n  Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1562249953, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s014761321.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s014761321", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let n, s = Scanf.scanf \" %d %s\" @@ fun a b -> a, b\nlet ans, acc = ref 0, ref 0\nlet _ =\n  String.iter (fun c -> if c = 'I' then incr acc else decr acc; ans := max !ans !acc) s;\n  Printf.printf \"%d\\n\" !ans", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s343773931", "group_id": "codeNet:p03828", "input_text": "(* O(n^2) *)\nlet n = read_int ()\nlet is_prime n =\n  if n <= 1 then false\n  else\n    let rec loop i =\n      if i * i > n then true\n      else if n mod i = 0 then false\n      else loop @@ i + 1 in\n    loop 2\nlet rec div_count n i = if n mod i <> 0 then 0 else 1 + div_count (n / i) i\nlet ans = ref 1\nlet _ =\n  for i = 2 to n do\n    if is_prime i then \n      let c = ref 0 in\n      for j = 2 to n do c := !c + div_count j i done;\n      ans := !ans * (!c + 1) mod 1_000_000_007 done;\n  Printf.printf \"%d\\n\" @@ !ans", "language": "OCaml", "metadata": {"date": 1561500783, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s343773931.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s343773931", "user_id": "u732304692"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "(* O(n^2) *)\nlet n = read_int ()\nlet is_prime n =\n  if n <= 1 then false\n  else\n    let rec loop i =\n      if i * i > n then true\n      else if n mod i = 0 then false\n      else loop @@ i + 1 in\n    loop 2\nlet rec div_count n i = if n mod i <> 0 then 0 else 1 + div_count (n / i) i\nlet ans = ref 1\nlet _ =\n  for i = 2 to n do\n    if is_prime i then \n      let c = ref 0 in\n      for j = 2 to n do c := !c + div_count j i done;\n      ans := !ans * (!c + 1) mod 1_000_000_007 done;\n  Printf.printf \"%d\\n\" @@ !ans", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\nFind the number of the positive divisors of N!, modulo 10^9+7.\n\nConstraints\n\n1≤N≤10^3\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of the positive divisors of N!, modulo 10^9+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n4\n\nThere are four divisors of 3! =6: 1, 2, 3 and 6. Thus, the output should be 4.\n\nSample Input 2\n\n6\n\nSample Output 2\n\n30\n\nSample Input 3\n\n1000\n\nSample Output 3\n\n972926972", "sample_input": "3\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03828", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\nFind the number of the positive divisors of N!, modulo 10^9+7.\n\nConstraints\n\n1≤N≤10^3\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of the positive divisors of N!, modulo 10^9+7.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n4\n\nThere are four divisors of 3! =6: 1, 2, 3 and 6. Thus, the output should be 4.\n\nSample Input 2\n\n6\n\nSample Output 2\n\n30\n\nSample Input 3\n\n1000\n\nSample Output 3\n\n972926972", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 510, "cpu_time_ms": 4, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s177435164", "group_id": "codeNet:p03834", "input_text": "let s = read_line ()\nlet f = String.sub s\nlet _ = Printf.printf \"%s %s %s\\n\" (f 0 5) (f 6 7) (f 14 5)", "language": "OCaml", "metadata": {"date": 1562487837, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s177435164.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s177435164", "user_id": "u732304692"}, "prompt_components": {"gold_output": "happy newyear enjoy\n", "input_to_evaluate": "let s = read_line ()\nlet f = String.sub s\nlet _ = Printf.printf \"%s %s %s\\n\" (f 0 5) (f 6 7) (f 14 5)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAs a New Year's gift, Dolphin received a string s of length 19.\n\nThe string s has the following format: [five lowercase English letters],[seven lowercase English letters],[five lowercase English letters].\n\nDolphin wants to convert the comma-separated string s into a space-separated string.\n\nWrite a program to perform the conversion for him.\n\nConstraints\n\nThe length of s is 19.\n\nThe sixth and fourteenth characters in s are ,.\n\nThe other characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string after the conversion.\n\nSample Input 1\n\nhappy,newyear,enjoy\n\nSample Output 1\n\nhappy newyear enjoy\n\nReplace all the commas in happy,newyear,enjoy with spaces to obtain happy newyear enjoy.\n\nSample Input 2\n\nhaiku,atcoder,tasks\n\nSample Output 2\n\nhaiku atcoder tasks\n\nSample Input 3\n\nabcde,fghihgf,edcba\n\nSample Output 3\n\nabcde fghihgf edcba", "sample_input": "happy,newyear,enjoy\n"}, "reference_outputs": ["happy newyear enjoy\n"], "source_document_id": "p03834", "source_text": "Score : 100 points\n\nProblem Statement\n\nAs a New Year's gift, Dolphin received a string s of length 19.\n\nThe string s has the following format: [five lowercase English letters],[seven lowercase English letters],[five lowercase English letters].\n\nDolphin wants to convert the comma-separated string s into a space-separated string.\n\nWrite a program to perform the conversion for him.\n\nConstraints\n\nThe length of s is 19.\n\nThe sixth and fourteenth characters in s are ,.\n\nThe other characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string after the conversion.\n\nSample Input 1\n\nhappy,newyear,enjoy\n\nSample Output 1\n\nhappy newyear enjoy\n\nReplace all the commas in happy,newyear,enjoy with spaces to obtain happy newyear enjoy.\n\nSample Input 2\n\nhaiku,atcoder,tasks\n\nSample Output 2\n\nhaiku atcoder tasks\n\nSample Input 3\n\nabcde,fghihgf,edcba\n\nSample Output 3\n\nabcde fghihgf edcba", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 101, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s495327699", "group_id": "codeNet:p03834", "input_text": "let (sx,sy,tx,ty) = Scanf.scanf \"%d %d %d %d\" (fun a b c d -> (a,b,c,d) )\n\nlet rec firstx x y tx ty list =\n  if (x < tx) then firstx (x+1) y tx ty ('R'::list) else\n    if (x > tx) then firstx (x-1) y tx ty ('L'::list) else list\n\nlet rec firsty x y tx ty list =\n  if (y < ty) then firsty x (y+1) tx ty ('U'::list) else\n    if (y > ty) then firsty x (y-1) tx ty ('D'::list) else list\n\nlet rec secondx x y tx ty list =\n  if (x < (tx+1)) then firstx (x+1) y tx ty ('R'::list) else\n    if (x > (tx+1)) then firstx (x-1) y tx ty ('L'::list) else list\n\nlet rec secondy x y tx ty list =\n  if (y < ty) then firsty x (y+1) tx ty ('U'::list) else\n    if (y > ty) then firsty x (y-1) tx ty ('D'::list) else list\n      \nlet rec listinv = function\n  | [] -> []\n  | a :: rest ->\n     match a with\n     | 'R' -> 'L' :: listinv rest\n     | 'L' -> 'R' :: listinv rest\n     | 'U' -> 'D' :: listinv rest\n     | 'D' -> 'U' :: listinv rest\n      \nlet list1 = firstx sx sy tx ty [] \nlet list2 = firsty sx sy tx ty []\nlet list12 = list1 @ list2 \nlet list12' = listinv list12\nlet list3 = 'D' :: (firstx sx sy tx ty []) @ ['R'] \nlet list4 = 'U' :: (firsty sx sy tx ty []) @ ['L'] \nlet list34 = list3 @ list4\nlet list34' = listinv list34\nlet anslist = list12 @ list12' @ list34 @ list34'\n\nlet rec list_to_string : char list -> string = fun cl ->\n   String.concat \"\" @@ List.map (String.make 1) cl\n\nlet ans = list_to_string anslist\n  \nlet () = Printf.printf \"%s\\n\" ans\n", "language": "OCaml", "metadata": {"date": 1485664738, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s495327699.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s495327699", "user_id": "u735499035"}, "prompt_components": {"gold_output": "happy newyear enjoy\n", "input_to_evaluate": "let (sx,sy,tx,ty) = Scanf.scanf \"%d %d %d %d\" (fun a b c d -> (a,b,c,d) )\n\nlet rec firstx x y tx ty list =\n  if (x < tx) then firstx (x+1) y tx ty ('R'::list) else\n    if (x > tx) then firstx (x-1) y tx ty ('L'::list) else list\n\nlet rec firsty x y tx ty list =\n  if (y < ty) then firsty x (y+1) tx ty ('U'::list) else\n    if (y > ty) then firsty x (y-1) tx ty ('D'::list) else list\n\nlet rec secondx x y tx ty list =\n  if (x < (tx+1)) then firstx (x+1) y tx ty ('R'::list) else\n    if (x > (tx+1)) then firstx (x-1) y tx ty ('L'::list) else list\n\nlet rec secondy x y tx ty list =\n  if (y < ty) then firsty x (y+1) tx ty ('U'::list) else\n    if (y > ty) then firsty x (y-1) tx ty ('D'::list) else list\n      \nlet rec listinv = function\n  | [] -> []\n  | a :: rest ->\n     match a with\n     | 'R' -> 'L' :: listinv rest\n     | 'L' -> 'R' :: listinv rest\n     | 'U' -> 'D' :: listinv rest\n     | 'D' -> 'U' :: listinv rest\n      \nlet list1 = firstx sx sy tx ty [] \nlet list2 = firsty sx sy tx ty []\nlet list12 = list1 @ list2 \nlet list12' = listinv list12\nlet list3 = 'D' :: (firstx sx sy tx ty []) @ ['R'] \nlet list4 = 'U' :: (firsty sx sy tx ty []) @ ['L'] \nlet list34 = list3 @ list4\nlet list34' = listinv list34\nlet anslist = list12 @ list12' @ list34 @ list34'\n\nlet rec list_to_string : char list -> string = fun cl ->\n   String.concat \"\" @@ List.map (String.make 1) cl\n\nlet ans = list_to_string anslist\n  \nlet () = Printf.printf \"%s\\n\" ans\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAs a New Year's gift, Dolphin received a string s of length 19.\n\nThe string s has the following format: [five lowercase English letters],[seven lowercase English letters],[five lowercase English letters].\n\nDolphin wants to convert the comma-separated string s into a space-separated string.\n\nWrite a program to perform the conversion for him.\n\nConstraints\n\nThe length of s is 19.\n\nThe sixth and fourteenth characters in s are ,.\n\nThe other characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string after the conversion.\n\nSample Input 1\n\nhappy,newyear,enjoy\n\nSample Output 1\n\nhappy newyear enjoy\n\nReplace all the commas in happy,newyear,enjoy with spaces to obtain happy newyear enjoy.\n\nSample Input 2\n\nhaiku,atcoder,tasks\n\nSample Output 2\n\nhaiku atcoder tasks\n\nSample Input 3\n\nabcde,fghihgf,edcba\n\nSample Output 3\n\nabcde fghihgf edcba", "sample_input": "happy,newyear,enjoy\n"}, "reference_outputs": ["happy newyear enjoy\n"], "source_document_id": "p03834", "source_text": "Score : 100 points\n\nProblem Statement\n\nAs a New Year's gift, Dolphin received a string s of length 19.\n\nThe string s has the following format: [five lowercase English letters],[seven lowercase English letters],[five lowercase English letters].\n\nDolphin wants to convert the comma-separated string s into a space-separated string.\n\nWrite a program to perform the conversion for him.\n\nConstraints\n\nThe length of s is 19.\n\nThe sixth and fourteenth characters in s are ,.\n\nThe other characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string after the conversion.\n\nSample Input 1\n\nhappy,newyear,enjoy\n\nSample Output 1\n\nhappy newyear enjoy\n\nReplace all the commas in happy,newyear,enjoy with spaces to obtain happy newyear enjoy.\n\nSample Input 2\n\nhaiku,atcoder,tasks\n\nSample Output 2\n\nhaiku atcoder tasks\n\nSample Input 3\n\nabcde,fghihgf,edcba\n\nSample Output 3\n\nabcde fghihgf edcba", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1441, "cpu_time_ms": 3, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s633733404", "group_id": "codeNet:p03837", "input_text": "Scanf.scanf \"%d %d\" (fun n m ->\n    let module S = Set.Make (struct type t = int let compare = compare end) in\n    let mat = Array.make_matrix n n (max_int / 1000, S.empty) in\n    for i = 0 to n - 1 do mat.(i).(i) <- 0,S.empty done;\n    for i = 0 to m - 1 do\n        Scanf.scanf \" %d %d %d\" (fun a b c ->\n            let a = a - 1 in let b = b - 1 in\n            mat.(a).(b) <- c, S.singleton i;\n            mat.(b).(a) <- c, S.singleton i;\n        )\n    done;\n    for k = 0 to n - 1 do\n        for i = 0 to n - 1 do\n            for j = 0 to n - 1 do\n                let d1, s1 = mat.(i).(j) in\n                let d2, s2 = mat.(i).(k) in\n                let d3, s3 = mat.(k).(j) in\n                if d1 > d2 + d3 then mat.(i).(j) <- d2 + d3, S.union s2 s3\n            done\n        done\n    done;\n    let edge = Array.make m false in\n    for i = 0 to n - 1 do\n        for j = 0 to n - 1 do\n            let _, s = mat.(i).(j) in\n            S.iter (fun v -> edge.(v) <- true) s\n        done\n    done;\n    Array.fold_left (fun acc v -> if v then acc else acc + 1) 0 edge |> Printf.printf \"%d\\n\"\n)\n", "language": "OCaml", "metadata": {"date": 1589251151, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03837.html", "problem_id": "p03837", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03837/input.txt", "sample_output_relpath": "derived/input_output/data/p03837/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03837/OCaml/s633733404.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s633733404", "user_id": "u342443598"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n m ->\n    let module S = Set.Make (struct type t = int let compare = compare end) in\n    let mat = Array.make_matrix n n (max_int / 1000, S.empty) in\n    for i = 0 to n - 1 do mat.(i).(i) <- 0,S.empty done;\n    for i = 0 to m - 1 do\n        Scanf.scanf \" %d %d %d\" (fun a b c ->\n            let a = a - 1 in let b = b - 1 in\n            mat.(a).(b) <- c, S.singleton i;\n            mat.(b).(a) <- c, S.singleton i;\n        )\n    done;\n    for k = 0 to n - 1 do\n        for i = 0 to n - 1 do\n            for j = 0 to n - 1 do\n                let d1, s1 = mat.(i).(j) in\n                let d2, s2 = mat.(i).(k) in\n                let d3, s3 = mat.(k).(j) in\n                if d1 > d2 + d3 then mat.(i).(j) <- d2 + d3, S.union s2 s3\n            done\n        done\n    done;\n    let edge = Array.make m false in\n    for i = 0 to n - 1 do\n        for j = 0 to n - 1 do\n            let _, s = mat.(i).(j) in\n            S.iter (fun v -> edge.(v) <- true) s\n        done\n    done;\n    Array.fold_left (fun acc v -> if v then acc else acc + 1) 0 edge |> Printf.printf \"%d\\n\"\n)\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given an undirected connected weighted graph with N vertices and M edges that contains neither self-loops nor double edges.\n\nThe i-th (1≤i≤M) edge connects vertex a_i and vertex b_i with a distance of c_i.\n\nHere, a self-loop is an edge where a_i = b_i (1≤i≤M), and double edges are two edges where (a_i,b_i)=(a_j,b_j) or (a_i,b_i)=(b_j,a_j) (1≤i<j≤M).\n\nA connected graph is a graph where there is a path between every pair of different vertices.\n\nFind the number of the edges that are not contained in any shortest path between any pair of different vertices.\n\nConstraints\n\n2≤N≤100\n\nN-1≤M≤min(N(N-1)/2,1000)\n\n1≤a_i,b_i≤N\n\n1≤c_i≤1000\n\nc_i is an integer.\n\nThe given graph contains neither self-loops nor double edges.\n\nThe given graph is connected.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_M b_M c_M\n\nOutput\n\nPrint the number of the edges in the graph that are not contained in any shortest path between any pair of different vertices.\n\nSample Input 1\n\n3 3\n1 2 1\n1 3 1\n2 3 3\n\nSample Output 1\n\n1\n\nIn the given graph, the shortest paths between all pairs of different vertices are as follows:\n\nThe shortest path from vertex 1 to vertex 2 is: vertex 1 → vertex 2, with the length of 1.\n\nThe shortest path from vertex 1 to vertex 3 is: vertex 1 → vertex 3, with the length of 1.\n\nThe shortest path from vertex 2 to vertex 1 is: vertex 2 → vertex 1, with the length of 1.\n\nThe shortest path from vertex 2 to vertex 3 is: vertex 2 → vertex 1 → vertex 3, with the length of 2.\n\nThe shortest path from vertex 3 to vertex 1 is: vertex 3 → vertex 1, with the length of 1.\n\nThe shortest path from vertex 3 to vertex 2 is: vertex 3 → vertex 1 → vertex 2, with the length of 2.\n\nThus, the only edge that is not contained in any shortest path, is the edge of length 3 connecting vertex 2 and vertex 3, hence the output should be 1.\n\nSample Input 2\n\n3 2\n1 2 1\n2 3 1\n\nSample Output 2\n\n0\n\nEvery edge is contained in some shortest path between some pair of different vertices.", "sample_input": "3 3\n1 2 1\n1 3 1\n2 3 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03837", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given an undirected connected weighted graph with N vertices and M edges that contains neither self-loops nor double edges.\n\nThe i-th (1≤i≤M) edge connects vertex a_i and vertex b_i with a distance of c_i.\n\nHere, a self-loop is an edge where a_i = b_i (1≤i≤M), and double edges are two edges where (a_i,b_i)=(a_j,b_j) or (a_i,b_i)=(b_j,a_j) (1≤i<j≤M).\n\nA connected graph is a graph where there is a path between every pair of different vertices.\n\nFind the number of the edges that are not contained in any shortest path between any pair of different vertices.\n\nConstraints\n\n2≤N≤100\n\nN-1≤M≤min(N(N-1)/2,1000)\n\n1≤a_i,b_i≤N\n\n1≤c_i≤1000\n\nc_i is an integer.\n\nThe given graph contains neither self-loops nor double edges.\n\nThe given graph is connected.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_M b_M c_M\n\nOutput\n\nPrint the number of the edges in the graph that are not contained in any shortest path between any pair of different vertices.\n\nSample Input 1\n\n3 3\n1 2 1\n1 3 1\n2 3 3\n\nSample Output 1\n\n1\n\nIn the given graph, the shortest paths between all pairs of different vertices are as follows:\n\nThe shortest path from vertex 1 to vertex 2 is: vertex 1 → vertex 2, with the length of 1.\n\nThe shortest path from vertex 1 to vertex 3 is: vertex 1 → vertex 3, with the length of 1.\n\nThe shortest path from vertex 2 to vertex 1 is: vertex 2 → vertex 1, with the length of 1.\n\nThe shortest path from vertex 2 to vertex 3 is: vertex 2 → vertex 1 → vertex 3, with the length of 2.\n\nThe shortest path from vertex 3 to vertex 1 is: vertex 3 → vertex 1, with the length of 1.\n\nThe shortest path from vertex 3 to vertex 2 is: vertex 3 → vertex 1 → vertex 2, with the length of 2.\n\nThus, the only edge that is not contained in any shortest path, is the edge of length 3 connecting vertex 2 and vertex 3, hence the output should be 1.\n\nSample Input 2\n\n3 2\n1 2 1\n2 3 1\n\nSample Output 2\n\n0\n\nEvery edge is contained in some shortest path between some pair of different vertices.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 29, "memory_kb": 7040}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s751743455", "group_id": "codeNet:p03837", "input_text": "(* 座標圧縮 *)\nmodule CoordComp\n  (* 座標の型 *)\n  (Coord : sig\n    type t\n    val compare : t -> t -> int\n  end) :\nsig\n  val compress :\n    (* 座標のリスト *)\n    Coord.t list ->\n    (* 座標の数，圧縮する関数と解凍する関数を返す *)\n    int * (Coord.t -> int) * (int -> Coord.t)\nend = struct\n  module IntMap = Map.Make (struct\n    type t = int\n    let compare = compare\n  end)\n  module CoordMap = Map.Make (Coord)\n\n  let compress cs =\n    let (n, comp, decomp) =\n      List.fold_left (fun (n, comp, decomp) c ->\n        if CoordMap.mem c comp then (n, comp, decomp)\n        else (n + 1, CoordMap.add c n comp, IntMap.add n c decomp))\n      (0, CoordMap.empty, IntMap.empty) cs in\n    (n, (fun c -> CoordMap.find c comp), (fun n -> IntMap.find n decomp))\nend\n\n(* 無限大の要素を付け足してトロピカル半環を作る *)\nmodule WithInf\n  (S : sig\n    type t\n    val zero : t\n    val ( + ) : t -> t -> t\n    val compare : t -> t -> int\n  end) :\nsig\n  (* Noneで無限大を表す *)\n  type t = S.t option\n  val inf : t\n  val zero : t\n  val ( + ) : t -> t -> t\n  val compare : t -> t -> int\nend =\nstruct\n  type t = S.t option\n  let inf = None\n  let zero = Some S.zero\n  let ( + ) x y =\n    match x, y with\n    | None, _ -> None\n    | _, None -> None\n    | Some m, Some n -> Some (S.( + ) m n)\n  let compare x y =\n    match x, y with\n    | None, None -> 0\n    | None, _ -> 1\n    | _, None -> -1\n    | Some m, Some n -> S.compare m n\nend\n\nmodule WeightedDirectedGraph\n  (Vertex : sig\n    type t\n    val compare : t -> t -> int\n  end)\n  (Weight : sig\n    type t\n    val zero : t\n    val ( + ) : t -> t -> t\n    val compare : t -> t -> int\n  end) :\nsig\n  (* 配列版の実装 *)\n  val raw_warshall_floyd :\n    (* 頂点の数n *)\n    int ->\n    (* 辺のリスト *)\n    (* 頂点は0からn-1までの整数でなくてはならない *)\n    (int * int * Weight.t) list ->\n    (* 辿り着けなければNoneを返す *)\n    (int -> int -> Weight.t option)\n\n  (* 座標圧縮により，頂点に様々な型を使えるようにしたバージョン *)\n  val warshall_floyd :\n    (* 辺のリスト *)\n    (Vertex.t * Vertex.t * Weight.t) list ->\n    (* 辿り着けなければNoneを返す *)\n    (Vertex.t -> Vertex.t -> Weight.t option)\nend =\nstruct\n  module CC = CoordComp (Vertex)\n  module Weight' = WithInf (Weight)\n\n  let raw_warshall_floyd n es =\n    (* 準備 *)\n    (* Noneで無限を表す *)\n    let d = Array.make_matrix n n Weight'.inf in\n    List.iter (fun (u, v, c) -> d.(u).(v) <- Some c) es;\n    for v = 0 to n - 1 do\n      d.(v).(v) <- Weight'.zero\n    done;\n    for i = 0 to n - 1 do\n      for j = 0 to n - 1 do\n        for k = 0 to n - 1 do\n          let open Weight' in\n          (* d.(j).(i) + d.(i).(k) < d.(j).(k) *)\n          if 0 < compare d.(j).(k) (d.(j).(i) + d.(i).(k)) then\n            d.(j).(k) <- d.(j).(i) + d.(i).(k)\n        done\n      done\n    done;\n    fun u v -> try d.(u).(v) with _ -> Weight'.inf\n\n  let warshall_floyd es =\n    let (n, comp, _) =\n      CC.compress @@\n        List.concat @@\n          List.map (fun (u, v, _) -> [u; v]) es in\n    let d =\n      raw_warshall_floyd n @@\n        List.map (fun (u, v, c) -> (comp u, comp v, c)) es in\n    fun u v ->\n      try d (comp u) (comp v) with Not_found -> None\nend\n\nmodule Int = struct\n  type t = int\n  let zero = 0\n  let ( + ) = ( + )\n  let compare = compare\nend\n\nmodule G = WeightedDirectedGraph (Int) (Int)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let abcs =\n    Array.to_list @@\n      Array.init m @@ fun _ ->\n        Scanf.scanf \"%d %d %d\\n\" @@ fun a b c -> a, b, c in\n  let d = G.warshall_floyd (List.map (fun (a, b, c) -> (b, a, c)) abcs @ abcs) in\n  List.filter (fun (a, b, c) -> let Some d = d a b in d < c) abcs\n  |> List.length\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1526352740, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03837.html", "problem_id": "p03837", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03837/input.txt", "sample_output_relpath": "derived/input_output/data/p03837/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03837/OCaml/s751743455.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s751743455", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "(* 座標圧縮 *)\nmodule CoordComp\n  (* 座標の型 *)\n  (Coord : sig\n    type t\n    val compare : t -> t -> int\n  end) :\nsig\n  val compress :\n    (* 座標のリスト *)\n    Coord.t list ->\n    (* 座標の数，圧縮する関数と解凍する関数を返す *)\n    int * (Coord.t -> int) * (int -> Coord.t)\nend = struct\n  module IntMap = Map.Make (struct\n    type t = int\n    let compare = compare\n  end)\n  module CoordMap = Map.Make (Coord)\n\n  let compress cs =\n    let (n, comp, decomp) =\n      List.fold_left (fun (n, comp, decomp) c ->\n        if CoordMap.mem c comp then (n, comp, decomp)\n        else (n + 1, CoordMap.add c n comp, IntMap.add n c decomp))\n      (0, CoordMap.empty, IntMap.empty) cs in\n    (n, (fun c -> CoordMap.find c comp), (fun n -> IntMap.find n decomp))\nend\n\n(* 無限大の要素を付け足してトロピカル半環を作る *)\nmodule WithInf\n  (S : sig\n    type t\n    val zero : t\n    val ( + ) : t -> t -> t\n    val compare : t -> t -> int\n  end) :\nsig\n  (* Noneで無限大を表す *)\n  type t = S.t option\n  val inf : t\n  val zero : t\n  val ( + ) : t -> t -> t\n  val compare : t -> t -> int\nend =\nstruct\n  type t = S.t option\n  let inf = None\n  let zero = Some S.zero\n  let ( + ) x y =\n    match x, y with\n    | None, _ -> None\n    | _, None -> None\n    | Some m, Some n -> Some (S.( + ) m n)\n  let compare x y =\n    match x, y with\n    | None, None -> 0\n    | None, _ -> 1\n    | _, None -> -1\n    | Some m, Some n -> S.compare m n\nend\n\nmodule WeightedDirectedGraph\n  (Vertex : sig\n    type t\n    val compare : t -> t -> int\n  end)\n  (Weight : sig\n    type t\n    val zero : t\n    val ( + ) : t -> t -> t\n    val compare : t -> t -> int\n  end) :\nsig\n  (* 配列版の実装 *)\n  val raw_warshall_floyd :\n    (* 頂点の数n *)\n    int ->\n    (* 辺のリスト *)\n    (* 頂点は0からn-1までの整数でなくてはならない *)\n    (int * int * Weight.t) list ->\n    (* 辿り着けなければNoneを返す *)\n    (int -> int -> Weight.t option)\n\n  (* 座標圧縮により，頂点に様々な型を使えるようにしたバージョン *)\n  val warshall_floyd :\n    (* 辺のリスト *)\n    (Vertex.t * Vertex.t * Weight.t) list ->\n    (* 辿り着けなければNoneを返す *)\n    (Vertex.t -> Vertex.t -> Weight.t option)\nend =\nstruct\n  module CC = CoordComp (Vertex)\n  module Weight' = WithInf (Weight)\n\n  let raw_warshall_floyd n es =\n    (* 準備 *)\n    (* Noneで無限を表す *)\n    let d = Array.make_matrix n n Weight'.inf in\n    List.iter (fun (u, v, c) -> d.(u).(v) <- Some c) es;\n    for v = 0 to n - 1 do\n      d.(v).(v) <- Weight'.zero\n    done;\n    for i = 0 to n - 1 do\n      for j = 0 to n - 1 do\n        for k = 0 to n - 1 do\n          let open Weight' in\n          (* d.(j).(i) + d.(i).(k) < d.(j).(k) *)\n          if 0 < compare d.(j).(k) (d.(j).(i) + d.(i).(k)) then\n            d.(j).(k) <- d.(j).(i) + d.(i).(k)\n        done\n      done\n    done;\n    fun u v -> try d.(u).(v) with _ -> Weight'.inf\n\n  let warshall_floyd es =\n    let (n, comp, _) =\n      CC.compress @@\n        List.concat @@\n          List.map (fun (u, v, _) -> [u; v]) es in\n    let d =\n      raw_warshall_floyd n @@\n        List.map (fun (u, v, c) -> (comp u, comp v, c)) es in\n    fun u v ->\n      try d (comp u) (comp v) with Not_found -> None\nend\n\nmodule Int = struct\n  type t = int\n  let zero = 0\n  let ( + ) = ( + )\n  let compare = compare\nend\n\nmodule G = WeightedDirectedGraph (Int) (Int)\n\nlet () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let abcs =\n    Array.to_list @@\n      Array.init m @@ fun _ ->\n        Scanf.scanf \"%d %d %d\\n\" @@ fun a b c -> a, b, c in\n  let d = G.warshall_floyd (List.map (fun (a, b, c) -> (b, a, c)) abcs @ abcs) in\n  List.filter (fun (a, b, c) -> let Some d = d a b in d < c) abcs\n  |> List.length\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given an undirected connected weighted graph with N vertices and M edges that contains neither self-loops nor double edges.\n\nThe i-th (1≤i≤M) edge connects vertex a_i and vertex b_i with a distance of c_i.\n\nHere, a self-loop is an edge where a_i = b_i (1≤i≤M), and double edges are two edges where (a_i,b_i)=(a_j,b_j) or (a_i,b_i)=(b_j,a_j) (1≤i<j≤M).\n\nA connected graph is a graph where there is a path between every pair of different vertices.\n\nFind the number of the edges that are not contained in any shortest path between any pair of different vertices.\n\nConstraints\n\n2≤N≤100\n\nN-1≤M≤min(N(N-1)/2,1000)\n\n1≤a_i,b_i≤N\n\n1≤c_i≤1000\n\nc_i is an integer.\n\nThe given graph contains neither self-loops nor double edges.\n\nThe given graph is connected.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_M b_M c_M\n\nOutput\n\nPrint the number of the edges in the graph that are not contained in any shortest path between any pair of different vertices.\n\nSample Input 1\n\n3 3\n1 2 1\n1 3 1\n2 3 3\n\nSample Output 1\n\n1\n\nIn the given graph, the shortest paths between all pairs of different vertices are as follows:\n\nThe shortest path from vertex 1 to vertex 2 is: vertex 1 → vertex 2, with the length of 1.\n\nThe shortest path from vertex 1 to vertex 3 is: vertex 1 → vertex 3, with the length of 1.\n\nThe shortest path from vertex 2 to vertex 1 is: vertex 2 → vertex 1, with the length of 1.\n\nThe shortest path from vertex 2 to vertex 3 is: vertex 2 → vertex 1 → vertex 3, with the length of 2.\n\nThe shortest path from vertex 3 to vertex 1 is: vertex 3 → vertex 1, with the length of 1.\n\nThe shortest path from vertex 3 to vertex 2 is: vertex 3 → vertex 1 → vertex 2, with the length of 2.\n\nThus, the only edge that is not contained in any shortest path, is the edge of length 3 connecting vertex 2 and vertex 3, hence the output should be 1.\n\nSample Input 2\n\n3 2\n1 2 1\n2 3 1\n\nSample Output 2\n\n0\n\nEvery edge is contained in some shortest path between some pair of different vertices.", "sample_input": "3 3\n1 2 1\n1 3 1\n2 3 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03837", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given an undirected connected weighted graph with N vertices and M edges that contains neither self-loops nor double edges.\n\nThe i-th (1≤i≤M) edge connects vertex a_i and vertex b_i with a distance of c_i.\n\nHere, a self-loop is an edge where a_i = b_i (1≤i≤M), and double edges are two edges where (a_i,b_i)=(a_j,b_j) or (a_i,b_i)=(b_j,a_j) (1≤i<j≤M).\n\nA connected graph is a graph where there is a path between every pair of different vertices.\n\nFind the number of the edges that are not contained in any shortest path between any pair of different vertices.\n\nConstraints\n\n2≤N≤100\n\nN-1≤M≤min(N(N-1)/2,1000)\n\n1≤a_i,b_i≤N\n\n1≤c_i≤1000\n\nc_i is an integer.\n\nThe given graph contains neither self-loops nor double edges.\n\nThe given graph is connected.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_M b_M c_M\n\nOutput\n\nPrint the number of the edges in the graph that are not contained in any shortest path between any pair of different vertices.\n\nSample Input 1\n\n3 3\n1 2 1\n1 3 1\n2 3 3\n\nSample Output 1\n\n1\n\nIn the given graph, the shortest paths between all pairs of different vertices are as follows:\n\nThe shortest path from vertex 1 to vertex 2 is: vertex 1 → vertex 2, with the length of 1.\n\nThe shortest path from vertex 1 to vertex 3 is: vertex 1 → vertex 3, with the length of 1.\n\nThe shortest path from vertex 2 to vertex 1 is: vertex 2 → vertex 1, with the length of 1.\n\nThe shortest path from vertex 2 to vertex 3 is: vertex 2 → vertex 1 → vertex 3, with the length of 2.\n\nThe shortest path from vertex 3 to vertex 1 is: vertex 3 → vertex 1, with the length of 1.\n\nThe shortest path from vertex 3 to vertex 2 is: vertex 3 → vertex 1 → vertex 2, with the length of 2.\n\nThus, the only edge that is not contained in any shortest path, is the edge of length 3 connecting vertex 2 and vertex 3, hence the output should be 1.\n\nSample Input 2\n\n3 2\n1 2 1\n2 3 1\n\nSample Output 2\n\n0\n\nEvery edge is contained in some shortest path between some pair of different vertices.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3810, "cpu_time_ms": 26, "memory_kb": 5248}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s467728034", "group_id": "codeNet:p03837", "input_text": "module IntSet = Set.Make (struct\n  type t = int\n  let compare = compare\nend)\n \nlet warshall_floyd ( + ) min n d =\n  for i = 0 to n - 1 do\n    for j = 0 to n - 1 do\n      for k = 0 to n - 1 do\n        d.(j).(k) <- min d.(j).(k) (d.(j).(i) + d.(i).(k))\n      done\n    done\n  done\n \nlet () =\n  let n, m = Scanf.scanf \"%d %d\\n\" (fun n m -> n, m) in\n  let es = Array.init m (fun _ ->\n    Scanf.scanf \"%d %d %d\\n\" (fun a b c -> (a, b, c))) in\n  let dp = Array.make_matrix n n infinity in\n  for i = 0 to n - 1 do\n    dp.(i).(i) <- 0.\n  done;\n  Array.iter (fun (a, b, c) ->\n    dp.(a - 1).(b - 1) <- float_of_int c;\n    dp.(b - 1).(a - 1) <- float_of_int c) es;\n  warshall_floyd ( +. ) min n dp;\n  Array.to_list es\n  |> List.filter (fun (a, b, c) ->\n      dp.(a - 1).(b - 1) < float_of_int c)\n  |> List.length\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1515131166, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03837.html", "problem_id": "p03837", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03837/input.txt", "sample_output_relpath": "derived/input_output/data/p03837/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03837/OCaml/s467728034.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s467728034", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "module IntSet = Set.Make (struct\n  type t = int\n  let compare = compare\nend)\n \nlet warshall_floyd ( + ) min n d =\n  for i = 0 to n - 1 do\n    for j = 0 to n - 1 do\n      for k = 0 to n - 1 do\n        d.(j).(k) <- min d.(j).(k) (d.(j).(i) + d.(i).(k))\n      done\n    done\n  done\n \nlet () =\n  let n, m = Scanf.scanf \"%d %d\\n\" (fun n m -> n, m) in\n  let es = Array.init m (fun _ ->\n    Scanf.scanf \"%d %d %d\\n\" (fun a b c -> (a, b, c))) in\n  let dp = Array.make_matrix n n infinity in\n  for i = 0 to n - 1 do\n    dp.(i).(i) <- 0.\n  done;\n  Array.iter (fun (a, b, c) ->\n    dp.(a - 1).(b - 1) <- float_of_int c;\n    dp.(b - 1).(a - 1) <- float_of_int c) es;\n  warshall_floyd ( +. ) min n dp;\n  Array.to_list es\n  |> List.filter (fun (a, b, c) ->\n      dp.(a - 1).(b - 1) < float_of_int c)\n  |> List.length\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given an undirected connected weighted graph with N vertices and M edges that contains neither self-loops nor double edges.\n\nThe i-th (1≤i≤M) edge connects vertex a_i and vertex b_i with a distance of c_i.\n\nHere, a self-loop is an edge where a_i = b_i (1≤i≤M), and double edges are two edges where (a_i,b_i)=(a_j,b_j) or (a_i,b_i)=(b_j,a_j) (1≤i<j≤M).\n\nA connected graph is a graph where there is a path between every pair of different vertices.\n\nFind the number of the edges that are not contained in any shortest path between any pair of different vertices.\n\nConstraints\n\n2≤N≤100\n\nN-1≤M≤min(N(N-1)/2,1000)\n\n1≤a_i,b_i≤N\n\n1≤c_i≤1000\n\nc_i is an integer.\n\nThe given graph contains neither self-loops nor double edges.\n\nThe given graph is connected.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_M b_M c_M\n\nOutput\n\nPrint the number of the edges in the graph that are not contained in any shortest path between any pair of different vertices.\n\nSample Input 1\n\n3 3\n1 2 1\n1 3 1\n2 3 3\n\nSample Output 1\n\n1\n\nIn the given graph, the shortest paths between all pairs of different vertices are as follows:\n\nThe shortest path from vertex 1 to vertex 2 is: vertex 1 → vertex 2, with the length of 1.\n\nThe shortest path from vertex 1 to vertex 3 is: vertex 1 → vertex 3, with the length of 1.\n\nThe shortest path from vertex 2 to vertex 1 is: vertex 2 → vertex 1, with the length of 1.\n\nThe shortest path from vertex 2 to vertex 3 is: vertex 2 → vertex 1 → vertex 3, with the length of 2.\n\nThe shortest path from vertex 3 to vertex 1 is: vertex 3 → vertex 1, with the length of 1.\n\nThe shortest path from vertex 3 to vertex 2 is: vertex 3 → vertex 1 → vertex 2, with the length of 2.\n\nThus, the only edge that is not contained in any shortest path, is the edge of length 3 connecting vertex 2 and vertex 3, hence the output should be 1.\n\nSample Input 2\n\n3 2\n1 2 1\n2 3 1\n\nSample Output 2\n\n0\n\nEvery edge is contained in some shortest path between some pair of different vertices.", "sample_input": "3 3\n1 2 1\n1 3 1\n2 3 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03837", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given an undirected connected weighted graph with N vertices and M edges that contains neither self-loops nor double edges.\n\nThe i-th (1≤i≤M) edge connects vertex a_i and vertex b_i with a distance of c_i.\n\nHere, a self-loop is an edge where a_i = b_i (1≤i≤M), and double edges are two edges where (a_i,b_i)=(a_j,b_j) or (a_i,b_i)=(b_j,a_j) (1≤i<j≤M).\n\nA connected graph is a graph where there is a path between every pair of different vertices.\n\nFind the number of the edges that are not contained in any shortest path between any pair of different vertices.\n\nConstraints\n\n2≤N≤100\n\nN-1≤M≤min(N(N-1)/2,1000)\n\n1≤a_i,b_i≤N\n\n1≤c_i≤1000\n\nc_i is an integer.\n\nThe given graph contains neither self-loops nor double edges.\n\nThe given graph is connected.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_M b_M c_M\n\nOutput\n\nPrint the number of the edges in the graph that are not contained in any shortest path between any pair of different vertices.\n\nSample Input 1\n\n3 3\n1 2 1\n1 3 1\n2 3 3\n\nSample Output 1\n\n1\n\nIn the given graph, the shortest paths between all pairs of different vertices are as follows:\n\nThe shortest path from vertex 1 to vertex 2 is: vertex 1 → vertex 2, with the length of 1.\n\nThe shortest path from vertex 1 to vertex 3 is: vertex 1 → vertex 3, with the length of 1.\n\nThe shortest path from vertex 2 to vertex 1 is: vertex 2 → vertex 1, with the length of 1.\n\nThe shortest path from vertex 2 to vertex 3 is: vertex 2 → vertex 1 → vertex 3, with the length of 2.\n\nThe shortest path from vertex 3 to vertex 1 is: vertex 3 → vertex 1, with the length of 1.\n\nThe shortest path from vertex 3 to vertex 2 is: vertex 3 → vertex 1 → vertex 2, with the length of 2.\n\nThus, the only edge that is not contained in any shortest path, is the edge of length 3 connecting vertex 2 and vertex 3, hence the output should be 1.\n\nSample Input 2\n\n3 2\n1 2 1\n2 3 1\n\nSample Output 2\n\n0\n\nEvery edge is contained in some shortest path between some pair of different vertices.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 827, "cpu_time_ms": 35, "memory_kb": 2688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s652335570", "group_id": "codeNet:p03837", "input_text": "type 'a set =\n  | Empty\n  | Singleton of 'a\n  | Union of 'a set * 'a set\n\nlet rec make_intset acc = function\n  | Empty -> ()\n  | Singleton x -> acc.(x) <- true\n  | Union (s, t) -> make_intset acc s; make_intset acc t\n\nlet warshall_floyd ( + ) min n d =\n  for i = 0 to n - 1 do\n    for j = 0 to n - 1 do\n      for k = 0 to n - 1 do\n        d.(j).(k) <- min d.(j).(k) (d.(j).(i) + d.(i).(k))\n      done\n    done\n  done\n\nlet () =\n  let n, m = Scanf.scanf \"%d %d\\n\" (fun n m -> n, m) in\n  let dp = Array.make_matrix n n (infinity, Empty) in\n  for i = 0 to n - 1 do\n    dp.(i).(i) <- (0., Empty)\n  done;\n  for i = 0 to m - 1 do\n    Scanf.scanf \"%d %d %d\\n\" (fun a b c ->\n      dp.(a - 1).(b - 1) <- (float_of_int c, Singleton i);\n      dp.(b - 1).(a - 1) <- (float_of_int c, Singleton i))\n  done;\n  warshall_floyd\n    (fun (d, es) (d', es') -> (d +. d', Union (es, es')))\n    (fun (d, es) (d', es') ->\n      match compare d d' with\n      | -1 -> (d, es)\n      | 0  -> (d, Union (es, es'))\n      | 1  -> (d', es')) n dp;\n  let bs = Array.make m false in\n  Array.iter (Array.iter (fun (_, es) -> make_intset bs es)) dp;\n  Array.to_list bs\n  |> List.filter (fun b -> not b)\n  |> List.length\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1515130571, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03837.html", "problem_id": "p03837", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03837/input.txt", "sample_output_relpath": "derived/input_output/data/p03837/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03837/OCaml/s652335570.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s652335570", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "type 'a set =\n  | Empty\n  | Singleton of 'a\n  | Union of 'a set * 'a set\n\nlet rec make_intset acc = function\n  | Empty -> ()\n  | Singleton x -> acc.(x) <- true\n  | Union (s, t) -> make_intset acc s; make_intset acc t\n\nlet warshall_floyd ( + ) min n d =\n  for i = 0 to n - 1 do\n    for j = 0 to n - 1 do\n      for k = 0 to n - 1 do\n        d.(j).(k) <- min d.(j).(k) (d.(j).(i) + d.(i).(k))\n      done\n    done\n  done\n\nlet () =\n  let n, m = Scanf.scanf \"%d %d\\n\" (fun n m -> n, m) in\n  let dp = Array.make_matrix n n (infinity, Empty) in\n  for i = 0 to n - 1 do\n    dp.(i).(i) <- (0., Empty)\n  done;\n  for i = 0 to m - 1 do\n    Scanf.scanf \"%d %d %d\\n\" (fun a b c ->\n      dp.(a - 1).(b - 1) <- (float_of_int c, Singleton i);\n      dp.(b - 1).(a - 1) <- (float_of_int c, Singleton i))\n  done;\n  warshall_floyd\n    (fun (d, es) (d', es') -> (d +. d', Union (es, es')))\n    (fun (d, es) (d', es') ->\n      match compare d d' with\n      | -1 -> (d, es)\n      | 0  -> (d, Union (es, es'))\n      | 1  -> (d', es')) n dp;\n  let bs = Array.make m false in\n  Array.iter (Array.iter (fun (_, es) -> make_intset bs es)) dp;\n  Array.to_list bs\n  |> List.filter (fun b -> not b)\n  |> List.length\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given an undirected connected weighted graph with N vertices and M edges that contains neither self-loops nor double edges.\n\nThe i-th (1≤i≤M) edge connects vertex a_i and vertex b_i with a distance of c_i.\n\nHere, a self-loop is an edge where a_i = b_i (1≤i≤M), and double edges are two edges where (a_i,b_i)=(a_j,b_j) or (a_i,b_i)=(b_j,a_j) (1≤i<j≤M).\n\nA connected graph is a graph where there is a path between every pair of different vertices.\n\nFind the number of the edges that are not contained in any shortest path between any pair of different vertices.\n\nConstraints\n\n2≤N≤100\n\nN-1≤M≤min(N(N-1)/2,1000)\n\n1≤a_i,b_i≤N\n\n1≤c_i≤1000\n\nc_i is an integer.\n\nThe given graph contains neither self-loops nor double edges.\n\nThe given graph is connected.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_M b_M c_M\n\nOutput\n\nPrint the number of the edges in the graph that are not contained in any shortest path between any pair of different vertices.\n\nSample Input 1\n\n3 3\n1 2 1\n1 3 1\n2 3 3\n\nSample Output 1\n\n1\n\nIn the given graph, the shortest paths between all pairs of different vertices are as follows:\n\nThe shortest path from vertex 1 to vertex 2 is: vertex 1 → vertex 2, with the length of 1.\n\nThe shortest path from vertex 1 to vertex 3 is: vertex 1 → vertex 3, with the length of 1.\n\nThe shortest path from vertex 2 to vertex 1 is: vertex 2 → vertex 1, with the length of 1.\n\nThe shortest path from vertex 2 to vertex 3 is: vertex 2 → vertex 1 → vertex 3, with the length of 2.\n\nThe shortest path from vertex 3 to vertex 1 is: vertex 3 → vertex 1, with the length of 1.\n\nThe shortest path from vertex 3 to vertex 2 is: vertex 3 → vertex 1 → vertex 2, with the length of 2.\n\nThus, the only edge that is not contained in any shortest path, is the edge of length 3 connecting vertex 2 and vertex 3, hence the output should be 1.\n\nSample Input 2\n\n3 2\n1 2 1\n2 3 1\n\nSample Output 2\n\n0\n\nEvery edge is contained in some shortest path between some pair of different vertices.", "sample_input": "3 3\n1 2 1\n1 3 1\n2 3 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03837", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given an undirected connected weighted graph with N vertices and M edges that contains neither self-loops nor double edges.\n\nThe i-th (1≤i≤M) edge connects vertex a_i and vertex b_i with a distance of c_i.\n\nHere, a self-loop is an edge where a_i = b_i (1≤i≤M), and double edges are two edges where (a_i,b_i)=(a_j,b_j) or (a_i,b_i)=(b_j,a_j) (1≤i<j≤M).\n\nA connected graph is a graph where there is a path between every pair of different vertices.\n\nFind the number of the edges that are not contained in any shortest path between any pair of different vertices.\n\nConstraints\n\n2≤N≤100\n\nN-1≤M≤min(N(N-1)/2,1000)\n\n1≤a_i,b_i≤N\n\n1≤c_i≤1000\n\nc_i is an integer.\n\nThe given graph contains neither self-loops nor double edges.\n\nThe given graph is connected.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_M b_M c_M\n\nOutput\n\nPrint the number of the edges in the graph that are not contained in any shortest path between any pair of different vertices.\n\nSample Input 1\n\n3 3\n1 2 1\n1 3 1\n2 3 3\n\nSample Output 1\n\n1\n\nIn the given graph, the shortest paths between all pairs of different vertices are as follows:\n\nThe shortest path from vertex 1 to vertex 2 is: vertex 1 → vertex 2, with the length of 1.\n\nThe shortest path from vertex 1 to vertex 3 is: vertex 1 → vertex 3, with the length of 1.\n\nThe shortest path from vertex 2 to vertex 1 is: vertex 2 → vertex 1, with the length of 1.\n\nThe shortest path from vertex 2 to vertex 3 is: vertex 2 → vertex 1 → vertex 3, with the length of 2.\n\nThe shortest path from vertex 3 to vertex 1 is: vertex 3 → vertex 1, with the length of 1.\n\nThe shortest path from vertex 3 to vertex 2 is: vertex 3 → vertex 1 → vertex 2, with the length of 2.\n\nThus, the only edge that is not contained in any shortest path, is the edge of length 3 connecting vertex 2 and vertex 3, hence the output should be 1.\n\nSample Input 2\n\n3 2\n1 2 1\n2 3 1\n\nSample Output 2\n\n0\n\nEvery edge is contained in some shortest path between some pair of different vertices.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1208, "cpu_time_ms": 2105, "memory_kb": 41472}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s551855216", "group_id": "codeNet:p03837", "input_text": "module IntSet = Set.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet warshall_floyd ( + ) min n d =\n  for i = 0 to n - 1 do\n    for j = 0 to n - 1 do\n      for k = 0 to n - 1 do\n        d.(j).(k) <- min d.(j).(k) (d.(j).(i) + d.(i).(k))\n      done\n    done\n  done\n\nlet () =\n  let n, m = Scanf.scanf \"%d %d\\n\" (fun n m -> n, m) in\n  let dp = Array.make_matrix n n (infinity, IntSet.empty) in\n  for i = 0 to n - 1 do\n    dp.(i).(i) <- (0., IntSet.empty)\n  done;\n  for i = 0 to m - 1 do\n    Scanf.scanf \"%d %d %d\\n\" (fun a b c ->\n      dp.(a - 1).(b - 1) <- (float_of_int c, IntSet.singleton i);\n      dp.(b - 1).(a - 1) <- (float_of_int c, IntSet.singleton i))\n  done;\n  warshall_floyd\n    (fun (d, es) (d', es') -> (d +. d', IntSet.union es es'))\n    (fun (d, es) (d', es') ->\n      match compare d d' with\n      | -1 -> (d, es)\n      | 0  -> (d, IntSet.union es es')\n      | 1  -> (d', es')) n dp;\n  Array.map (fun dp ->\n    Array.map snd dp\n    |> Array.fold_left IntSet.union IntSet.empty) dp\n  |> Array.fold_left IntSet.union IntSet.empty\n  |> IntSet.cardinal\n  |> (fun n -> Printf.printf \"%d\\n\" (m - n))", "language": "OCaml", "metadata": {"date": 1515127692, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03837.html", "problem_id": "p03837", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03837/input.txt", "sample_output_relpath": "derived/input_output/data/p03837/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03837/OCaml/s551855216.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s551855216", "user_id": "u504158101"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "module IntSet = Set.Make (struct\n  type t = int\n  let compare = compare\nend)\n\nlet warshall_floyd ( + ) min n d =\n  for i = 0 to n - 1 do\n    for j = 0 to n - 1 do\n      for k = 0 to n - 1 do\n        d.(j).(k) <- min d.(j).(k) (d.(j).(i) + d.(i).(k))\n      done\n    done\n  done\n\nlet () =\n  let n, m = Scanf.scanf \"%d %d\\n\" (fun n m -> n, m) in\n  let dp = Array.make_matrix n n (infinity, IntSet.empty) in\n  for i = 0 to n - 1 do\n    dp.(i).(i) <- (0., IntSet.empty)\n  done;\n  for i = 0 to m - 1 do\n    Scanf.scanf \"%d %d %d\\n\" (fun a b c ->\n      dp.(a - 1).(b - 1) <- (float_of_int c, IntSet.singleton i);\n      dp.(b - 1).(a - 1) <- (float_of_int c, IntSet.singleton i))\n  done;\n  warshall_floyd\n    (fun (d, es) (d', es') -> (d +. d', IntSet.union es es'))\n    (fun (d, es) (d', es') ->\n      match compare d d' with\n      | -1 -> (d, es)\n      | 0  -> (d, IntSet.union es es')\n      | 1  -> (d', es')) n dp;\n  Array.map (fun dp ->\n    Array.map snd dp\n    |> Array.fold_left IntSet.union IntSet.empty) dp\n  |> Array.fold_left IntSet.union IntSet.empty\n  |> IntSet.cardinal\n  |> (fun n -> Printf.printf \"%d\\n\" (m - n))", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given an undirected connected weighted graph with N vertices and M edges that contains neither self-loops nor double edges.\n\nThe i-th (1≤i≤M) edge connects vertex a_i and vertex b_i with a distance of c_i.\n\nHere, a self-loop is an edge where a_i = b_i (1≤i≤M), and double edges are two edges where (a_i,b_i)=(a_j,b_j) or (a_i,b_i)=(b_j,a_j) (1≤i<j≤M).\n\nA connected graph is a graph where there is a path between every pair of different vertices.\n\nFind the number of the edges that are not contained in any shortest path between any pair of different vertices.\n\nConstraints\n\n2≤N≤100\n\nN-1≤M≤min(N(N-1)/2,1000)\n\n1≤a_i,b_i≤N\n\n1≤c_i≤1000\n\nc_i is an integer.\n\nThe given graph contains neither self-loops nor double edges.\n\nThe given graph is connected.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_M b_M c_M\n\nOutput\n\nPrint the number of the edges in the graph that are not contained in any shortest path between any pair of different vertices.\n\nSample Input 1\n\n3 3\n1 2 1\n1 3 1\n2 3 3\n\nSample Output 1\n\n1\n\nIn the given graph, the shortest paths between all pairs of different vertices are as follows:\n\nThe shortest path from vertex 1 to vertex 2 is: vertex 1 → vertex 2, with the length of 1.\n\nThe shortest path from vertex 1 to vertex 3 is: vertex 1 → vertex 3, with the length of 1.\n\nThe shortest path from vertex 2 to vertex 1 is: vertex 2 → vertex 1, with the length of 1.\n\nThe shortest path from vertex 2 to vertex 3 is: vertex 2 → vertex 1 → vertex 3, with the length of 2.\n\nThe shortest path from vertex 3 to vertex 1 is: vertex 3 → vertex 1, with the length of 1.\n\nThe shortest path from vertex 3 to vertex 2 is: vertex 3 → vertex 1 → vertex 2, with the length of 2.\n\nThus, the only edge that is not contained in any shortest path, is the edge of length 3 connecting vertex 2 and vertex 3, hence the output should be 1.\n\nSample Input 2\n\n3 2\n1 2 1\n2 3 1\n\nSample Output 2\n\n0\n\nEvery edge is contained in some shortest path between some pair of different vertices.", "sample_input": "3 3\n1 2 1\n1 3 1\n2 3 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03837", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given an undirected connected weighted graph with N vertices and M edges that contains neither self-loops nor double edges.\n\nThe i-th (1≤i≤M) edge connects vertex a_i and vertex b_i with a distance of c_i.\n\nHere, a self-loop is an edge where a_i = b_i (1≤i≤M), and double edges are two edges where (a_i,b_i)=(a_j,b_j) or (a_i,b_i)=(b_j,a_j) (1≤i<j≤M).\n\nA connected graph is a graph where there is a path between every pair of different vertices.\n\nFind the number of the edges that are not contained in any shortest path between any pair of different vertices.\n\nConstraints\n\n2≤N≤100\n\nN-1≤M≤min(N(N-1)/2,1000)\n\n1≤a_i,b_i≤N\n\n1≤c_i≤1000\n\nc_i is an integer.\n\nThe given graph contains neither self-loops nor double edges.\n\nThe given graph is connected.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_M b_M c_M\n\nOutput\n\nPrint the number of the edges in the graph that are not contained in any shortest path between any pair of different vertices.\n\nSample Input 1\n\n3 3\n1 2 1\n1 3 1\n2 3 3\n\nSample Output 1\n\n1\n\nIn the given graph, the shortest paths between all pairs of different vertices are as follows:\n\nThe shortest path from vertex 1 to vertex 2 is: vertex 1 → vertex 2, with the length of 1.\n\nThe shortest path from vertex 1 to vertex 3 is: vertex 1 → vertex 3, with the length of 1.\n\nThe shortest path from vertex 2 to vertex 1 is: vertex 2 → vertex 1, with the length of 1.\n\nThe shortest path from vertex 2 to vertex 3 is: vertex 2 → vertex 1 → vertex 3, with the length of 2.\n\nThe shortest path from vertex 3 to vertex 1 is: vertex 3 → vertex 1, with the length of 1.\n\nThe shortest path from vertex 3 to vertex 2 is: vertex 3 → vertex 1 → vertex 2, with the length of 2.\n\nThus, the only edge that is not contained in any shortest path, is the edge of length 3 connecting vertex 2 and vertex 3, hence the output should be 1.\n\nSample Input 2\n\n3 2\n1 2 1\n2 3 1\n\nSample Output 2\n\n0\n\nEvery edge is contained in some shortest path between some pair of different vertices.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1120, "cpu_time_ms": 2105, "memory_kb": 35768}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s780093444", "group_id": "codeNet:p03838", "input_text": "Scanf.scanf \" %d %d\" @@ fun x y -> List.fold_left (fun m (x, y, b) -> min m @@ if x <= y then y - x + b else m) max_int [x, y, 0; -x, y, 1; x, -y, 1; -x, -y, 2] |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1576878105, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s780093444.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s780093444", "user_id": "u732304692"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "Scanf.scanf \" %d %d\" @@ fun x y -> List.fold_left (fun m (x, y, b) -> min m @@ if x <= y then y - x + b else m) max_int [x, y, 0; -x, y, 1; x, -y, 1; -x, -y, 2] |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has a calculator. It has a display and two buttons.\n\nInitially, the display shows an integer x.\nSnuke wants to change this value into another integer y, by pressing the following two buttons some number of times in arbitrary order:\n\nButton A: When pressed, the value on the display is incremented by 1.\n\nButton B: When pressed, the sign of the value on the display is reversed.\n\nFind the minimum number of times Snuke needs to press the buttons to achieve his objective.\nIt can be shown that the objective is always achievable regardless of the values of the integers x and y.\n\nConstraints\n\nx and y are integers.\n\n|x|, |y| ≤ 10^9\n\nx and y are different.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx y\n\nOutput\n\nPrint the minimum number of times Snuke needs to press the buttons to achieve his objective.\n\nSample Input 1\n\n10 20\n\nSample Output 1\n\n10\n\nPress button A ten times.\n\nSample Input 2\n\n10 -10\n\nSample Output 2\n\n1\n\nPress button B once.\n\nSample Input 3\n\n-10 -20\n\nSample Output 3\n\n12\n\nPress the buttons as follows:\n\nPress button B once.\n\nPress button A ten times.\n\nPress button B once.", "sample_input": "10 20\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03838", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has a calculator. It has a display and two buttons.\n\nInitially, the display shows an integer x.\nSnuke wants to change this value into another integer y, by pressing the following two buttons some number of times in arbitrary order:\n\nButton A: When pressed, the value on the display is incremented by 1.\n\nButton B: When pressed, the sign of the value on the display is reversed.\n\nFind the minimum number of times Snuke needs to press the buttons to achieve his objective.\nIt can be shown that the objective is always achievable regardless of the values of the integers x and y.\n\nConstraints\n\nx and y are integers.\n\n|x|, |y| ≤ 10^9\n\nx and y are different.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx y\n\nOutput\n\nPrint the minimum number of times Snuke needs to press the buttons to achieve his objective.\n\nSample Input 1\n\n10 20\n\nSample Output 1\n\n10\n\nPress button A ten times.\n\nSample Input 2\n\n10 -10\n\nSample Output 2\n\n1\n\nPress button B once.\n\nSample Input 3\n\n-10 -20\n\nSample Output 3\n\n12\n\nPress the buttons as follows:\n\nPress button B once.\n\nPress button A ten times.\n\nPress button B once.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 184, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s017798717", "group_id": "codeNet:p03838", "input_text": "let x, y, d, z = Scanf.scanf \" %d %d\" @@ fun a b -> a, b, abs b - abs a, ref a\nlet c = if d < 0 then (z := -(abs x + d); if x < 0 then -d else -d + 1) else if d > 0 then (z := abs x + d; if x < 0 then d + 1 else d) else 0\nlet _ = Printf.printf \"%d\\n\" @@ if !z = y then c else c + 1", "language": "OCaml", "metadata": {"date": 1576870247, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s017798717.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s017798717", "user_id": "u732304692"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let x, y, d, z = Scanf.scanf \" %d %d\" @@ fun a b -> a, b, abs b - abs a, ref a\nlet c = if d < 0 then (z := -(abs x + d); if x < 0 then -d else -d + 1) else if d > 0 then (z := abs x + d; if x < 0 then d + 1 else d) else 0\nlet _ = Printf.printf \"%d\\n\" @@ if !z = y then c else c + 1", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 281, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s501509311", "group_id": "codeNet:p03844", "input_text": "Scanf.scanf \"%d %c %d\" (fun a op b -> print_int (if op = '+' then a+b else a-b))", "language": "OCaml", "metadata": {"date": 1582706586, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s501509311.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s501509311", "user_id": "u752907799"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "Scanf.scanf \"%d %c %d\" (fun a op b -> print_int (if op = '+' then a+b else a-b))", "problem_context": "Score : 100 points\n\nProblem Statement\n\nJoisino wants to evaluate the formula \"A op B\".\nHere, A and B are integers, and the binary operator op is either + or -.\nYour task is to evaluate the formula instead of her.\n\nConstraints\n\n1≦A,B≦10^9\n\nop is either + or -.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA op B\n\nOutput\n\nEvaluate the formula and print the result.\n\nSample Input 1\n\n1 + 2\n\nSample Output 1\n\n3\n\nSince 1 + 2 = 3, the output should be 3.\n\nSample Input 2\n\n5 - 7\n\nSample Output 2\n\n-2", "sample_input": "1 + 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03844", "source_text": "Score : 100 points\n\nProblem Statement\n\nJoisino wants to evaluate the formula \"A op B\".\nHere, A and B are integers, and the binary operator op is either + or -.\nYour task is to evaluate the formula instead of her.\n\nConstraints\n\n1≦A,B≦10^9\n\nop is either + or -.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA op B\n\nOutput\n\nEvaluate the formula and print the result.\n\nSample Input 1\n\n1 + 2\n\nSample Output 1\n\n3\n\nSince 1 + 2 = 3, the output should be 3.\n\nSample Input 2\n\n5 - 7\n\nSample Output 2\n\n-2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 80, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s599388360", "group_id": "codeNet:p03845", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let t = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun t -> t)) in\n    let sum = Array.fold_left (+) 0 t in\n    Scanf.scanf \" %d\" (fun m ->\n        for i = 1 to m do\n            Scanf.scanf \" %d %d\" (fun p x ->\n                let p = p - 1 in\n                Printf.printf \"%d\\n\" @@ sum + x - t.(p)\n            )\n        done\n    )\n)", "language": "OCaml", "metadata": {"date": 1597721751, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s599388360.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s599388360", "user_id": "u342443598"}, "prompt_components": {"gold_output": "6\n9\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let t = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun t -> t)) in\n    let sum = Array.fold_left (+) 0 t in\n    Scanf.scanf \" %d\" (fun m ->\n        for i = 1 to m do\n            Scanf.scanf \" %d %d\" (fun p x ->\n                let p = p - 1 in\n                Printf.printf \"%d\\n\" @@ sum + x - t.(p)\n            )\n        done\n    )\n)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nJoisino is about to compete in the final round of a certain programming competition.\nIn this contest, there are N problems, numbered 1 through N.\nJoisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).\n\nAlso, there are M kinds of drinks offered to the contestants, numbered 1 through M.\nIf Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds.\nIt does not affect the time to solve the other problems.\n\nA contestant is allowed to take exactly one of the drinks before the start of the contest.\nFor each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink.\nHere, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems.\nYour task is to write a program to calculate it instead of her.\n\nConstraints\n\nAll input values are integers.\n\n1≦N≦100\n\n1≦T_i≦10^5\n\n1≦M≦100\n\n1≦P_i≦N\n\n1≦X_i≦10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nT_1 T_2 ... T_N\nM\nP_1 X_1\nP_2 X_2\n:\nP_M X_M\n\nOutput\n\nFor each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.\n\nSample Input 1\n\n3\n2 1 4\n2\n1 1\n2 3\n\nSample Output 1\n\n6\n9\n\nIf Joisino takes drink 1, the time it takes her to solve each problem will be 1, 1 and 4 seconds, respectively, totaling 6 seconds.\n\nIf Joisino takes drink 2, the time it takes her to solve each problem will be 2, 3 and 4 seconds, respectively, totaling 9 seconds.\n\nSample Input 2\n\n5\n7 2 3 8 5\n3\n4 2\n1 7\n4 13\n\nSample Output 2\n\n19\n25\n30", "sample_input": "3\n2 1 4\n2\n1 1\n2 3\n"}, "reference_outputs": ["6\n9\n"], "source_document_id": "p03845", "source_text": "Score : 200 points\n\nProblem Statement\n\nJoisino is about to compete in the final round of a certain programming competition.\nIn this contest, there are N problems, numbered 1 through N.\nJoisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).\n\nAlso, there are M kinds of drinks offered to the contestants, numbered 1 through M.\nIf Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds.\nIt does not affect the time to solve the other problems.\n\nA contestant is allowed to take exactly one of the drinks before the start of the contest.\nFor each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink.\nHere, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems.\nYour task is to write a program to calculate it instead of her.\n\nConstraints\n\nAll input values are integers.\n\n1≦N≦100\n\n1≦T_i≦10^5\n\n1≦M≦100\n\n1≦P_i≦N\n\n1≦X_i≦10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nT_1 T_2 ... T_N\nM\nP_1 X_1\nP_2 X_2\n:\nP_M X_M\n\nOutput\n\nFor each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.\n\nSample Input 1\n\n3\n2 1 4\n2\n1 1\n2 3\n\nSample Output 1\n\n6\n9\n\nIf Joisino takes drink 1, the time it takes her to solve each problem will be 1, 1 and 4 seconds, respectively, totaling 6 seconds.\n\nIf Joisino takes drink 2, the time it takes her to solve each problem will be 2, 3 and 4 seconds, respectively, totaling 9 seconds.\n\nSample Input 2\n\n5\n7 2 3 8 5\n3\n4 2\n1 7\n4 13\n\nSample Output 2\n\n19\n25\n30", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 364, "cpu_time_ms": 8, "memory_kb": 3868}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s239647699", "group_id": "codeNet:p03845", "input_text": "open Scanf\nlet () =\n  let xs = scanf \" %d\" (fun n -> Array.init n (fun _ -> scanf \" %d\" (fun t -> t))) in\n  let total = Array.fold_left (+) 0 xs in\n  scanf \" %d\" (fun m -> Array.init m (fun _ -> scanf \" %d %d\" (fun p u -> p, u)))\n  |> Array.iter (fun (p, u) -> Printf.printf \"%d\\n\" (total + (u - xs.(p-1))))\n", "language": "OCaml", "metadata": {"date": 1519722219, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s239647699.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s239647699", "user_id": "u798181098"}, "prompt_components": {"gold_output": "6\n9\n", "input_to_evaluate": "open Scanf\nlet () =\n  let xs = scanf \" %d\" (fun n -> Array.init n (fun _ -> scanf \" %d\" (fun t -> t))) in\n  let total = Array.fold_left (+) 0 xs in\n  scanf \" %d\" (fun m -> Array.init m (fun _ -> scanf \" %d %d\" (fun p u -> p, u)))\n  |> Array.iter (fun (p, u) -> Printf.printf \"%d\\n\" (total + (u - xs.(p-1))))\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nJoisino is about to compete in the final round of a certain programming competition.\nIn this contest, there are N problems, numbered 1 through N.\nJoisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).\n\nAlso, there are M kinds of drinks offered to the contestants, numbered 1 through M.\nIf Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds.\nIt does not affect the time to solve the other problems.\n\nA contestant is allowed to take exactly one of the drinks before the start of the contest.\nFor each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink.\nHere, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems.\nYour task is to write a program to calculate it instead of her.\n\nConstraints\n\nAll input values are integers.\n\n1≦N≦100\n\n1≦T_i≦10^5\n\n1≦M≦100\n\n1≦P_i≦N\n\n1≦X_i≦10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nT_1 T_2 ... T_N\nM\nP_1 X_1\nP_2 X_2\n:\nP_M X_M\n\nOutput\n\nFor each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.\n\nSample Input 1\n\n3\n2 1 4\n2\n1 1\n2 3\n\nSample Output 1\n\n6\n9\n\nIf Joisino takes drink 1, the time it takes her to solve each problem will be 1, 1 and 4 seconds, respectively, totaling 6 seconds.\n\nIf Joisino takes drink 2, the time it takes her to solve each problem will be 2, 3 and 4 seconds, respectively, totaling 9 seconds.\n\nSample Input 2\n\n5\n7 2 3 8 5\n3\n4 2\n1 7\n4 13\n\nSample Output 2\n\n19\n25\n30", "sample_input": "3\n2 1 4\n2\n1 1\n2 3\n"}, "reference_outputs": ["6\n9\n"], "source_document_id": "p03845", "source_text": "Score : 200 points\n\nProblem Statement\n\nJoisino is about to compete in the final round of a certain programming competition.\nIn this contest, there are N problems, numbered 1 through N.\nJoisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).\n\nAlso, there are M kinds of drinks offered to the contestants, numbered 1 through M.\nIf Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds.\nIt does not affect the time to solve the other problems.\n\nA contestant is allowed to take exactly one of the drinks before the start of the contest.\nFor each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink.\nHere, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems.\nYour task is to write a program to calculate it instead of her.\n\nConstraints\n\nAll input values are integers.\n\n1≦N≦100\n\n1≦T_i≦10^5\n\n1≦M≦100\n\n1≦P_i≦N\n\n1≦X_i≦10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nT_1 T_2 ... T_N\nM\nP_1 X_1\nP_2 X_2\n:\nP_M X_M\n\nOutput\n\nFor each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.\n\nSample Input 1\n\n3\n2 1 4\n2\n1 1\n2 3\n\nSample Output 1\n\n6\n9\n\nIf Joisino takes drink 1, the time it takes her to solve each problem will be 1, 1 and 4 seconds, respectively, totaling 6 seconds.\n\nIf Joisino takes drink 2, the time it takes her to solve each problem will be 2, 3 and 4 seconds, respectively, totaling 9 seconds.\n\nSample Input 2\n\n5\n7 2 3 8 5\n3\n4 2\n1 7\n4 13\n\nSample Output 2\n\n19\n25\n30", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 308, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s575736506", "group_id": "codeNet:p03846", "input_text": "let n = read_int ()\nlet cs = Array.make n 0\nlet rec f n a = if n <= 0 then a else f (n - 1) (2 * a mod 1000000007)\nlet _ = for i = 1 to n do Scanf.scanf \" %d\" @@ fun a -> cs.(a / 2) <- cs.(a / 2) + 1 done; for i = 0 to n / 2 + n mod 2 - 1 do if i = 0 && cs.(i) <> 2 - n mod 2 || i > 0 && cs.(i) <> 2 then (print_endline \"0\"; exit 0) done; Printf.printf \"%d\\n\" @@ f (n / 2) 1", "language": "OCaml", "metadata": {"date": 1579951941, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s575736506.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s575736506", "user_id": "u732304692"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let n = read_int ()\nlet cs = Array.make n 0\nlet rec f n a = if n <= 0 then a else f (n - 1) (2 * a mod 1000000007)\nlet _ = for i = 1 to n do Scanf.scanf \" %d\" @@ fun a -> cs.(a / 2) <- cs.(a / 2) + 1 done; for i = 0 to n / 2 + n mod 2 - 1 do if i = 0 && cs.(i) <> 2 - n mod 2 || i > 0 && cs.(i) <> 2 then (print_endline \"0\"; exit 0) done; Printf.printf \"%d\\n\" @@ f (n / 2) 1", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N people, conveniently numbered 1 through N.\nThey were standing in a row yesterday, but now they are unsure of the order in which they were standing.\nHowever, each person remembered the following fact: the absolute difference of the number of the people who were standing to the left of that person, and the number of the people who were standing to the right of that person.\nAccording to their reports, the difference above for person i is A_i.\n\nBased on these reports, find the number of the possible orders in which they were standing.\nSince it can be extremely large, print the answer modulo 10^9+7.\nNote that the reports may be incorrect and thus there may be no consistent order.\nIn such a case, print 0.\n\nConstraints\n\n1≦N≦10^5\n\n0≦A_i≦N-1\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of the possible orders in which they were standing, modulo 10^9+7.\n\nSample Input 1\n\n5\n2 4 4 0 2\n\nSample Output 1\n\n4\n\nThere are four possible orders, as follows:\n\n2,1,4,5,3\n\n2,5,4,1,3\n\n3,1,4,5,2\n\n3,5,4,1,2\n\nSample Input 2\n\n7\n6 4 0 2 4 0 2\n\nSample Output 2\n\n0\n\nAny order would be inconsistent with the reports, thus the answer is 0.\n\nSample Input 3\n\n8\n7 5 1 1 7 3 5 3\n\nSample Output 3\n\n16", "sample_input": "5\n2 4 4 0 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03846", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N people, conveniently numbered 1 through N.\nThey were standing in a row yesterday, but now they are unsure of the order in which they were standing.\nHowever, each person remembered the following fact: the absolute difference of the number of the people who were standing to the left of that person, and the number of the people who were standing to the right of that person.\nAccording to their reports, the difference above for person i is A_i.\n\nBased on these reports, find the number of the possible orders in which they were standing.\nSince it can be extremely large, print the answer modulo 10^9+7.\nNote that the reports may be incorrect and thus there may be no consistent order.\nIn such a case, print 0.\n\nConstraints\n\n1≦N≦10^5\n\n0≦A_i≦N-1\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of the possible orders in which they were standing, modulo 10^9+7.\n\nSample Input 1\n\n5\n2 4 4 0 2\n\nSample Output 1\n\n4\n\nThere are four possible orders, as follows:\n\n2,1,4,5,3\n\n2,5,4,1,3\n\n3,1,4,5,2\n\n3,5,4,1,2\n\nSample Input 2\n\n7\n6 4 0 2 4 0 2\n\nSample Output 2\n\n0\n\nAny order would be inconsistent with the reports, thus the answer is 0.\n\nSample Input 3\n\n8\n7 5 1 1 7 3 5 3\n\nSample Output 3\n\n16", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 374, "cpu_time_ms": 25, "memory_kb": 5120}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s986529360", "group_id": "codeNet:p03852", "input_text": "print_endline @@ if String.contains \"aeiou\" (read_line ()).[0] then \"vowel\" else \"consonant\"", "language": "OCaml", "metadata": {"date": 1579225668, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s986529360.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s986529360", "user_id": "u732304692"}, "prompt_components": {"gold_output": "vowel\n", "input_to_evaluate": "print_endline @@ if String.contains \"aeiou\" (read_line ()).[0] then \"vowel\" else \"consonant\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven a lowercase English letter c, determine whether it is a vowel. Here, there are five vowels in the English alphabet: a, e, i, o and u.\n\nConstraints\n\nc is a lowercase English letter.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nc\n\nOutput\n\nIf c is a vowel, print vowel. Otherwise, print consonant.\n\nSample Input 1\n\na\n\nSample Output 1\n\nvowel\n\nSince a is a vowel, print vowel.\n\nSample Input 2\n\nz\n\nSample Output 2\n\nconsonant\n\nSample Input 3\n\ns\n\nSample Output 3\n\nconsonant", "sample_input": "a\n"}, "reference_outputs": ["vowel\n"], "source_document_id": "p03852", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven a lowercase English letter c, determine whether it is a vowel. Here, there are five vowels in the English alphabet: a, e, i, o and u.\n\nConstraints\n\nc is a lowercase English letter.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nc\n\nOutput\n\nIf c is a vowel, print vowel. Otherwise, print consonant.\n\nSample Input 1\n\na\n\nSample Output 1\n\nvowel\n\nSince a is a vowel, print vowel.\n\nSample Input 2\n\nz\n\nSample Output 2\n\nconsonant\n\nSample Input 3\n\ns\n\nSample Output 3\n\nconsonant", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 92, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s198487588", "group_id": "codeNet:p03853", "input_text": "let () = Scanf.scanf \"%d %d\\n\" @@ fun h w ->\n  let css = Array.init h @@ fun _ ->\n    Scanf.scanf \"%s\\n\" @@ fun cs -> cs in\n  Array.iter (fun cs ->\n    print_endline cs;\n    print_endline cs) css\n", "language": "OCaml", "metadata": {"date": 1530678954, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s198487588.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s198487588", "user_id": "u504158101"}, "prompt_components": {"gold_output": "*.\n*.\n.*\n.*\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\\n\" @@ fun h w ->\n  let css = Array.init h @@ fun _ ->\n    Scanf.scanf \"%s\\n\" @@ fun cs -> cs in\n  Array.iter (fun cs ->\n    print_endline cs;\n    print_endline cs) css\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere is an image with a height of H pixels and a width of W pixels. Each of the pixels is represented by either . or *. The character representing the pixel at the i-th row from the top and the j-th column from the left, is denoted by C_{i,j}.\n\nExtend this image vertically so that its height is doubled. That is, print a image with a height of 2H pixels and a width of W pixels where the pixel at the i-th row and j-th column is equal to C_{(i+1)/2,j} (the result of division is rounded down).\n\nConstraints\n\n1≦H, W≦100\n\nC_{i,j} is either . or *.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W\nC_{1,1}...C_{1,W}\n:\nC_{H,1}...C_{H,W}\n\nOutput\n\nPrint the extended image.\n\nSample Input 1\n\n2 2\n*.\n.*\n\nSample Output 1\n\n*.\n*.\n.*\n.*\n\nSample Input 2\n\n1 4\n***.\n\nSample Output 2\n\n***.\n***.\n\nSample Input 3\n\n9 20\n.....***....***.....\n....*...*..*...*....\n...*.....**.....*...\n...*.....*......*...\n....*.....*....*....\n.....**..*...**.....\n.......*..*.*.......\n........**.*........\n.........**.........\n\nSample Output 3\n\n.....***....***.....\n.....***....***.....\n....*...*..*...*....\n....*...*..*...*....\n...*.....**.....*...\n...*.....**.....*...\n...*.....*......*...\n...*.....*......*...\n....*.....*....*....\n....*.....*....*....\n.....**..*...**.....\n.....**..*...**.....\n.......*..*.*.......\n.......*..*.*.......\n........**.*........\n........**.*........\n.........**.........\n.........**.........", "sample_input": "2 2\n*.\n.*\n"}, "reference_outputs": ["*.\n*.\n.*\n.*\n"], "source_document_id": "p03853", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere is an image with a height of H pixels and a width of W pixels. Each of the pixels is represented by either . or *. The character representing the pixel at the i-th row from the top and the j-th column from the left, is denoted by C_{i,j}.\n\nExtend this image vertically so that its height is doubled. That is, print a image with a height of 2H pixels and a width of W pixels where the pixel at the i-th row and j-th column is equal to C_{(i+1)/2,j} (the result of division is rounded down).\n\nConstraints\n\n1≦H, W≦100\n\nC_{i,j} is either . or *.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W\nC_{1,1}...C_{1,W}\n:\nC_{H,1}...C_{H,W}\n\nOutput\n\nPrint the extended image.\n\nSample Input 1\n\n2 2\n*.\n.*\n\nSample Output 1\n\n*.\n*.\n.*\n.*\n\nSample Input 2\n\n1 4\n***.\n\nSample Output 2\n\n***.\n***.\n\nSample Input 3\n\n9 20\n.....***....***.....\n....*...*..*...*....\n...*.....**.....*...\n...*.....*......*...\n....*.....*....*....\n.....**..*...**.....\n.......*..*.*.......\n........**.*........\n.........**.........\n\nSample Output 3\n\n.....***....***.....\n.....***....***.....\n....*...*..*...*....\n....*...*..*...*....\n...*.....**.....*...\n...*.....**.....*...\n...*.....*......*...\n...*.....*......*...\n....*.....*....*....\n....*.....*....*....\n.....**..*...**.....\n.....**..*...**.....\n.......*..*.*.......\n.......*..*.*.......\n........**.*........\n........**.*........\n.........**.........\n.........**.........", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 196, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s974016390", "group_id": "codeNet:p03853", "input_text": "let read h =\n\tlet rec f img = function\n\t\t| 0 -> img\n\t\t| n ->\n\t\t\tlet line = read_line () in\n\t\t\tf (line::line::img) (n - 1)\n\tin f [] h |> List.rev\n\nlet rec print = function\n\t| [] -> () \n\t| x::xs -> print_string x;print_newline ();print xs\n\nlet _ =\n\tScanf.scanf \"%d %d\" (fun h w -> read h) |> print \n", "language": "OCaml", "metadata": {"date": 1481431287, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s974016390.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s974016390", "user_id": "u604818425"}, "prompt_components": {"gold_output": "*.\n*.\n.*\n.*\n", "input_to_evaluate": "let read h =\n\tlet rec f img = function\n\t\t| 0 -> img\n\t\t| n ->\n\t\t\tlet line = read_line () in\n\t\t\tf (line::line::img) (n - 1)\n\tin f [] h |> List.rev\n\nlet rec print = function\n\t| [] -> () \n\t| x::xs -> print_string x;print_newline ();print xs\n\nlet _ =\n\tScanf.scanf \"%d %d\" (fun h w -> read h) |> print \n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere is an image with a height of H pixels and a width of W pixels. Each of the pixels is represented by either . or *. The character representing the pixel at the i-th row from the top and the j-th column from the left, is denoted by C_{i,j}.\n\nExtend this image vertically so that its height is doubled. That is, print a image with a height of 2H pixels and a width of W pixels where the pixel at the i-th row and j-th column is equal to C_{(i+1)/2,j} (the result of division is rounded down).\n\nConstraints\n\n1≦H, W≦100\n\nC_{i,j} is either . or *.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W\nC_{1,1}...C_{1,W}\n:\nC_{H,1}...C_{H,W}\n\nOutput\n\nPrint the extended image.\n\nSample Input 1\n\n2 2\n*.\n.*\n\nSample Output 1\n\n*.\n*.\n.*\n.*\n\nSample Input 2\n\n1 4\n***.\n\nSample Output 2\n\n***.\n***.\n\nSample Input 3\n\n9 20\n.....***....***.....\n....*...*..*...*....\n...*.....**.....*...\n...*.....*......*...\n....*.....*....*....\n.....**..*...**.....\n.......*..*.*.......\n........**.*........\n.........**.........\n\nSample Output 3\n\n.....***....***.....\n.....***....***.....\n....*...*..*...*....\n....*...*..*...*....\n...*.....**.....*...\n...*.....**.....*...\n...*.....*......*...\n...*.....*......*...\n....*.....*....*....\n....*.....*....*....\n.....**..*...**.....\n.....**..*...**.....\n.......*..*.*.......\n.......*..*.*.......\n........**.*........\n........**.*........\n.........**.........\n.........**.........", "sample_input": "2 2\n*.\n.*\n"}, "reference_outputs": ["*.\n*.\n.*\n.*\n"], "source_document_id": "p03853", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere is an image with a height of H pixels and a width of W pixels. Each of the pixels is represented by either . or *. The character representing the pixel at the i-th row from the top and the j-th column from the left, is denoted by C_{i,j}.\n\nExtend this image vertically so that its height is doubled. That is, print a image with a height of 2H pixels and a width of W pixels where the pixel at the i-th row and j-th column is equal to C_{(i+1)/2,j} (the result of division is rounded down).\n\nConstraints\n\n1≦H, W≦100\n\nC_{i,j} is either . or *.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W\nC_{1,1}...C_{1,W}\n:\nC_{H,1}...C_{H,W}\n\nOutput\n\nPrint the extended image.\n\nSample Input 1\n\n2 2\n*.\n.*\n\nSample Output 1\n\n*.\n*.\n.*\n.*\n\nSample Input 2\n\n1 4\n***.\n\nSample Output 2\n\n***.\n***.\n\nSample Input 3\n\n9 20\n.....***....***.....\n....*...*..*...*....\n...*.....**.....*...\n...*.....*......*...\n....*.....*....*....\n.....**..*...**.....\n.......*..*.*.......\n........**.*........\n.........**.........\n\nSample Output 3\n\n.....***....***.....\n.....***....***.....\n....*...*..*...*....\n....*...*..*...*....\n...*.....**.....*...\n...*.....**.....*...\n...*.....*......*...\n...*.....*......*...\n....*.....*....*....\n....*.....*....*....\n.....**..*...**.....\n.....**..*...**.....\n.......*..*.*.......\n.......*..*.*.......\n........**.*........\n........**.*........\n.........**.........\n.........**.........", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 297, "cpu_time_ms": 2, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s103018268", "group_id": "codeNet:p03855", "input_text": "module M = Map.Make(struct type t = int * int let compare = compare end)\nlet inc k m = try M.add k (1 + M.find k m) m with Not_found -> M.add k 1 m\n\nlet init n = Array.make n (-1)\nlet rec find x p =\n  if p.(x) < 0 then x\n  else let x' = find p.(x) p in p.(x) <- x'; x'\nlet unite x y p =\n  let x', y' = find x p, find y p in\n  if x' = y' then () else begin\n    if p.(x') < p.(y') then begin\n      p.(x') <- p.(x') + p.(y'); p.(y') <- x';\n    end else begin\n      p.(y') <- p.(x') + p.(y'); p.(x') <- y';\n    end\n  end\nlet size x p = - p.(find x p)\n\nlet () =\n  Scanf.scanf \"%d %d %d\" @@ fun n k l ->\n  let e0 = Array.init k (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x-1, y-1)) in\n  let e1 = Array.init l (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x-1, y-1)) in\n  let uf0, uf1, uf2  = init n, init n, init n in\n  e0 |> Array.iter (fun (u, v) -> unite u v uf0);\n  e1 |> Array.iter (fun (u, v) -> unite u v uf1);\n  let g = Array.init n (fun i -> (find i uf0, find i uf1)) in\n  let m = Array.fold_left (fun m (i, j) -> inc (i, j) m) M.empty g in\n  g |> Array.iter (fun p -> M.find p m |> Printf.printf \"%d \");\n  print_newline ()\n", "language": "OCaml", "metadata": {"date": 1531988376, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03855.html", "problem_id": "p03855", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03855/input.txt", "sample_output_relpath": "derived/input_output/data/p03855/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03855/OCaml/s103018268.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s103018268", "user_id": "u798181098"}, "prompt_components": {"gold_output": "1 2 2 1\n", "input_to_evaluate": "module M = Map.Make(struct type t = int * int let compare = compare end)\nlet inc k m = try M.add k (1 + M.find k m) m with Not_found -> M.add k 1 m\n\nlet init n = Array.make n (-1)\nlet rec find x p =\n  if p.(x) < 0 then x\n  else let x' = find p.(x) p in p.(x) <- x'; x'\nlet unite x y p =\n  let x', y' = find x p, find y p in\n  if x' = y' then () else begin\n    if p.(x') < p.(y') then begin\n      p.(x') <- p.(x') + p.(y'); p.(y') <- x';\n    end else begin\n      p.(y') <- p.(x') + p.(y'); p.(x') <- y';\n    end\n  end\nlet size x p = - p.(find x p)\n\nlet () =\n  Scanf.scanf \"%d %d %d\" @@ fun n k l ->\n  let e0 = Array.init k (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x-1, y-1)) in\n  let e1 = Array.init l (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x-1, y-1)) in\n  let uf0, uf1, uf2  = init n, init n, init n in\n  e0 |> Array.iter (fun (u, v) -> unite u v uf0);\n  e1 |> Array.iter (fun (u, v) -> unite u v uf1);\n  let g = Array.init n (fun i -> (find i uf0, find i uf1)) in\n  let m = Array.fold_left (fun m (i, j) -> inc (i, j) m) M.empty g in\n  g |> Array.iter (fun p -> M.find p m |> Printf.printf \"%d \");\n  print_newline ()\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N cities. There are also K roads and L railways, extending between the cities.\nThe i-th road bidirectionally connects the p_i-th and q_i-th cities, and the i-th railway bidirectionally connects the r_i-th and s_i-th cities.\nNo two roads connect the same pair of cities. Similarly, no two railways connect the same pair of cities.\n\nWe will say city A and B are connected by roads if city B is reachable from city A by traversing some number of roads. Here, any city is considered to be connected to itself by roads.\nWe will also define connectivity by railways similarly.\n\nFor each city, find the number of the cities connected to that city by both roads and railways.\n\nConstraints\n\n2 ≦ N ≦ 2*10^5\n\n1 ≦ K, L≦ 10^5\n\n1 ≦ p_i, q_i, r_i, s_i ≦ N\n\np_i < q_i\n\nr_i < s_i\n\nWhen i ≠ j, (p_i, q_i) ≠ (p_j, q_j)\n\nWhen i ≠ j, (r_i, s_i) ≠ (r_j, s_j)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K L\np_1 q_1\n:\np_K q_K\nr_1 s_1\n:\nr_L s_L\n\nOutput\n\nPrint N integers. The i-th of them should represent the number of the cities connected to the i-th city by both roads and railways.\n\nSample Input 1\n\n4 3 1\n1 2\n2 3\n3 4\n2 3\n\nSample Output 1\n\n1 2 2 1\n\nAll the four cities are connected to each other by roads.\n\nBy railways, only the second and third cities are connected. Thus, the answers for the cities are 1, 2, 2 and 1, respectively.\n\nSample Input 2\n\n4 2 2\n1 2\n2 3\n1 4\n2 3\n\nSample Output 2\n\n1 2 2 1\n\nSample Input 3\n\n7 4 4\n1 2\n2 3\n2 5\n6 7\n3 5\n4 5\n3 4\n6 7\n\nSample Output 3\n\n1 1 2 1 2 2 2", "sample_input": "4 3 1\n1 2\n2 3\n3 4\n2 3\n"}, "reference_outputs": ["1 2 2 1\n"], "source_document_id": "p03855", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N cities. There are also K roads and L railways, extending between the cities.\nThe i-th road bidirectionally connects the p_i-th and q_i-th cities, and the i-th railway bidirectionally connects the r_i-th and s_i-th cities.\nNo two roads connect the same pair of cities. Similarly, no two railways connect the same pair of cities.\n\nWe will say city A and B are connected by roads if city B is reachable from city A by traversing some number of roads. Here, any city is considered to be connected to itself by roads.\nWe will also define connectivity by railways similarly.\n\nFor each city, find the number of the cities connected to that city by both roads and railways.\n\nConstraints\n\n2 ≦ N ≦ 2*10^5\n\n1 ≦ K, L≦ 10^5\n\n1 ≦ p_i, q_i, r_i, s_i ≦ N\n\np_i < q_i\n\nr_i < s_i\n\nWhen i ≠ j, (p_i, q_i) ≠ (p_j, q_j)\n\nWhen i ≠ j, (r_i, s_i) ≠ (r_j, s_j)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K L\np_1 q_1\n:\np_K q_K\nr_1 s_1\n:\nr_L s_L\n\nOutput\n\nPrint N integers. The i-th of them should represent the number of the cities connected to the i-th city by both roads and railways.\n\nSample Input 1\n\n4 3 1\n1 2\n2 3\n3 4\n2 3\n\nSample Output 1\n\n1 2 2 1\n\nAll the four cities are connected to each other by roads.\n\nBy railways, only the second and third cities are connected. Thus, the answers for the cities are 1, 2, 2 and 1, respectively.\n\nSample Input 2\n\n4 2 2\n1 2\n2 3\n1 4\n2 3\n\nSample Output 2\n\n1 2 2 1\n\nSample Input 3\n\n7 4 4\n1 2\n2 3\n2 5\n6 7\n3 5\n4 5\n3 4\n6 7\n\nSample Output 3\n\n1 1 2 1 2 2 2", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1124, "cpu_time_ms": 528, "memory_kb": 23964}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s923848583", "group_id": "codeNet:p03860", "input_text": "Scanf.scanf \"%s %s\" @@ fun _ s -> Printf.printf \"A%cC\\n\" s.[0]", "language": "OCaml", "metadata": {"date": 1579226080, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s923848583.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s923848583", "user_id": "u732304692"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "Scanf.scanf \"%s %s\" @@ fun _ s -> Printf.printf \"A%cC\\n\" s.[0]", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "sample_input": "AtCoder Beginner Contest\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03860", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 62, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s683424039", "group_id": "codeNet:p03860", "input_text": "let () =\n  Scanf.scanf \"AtCoder %s Contest\" \n    (fun s -> Printf.printf \"A%cC\\n\" s.[0])", "language": "OCaml", "metadata": {"date": 1522722894, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s683424039.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s683424039", "user_id": "u987869509"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "let () =\n  Scanf.scanf \"AtCoder %s Contest\" \n    (fun s -> Printf.printf \"A%cC\\n\" s.[0])", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "sample_input": "AtCoder Beginner Contest\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03860", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 88, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s278215058", "group_id": "codeNet:p03861", "input_text": "Scanf.scanf \"%d %d %d\" (fun a b x ->\n    Printf.printf \"%d\\n\" @@ (b / x) - ((a - 1) / x)\n)", "language": "OCaml", "metadata": {"date": 1592967979, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s278215058.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s278215058", "user_id": "u342443598"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "Scanf.scanf \"%d %d %d\" (fun a b x ->\n    Printf.printf \"%d\\n\" @@ (b / x) - ((a - 1) / x)\n)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given nonnegative integers a and b (a ≤ b), and a positive integer x.\nAmong the integers between a and b, inclusive, how many are divisible by x?\n\nConstraints\n\n0 ≤ a ≤ b ≤ 10^{18}\n\n1 ≤ x ≤ 10^{18}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the number of the integers between a and b, inclusive, that are divisible by x.\n\nSample Input 1\n\n4 8 2\n\nSample Output 1\n\n3\n\nThere are three integers between 4 and 8, inclusive, that are divisible by 2: 4, 6 and 8.\n\nSample Input 2\n\n0 5 1\n\nSample Output 2\n\n6\n\nThere are six integers between 0 and 5, inclusive, that are divisible by 1: 0, 1, 2, 3, 4 and 5.\n\nSample Input 3\n\n9 9 2\n\nSample Output 3\n\n0\n\nThere are no integer between 9 and 9, inclusive, that is divisible by 2.\n\nSample Input 4\n\n1 1000000000000000000 3\n\nSample Output 4\n\n333333333333333333\n\nWatch out for integer overflows.", "sample_input": "4 8 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03861", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given nonnegative integers a and b (a ≤ b), and a positive integer x.\nAmong the integers between a and b, inclusive, how many are divisible by x?\n\nConstraints\n\n0 ≤ a ≤ b ≤ 10^{18}\n\n1 ≤ x ≤ 10^{18}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the number of the integers between a and b, inclusive, that are divisible by x.\n\nSample Input 1\n\n4 8 2\n\nSample Output 1\n\n3\n\nThere are three integers between 4 and 8, inclusive, that are divisible by 2: 4, 6 and 8.\n\nSample Input 2\n\n0 5 1\n\nSample Output 2\n\n6\n\nThere are six integers between 0 and 5, inclusive, that are divisible by 1: 0, 1, 2, 3, 4 and 5.\n\nSample Input 3\n\n9 9 2\n\nSample Output 3\n\n0\n\nThere are no integer between 9 and 9, inclusive, that is divisible by 2.\n\nSample Input 4\n\n1 1000000000000000000 3\n\nSample Output 4\n\n333333333333333333\n\nWatch out for integer overflows.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 90, "cpu_time_ms": 8, "memory_kb": 3828}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s356513066", "group_id": "codeNet:p03861", "input_text": "let () = Scanf.scanf \"%d %d %d\" (fun a b x -> b / x - (a-1) / x) |> Printf.printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1519721421, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s356513066.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s356513066", "user_id": "u798181098"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" (fun a b x -> b / x - (a-1) / x) |> Printf.printf \"%d\\n\"\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given nonnegative integers a and b (a ≤ b), and a positive integer x.\nAmong the integers between a and b, inclusive, how many are divisible by x?\n\nConstraints\n\n0 ≤ a ≤ b ≤ 10^{18}\n\n1 ≤ x ≤ 10^{18}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the number of the integers between a and b, inclusive, that are divisible by x.\n\nSample Input 1\n\n4 8 2\n\nSample Output 1\n\n3\n\nThere are three integers between 4 and 8, inclusive, that are divisible by 2: 4, 6 and 8.\n\nSample Input 2\n\n0 5 1\n\nSample Output 2\n\n6\n\nThere are six integers between 0 and 5, inclusive, that are divisible by 1: 0, 1, 2, 3, 4 and 5.\n\nSample Input 3\n\n9 9 2\n\nSample Output 3\n\n0\n\nThere are no integer between 9 and 9, inclusive, that is divisible by 2.\n\nSample Input 4\n\n1 1000000000000000000 3\n\nSample Output 4\n\n333333333333333333\n\nWatch out for integer overflows.", "sample_input": "4 8 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03861", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given nonnegative integers a and b (a ≤ b), and a positive integer x.\nAmong the integers between a and b, inclusive, how many are divisible by x?\n\nConstraints\n\n0 ≤ a ≤ b ≤ 10^{18}\n\n1 ≤ x ≤ 10^{18}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the number of the integers between a and b, inclusive, that are divisible by x.\n\nSample Input 1\n\n4 8 2\n\nSample Output 1\n\n3\n\nThere are three integers between 4 and 8, inclusive, that are divisible by 2: 4, 6 and 8.\n\nSample Input 2\n\n0 5 1\n\nSample Output 2\n\n6\n\nThere are six integers between 0 and 5, inclusive, that are divisible by 1: 0, 1, 2, 3, 4 and 5.\n\nSample Input 3\n\n9 9 2\n\nSample Output 3\n\n0\n\nThere are no integer between 9 and 9, inclusive, that is divisible by 2.\n\nSample Input 4\n\n1 1000000000000000000 3\n\nSample Output 4\n\n333333333333333333\n\nWatch out for integer overflows.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 89, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s056549353", "group_id": "codeNet:p03861", "input_text": "let solve a b x =\n\t(b / x) - ((a - 1) / x)\n\nlet () =\n\tlet [a; b; x] =\n\t\tread_line ()\n\t\t|> Str.split (Str.regexp \" \")\n\t\t|> List.map int_of_string\n\tin\n\tsolve a b x\n\t|> print_int\n\t|> print_newline\n", "language": "OCaml", "metadata": {"date": 1480905269, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s056549353.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s056549353", "user_id": "u420267469"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let solve a b x =\n\t(b / x) - ((a - 1) / x)\n\nlet () =\n\tlet [a; b; x] =\n\t\tread_line ()\n\t\t|> Str.split (Str.regexp \" \")\n\t\t|> List.map int_of_string\n\tin\n\tsolve a b x\n\t|> print_int\n\t|> print_newline\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given nonnegative integers a and b (a ≤ b), and a positive integer x.\nAmong the integers between a and b, inclusive, how many are divisible by x?\n\nConstraints\n\n0 ≤ a ≤ b ≤ 10^{18}\n\n1 ≤ x ≤ 10^{18}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the number of the integers between a and b, inclusive, that are divisible by x.\n\nSample Input 1\n\n4 8 2\n\nSample Output 1\n\n3\n\nThere are three integers between 4 and 8, inclusive, that are divisible by 2: 4, 6 and 8.\n\nSample Input 2\n\n0 5 1\n\nSample Output 2\n\n6\n\nThere are six integers between 0 and 5, inclusive, that are divisible by 1: 0, 1, 2, 3, 4 and 5.\n\nSample Input 3\n\n9 9 2\n\nSample Output 3\n\n0\n\nThere are no integer between 9 and 9, inclusive, that is divisible by 2.\n\nSample Input 4\n\n1 1000000000000000000 3\n\nSample Output 4\n\n333333333333333333\n\nWatch out for integer overflows.", "sample_input": "4 8 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03861", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given nonnegative integers a and b (a ≤ b), and a positive integer x.\nAmong the integers between a and b, inclusive, how many are divisible by x?\n\nConstraints\n\n0 ≤ a ≤ b ≤ 10^{18}\n\n1 ≤ x ≤ 10^{18}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b x\n\nOutput\n\nPrint the number of the integers between a and b, inclusive, that are divisible by x.\n\nSample Input 1\n\n4 8 2\n\nSample Output 1\n\n3\n\nThere are three integers between 4 and 8, inclusive, that are divisible by 2: 4, 6 and 8.\n\nSample Input 2\n\n0 5 1\n\nSample Output 2\n\n6\n\nThere are six integers between 0 and 5, inclusive, that are divisible by 1: 0, 1, 2, 3, 4 and 5.\n\nSample Input 3\n\n9 9 2\n\nSample Output 3\n\n0\n\nThere are no integer between 9 and 9, inclusive, that is divisible by 2.\n\nSample Input 4\n\n1 1000000000000000000 3\n\nSample Output 4\n\n333333333333333333\n\nWatch out for integer overflows.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 194, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s756183440", "group_id": "codeNet:p03862", "input_text": "let ($) f g = fun x -> f (g x)\n\nlet n, x = Scanf.scanf \"%d %d\\n\" (fun a b -> a, b)\nlet a = Str.split (Str.regexp \" \") @@ read_line () \n      |> List.map int_of_string\n\nlet rec cutting l =\n  let rec func cnt res = function\n      [] -> (cnt, List.rev res)\n    | hd :: rest ->\n      let n = max 0 (hd-x) in\n      func (cnt + n) ((min x hd)::res) rest\n  in func 0 [] l\n\nlet checking (pre_ans, l) =\n  let rec func cnt = function\n      [] | [_] -> cnt\n    | o::t::rest ->\n        let n = max 0 (o+t - x) in\n        func (cnt+n) ((max 0 (t-n)) :: rest)\n  in\n  pre_ans + func 0 l\n      \n\nlet () =\n  cutting a\n  |> checking\n  |> (print_endline $ string_of_int)\n", "language": "OCaml", "metadata": {"date": 1481227309, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03862.html", "problem_id": "p03862", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03862/input.txt", "sample_output_relpath": "derived/input_output/data/p03862/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03862/OCaml/s756183440.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s756183440", "user_id": "u098968285"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "let ($) f g = fun x -> f (g x)\n\nlet n, x = Scanf.scanf \"%d %d\\n\" (fun a b -> a, b)\nlet a = Str.split (Str.regexp \" \") @@ read_line () \n      |> List.map int_of_string\n\nlet rec cutting l =\n  let rec func cnt res = function\n      [] -> (cnt, List.rev res)\n    | hd :: rest ->\n      let n = max 0 (hd-x) in\n      func (cnt + n) ((min x hd)::res) rest\n  in func 0 [] l\n\nlet checking (pre_ans, l) =\n  let rec func cnt = function\n      [] | [_] -> cnt\n    | o::t::rest ->\n        let n = max 0 (o+t - x) in\n        func (cnt+n) ((max 0 (t-n)) :: rest)\n  in\n  pre_ans + func 0 l\n      \n\nlet () =\n  cutting a\n  |> checking\n  |> (print_endline $ string_of_int)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N boxes arranged in a row.\nInitially, the i-th box from the left contains a_i candies.\n\nSnuke can perform the following operation any number of times:\n\nChoose a box containing at least one candy, and eat one of the candies in the chosen box.\n\nHis objective is as follows:\n\nAny two neighboring boxes contain at most x candies in total.\n\nFind the minimum number of operations required to achieve the objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n0 ≤ a_i ≤ 10^9\n\n0 ≤ x ≤ 10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN x\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum number of operations required to achieve the objective.\n\nSample Input 1\n\n3 3\n2 2 2\n\nSample Output 1\n\n1\n\nEat one candy in the second box.\nThen, the number of candies in each box becomes (2, 1, 2).\n\nSample Input 2\n\n6 1\n1 6 1 2 0 4\n\nSample Output 2\n\n11\n\nFor example, eat six candies in the second box, two in the fourth box, and three in the sixth box.\nThen, the number of candies in each box becomes (1, 0, 1, 0, 0, 1).\n\nSample Input 3\n\n5 9\n3 1 4 1 5\n\nSample Output 3\n\n0\n\nThe objective is already achieved without performing operations.\n\nSample Input 4\n\n2 0\n5 5\n\nSample Output 4\n\n10\n\nAll the candies need to be eaten.", "sample_input": "3 3\n2 2 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03862", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N boxes arranged in a row.\nInitially, the i-th box from the left contains a_i candies.\n\nSnuke can perform the following operation any number of times:\n\nChoose a box containing at least one candy, and eat one of the candies in the chosen box.\n\nHis objective is as follows:\n\nAny two neighboring boxes contain at most x candies in total.\n\nFind the minimum number of operations required to achieve the objective.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n0 ≤ a_i ≤ 10^9\n\n0 ≤ x ≤ 10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN x\na_1 a_2 ... a_N\n\nOutput\n\nPrint the minimum number of operations required to achieve the objective.\n\nSample Input 1\n\n3 3\n2 2 2\n\nSample Output 1\n\n1\n\nEat one candy in the second box.\nThen, the number of candies in each box becomes (2, 1, 2).\n\nSample Input 2\n\n6 1\n1 6 1 2 0 4\n\nSample Output 2\n\n11\n\nFor example, eat six candies in the second box, two in the fourth box, and three in the sixth box.\nThen, the number of candies in each box becomes (1, 0, 1, 0, 0, 1).\n\nSample Input 3\n\n5 9\n3 1 4 1 5\n\nSample Output 3\n\n0\n\nThe objective is already achieved without performing operations.\n\nSample Input 4\n\n2 0\n5 5\n\nSample Output 4\n\n10\n\nAll the candies need to be eaten.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 652, "cpu_time_ms": 72, "memory_kb": 18560}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s011365664", "group_id": "codeNet:p03863", "input_text": "let () =\n  let s = Scanf.scanf \"%s \" (fun a -> a) in\n  let l = Batteries.String.to_list s in\n\n  let t1 = Batteries.List.filteri (fun i x -> i mod 2 = 0) l in\n  let t2 = Batteries.List.filteri (fun i x -> i mod 2 <> 0) l in\n\n  Printf.printf \"%s\\n\" @@\n  if (\n    (\n      List.sort_uniq compare t1 |> List.length = 1\n    ) \n    &&\n      (\n        List.sort_uniq compare t2 |> List.length = 1\n      )\n  )\n  then \"Second\"\n  else if List.length l mod 2 = 0 then \"Second\" else \"First\"\n\n", "language": "OCaml", "metadata": {"date": 1528930412, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03863.html", "problem_id": "p03863", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03863/input.txt", "sample_output_relpath": "derived/input_output/data/p03863/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03863/OCaml/s011365664.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s011365664", "user_id": "u139013163"}, "prompt_components": {"gold_output": "Second\n", "input_to_evaluate": "let () =\n  let s = Scanf.scanf \"%s \" (fun a -> a) in\n  let l = Batteries.String.to_list s in\n\n  let t1 = Batteries.List.filteri (fun i x -> i mod 2 = 0) l in\n  let t2 = Batteries.List.filteri (fun i x -> i mod 2 <> 0) l in\n\n  Printf.printf \"%s\\n\" @@\n  if (\n    (\n      List.sort_uniq compare t1 |> List.length = 1\n    ) \n    &&\n      (\n        List.sort_uniq compare t2 |> List.length = 1\n      )\n  )\n  then \"Second\"\n  else if List.length l mod 2 = 0 then \"Second\" else \"First\"\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a string s of length 3 or greater.\nNo two neighboring characters in s are equal.\n\nTakahashi and Aoki will play a game against each other.\nThe two players alternately performs the following operation, Takahashi going first:\n\nRemove one of the characters in s, excluding both ends. However, a character cannot be removed if removal of the character would result in two neighboring equal characters in s.\n\nThe player who becomes unable to perform the operation, loses the game. Determine which player will win when the two play optimally.\n\nConstraints\n\n3 ≤ |s| ≤ 10^5\n\ns consists of lowercase English letters.\n\nNo two neighboring characters in s are equal.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nIf Takahashi will win, print First. If Aoki will win, print Second.\n\nSample Input 1\n\naba\n\nSample Output 1\n\nSecond\n\nTakahashi, who goes first, cannot perform the operation, since removal of the b, which is the only character not at either ends of s, would result in s becoming aa, with two as neighboring.\n\nSample Input 2\n\nabc\n\nSample Output 2\n\nFirst\n\nWhen Takahashi removes b from s, it becomes ac.\nThen, Aoki cannot perform the operation, since there is no character in s, excluding both ends.\n\nSample Input 3\n\nabcab\n\nSample Output 3\n\nFirst", "sample_input": "aba\n"}, "reference_outputs": ["Second\n"], "source_document_id": "p03863", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a string s of length 3 or greater.\nNo two neighboring characters in s are equal.\n\nTakahashi and Aoki will play a game against each other.\nThe two players alternately performs the following operation, Takahashi going first:\n\nRemove one of the characters in s, excluding both ends. However, a character cannot be removed if removal of the character would result in two neighboring equal characters in s.\n\nThe player who becomes unable to perform the operation, loses the game. Determine which player will win when the two play optimally.\n\nConstraints\n\n3 ≤ |s| ≤ 10^5\n\ns consists of lowercase English letters.\n\nNo two neighboring characters in s are equal.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nIf Takahashi will win, print First. If Aoki will win, print Second.\n\nSample Input 1\n\naba\n\nSample Output 1\n\nSecond\n\nTakahashi, who goes first, cannot perform the operation, since removal of the b, which is the only character not at either ends of s, would result in s becoming aa, with two as neighboring.\n\nSample Input 2\n\nabc\n\nSample Output 2\n\nFirst\n\nWhen Takahashi removes b from s, it becomes ac.\nThen, Aoki cannot perform the operation, since there is no character in s, excluding both ends.\n\nSample Input 3\n\nabcab\n\nSample Output 3\n\nFirst", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 479, "cpu_time_ms": 20, "memory_kb": 10624}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s111106200", "group_id": "codeNet:p03909", "input_text": "let h, w = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet sss = Array.init h @@ fun _ -> Array.init w @@ fun _ -> Scanf.scanf \" %s\" @@ fun s -> s\nlet _ =\n  for i = 0 to h - 1 do\n    for j = 0 to w - 1 do if sss.(i).(j) = \"snuke\" then Printf.printf \"%c%d\\n\" (Char.chr @@ Char.code 'A' + j) @@ i + 1 done done", "language": "OCaml", "metadata": {"date": 1564101742, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03909.html", "problem_id": "p03909", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03909/input.txt", "sample_output_relpath": "derived/input_output/data/p03909/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03909/OCaml/s111106200.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s111106200", "user_id": "u732304692"}, "prompt_components": {"gold_output": "H6\n", "input_to_evaluate": "let h, w = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet sss = Array.init h @@ fun _ -> Array.init w @@ fun _ -> Scanf.scanf \" %s\" @@ fun s -> s\nlet _ =\n  for i = 0 to h - 1 do\n    for j = 0 to w - 1 do if sss.(i).(j) = \"snuke\" then Printf.printf \"%c%d\\n\" (Char.chr @@ Char.code 'A' + j) @@ i + 1 done done", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a grid with H rows and W columns.\n\nThe square at the i-th row and j-th column contains a string S_{i,j} of length 5.\n\nThe rows are labeled with the numbers from 1 through H, and the columns are labeled with the uppercase English letters from A through the W-th letter of the alphabet.\n\nExactly one of the squares in the grid contains the string snuke. Find this square and report its location.\n\nFor example, the square at the 6-th row and 8-th column should be reported as H6.\n\nConstraints\n\n1≦H, W≦26\n\nThe length of S_{i,j} is 5.\n\nS_{i,j} consists of lowercase English letters (a-z).\n\nExactly one of the given strings is equal to snuke.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W\nS_{1,1} S_{1,2} ... S_{1,W}\nS_{2,1} S_{2,2} ... S_{2,W}\n:\nS_{H,1} S_{H,2} ... S_{H,W}\n\nOutput\n\nPrint the labels of the row and the column of the square containing the string snuke, with no space inbetween.\n\nSample Input 1\n\n15 10\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snuke snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\n\nSample Output 1\n\nH6\n\nSample Input 2\n\n1 1\nsnuke\n\nSample Output 2\n\nA1", "sample_input": "15 10\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snuke snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\n"}, "reference_outputs": ["H6\n"], "source_document_id": "p03909", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a grid with H rows and W columns.\n\nThe square at the i-th row and j-th column contains a string S_{i,j} of length 5.\n\nThe rows are labeled with the numbers from 1 through H, and the columns are labeled with the uppercase English letters from A through the W-th letter of the alphabet.\n\nExactly one of the squares in the grid contains the string snuke. Find this square and report its location.\n\nFor example, the square at the 6-th row and 8-th column should be reported as H6.\n\nConstraints\n\n1≦H, W≦26\n\nThe length of S_{i,j} is 5.\n\nS_{i,j} consists of lowercase English letters (a-z).\n\nExactly one of the given strings is equal to snuke.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W\nS_{1,1} S_{1,2} ... S_{1,W}\nS_{2,1} S_{2,2} ... S_{2,W}\n:\nS_{H,1} S_{H,2} ... S_{H,W}\n\nOutput\n\nPrint the labels of the row and the column of the square containing the string snuke, with no space inbetween.\n\nSample Input 1\n\n15 10\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snuke snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\n\nSample Output 1\n\nH6\n\nSample Input 2\n\n1 1\nsnuke\n\nSample Output 2\n\nA1", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 304, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s422887395", "group_id": "codeNet:p03912", "input_text": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let xs = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun x -> x in\n  let count = Array.make m 0 in\n  let pairs = Array.make m 0 in\n  begin\n    let elt = Array.make 100001 false in\n    Array.iter (fun x ->\n      (if elt.(x) then pairs.(x mod m) <- 1 + pairs.(x mod m));\n      elt.(x) <- not elt.(x);\n      count.(x mod m) <- 1 + count.(x mod m)) xs\n  end;\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left ( + ) 0 @@ \n  Array.init m @@ fun i ->\n    if m - i < i then 0\n    else if i = 0 || m - i = i then count.(i) / 2\n    else begin\n      let x = min count.(i) count.(m - i) in\n      x\n      + min (count.(i) - x) (2 * pairs.(i)) / 2\n      + min (count.(m - i) - x) (2 * pairs.(m - i)) / 2\n    end\n", "language": "OCaml", "metadata": {"date": 1577602608, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03912.html", "problem_id": "p03912", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03912/input.txt", "sample_output_relpath": "derived/input_output/data/p03912/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03912/OCaml/s422887395.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s422887395", "user_id": "u504158101"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n m ->\n  let xs = Array.init n @@ fun _ -> Scanf.scanf \"%d \" @@ fun x -> x in\n  let count = Array.make m 0 in\n  let pairs = Array.make m 0 in\n  begin\n    let elt = Array.make 100001 false in\n    Array.iter (fun x ->\n      (if elt.(x) then pairs.(x mod m) <- 1 + pairs.(x mod m));\n      elt.(x) <- not elt.(x);\n      count.(x mod m) <- 1 + count.(x mod m)) xs\n  end;\n  Printf.printf \"%d\\n\" @@\n  Array.fold_left ( + ) 0 @@ \n  Array.init m @@ fun i ->\n    if m - i < i then 0\n    else if i = 0 || m - i = i then count.(i) / 2\n    else begin\n      let x = min count.(i) count.(m - i) in\n      x\n      + min (count.(i) - x) (2 * pairs.(i)) / 2\n      + min (count.(m - i) - x) (2 * pairs.(m - i)) / 2\n    end\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nTakahashi is playing with N cards.\n\nThe i-th card has an integer X_i on it.\n\nTakahashi is trying to create as many pairs of cards as possible satisfying one of the following conditions:\n\nThe integers on the two cards are the same.\n\nThe sum of the integers on the two cards is a multiple of M.\n\nFind the maximum number of pairs that can be created.\n\nNote that a card cannot be used in more than one pair.\n\nConstraints\n\n2≦N≦10^5\n\n1≦M≦10^5\n\n1≦X_i≦10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nX_1 X_2 ... X_N\n\nOutput\n\nPrint the maximum number of pairs that can be created.\n\nSample Input 1\n\n7 5\n3 1 4 1 5 9 2\n\nSample Output 1\n\n3\n\nThree pairs (3,2), (1,4) and (1,9) can be created.\n\nIt is possible to create pairs (3,2) and (1,1), but the number of pairs is not maximized with this.\n\nSample Input 2\n\n15 10\n1 5 6 10 11 11 11 20 21 25 25 26 99 99 99\n\nSample Output 2\n\n6", "sample_input": "7 5\n3 1 4 1 5 9 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03912", "source_text": "Score : 700 points\n\nProblem Statement\n\nTakahashi is playing with N cards.\n\nThe i-th card has an integer X_i on it.\n\nTakahashi is trying to create as many pairs of cards as possible satisfying one of the following conditions:\n\nThe integers on the two cards are the same.\n\nThe sum of the integers on the two cards is a multiple of M.\n\nFind the maximum number of pairs that can be created.\n\nNote that a card cannot be used in more than one pair.\n\nConstraints\n\n2≦N≦10^5\n\n1≦M≦10^5\n\n1≦X_i≦10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nX_1 X_2 ... X_N\n\nOutput\n\nPrint the maximum number of pairs that can be created.\n\nSample Input 1\n\n7 5\n3 1 4 1 5 9 2\n\nSample Output 1\n\n3\n\nThree pairs (3,2), (1,4) and (1,9) can be created.\n\nIt is possible to create pairs (3,2) and (1,1), but the number of pairs is not maximized with this.\n\nSample Input 2\n\n15 10\n1 5 6 10 11 11 11 20 21 25 25 26 99 99 99\n\nSample Output 2\n\n6", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 741, "cpu_time_ms": 36, "memory_kb": 6656}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s002065562", "group_id": "codeNet:p03937", "input_text": "Scanf.(scanf \" %d %d\" @@ fun h w -> print_endline @@ if Array.(fold_left (+) 0 @@ init (h * w) @@ fun _ -> scanf \" %c\" @@ fun a -> if a = '#' then 1 else 0) = h + w - 1 then \"Possible\" else \"Impossible\")", "language": "OCaml", "metadata": {"date": 1576767448, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03937.html", "problem_id": "p03937", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03937/input.txt", "sample_output_relpath": "derived/input_output/data/p03937/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03937/OCaml/s002065562.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s002065562", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Possible\n", "input_to_evaluate": "Scanf.(scanf \" %d %d\" @@ fun h w -> print_endline @@ if Array.(fold_left (+) 0 @@ init (h * w) @@ fun _ -> scanf \" %c\" @@ fun a -> if a = '#' then 1 else 0) = h + w - 1 then \"Possible\" else \"Impossible\")", "problem_context": "Score : 200 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nWe have a grid of H rows and W columns. Initially, there is a stone in the top left cell. Shik is trying to move the stone to the bottom right cell. In each step, he can move the stone one cell to its left, up, right, or down (if such cell exists). It is possible that the stone visits a cell multiple times (including the bottom right and the top left cell).\n\nYou are given a matrix of characters a_{ij} (1 \\leq i \\leq H, 1 \\leq j \\leq W). After Shik completes all moving actions, a_{ij} is # if the stone had ever located at the i-th row and the j-th column during the process of moving. Otherwise, a_{ij} is .. Please determine whether it is possible that Shik only uses right and down moves in all steps.\n\nConstraints\n\n2 \\leq H, W \\leq 8\n\na_{i,j} is either # or ..\n\nThere exists a valid sequence of moves for Shik to generate the map a.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W\na_{11}a_{12}...a_{1W}\n:\na_{H1}a_{H2}...a_{HW}\n\nOutput\n\nIf it is possible that Shik only uses right and down moves, print Possible. Otherwise, print Impossible.\n\nSample Input 1\n\n4 5\n##...\n.##..\n..##.\n...##\n\nSample Output 1\n\nPossible\n\nThe matrix can be generated by a 7-move sequence: right, down, right, down, right, down, and right.\n\nSample Input 2\n\n5 3\n###\n..#\n###\n#..\n###\n\nSample Output 2\n\nImpossible\n\nSample Input 3\n\n4 5\n##...\n.###.\n.###.\n...##\n\nSample Output 3\n\nImpossible", "sample_input": "4 5\n##...\n.##..\n..##.\n...##\n"}, "reference_outputs": ["Possible\n"], "source_document_id": "p03937", "source_text": "Score : 200 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nWe have a grid of H rows and W columns. Initially, there is a stone in the top left cell. Shik is trying to move the stone to the bottom right cell. In each step, he can move the stone one cell to its left, up, right, or down (if such cell exists). It is possible that the stone visits a cell multiple times (including the bottom right and the top left cell).\n\nYou are given a matrix of characters a_{ij} (1 \\leq i \\leq H, 1 \\leq j \\leq W). After Shik completes all moving actions, a_{ij} is # if the stone had ever located at the i-th row and the j-th column during the process of moving. Otherwise, a_{ij} is .. Please determine whether it is possible that Shik only uses right and down moves in all steps.\n\nConstraints\n\n2 \\leq H, W \\leq 8\n\na_{i,j} is either # or ..\n\nThere exists a valid sequence of moves for Shik to generate the map a.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W\na_{11}a_{12}...a_{1W}\n:\na_{H1}a_{H2}...a_{HW}\n\nOutput\n\nIf it is possible that Shik only uses right and down moves, print Possible. Otherwise, print Impossible.\n\nSample Input 1\n\n4 5\n##...\n.##..\n..##.\n...##\n\nSample Output 1\n\nPossible\n\nThe matrix can be generated by a 7-move sequence: right, down, right, down, right, down, and right.\n\nSample Input 2\n\n5 3\n###\n..#\n###\n#..\n###\n\nSample Output 2\n\nImpossible\n\nSample Input 3\n\n4 5\n##...\n.###.\n.###.\n...##\n\nSample Output 3\n\nImpossible", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 203, "cpu_time_ms": 1, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s601653599", "group_id": "codeNet:p03937", "input_text": "let h, w = Scanf.scanf \"%d %d\\n\" (fun x y -> x, y)\n\nlet rec read_char acc = function\n  | 0 -> acc\n  | k -> read_char (Scanf.scanf \" %c\" (fun x -> if x = '#' then (acc + 1) else acc)) (k-1)\n\nlet () = print_string (if (read_char 0 (h*w)) = h+w-1 then \"Possible\" else \"Impossible\")", "language": "OCaml", "metadata": {"date": 1479003891, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03937.html", "problem_id": "p03937", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03937/input.txt", "sample_output_relpath": "derived/input_output/data/p03937/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03937/OCaml/s601653599.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s601653599", "user_id": "u367021138"}, "prompt_components": {"gold_output": "Possible\n", "input_to_evaluate": "let h, w = Scanf.scanf \"%d %d\\n\" (fun x y -> x, y)\n\nlet rec read_char acc = function\n  | 0 -> acc\n  | k -> read_char (Scanf.scanf \" %c\" (fun x -> if x = '#' then (acc + 1) else acc)) (k-1)\n\nlet () = print_string (if (read_char 0 (h*w)) = h+w-1 then \"Possible\" else \"Impossible\")", "problem_context": "Score : 200 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nWe have a grid of H rows and W columns. Initially, there is a stone in the top left cell. Shik is trying to move the stone to the bottom right cell. In each step, he can move the stone one cell to its left, up, right, or down (if such cell exists). It is possible that the stone visits a cell multiple times (including the bottom right and the top left cell).\n\nYou are given a matrix of characters a_{ij} (1 \\leq i \\leq H, 1 \\leq j \\leq W). After Shik completes all moving actions, a_{ij} is # if the stone had ever located at the i-th row and the j-th column during the process of moving. Otherwise, a_{ij} is .. Please determine whether it is possible that Shik only uses right and down moves in all steps.\n\nConstraints\n\n2 \\leq H, W \\leq 8\n\na_{i,j} is either # or ..\n\nThere exists a valid sequence of moves for Shik to generate the map a.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W\na_{11}a_{12}...a_{1W}\n:\na_{H1}a_{H2}...a_{HW}\n\nOutput\n\nIf it is possible that Shik only uses right and down moves, print Possible. Otherwise, print Impossible.\n\nSample Input 1\n\n4 5\n##...\n.##..\n..##.\n...##\n\nSample Output 1\n\nPossible\n\nThe matrix can be generated by a 7-move sequence: right, down, right, down, right, down, and right.\n\nSample Input 2\n\n5 3\n###\n..#\n###\n#..\n###\n\nSample Output 2\n\nImpossible\n\nSample Input 3\n\n4 5\n##...\n.###.\n.###.\n...##\n\nSample Output 3\n\nImpossible", "sample_input": "4 5\n##...\n.##..\n..##.\n...##\n"}, "reference_outputs": ["Possible\n"], "source_document_id": "p03937", "source_text": "Score : 200 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nWe have a grid of H rows and W columns. Initially, there is a stone in the top left cell. Shik is trying to move the stone to the bottom right cell. In each step, he can move the stone one cell to its left, up, right, or down (if such cell exists). It is possible that the stone visits a cell multiple times (including the bottom right and the top left cell).\n\nYou are given a matrix of characters a_{ij} (1 \\leq i \\leq H, 1 \\leq j \\leq W). After Shik completes all moving actions, a_{ij} is # if the stone had ever located at the i-th row and the j-th column during the process of moving. Otherwise, a_{ij} is .. Please determine whether it is possible that Shik only uses right and down moves in all steps.\n\nConstraints\n\n2 \\leq H, W \\leq 8\n\na_{i,j} is either # or ..\n\nThere exists a valid sequence of moves for Shik to generate the map a.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W\na_{11}a_{12}...a_{1W}\n:\na_{H1}a_{H2}...a_{HW}\n\nOutput\n\nIf it is possible that Shik only uses right and down moves, print Possible. Otherwise, print Impossible.\n\nSample Input 1\n\n4 5\n##...\n.##..\n..##.\n...##\n\nSample Output 1\n\nPossible\n\nThe matrix can be generated by a 7-move sequence: right, down, right, down, right, down, and right.\n\nSample Input 2\n\n5 3\n###\n..#\n###\n#..\n###\n\nSample Output 2\n\nImpossible\n\nSample Input 3\n\n4 5\n##...\n.###.\n.###.\n...##\n\nSample Output 3\n\nImpossible", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 278, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s115040048", "group_id": "codeNet:p03943", "input_text": "let () =\n\tlet a,b,c = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> a,b,c) in\n    Printf.printf (if a+b=c || a+c=b || b+c=a then \"Yes\" else \"No\")", "language": "OCaml", "metadata": {"date": 1581978001, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s115040048.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s115040048", "user_id": "u307426615"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n\tlet a,b,c = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> a,b,c) in\n    Printf.printf (if a+b=c || a+c=b || b+c=a then \"Yes\" else \"No\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTwo students of AtCoder Kindergarten are fighting over candy packs.\n\nThere are three candy packs, each of which contains a, b, and c candies, respectively.\n\nTeacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.\n\nNote that Evi cannot take candies out of the packs, and the whole contents of each pack must be given to one of the students.\n\nConstraints\n\n1 ≦ a, b, c ≦ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nIf it is possible to distribute the packs so that each student gets the same number of candies, print Yes. Otherwise, print No.\n\nSample Input 1\n\n10 30 20\n\nSample Output 1\n\nYes\n\nGive the pack with 30 candies to one student, and give the two packs with 10 and 20 candies to the other. Then, each gets 30 candies.\n\nSample Input 2\n\n30 30 100\n\nSample Output 2\n\nNo\n\nIn this case, the student who gets the pack with 100 candies always has more candies than the other.\n\nNote that every pack must be given to one of them.\n\nSample Input 3\n\n56 25 31\n\nSample Output 3\n\nYes", "sample_input": "10 30 20\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03943", "source_text": "Score : 100 points\n\nProblem Statement\n\nTwo students of AtCoder Kindergarten are fighting over candy packs.\n\nThere are three candy packs, each of which contains a, b, and c candies, respectively.\n\nTeacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.\n\nNote that Evi cannot take candies out of the packs, and the whole contents of each pack must be given to one of the students.\n\nConstraints\n\n1 ≦ a, b, c ≦ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nIf it is possible to distribute the packs so that each student gets the same number of candies, print Yes. Otherwise, print No.\n\nSample Input 1\n\n10 30 20\n\nSample Output 1\n\nYes\n\nGive the pack with 30 candies to one student, and give the two packs with 10 and 20 candies to the other. Then, each gets 30 candies.\n\nSample Input 2\n\n30 30 100\n\nSample Output 2\n\nNo\n\nIn this case, the student who gets the pack with 100 candies always has more candies than the other.\n\nNote that every pack must be given to one of them.\n\nSample Input 3\n\n56 25 31\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 138, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s076880085", "group_id": "codeNet:p03943", "input_text": "let () =\n\tlet a,b,c = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> a,b,c) in\n    Printf.printf (if (a+b+c) mod 2 = 0 then \"Yes\" else \"No\")", "language": "OCaml", "metadata": {"date": 1581977943, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s076880085.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s076880085", "user_id": "u307426615"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () =\n\tlet a,b,c = Scanf.scanf \"%d %d %d\\n\" (fun a b c -> a,b,c) in\n    Printf.printf (if (a+b+c) mod 2 = 0 then \"Yes\" else \"No\")", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTwo students of AtCoder Kindergarten are fighting over candy packs.\n\nThere are three candy packs, each of which contains a, b, and c candies, respectively.\n\nTeacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.\n\nNote that Evi cannot take candies out of the packs, and the whole contents of each pack must be given to one of the students.\n\nConstraints\n\n1 ≦ a, b, c ≦ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nIf it is possible to distribute the packs so that each student gets the same number of candies, print Yes. Otherwise, print No.\n\nSample Input 1\n\n10 30 20\n\nSample Output 1\n\nYes\n\nGive the pack with 30 candies to one student, and give the two packs with 10 and 20 candies to the other. Then, each gets 30 candies.\n\nSample Input 2\n\n30 30 100\n\nSample Output 2\n\nNo\n\nIn this case, the student who gets the pack with 100 candies always has more candies than the other.\n\nNote that every pack must be given to one of them.\n\nSample Input 3\n\n56 25 31\n\nSample Output 3\n\nYes", "sample_input": "10 30 20\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03943", "source_text": "Score : 100 points\n\nProblem Statement\n\nTwo students of AtCoder Kindergarten are fighting over candy packs.\n\nThere are three candy packs, each of which contains a, b, and c candies, respectively.\n\nTeacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.\n\nNote that Evi cannot take candies out of the packs, and the whole contents of each pack must be given to one of the students.\n\nConstraints\n\n1 ≦ a, b, c ≦ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nIf it is possible to distribute the packs so that each student gets the same number of candies, print Yes. Otherwise, print No.\n\nSample Input 1\n\n10 30 20\n\nSample Output 1\n\nYes\n\nGive the pack with 30 candies to one student, and give the two packs with 10 and 20 candies to the other. Then, each gets 30 candies.\n\nSample Input 2\n\n30 30 100\n\nSample Output 2\n\nNo\n\nIn this case, the student who gets the pack with 100 candies always has more candies than the other.\n\nNote that every pack must be given to one of them.\n\nSample Input 3\n\n56 25 31\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 132, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s104051208", "group_id": "codeNet:p03943", "input_text": "let () = Scanf.scanf \"%d %d %d\" (fun a b c ->\n  let m = max a (max b c) in if a+b+c-m = m then \"Yes\" else \"No\")\n|> print_endline\n", "language": "OCaml", "metadata": {"date": 1519656844, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s104051208.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s104051208", "user_id": "u798181098"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" (fun a b c ->\n  let m = max a (max b c) in if a+b+c-m = m then \"Yes\" else \"No\")\n|> print_endline\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTwo students of AtCoder Kindergarten are fighting over candy packs.\n\nThere are three candy packs, each of which contains a, b, and c candies, respectively.\n\nTeacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.\n\nNote that Evi cannot take candies out of the packs, and the whole contents of each pack must be given to one of the students.\n\nConstraints\n\n1 ≦ a, b, c ≦ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nIf it is possible to distribute the packs so that each student gets the same number of candies, print Yes. Otherwise, print No.\n\nSample Input 1\n\n10 30 20\n\nSample Output 1\n\nYes\n\nGive the pack with 30 candies to one student, and give the two packs with 10 and 20 candies to the other. Then, each gets 30 candies.\n\nSample Input 2\n\n30 30 100\n\nSample Output 2\n\nNo\n\nIn this case, the student who gets the pack with 100 candies always has more candies than the other.\n\nNote that every pack must be given to one of them.\n\nSample Input 3\n\n56 25 31\n\nSample Output 3\n\nYes", "sample_input": "10 30 20\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03943", "source_text": "Score : 100 points\n\nProblem Statement\n\nTwo students of AtCoder Kindergarten are fighting over candy packs.\n\nThere are three candy packs, each of which contains a, b, and c candies, respectively.\n\nTeacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.\n\nNote that Evi cannot take candies out of the packs, and the whole contents of each pack must be given to one of the students.\n\nConstraints\n\n1 ≦ a, b, c ≦ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nIf it is possible to distribute the packs so that each student gets the same number of candies, print Yes. Otherwise, print No.\n\nSample Input 1\n\n10 30 20\n\nSample Output 1\n\nYes\n\nGive the pack with 30 candies to one student, and give the two packs with 10 and 20 candies to the other. Then, each gets 30 candies.\n\nSample Input 2\n\n30 30 100\n\nSample Output 2\n\nNo\n\nIn this case, the student who gets the pack with 100 candies always has more candies than the other.\n\nNote that every pack must be given to one of them.\n\nSample Input 3\n\n56 25 31\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 129, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s828596132", "group_id": "codeNet:p03943", "input_text": "let () = Scanf.scanf \"%d %d %d\" (fun a b c ->\n  if a + b = c || b + c = a || c + a = b then print_endline \"Yes\"\n  else print_endline \"No\")\n", "language": "OCaml", "metadata": {"date": 1478484258, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s828596132.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s828596132", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d %d\" (fun a b c ->\n  if a + b = c || b + c = a || c + a = b then print_endline \"Yes\"\n  else print_endline \"No\")\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTwo students of AtCoder Kindergarten are fighting over candy packs.\n\nThere are three candy packs, each of which contains a, b, and c candies, respectively.\n\nTeacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.\n\nNote that Evi cannot take candies out of the packs, and the whole contents of each pack must be given to one of the students.\n\nConstraints\n\n1 ≦ a, b, c ≦ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nIf it is possible to distribute the packs so that each student gets the same number of candies, print Yes. Otherwise, print No.\n\nSample Input 1\n\n10 30 20\n\nSample Output 1\n\nYes\n\nGive the pack with 30 candies to one student, and give the two packs with 10 and 20 candies to the other. Then, each gets 30 candies.\n\nSample Input 2\n\n30 30 100\n\nSample Output 2\n\nNo\n\nIn this case, the student who gets the pack with 100 candies always has more candies than the other.\n\nNote that every pack must be given to one of them.\n\nSample Input 3\n\n56 25 31\n\nSample Output 3\n\nYes", "sample_input": "10 30 20\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03943", "source_text": "Score : 100 points\n\nProblem Statement\n\nTwo students of AtCoder Kindergarten are fighting over candy packs.\n\nThere are three candy packs, each of which contains a, b, and c candies, respectively.\n\nTeacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.\n\nNote that Evi cannot take candies out of the packs, and the whole contents of each pack must be given to one of the students.\n\nConstraints\n\n1 ≦ a, b, c ≦ 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nIf it is possible to distribute the packs so that each student gets the same number of candies, print Yes. Otherwise, print No.\n\nSample Input 1\n\n10 30 20\n\nSample Output 1\n\nYes\n\nGive the pack with 30 candies to one student, and give the two packs with 10 and 20 candies to the other. Then, each gets 30 candies.\n\nSample Input 2\n\n30 30 100\n\nSample Output 2\n\nNo\n\nIn this case, the student who gets the pack with 100 candies always has more candies than the other.\n\nNote that every pack must be given to one of them.\n\nSample Input 3\n\n56 25 31\n\nSample Output 3\n\nYes", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 139, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s755033746", "group_id": "codeNet:p03951", "input_text": "let n = read_int ()\nlet s = read_line ()\nlet t = read_line ()\nlet f m = Printf.printf \"%d\\n\" @@ 2 * n - m; exit 0\nlet _ = for l = n downto 1 do if String.(sub s (n - l) l = sub t 0 l) then f l done; f 0", "language": "OCaml", "metadata": {"date": 1572077730, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s755033746.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s755033746", "user_id": "u732304692"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let n = read_int ()\nlet s = read_line ()\nlet t = read_line ()\nlet f m = Printf.printf \"%d\\n\" @@ 2 * n - m; exit 0\nlet _ = for l = n downto 1 do if String.(sub s (n - l) l = sub t 0 l) then f l done; f 0", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 202, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s225670448", "group_id": "codeNet:p03951", "input_text": "let n = read_int ()\nlet s = read_line ()\nlet t = read_line ()\nlet f m = Printf.printf \"%d\\n\" @@ 2 * n - m; exit 0\nlet _ = for i = 0 to n - 1 do if String.(sub s i (n - i) = sub t 0 (n - i)) then f (n - i) done; f 0", "language": "OCaml", "metadata": {"date": 1572077133, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s225670448.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s225670448", "user_id": "u732304692"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let n = read_int ()\nlet s = read_line ()\nlet t = read_line ()\nlet f m = Printf.printf \"%d\\n\" @@ 2 * n - m; exit 0\nlet _ = for i = 0 to n - 1 do if String.(sub s i (n - i) = sub t 0 (n - i)) then f (n - i) done; f 0", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s517487738", "group_id": "codeNet:p03957", "input_text": "let s = read_line ()\nlet f s = print_endline s; exit 0\nlet i = try String.index s 'C' with _ -> f \"No\"\nlet _ = try String.index_from s i 'F' |> ignore; f \"Yes\" with _ -> f \"No\"", "language": "OCaml", "metadata": {"date": 1570908244, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03957.html", "problem_id": "p03957", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03957/input.txt", "sample_output_relpath": "derived/input_output/data/p03957/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03957/OCaml/s517487738.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s517487738", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let s = read_line ()\nlet f s = print_endline s; exit 0\nlet i = try String.index s 'C' with _ -> f \"No\"\nlet _ = try String.index_from s i 'F' |> ignore; f \"Yes\" with _ -> f \"No\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThis contest is CODEFESTIVAL, which can be shortened to the string CF by deleting some characters.\n\nMr. Takahashi, full of curiosity, wondered if he could obtain CF from other strings in the same way.\n\nYou are given a string s consisting of uppercase English letters.\nDetermine whether the string CF can be obtained from the string s by deleting some characters.\n\nConstraints\n\n2 ≤ |s| ≤ 100\n\nAll characters in s are uppercase English letters (A-Z).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint Yes if the string CF can be obtained from the string s by deleting some characters.\nOtherwise print No.\n\nSample Input 1\n\nCODEFESTIVAL\n\nSample Output 1\n\nYes\n\nCF is obtained by deleting characters other than the first character C and the fifth character F.\n\nSample Input 2\n\nFESTIVALCODE\n\nSample Output 2\n\nNo\n\nFC can be obtained but CF cannot be obtained because you cannot change the order of the characters.\n\nSample Input 3\n\nCF\n\nSample Output 3\n\nYes\n\nIt is also possible not to delete any characters.\n\nSample Input 4\n\nFCF\n\nSample Output 4\n\nYes\n\nCF is obtained by deleting the first character.", "sample_input": "CODEFESTIVAL\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03957", "source_text": "Score : 100 points\n\nProblem Statement\n\nThis contest is CODEFESTIVAL, which can be shortened to the string CF by deleting some characters.\n\nMr. Takahashi, full of curiosity, wondered if he could obtain CF from other strings in the same way.\n\nYou are given a string s consisting of uppercase English letters.\nDetermine whether the string CF can be obtained from the string s by deleting some characters.\n\nConstraints\n\n2 ≤ |s| ≤ 100\n\nAll characters in s are uppercase English letters (A-Z).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint Yes if the string CF can be obtained from the string s by deleting some characters.\nOtherwise print No.\n\nSample Input 1\n\nCODEFESTIVAL\n\nSample Output 1\n\nYes\n\nCF is obtained by deleting characters other than the first character C and the fifth character F.\n\nSample Input 2\n\nFESTIVALCODE\n\nSample Output 2\n\nNo\n\nFC can be obtained but CF cannot be obtained because you cannot change the order of the characters.\n\nSample Input 3\n\nCF\n\nSample Output 3\n\nYes\n\nIt is also possible not to delete any characters.\n\nSample Input 4\n\nFCF\n\nSample Output 4\n\nYes\n\nCF is obtained by deleting the first character.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s527575151", "group_id": "codeNet:p03962", "input_text": "let ans a b c =\n  if a = b && b = c then 1\n  else if a <> b && b <> c && c <> a then 3\n  else 2;;\n\nScanf.scanf \"%d %d %d\" (fun a b c -> print_int (ans a b c))\n", "language": "OCaml", "metadata": {"date": 1582590710, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03962.html", "problem_id": "p03962", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03962/input.txt", "sample_output_relpath": "derived/input_output/data/p03962/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03962/OCaml/s527575151.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s527575151", "user_id": "u752907799"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let ans a b c =\n  if a = b && b = c then 1\n  else if a <> b && b <> c && c <> a then 3\n  else 2;;\n\nScanf.scanf \"%d %d %d\" (fun a b c -> print_int (ans a b c))\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer recently bought three paint cans.\nThe color of the one he bought two days ago is a, the color of the one he bought yesterday is b, and the color of the one he bought today is c.\nHere, the color of each paint can is represented by an integer between 1 and 100, inclusive.\n\nSince he is forgetful, he might have bought more than one paint can in the same color.\nCount the number of different kinds of colors of these paint cans and tell him.\n\nConstraints\n\n1≦a,b,c≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the number of different kinds of colors of the paint cans.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n3\n\nThree different colors: 1, 3, and 4.\n\nSample Input 2\n\n3 3 33\n\nSample Output 2\n\n2\n\nTwo different colors: 3 and 33.", "sample_input": "3 1 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03962", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer the deer recently bought three paint cans.\nThe color of the one he bought two days ago is a, the color of the one he bought yesterday is b, and the color of the one he bought today is c.\nHere, the color of each paint can is represented by an integer between 1 and 100, inclusive.\n\nSince he is forgetful, he might have bought more than one paint can in the same color.\nCount the number of different kinds of colors of these paint cans and tell him.\n\nConstraints\n\n1≦a,b,c≦100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint the number of different kinds of colors of the paint cans.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n3\n\nThree different colors: 1, 3, and 4.\n\nSample Input 2\n\n3 3 33\n\nSample Output 2\n\n2\n\nTwo different colors: 3 and 33.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s973881846", "group_id": "codeNet:p03963", "input_text": "let n, k = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet rec f n = if n <= 0 then 1 else (k - 1) * f (n - 1)\nlet _ = Printf.printf \"%d\\n\" @@ k * f (n - 1)", "language": "OCaml", "metadata": {"date": 1565373694, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03963.html", "problem_id": "p03963", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03963/input.txt", "sample_output_relpath": "derived/input_output/data/p03963/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03963/OCaml/s973881846.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s973881846", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let n, k = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet rec f n = if n <= 0 then 1 else (k - 1) * f (n - 1)\nlet _ = Printf.printf \"%d\\n\" @@ k * f (n - 1)", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N balls placed in a row.\nAtCoDeer the deer is painting each of these in one of the K colors of his paint cans.\nFor aesthetic reasons, any two adjacent balls must be painted in different colors.\n\nFind the number of the possible ways to paint the balls.\n\nConstraints\n\n1≦N≦1000\n\n2≦K≦1000\n\nThe correct answer is at most 2^{31}-1.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of the possible ways to paint the balls.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n2\n\nWe will denote the colors by 0 and 1. There are two possible ways: we can either paint the left ball in color 0 and the right ball in color 1, or paint the left in color 1 and the right in color 0.\n\nSample Input 2\n\n1 10\n\nSample Output 2\n\n10\n\nSince there is only one ball, we can use any of the ten colors to paint it. Thus, the answer is ten.", "sample_input": "2 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03963", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N balls placed in a row.\nAtCoDeer the deer is painting each of these in one of the K colors of his paint cans.\nFor aesthetic reasons, any two adjacent balls must be painted in different colors.\n\nFind the number of the possible ways to paint the balls.\n\nConstraints\n\n1≦N≦1000\n\n2≦K≦1000\n\nThe correct answer is at most 2^{31}-1.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of the possible ways to paint the balls.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n2\n\nWe will denote the colors by 0 and 1. There are two possible ways: we can either paint the left ball in color 0 and the right ball in color 1, or paint the left in color 1 and the right in color 0.\n\nSample Input 2\n\n1 10\n\nSample Output 2\n\n10\n\nSince there is only one ball, we can use any of the ten colors to paint it. Thus, the answer is ten.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 152, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s763417896", "group_id": "codeNet:p03963", "input_text": "let a, b = Scanf.scanf \"%d %d\\n\" (fun a b -> a, b)\nlet rec pow n x =\n  match n with\n  | 1 -> x\n  | n' -> x * pow (n'-1) x\n\nlet ans =\n  if a = 1 then b\n  else b * pow (a-1) (b-1)\n\nlet () =\n  print_int ans; print_newline ()", "language": "OCaml", "metadata": {"date": 1477003168, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03963.html", "problem_id": "p03963", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03963/input.txt", "sample_output_relpath": "derived/input_output/data/p03963/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03963/OCaml/s763417896.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s763417896", "user_id": "u098968285"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let a, b = Scanf.scanf \"%d %d\\n\" (fun a b -> a, b)\nlet rec pow n x =\n  match n with\n  | 1 -> x\n  | n' -> x * pow (n'-1) x\n\nlet ans =\n  if a = 1 then b\n  else b * pow (a-1) (b-1)\n\nlet () =\n  print_int ans; print_newline ()", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N balls placed in a row.\nAtCoDeer the deer is painting each of these in one of the K colors of his paint cans.\nFor aesthetic reasons, any two adjacent balls must be painted in different colors.\n\nFind the number of the possible ways to paint the balls.\n\nConstraints\n\n1≦N≦1000\n\n2≦K≦1000\n\nThe correct answer is at most 2^{31}-1.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of the possible ways to paint the balls.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n2\n\nWe will denote the colors by 0 and 1. There are two possible ways: we can either paint the left ball in color 0 and the right ball in color 1, or paint the left in color 1 and the right in color 0.\n\nSample Input 2\n\n1 10\n\nSample Output 2\n\n10\n\nSince there is only one ball, we can use any of the ten colors to paint it. Thus, the answer is ten.", "sample_input": "2 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03963", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N balls placed in a row.\nAtCoDeer the deer is painting each of these in one of the K colors of his paint cans.\nFor aesthetic reasons, any two adjacent balls must be painted in different colors.\n\nFind the number of the possible ways to paint the balls.\n\nConstraints\n\n1≦N≦1000\n\n2≦K≦1000\n\nThe correct answer is at most 2^{31}-1.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of the possible ways to paint the balls.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n2\n\nWe will denote the colors by 0 and 1. There are two possible ways: we can either paint the left ball in color 0 and the right ball in color 1, or paint the left in color 1 and the right in color 0.\n\nSample Input 2\n\n1 10\n\nSample Output 2\n\n10\n\nSince there is only one ball, we can use any of the ten colors to paint it. Thus, the answer is ten.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 221, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s429113314", "group_id": "codeNet:p03964", "input_text": "let () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  let t_a = Array.to_list @@ Array.init n (fun _ -> Scanf.scanf \"%d %d \" (fun a b -> a,b)) in\n\n  let rec aux cur = function\n    | [] -> cur \n    | (t,a) :: tl -> \n      let (rt,ra) = cur in\n      if rt <= t && ra <= a \n      then \n        aux (t,a) tl\n      else (\n        let mul = max \n            (if ra mod a <> 0 then ra/a+1 else ra/a) \n            (if rt mod t <> 0 then rt/t+1 else rt/t) \n        in\n        aux (t*mul,a*mul) tl\n\n      )\n  in\n\n  let (rt, ra) = aux (0,0) t_a in\n  Printf.printf \"%d\\n\" (rt + ra)\n", "language": "OCaml", "metadata": {"date": 1528725284, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03964.html", "problem_id": "p03964", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03964/input.txt", "sample_output_relpath": "derived/input_output/data/p03964/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03964/OCaml/s429113314.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s429113314", "user_id": "u139013163"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let () =\n  let n = Scanf.scanf \"%d \" (fun a -> a) in\n  let t_a = Array.to_list @@ Array.init n (fun _ -> Scanf.scanf \"%d %d \" (fun a b -> a,b)) in\n\n  let rec aux cur = function\n    | [] -> cur \n    | (t,a) :: tl -> \n      let (rt,ra) = cur in\n      if rt <= t && ra <= a \n      then \n        aux (t,a) tl\n      else (\n        let mul = max \n            (if ra mod a <> 0 then ra/a+1 else ra/a) \n            (if rt mod t <> 0 then rt/t+1 else rt/t) \n        in\n        aux (t*mul,a*mul) tl\n\n      )\n  in\n\n  let (rt, ra) = aux (0,0) t_a in\n  Printf.printf \"%d\\n\" (rt + ra)\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is seeing a quick report of election results on TV.\nTwo candidates are standing for the election: Takahashi and Aoki.\nThe report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes.\nAtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i.\nIt is known that each candidate had at least one vote when he checked the report for the first time.\n\nFind the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time.\nIt can be assumed that the number of votes obtained by each candidate never decreases.\n\nConstraints\n\n1≦N≦1000\n\n1≦T_i,A_i≦1000 (1≦i≦N)\n\nT_i and A_i (1≦i≦N) are coprime.\n\nIt is guaranteed that the correct answer is at most 10^{18}.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nT_1 A_1\nT_2 A_2\n:\nT_N A_N\n\nOutput\n\nPrint the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.\n\nSample Input 1\n\n3\n2 3\n1 1\n3 2\n\nSample Output 1\n\n10\n\nWhen the numbers of votes obtained by the two candidates change as 2,3 → 3,3 → 6,4, the total number of votes at the end is 10, which is the minimum possible number.\n\nSample Input 2\n\n4\n1 1\n1 1\n1 5\n1 100\n\nSample Output 2\n\n101\n\nIt is possible that neither candidate obtained a vote between the moment when he checked the report, and the moment when he checked it for the next time.\n\nSample Input 3\n\n5\n3 10\n48 17\n31 199\n231 23\n3 2\n\nSample Output 3\n\n6930", "sample_input": "3\n2 3\n1 1\n3 2\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03964", "source_text": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is seeing a quick report of election results on TV.\nTwo candidates are standing for the election: Takahashi and Aoki.\nThe report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes.\nAtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i.\nIt is known that each candidate had at least one vote when he checked the report for the first time.\n\nFind the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time.\nIt can be assumed that the number of votes obtained by each candidate never decreases.\n\nConstraints\n\n1≦N≦1000\n\n1≦T_i,A_i≦1000 (1≦i≦N)\n\nT_i and A_i (1≦i≦N) are coprime.\n\nIt is guaranteed that the correct answer is at most 10^{18}.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nT_1 A_1\nT_2 A_2\n:\nT_N A_N\n\nOutput\n\nPrint the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.\n\nSample Input 1\n\n3\n2 3\n1 1\n3 2\n\nSample Output 1\n\n10\n\nWhen the numbers of votes obtained by the two candidates change as 2,3 → 3,3 → 6,4, the total number of votes at the end is 10, which is the minimum possible number.\n\nSample Input 2\n\n4\n1 1\n1 1\n1 5\n1 100\n\nSample Output 2\n\n101\n\nIt is possible that neither candidate obtained a vote between the moment when he checked the report, and the moment when he checked it for the next time.\n\nSample Input 3\n\n5\n3 10\n48 17\n31 199\n231 23\n3 2\n\nSample Output 3\n\n6930", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 1024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s150352595", "group_id": "codeNet:p03964", "input_text": "let inf = 1000000000000000001\nlet step (a, b) (r1, r2) =\n  let c1 = begin\n    let ta = (a + r1 - 1) / r1 * r1 in\n    let tb = ta / r1 * r2 in\n    let m = (b + tb - 1) / tb in\n    (m * ta, m * tb)\n  end in\n  let c2 = begin\n    let tb = (b + r2 - 1) / r2 * r2 in\n    let ta = tb / r2 * r1 in\n    let m = (a + ta - 1) / ta in\n    (m * ta, m * tb)\n  end in\n  min c1 c2\n\nlet n = Scanf.scanf \"%d\" (fun x -> x)\nlet () =\n  Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x, y))\n  |> Array.fold_left step (1, 1)\n  |> (fun (a, b) -> Printf.printf \"%d\\n\" (a+b))\n\n", "language": "OCaml", "metadata": {"date": 1527926542, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03964.html", "problem_id": "p03964", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03964/input.txt", "sample_output_relpath": "derived/input_output/data/p03964/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03964/OCaml/s150352595.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s150352595", "user_id": "u798181098"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let inf = 1000000000000000001\nlet step (a, b) (r1, r2) =\n  let c1 = begin\n    let ta = (a + r1 - 1) / r1 * r1 in\n    let tb = ta / r1 * r2 in\n    let m = (b + tb - 1) / tb in\n    (m * ta, m * tb)\n  end in\n  let c2 = begin\n    let tb = (b + r2 - 1) / r2 * r2 in\n    let ta = tb / r2 * r1 in\n    let m = (a + ta - 1) / ta in\n    (m * ta, m * tb)\n  end in\n  min c1 c2\n\nlet n = Scanf.scanf \"%d\" (fun x -> x)\nlet () =\n  Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x, y))\n  |> Array.fold_left step (1, 1)\n  |> (fun (a, b) -> Printf.printf \"%d\\n\" (a+b))\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is seeing a quick report of election results on TV.\nTwo candidates are standing for the election: Takahashi and Aoki.\nThe report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes.\nAtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i.\nIt is known that each candidate had at least one vote when he checked the report for the first time.\n\nFind the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time.\nIt can be assumed that the number of votes obtained by each candidate never decreases.\n\nConstraints\n\n1≦N≦1000\n\n1≦T_i,A_i≦1000 (1≦i≦N)\n\nT_i and A_i (1≦i≦N) are coprime.\n\nIt is guaranteed that the correct answer is at most 10^{18}.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nT_1 A_1\nT_2 A_2\n:\nT_N A_N\n\nOutput\n\nPrint the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.\n\nSample Input 1\n\n3\n2 3\n1 1\n3 2\n\nSample Output 1\n\n10\n\nWhen the numbers of votes obtained by the two candidates change as 2,3 → 3,3 → 6,4, the total number of votes at the end is 10, which is the minimum possible number.\n\nSample Input 2\n\n4\n1 1\n1 1\n1 5\n1 100\n\nSample Output 2\n\n101\n\nIt is possible that neither candidate obtained a vote between the moment when he checked the report, and the moment when he checked it for the next time.\n\nSample Input 3\n\n5\n3 10\n48 17\n31 199\n231 23\n3 2\n\nSample Output 3\n\n6930", "sample_input": "3\n2 3\n1 1\n3 2\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03964", "source_text": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is seeing a quick report of election results on TV.\nTwo candidates are standing for the election: Takahashi and Aoki.\nThe report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes.\nAtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i.\nIt is known that each candidate had at least one vote when he checked the report for the first time.\n\nFind the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time.\nIt can be assumed that the number of votes obtained by each candidate never decreases.\n\nConstraints\n\n1≦N≦1000\n\n1≦T_i,A_i≦1000 (1≦i≦N)\n\nT_i and A_i (1≦i≦N) are coprime.\n\nIt is guaranteed that the correct answer is at most 10^{18}.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nT_1 A_1\nT_2 A_2\n:\nT_N A_N\n\nOutput\n\nPrint the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.\n\nSample Input 1\n\n3\n2 3\n1 1\n3 2\n\nSample Output 1\n\n10\n\nWhen the numbers of votes obtained by the two candidates change as 2,3 → 3,3 → 6,4, the total number of votes at the end is 10, which is the minimum possible number.\n\nSample Input 2\n\n4\n1 1\n1 1\n1 5\n1 100\n\nSample Output 2\n\n101\n\nIt is possible that neither candidate obtained a vote between the moment when he checked the report, and the moment when he checked it for the next time.\n\nSample Input 3\n\n5\n3 10\n48 17\n31 199\n231 23\n3 2\n\nSample Output 3\n\n6930", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s141070653", "group_id": "codeNet:p03964", "input_text": "let rec input n =\n\t\tif n = 0\n\t\tthen []\n\t\telse Scanf.scanf \"%d %d\\n\" (fun x y -> (x,y)) :: input (n - 1)\n\nlet solve lst =\n\tlet rec solve_loop before lst = match lst with\n\t\t| [] -> let(a,b) = before in a + b\n\t\t| first :: xs ->\n\t\t\tlet (x,y) = first in\n\t\t\tlet (a,b) = before in\n\t\t\tlet ratio = max ((a-1)/x+1) ((b-1)/y+1) in\n\t\t\t\tsolve_loop (x*ratio,y*ratio) xs\n\tin\n\t\tsolve_loop (1,1) (List.rev lst)\n\nlet () =\n\tScanf.scanf \"%d\\n\" (fun x -> x) |> input |> solve |> Printf.printf \"%d\"\n", "language": "OCaml", "metadata": {"date": 1477900560, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03964.html", "problem_id": "p03964", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03964/input.txt", "sample_output_relpath": "derived/input_output/data/p03964/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03964/OCaml/s141070653.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s141070653", "user_id": "u604818425"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let rec input n =\n\t\tif n = 0\n\t\tthen []\n\t\telse Scanf.scanf \"%d %d\\n\" (fun x y -> (x,y)) :: input (n - 1)\n\nlet solve lst =\n\tlet rec solve_loop before lst = match lst with\n\t\t| [] -> let(a,b) = before in a + b\n\t\t| first :: xs ->\n\t\t\tlet (x,y) = first in\n\t\t\tlet (a,b) = before in\n\t\t\tlet ratio = max ((a-1)/x+1) ((b-1)/y+1) in\n\t\t\t\tsolve_loop (x*ratio,y*ratio) xs\n\tin\n\t\tsolve_loop (1,1) (List.rev lst)\n\nlet () =\n\tScanf.scanf \"%d\\n\" (fun x -> x) |> input |> solve |> Printf.printf \"%d\"\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is seeing a quick report of election results on TV.\nTwo candidates are standing for the election: Takahashi and Aoki.\nThe report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes.\nAtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i.\nIt is known that each candidate had at least one vote when he checked the report for the first time.\n\nFind the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time.\nIt can be assumed that the number of votes obtained by each candidate never decreases.\n\nConstraints\n\n1≦N≦1000\n\n1≦T_i,A_i≦1000 (1≦i≦N)\n\nT_i and A_i (1≦i≦N) are coprime.\n\nIt is guaranteed that the correct answer is at most 10^{18}.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nT_1 A_1\nT_2 A_2\n:\nT_N A_N\n\nOutput\n\nPrint the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.\n\nSample Input 1\n\n3\n2 3\n1 1\n3 2\n\nSample Output 1\n\n10\n\nWhen the numbers of votes obtained by the two candidates change as 2,3 → 3,3 → 6,4, the total number of votes at the end is 10, which is the minimum possible number.\n\nSample Input 2\n\n4\n1 1\n1 1\n1 5\n1 100\n\nSample Output 2\n\n101\n\nIt is possible that neither candidate obtained a vote between the moment when he checked the report, and the moment when he checked it for the next time.\n\nSample Input 3\n\n5\n3 10\n48 17\n31 199\n231 23\n3 2\n\nSample Output 3\n\n6930", "sample_input": "3\n2 3\n1 1\n3 2\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03964", "source_text": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is seeing a quick report of election results on TV.\nTwo candidates are standing for the election: Takahashi and Aoki.\nThe report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes.\nAtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i.\nIt is known that each candidate had at least one vote when he checked the report for the first time.\n\nFind the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time.\nIt can be assumed that the number of votes obtained by each candidate never decreases.\n\nConstraints\n\n1≦N≦1000\n\n1≦T_i,A_i≦1000 (1≦i≦N)\n\nT_i and A_i (1≦i≦N) are coprime.\n\nIt is guaranteed that the correct answer is at most 10^{18}.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nT_1 A_1\nT_2 A_2\n:\nT_N A_N\n\nOutput\n\nPrint the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.\n\nSample Input 1\n\n3\n2 3\n1 1\n3 2\n\nSample Output 1\n\n10\n\nWhen the numbers of votes obtained by the two candidates change as 2,3 → 3,3 → 6,4, the total number of votes at the end is 10, which is the minimum possible number.\n\nSample Input 2\n\n4\n1 1\n1 1\n1 5\n1 100\n\nSample Output 2\n\n101\n\nIt is possible that neither candidate obtained a vote between the moment when he checked the report, and the moment when he checked it for the next time.\n\nSample Input 3\n\n5\n3 10\n48 17\n31 199\n231 23\n3 2\n\nSample Output 3\n\n6930", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 477, "cpu_time_ms": 3, "memory_kb": 896}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s144446438", "group_id": "codeNet:p03965", "input_text": "let () =\n  let s = Scanf.scanf \"%s \" (fun a -> a) in\n\n  let s_len = String.length s in\n  let p_len = Batteries.String.to_list s |> List.filter (fun x -> x = 'p') |> List.length in\n\n  Printf.printf \"%d\\n\" @@ (s_len/2) - p_len\n", "language": "OCaml", "metadata": {"date": 1528720096, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03965.html", "problem_id": "p03965", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03965/input.txt", "sample_output_relpath": "derived/input_output/data/p03965/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03965/OCaml/s144446438.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s144446438", "user_id": "u139013163"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "let () =\n  let s = Scanf.scanf \"%s \" (fun a -> a) in\n\n  let s_len = String.length s in\n  let p_len = Batteries.String.to_list s |> List.filter (fun x -> x = 'p') |> List.length in\n\n  Printf.printf \"%d\\n\" @@ (s_len/2) - p_len\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer and his friend TopCoDeer is playing a game.\nThe game consists of N turns.\nIn each turn, each player plays one of the two gestures, Rock and Paper, as in Rock-paper-scissors, under the following condition:\n\n(※) After each turn, (the number of times the player has played Paper)≦(the number of times the player has played Rock).\n\nEach player's score is calculated by (the number of turns where the player wins) - (the number of turns where the player loses), where the outcome of each turn is determined by the rules of Rock-paper-scissors.\n\n(For those who are not familiar with Rock-paper-scissors: If one player plays Rock and the other plays Paper, the latter player will win and the former player will lose. If both players play the same gesture, the round is a tie and neither player will win nor lose.)\n\nWith his supernatural power, AtCoDeer was able to foresee the gesture that TopCoDeer will play in each of the N turns, before the game starts.\nPlan AtCoDeer's gesture in each turn to maximize AtCoDeer's score.\n\nThe gesture that TopCoDeer will play in each turn is given by a string s. If the i-th (1≦i≦N) character in s is g, TopCoDeer will play Rock in the i-th turn. Similarly, if the i-th (1≦i≦N) character of s in p, TopCoDeer will play Paper in the i-th turn.\n\nConstraints\n\n1≦N≦10^5\n\nN=|s|\n\nEach character in s is g or p.\n\nThe gestures represented by s satisfy the condition (※).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the AtCoDeer's maximum possible score.\n\nSample Input 1\n\ngpg\n\nSample Output 1\n\n0\n\nPlaying the same gesture as the opponent in each turn results in the score of 0, which is the maximum possible score.\n\nSample Input 2\n\nggppgggpgg\n\nSample Output 2\n\n2\n\nFor example, consider playing gestures in the following order: Rock, Paper, Rock, Paper, Rock, Rock, Paper, Paper, Rock, Paper. This strategy earns three victories and suffers one defeat, resulting in the score of 2, which is the maximum possible score.", "sample_input": "gpg\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03965", "source_text": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer and his friend TopCoDeer is playing a game.\nThe game consists of N turns.\nIn each turn, each player plays one of the two gestures, Rock and Paper, as in Rock-paper-scissors, under the following condition:\n\n(※) After each turn, (the number of times the player has played Paper)≦(the number of times the player has played Rock).\n\nEach player's score is calculated by (the number of turns where the player wins) - (the number of turns where the player loses), where the outcome of each turn is determined by the rules of Rock-paper-scissors.\n\n(For those who are not familiar with Rock-paper-scissors: If one player plays Rock and the other plays Paper, the latter player will win and the former player will lose. If both players play the same gesture, the round is a tie and neither player will win nor lose.)\n\nWith his supernatural power, AtCoDeer was able to foresee the gesture that TopCoDeer will play in each of the N turns, before the game starts.\nPlan AtCoDeer's gesture in each turn to maximize AtCoDeer's score.\n\nThe gesture that TopCoDeer will play in each turn is given by a string s. If the i-th (1≦i≦N) character in s is g, TopCoDeer will play Rock in the i-th turn. Similarly, if the i-th (1≦i≦N) character of s in p, TopCoDeer will play Paper in the i-th turn.\n\nConstraints\n\n1≦N≦10^5\n\nN=|s|\n\nEach character in s is g or p.\n\nThe gestures represented by s satisfy the condition (※).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the AtCoDeer's maximum possible score.\n\nSample Input 1\n\ngpg\n\nSample Output 1\n\n0\n\nPlaying the same gesture as the opponent in each turn results in the score of 0, which is the maximum possible score.\n\nSample Input 2\n\nggppgggpgg\n\nSample Output 2\n\n2\n\nFor example, consider playing gestures in the following order: Rock, Paper, Rock, Paper, Rock, Rock, Paper, Paper, Rock, Paper. This strategy earns three victories and suffers one defeat, resulting in the score of 2, which is the maximum possible score.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 10, "memory_kb": 6656}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s821095244", "group_id": "codeNet:p03966", "input_text": "let () =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let tas = Array.init n (fun _ -> Scanf.scanf \"%d %d\\n\" (fun t a -> t, a)) in\n  Array.fold_left (fun (x, y) (t, a) ->\n    let n = max ((x + t - 1) / t) ((y + a - 1) / a) in\n    (t * n, a * n)) (1, 1) tas\n  |> (fun (x, y) -> x + y)\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1510534801, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03966.html", "problem_id": "p03966", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03966/input.txt", "sample_output_relpath": "derived/input_output/data/p03966/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03966/OCaml/s821095244.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s821095244", "user_id": "u504158101"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let () =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let tas = Array.init n (fun _ -> Scanf.scanf \"%d %d\\n\" (fun t a -> t, a)) in\n  Array.fold_left (fun (x, y) (t, a) ->\n    let n = max ((x + t - 1) / t) ((y + a - 1) / a) in\n    (t * n, a * n)) (1, 1) tas\n  |> (fun (x, y) -> x + y)\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is seeing a quick report of election results on TV.\nTwo candidates are standing for the election: Takahashi and Aoki.\nThe report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes.\nAtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i.\nIt is known that each candidate had at least one vote when he checked the report for the first time.\n\nFind the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time.\nIt can be assumed that the number of votes obtained by each candidate never decreases.\n\nConstraints\n\n1≦N≦1000\n\n1≦T_i,A_i≦1000 (1≦i≦N)\n\nT_i and A_i (1≦i≦N) are coprime.\n\nIt is guaranteed that the correct answer is at most 10^{18}.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nT_1 A_1\nT_2 A_2\n:\nT_N A_N\n\nOutput\n\nPrint the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.\n\nSample Input 1\n\n3\n2 3\n1 1\n3 2\n\nSample Output 1\n\n10\n\nWhen the numbers of votes obtained by the two candidates change as 2,3 → 3,3 → 6,4, the total number of votes at the end is 10, which is the minimum possible number.\n\nSample Input 2\n\n4\n1 1\n1 1\n1 5\n1 100\n\nSample Output 2\n\n101\n\nIt is possible that neither candidate obtained a vote between the moment when he checked the report, and the moment when he checked it for the next time.\n\nSample Input 3\n\n5\n3 10\n48 17\n31 199\n231 23\n3 2\n\nSample Output 3\n\n6930", "sample_input": "3\n2 3\n1 1\n3 2\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03966", "source_text": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer is seeing a quick report of election results on TV.\nTwo candidates are standing for the election: Takahashi and Aoki.\nThe report shows the ratio of the current numbers of votes the two candidates have obtained, but not the actual numbers of votes.\nAtCoDeer has checked the report N times, and when he checked it for the i-th (1≦i≦N) time, the ratio was T_i:A_i.\nIt is known that each candidate had at least one vote when he checked the report for the first time.\n\nFind the minimum possible total number of votes obtained by the two candidates when he checked the report for the N-th time.\nIt can be assumed that the number of votes obtained by each candidate never decreases.\n\nConstraints\n\n1≦N≦1000\n\n1≦T_i,A_i≦1000 (1≦i≦N)\n\nT_i and A_i (1≦i≦N) are coprime.\n\nIt is guaranteed that the correct answer is at most 10^{18}.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nT_1 A_1\nT_2 A_2\n:\nT_N A_N\n\nOutput\n\nPrint the minimum possible total number of votes obtained by Takahashi and Aoki when AtCoDeer checked the report for the N-th time.\n\nSample Input 1\n\n3\n2 3\n1 1\n3 2\n\nSample Output 1\n\n10\n\nWhen the numbers of votes obtained by the two candidates change as 2,3 → 3,3 → 6,4, the total number of votes at the end is 10, which is the minimum possible number.\n\nSample Input 2\n\n4\n1 1\n1 1\n1 5\n1 100\n\nSample Output 2\n\n101\n\nIt is possible that neither candidate obtained a vote between the moment when he checked the report, and the moment when he checked it for the next time.\n\nSample Input 3\n\n5\n3 10\n48 17\n31 199\n231 23\n3 2\n\nSample Output 3\n\n6930", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 1024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s185636205", "group_id": "codeNet:p03970", "input_text": "let s = read_line ()\nlet ans = ref 0\nlet _ = String.iteri (fun i c -> if c <> \"CODEFESTIVAL2016\".[i] then incr ans) s; Printf.printf \"%d\\n\" !ans", "language": "OCaml", "metadata": {"date": 1564190965, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03970.html", "problem_id": "p03970", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03970/input.txt", "sample_output_relpath": "derived/input_output/data/p03970/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03970/OCaml/s185636205.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s185636205", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let s = read_line ()\nlet ans = ref 0\nlet _ = String.iteri (fun i c -> if c <> \"CODEFESTIVAL2016\".[i] then incr ans) s; Printf.printf \"%d\\n\" !ans", "problem_context": "Score : 100 points\n\nProblem Statement\n\nCODE FESTIVAL 2016 is going to be held. For the occasion, Mr. Takahashi decided to make a signboard.\n\nHe intended to write CODEFESTIVAL2016 on it, but he mistakenly wrote a different string S. Fortunately, the string he wrote was the correct length.\n\nSo Mr. Takahashi decided to perform an operation that replaces a certain character with another in the minimum number of iterations, changing the string to CODEFESTIVAL2016.\n\nFind the minimum number of iterations for the rewrite operation.\n\nConstraints\n\nS is 16 characters long.\n\nS consists of uppercase and lowercase alphabet letters and numerals.\n\nInput\n\nInputs are provided from Standard Input in the following form.\n\nS\n\nOutput\n\nOutput an integer representing the minimum number of iterations needed for the rewrite operation.\n\nSample Input 1\n\nC0DEFESTIVAL2O16\n\nSample Output 1\n\n2\n\nThe second character 0 must be changed to O and the 14th character O changed to 0.\n\nSample Input 2\n\nFESTIVAL2016CODE\n\nSample Output 2\n\n16", "sample_input": "C0DEFESTIVAL2O16\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03970", "source_text": "Score : 100 points\n\nProblem Statement\n\nCODE FESTIVAL 2016 is going to be held. For the occasion, Mr. Takahashi decided to make a signboard.\n\nHe intended to write CODEFESTIVAL2016 on it, but he mistakenly wrote a different string S. Fortunately, the string he wrote was the correct length.\n\nSo Mr. Takahashi decided to perform an operation that replaces a certain character with another in the minimum number of iterations, changing the string to CODEFESTIVAL2016.\n\nFind the minimum number of iterations for the rewrite operation.\n\nConstraints\n\nS is 16 characters long.\n\nS consists of uppercase and lowercase alphabet letters and numerals.\n\nInput\n\nInputs are provided from Standard Input in the following form.\n\nS\n\nOutput\n\nOutput an integer representing the minimum number of iterations needed for the rewrite operation.\n\nSample Input 1\n\nC0DEFESTIVAL2O16\n\nSample Output 1\n\n2\n\nThe second character 0 must be changed to O and the 14th character O changed to 0.\n\nSample Input 2\n\nFESTIVAL2016CODE\n\nSample Output 2\n\n16", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s570606321", "group_id": "codeNet:p03971", "input_text": "module String = struct\n  include String\n  let to_list s =\n    let rec loop acc = function\n      | 0 -> acc\n      | n -> loop (s.[n - 1] :: acc) (n - 1) in\n    loop [] (String.length s)\nend\n\nlet () =\n  let n, a, b = Scanf.scanf \"%d %d %d\\n\" (fun n a b -> n, a, b) in\n  let s = Scanf.scanf \"%s\\n\" (fun s -> s) in\n  String.to_list s\n    |> List.fold_left (fun (accepted, foreigners) -> function\n      | 'a' ->\n          if accepted < a + b then begin\n            print_endline \"Yes\";\n            (accepted + 1, foreigners)\n          end else begin\n            print_endline \"No\";\n            (accepted, foreigners)\n          end\n      | 'b' ->\n          if accepted < a + b && foreigners < b then begin\n            print_endline \"Yes\";\n            (accepted + 1, foreigners + 1)\n          end else begin\n            print_endline \"No\";\n            (accepted, foreigners + 1)\n          end\n      | 'c' -> print_endline \"No\"; (accepted, foreigners)) (0, 0)\n    |> ignore", "language": "OCaml", "metadata": {"date": 1476124527, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s570606321.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s570606321", "user_id": "u504158101"}, "prompt_components": {"gold_output": "Yes\nYes\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\n", "input_to_evaluate": "module String = struct\n  include String\n  let to_list s =\n    let rec loop acc = function\n      | 0 -> acc\n      | n -> loop (s.[n - 1] :: acc) (n - 1) in\n    loop [] (String.length s)\nend\n\nlet () =\n  let n, a, b = Scanf.scanf \"%d %d %d\\n\" (fun n a b -> n, a, b) in\n  let s = Scanf.scanf \"%s\\n\" (fun s -> s) in\n  String.to_list s\n    |> List.fold_left (fun (accepted, foreigners) -> function\n      | 'a' ->\n          if accepted < a + b then begin\n            print_endline \"Yes\";\n            (accepted + 1, foreigners)\n          end else begin\n            print_endline \"No\";\n            (accepted, foreigners)\n          end\n      | 'b' ->\n          if accepted < a + b && foreigners < b then begin\n            print_endline \"Yes\";\n            (accepted + 1, foreigners + 1)\n          end else begin\n            print_endline \"No\";\n            (accepted, foreigners + 1)\n          end\n      | 'c' -> print_endline \"No\"; (accepted, foreigners)) (0, 0)\n    |> ignore", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N participants in the CODE FESTIVAL 2016 Qualification contests. The participants are either students in Japan, students from overseas, or neither of these.\n\nOnly Japanese students or overseas students can pass the Qualification contests. The students pass when they satisfy the conditions listed below, from the top rank down. Participants who are not students cannot pass the Qualification contests.\n\nA Japanese student passes the Qualification contests if the number of the participants who have already definitively passed is currently fewer than A+B.\n\nAn overseas student passes the Qualification contests if the number of the participants who have already definitively passed is currently fewer than A+B and the student ranks B-th or above among all overseas students.\n\nA string S is assigned indicating attributes of all participants. If the i-th character of string S is a, this means the participant ranked i-th in the Qualification contests is a Japanese student; b means the participant ranked i-th is an overseas student; and c means the participant ranked i-th is neither of these.\n\nWrite a program that outputs for all the participants in descending rank either Yes if they passed the Qualification contests or No if they did not pass.\n\nConstraints\n\n1≦N,A,B≦100000\n\nA+B≦N\n\nS is N characters long.\n\nS consists only of the letters a, b and c.\n\nInput\n\nInputs are provided from Standard Input in the following form.\n\nN A B\nS\n\nOutput\n\nOutput N lines. On the i-th line, output Yes if the i-th participant passed the Qualification contests or No if that participant did not pass.\n\nSample Input 1\n\n10 2 3\nabccabaabb\n\nSample Output 1\n\nYes\nYes\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\n\nThe first, second, fifth, sixth, and seventh participants pass the Qualification contests.\n\nSample Input 2\n\n12 5 2\ncabbabaacaba\n\nSample Output 2\n\nNo\nYes\nYes\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nNo\nNo\n\nThe sixth participant is third among overseas students and thus does not pass the Qualification contests.\n\nSample Input 3\n\n5 2 2\nccccc\n\nSample Output 3\n\nNo\nNo\nNo\nNo\nNo", "sample_input": "10 2 3\nabccabaabb\n"}, "reference_outputs": ["Yes\nYes\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\n"], "source_document_id": "p03971", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N participants in the CODE FESTIVAL 2016 Qualification contests. The participants are either students in Japan, students from overseas, or neither of these.\n\nOnly Japanese students or overseas students can pass the Qualification contests. The students pass when they satisfy the conditions listed below, from the top rank down. Participants who are not students cannot pass the Qualification contests.\n\nA Japanese student passes the Qualification contests if the number of the participants who have already definitively passed is currently fewer than A+B.\n\nAn overseas student passes the Qualification contests if the number of the participants who have already definitively passed is currently fewer than A+B and the student ranks B-th or above among all overseas students.\n\nA string S is assigned indicating attributes of all participants. If the i-th character of string S is a, this means the participant ranked i-th in the Qualification contests is a Japanese student; b means the participant ranked i-th is an overseas student; and c means the participant ranked i-th is neither of these.\n\nWrite a program that outputs for all the participants in descending rank either Yes if they passed the Qualification contests or No if they did not pass.\n\nConstraints\n\n1≦N,A,B≦100000\n\nA+B≦N\n\nS is N characters long.\n\nS consists only of the letters a, b and c.\n\nInput\n\nInputs are provided from Standard Input in the following form.\n\nN A B\nS\n\nOutput\n\nOutput N lines. On the i-th line, output Yes if the i-th participant passed the Qualification contests or No if that participant did not pass.\n\nSample Input 1\n\n10 2 3\nabccabaabb\n\nSample Output 1\n\nYes\nYes\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\n\nThe first, second, fifth, sixth, and seventh participants pass the Qualification contests.\n\nSample Input 2\n\n12 5 2\ncabbabaacaba\n\nSample Output 2\n\nNo\nYes\nYes\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nNo\nNo\n\nThe sixth participant is third among overseas students and thus does not pass the Qualification contests.\n\nSample Input 3\n\n5 2 2\nccccc\n\nSample Output 3\n\nNo\nNo\nNo\nNo\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 965, "cpu_time_ms": 415, "memory_kb": 5376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s231703072", "group_id": "codeNet:p03972", "input_text": "let () = Scanf.scanf \"%d %d\\n\" @@ fun w h ->\n  begin\n    Array.to_list (Array.init w (fun _ ->\n      Scanf.scanf \"%d\\n\" (fun p -> (p, `Col)))) @\n    Array.to_list (Array.init h (fun _ ->\n      Scanf.scanf \"%d\\n\" (fun q -> (q, `Row))))\n  end\n  |> List.sort (fun (p, _) (q, _) -> compare p q)\n  |> List.fold_left (fun (cost, (row, col)) -> function\n    | (p, `Col) ->\n        (* p_i は，∀j. (i, j)と(i + 1, j)を結ぶコスト *)\n        (cost + p * row, (row, col - 1))\n    | (q, `Row) ->\n        (* q_j は，∀i. (i, j)と(i, j + 1)を結ぶコスト *)\n        (cost + q * col, (row - 1, col))) (0, (h + 1, w + 1))\n  |> fst\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1526800674, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03972.html", "problem_id": "p03972", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03972/input.txt", "sample_output_relpath": "derived/input_output/data/p03972/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03972/OCaml/s231703072.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s231703072", "user_id": "u504158101"}, "prompt_components": {"gold_output": "29\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\\n\" @@ fun w h ->\n  begin\n    Array.to_list (Array.init w (fun _ ->\n      Scanf.scanf \"%d\\n\" (fun p -> (p, `Col)))) @\n    Array.to_list (Array.init h (fun _ ->\n      Scanf.scanf \"%d\\n\" (fun q -> (q, `Row))))\n  end\n  |> List.sort (fun (p, _) (q, _) -> compare p q)\n  |> List.fold_left (fun (cost, (row, col)) -> function\n    | (p, `Col) ->\n        (* p_i は，∀j. (i, j)と(i + 1, j)を結ぶコスト *)\n        (cost + p * row, (row, col - 1))\n    | (q, `Row) ->\n        (* q_j は，∀i. (i, j)と(i, j + 1)を結ぶコスト *)\n        (cost + q * col, (row - 1, col))) (0, (h + 1, w + 1))\n  |> fst\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 500 points\n\nProblem Statement\n\nOn an xy plane, in an area satisfying 0 ≤ x ≤ W, 0 ≤ y ≤ H, there is one house at each and every point where both x and y are integers.\n\nThere are unpaved roads between every pair of points for which either the x coordinates are equal and the difference between the y coordinates is 1, or the y coordinates are equal and the difference between the x coordinates is 1.\n\nThe cost of paving a road between houses on coordinates (i,j) and (i+1,j) is p_i for any value of j, while the cost of paving a road between houses on coordinates (i,j) and (i,j+1) is q_j for any value of i.\n\nMr. Takahashi wants to pave some of these roads and be able to travel between any two houses on paved roads only. Find the solution with the minimum total cost.\n\nConstraints\n\n1 ≦ W,H ≦ 10^5\n\n1 ≦ p_i ≦ 10^8(0 ≦ i ≦ W-1)\n\n1 ≦ q_j ≦ 10^8(0 ≦ j ≦ H-1)\n\np_i (0 ≦ i ≦ W−1) is an integer.\n\nq_j (0 ≦ j ≦ H−1) is an integer.\n\nInput\n\nInputs are provided from Standard Input in the following form.\n\nW H\np_0\n:\np_{W-1}\nq_0\n:\nq_{H-1}\n\nOutput\n\nOutput an integer representing the minimum total cost.\n\nSample Input 1\n\n2 2\n3\n5\n2\n7\n\nSample Output 1\n\n29\n\nIt is enough to pave the following eight roads.\n\nRoad connecting houses at (0,0) and (0,1)\n\nRoad connecting houses at (0,1) and (1,1)\n\nRoad connecting houses at (0,2) and (1,2)\n\nRoad connecting houses at (1,0) and (1,1)\n\nRoad connecting houses at (1,0) and (2,0)\n\nRoad connecting houses at (1,1) and (1,2)\n\nRoad connecting houses at (1,2) and (2,2)\n\nRoad connecting houses at (2,0) and (2,1)\n\nSample Input 2\n\n4 3\n2\n4\n8\n1\n2\n9\n3\n\nSample Output 2\n\n60", "sample_input": "2 2\n3\n5\n2\n7\n"}, "reference_outputs": ["29\n"], "source_document_id": "p03972", "source_text": "Score : 500 points\n\nProblem Statement\n\nOn an xy plane, in an area satisfying 0 ≤ x ≤ W, 0 ≤ y ≤ H, there is one house at each and every point where both x and y are integers.\n\nThere are unpaved roads between every pair of points for which either the x coordinates are equal and the difference between the y coordinates is 1, or the y coordinates are equal and the difference between the x coordinates is 1.\n\nThe cost of paving a road between houses on coordinates (i,j) and (i+1,j) is p_i for any value of j, while the cost of paving a road between houses on coordinates (i,j) and (i,j+1) is q_j for any value of i.\n\nMr. Takahashi wants to pave some of these roads and be able to travel between any two houses on paved roads only. Find the solution with the minimum total cost.\n\nConstraints\n\n1 ≦ W,H ≦ 10^5\n\n1 ≦ p_i ≦ 10^8(0 ≦ i ≦ W-1)\n\n1 ≦ q_j ≦ 10^8(0 ≦ j ≦ H-1)\n\np_i (0 ≦ i ≦ W−1) is an integer.\n\nq_j (0 ≦ j ≦ H−1) is an integer.\n\nInput\n\nInputs are provided from Standard Input in the following form.\n\nW H\np_0\n:\np_{W-1}\nq_0\n:\nq_{H-1}\n\nOutput\n\nOutput an integer representing the minimum total cost.\n\nSample Input 1\n\n2 2\n3\n5\n2\n7\n\nSample Output 1\n\n29\n\nIt is enough to pave the following eight roads.\n\nRoad connecting houses at (0,0) and (0,1)\n\nRoad connecting houses at (0,1) and (1,1)\n\nRoad connecting houses at (0,2) and (1,2)\n\nRoad connecting houses at (1,0) and (1,1)\n\nRoad connecting houses at (1,0) and (2,0)\n\nRoad connecting houses at (1,1) and (1,2)\n\nRoad connecting houses at (1,2) and (2,2)\n\nRoad connecting houses at (2,0) and (2,1)\n\nSample Input 2\n\n4 3\n2\n4\n8\n1\n2\n9\n3\n\nSample Output 2\n\n60", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 658, "cpu_time_ms": 204, "memory_kb": 28164}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s264237037", "group_id": "codeNet:p03972", "input_text": "let () = Scanf.scanf \"%d %d\\n\" @@ fun w h ->\n  begin\n    Array.to_list (Array.init w (fun i ->\n      Scanf.scanf \"%d\\n\" (fun p -> (p, `Col)))) @\n    Array.to_list (Array.init h (fun i ->\n      Scanf.scanf \"%d\\n\" (fun q -> (q, `Row))))\n  end\n  |> List.sort (fun (p, _) (q, _) -> compare p q)\n  |> List.fold_left (fun (cost, (row, col)) -> function\n    | (p, `Col) -> (cost + p * (h + 1 - row), (row, col + 1))\n    | (q, `Row) -> (cost + q * (w + 1 - col), (row + 1, col))) (0, (0, 0))\n  |> fst\n  |> Printf.printf \"%d\\n\"\n\n\n", "language": "OCaml", "metadata": {"date": 1526797454, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03972.html", "problem_id": "p03972", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03972/input.txt", "sample_output_relpath": "derived/input_output/data/p03972/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03972/OCaml/s264237037.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s264237037", "user_id": "u504158101"}, "prompt_components": {"gold_output": "29\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\\n\" @@ fun w h ->\n  begin\n    Array.to_list (Array.init w (fun i ->\n      Scanf.scanf \"%d\\n\" (fun p -> (p, `Col)))) @\n    Array.to_list (Array.init h (fun i ->\n      Scanf.scanf \"%d\\n\" (fun q -> (q, `Row))))\n  end\n  |> List.sort (fun (p, _) (q, _) -> compare p q)\n  |> List.fold_left (fun (cost, (row, col)) -> function\n    | (p, `Col) -> (cost + p * (h + 1 - row), (row, col + 1))\n    | (q, `Row) -> (cost + q * (w + 1 - col), (row + 1, col))) (0, (0, 0))\n  |> fst\n  |> Printf.printf \"%d\\n\"\n\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nOn an xy plane, in an area satisfying 0 ≤ x ≤ W, 0 ≤ y ≤ H, there is one house at each and every point where both x and y are integers.\n\nThere are unpaved roads between every pair of points for which either the x coordinates are equal and the difference between the y coordinates is 1, or the y coordinates are equal and the difference between the x coordinates is 1.\n\nThe cost of paving a road between houses on coordinates (i,j) and (i+1,j) is p_i for any value of j, while the cost of paving a road between houses on coordinates (i,j) and (i,j+1) is q_j for any value of i.\n\nMr. Takahashi wants to pave some of these roads and be able to travel between any two houses on paved roads only. Find the solution with the minimum total cost.\n\nConstraints\n\n1 ≦ W,H ≦ 10^5\n\n1 ≦ p_i ≦ 10^8(0 ≦ i ≦ W-1)\n\n1 ≦ q_j ≦ 10^8(0 ≦ j ≦ H-1)\n\np_i (0 ≦ i ≦ W−1) is an integer.\n\nq_j (0 ≦ j ≦ H−1) is an integer.\n\nInput\n\nInputs are provided from Standard Input in the following form.\n\nW H\np_0\n:\np_{W-1}\nq_0\n:\nq_{H-1}\n\nOutput\n\nOutput an integer representing the minimum total cost.\n\nSample Input 1\n\n2 2\n3\n5\n2\n7\n\nSample Output 1\n\n29\n\nIt is enough to pave the following eight roads.\n\nRoad connecting houses at (0,0) and (0,1)\n\nRoad connecting houses at (0,1) and (1,1)\n\nRoad connecting houses at (0,2) and (1,2)\n\nRoad connecting houses at (1,0) and (1,1)\n\nRoad connecting houses at (1,0) and (2,0)\n\nRoad connecting houses at (1,1) and (1,2)\n\nRoad connecting houses at (1,2) and (2,2)\n\nRoad connecting houses at (2,0) and (2,1)\n\nSample Input 2\n\n4 3\n2\n4\n8\n1\n2\n9\n3\n\nSample Output 2\n\n60", "sample_input": "2 2\n3\n5\n2\n7\n"}, "reference_outputs": ["29\n"], "source_document_id": "p03972", "source_text": "Score : 500 points\n\nProblem Statement\n\nOn an xy plane, in an area satisfying 0 ≤ x ≤ W, 0 ≤ y ≤ H, there is one house at each and every point where both x and y are integers.\n\nThere are unpaved roads between every pair of points for which either the x coordinates are equal and the difference between the y coordinates is 1, or the y coordinates are equal and the difference between the x coordinates is 1.\n\nThe cost of paving a road between houses on coordinates (i,j) and (i+1,j) is p_i for any value of j, while the cost of paving a road between houses on coordinates (i,j) and (i,j+1) is q_j for any value of i.\n\nMr. Takahashi wants to pave some of these roads and be able to travel between any two houses on paved roads only. Find the solution with the minimum total cost.\n\nConstraints\n\n1 ≦ W,H ≦ 10^5\n\n1 ≦ p_i ≦ 10^8(0 ≦ i ≦ W-1)\n\n1 ≦ q_j ≦ 10^8(0 ≦ j ≦ H-1)\n\np_i (0 ≦ i ≦ W−1) is an integer.\n\nq_j (0 ≦ j ≦ H−1) is an integer.\n\nInput\n\nInputs are provided from Standard Input in the following form.\n\nW H\np_0\n:\np_{W-1}\nq_0\n:\nq_{H-1}\n\nOutput\n\nOutput an integer representing the minimum total cost.\n\nSample Input 1\n\n2 2\n3\n5\n2\n7\n\nSample Output 1\n\n29\n\nIt is enough to pave the following eight roads.\n\nRoad connecting houses at (0,0) and (0,1)\n\nRoad connecting houses at (0,1) and (1,1)\n\nRoad connecting houses at (0,2) and (1,2)\n\nRoad connecting houses at (1,0) and (1,1)\n\nRoad connecting houses at (1,0) and (2,0)\n\nRoad connecting houses at (1,1) and (1,2)\n\nRoad connecting houses at (1,2) and (2,2)\n\nRoad connecting houses at (2,0) and (2,1)\n\nSample Input 2\n\n4 3\n2\n4\n8\n1\n2\n9\n3\n\nSample Output 2\n\n60", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 521, "cpu_time_ms": 201, "memory_kb": 28160}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s461797440", "group_id": "codeNet:p03987", "input_text": "let rec for_fold a b f v = if a >= b then v else for_fold (a+1) b f (f v a)\nlet rec pop v = function (y,_)::ys when y > v -> pop v ys | ys -> ys\n\nlet _ = Scanf.scanf \"%d\" @@ fun n ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  let li = Array.make n (-1) in\n  let _ : _ list = for_fold 0 n (fun stk i ->\n    let x = a.(i) in\n    let stk' = pop x stk in\n    li.(i) <- (match stk' with [] -> -1 | (_,j)::_ -> j);\n    (x, i)::stk') [] in\n\n  let ri = Array.make n n in\n  let _ : _ list = for_fold 0 n (fun stk i ->\n    let i = n-1-i in\n    let x = a.(i) in\n    let stk' = pop x stk in\n    ri.(i) <- (match stk' with [] -> n | (_,j)::_ -> j);\n    (x, i)::stk') [] in\n\n  for_fold 0 n (fun s i ->\n    Printf.printf \"-- %d %d %d %d\\n\" i a.(i) li.(i) ri.(i);\n    s + a.(i) * (i - li.(i)) * (ri.(i) - i)) 0\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1534572466, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03987.html", "problem_id": "p03987", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03987/input.txt", "sample_output_relpath": "derived/input_output/data/p03987/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03987/OCaml/s461797440.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s461797440", "user_id": "u798181098"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "let rec for_fold a b f v = if a >= b then v else for_fold (a+1) b f (f v a)\nlet rec pop v = function (y,_)::ys when y > v -> pop v ys | ys -> ys\n\nlet _ = Scanf.scanf \"%d\" @@ fun n ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d\" ((+) 0)) in\n  let li = Array.make n (-1) in\n  let _ : _ list = for_fold 0 n (fun stk i ->\n    let x = a.(i) in\n    let stk' = pop x stk in\n    li.(i) <- (match stk' with [] -> -1 | (_,j)::_ -> j);\n    (x, i)::stk') [] in\n\n  let ri = Array.make n n in\n  let _ : _ list = for_fold 0 n (fun stk i ->\n    let i = n-1-i in\n    let x = a.(i) in\n    let stk' = pop x stk in\n    ri.(i) <- (match stk' with [] -> n | (_,j)::_ -> j);\n    (x, i)::stk') [] in\n\n  for_fold 0 n (fun s i ->\n    Printf.printf \"-- %d %d %d %d\\n\" i a.(i) li.(i) ri.(i);\n    s + a.(i) * (i - li.(i)) * (ri.(i) - i)) 0\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 400 points\n\nProblem Statement\n\nOne day, Snuke was given a permutation of length N, a_1, a_2, ..., a_N, from his friend.\n\nFind the following:\n\nConstraints\n\n1 ≦ N ≦ 200,000\n\n(a_1, a_2, ..., a_N) is a permutation of (1, 2, ..., N).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the answer.\n\nNote that the answer may not fit into a 32-bit integer.\n\nSample Input 1\n\n3\n2 1 3\n\nSample Output 1\n\n9\n\nSample Input 2\n\n4\n1 3 2 4\n\nSample Output 2\n\n19\n\nSample Input 3\n\n8\n5 4 8 1 2 6 7 3\n\nSample Output 3\n\n85", "sample_input": "3\n2 1 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03987", "source_text": "Score : 400 points\n\nProblem Statement\n\nOne day, Snuke was given a permutation of length N, a_1, a_2, ..., a_N, from his friend.\n\nFind the following:\n\nConstraints\n\n1 ≦ N ≦ 200,000\n\n(a_1, a_2, ..., a_N) is a permutation of (1, 2, ..., N).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the answer.\n\nNote that the answer may not fit into a 32-bit integer.\n\nSample Input 1\n\n3\n2 1 3\n\nSample Output 1\n\n9\n\nSample Input 2\n\n4\n1 3 2 4\n\nSample Output 2\n\n19\n\nSample Input 3\n\n8\n5 4 8 1 2 6 7 3\n\nSample Output 3\n\n85", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 842, "cpu_time_ms": 247, "memory_kb": 24592}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s062551201", "group_id": "codeNet:p03992", "input_text": "let s = read_line ()\nlet _ = String.iteri (fun i c -> if i = 4 then print_char ' '; print_char c) s; print_newline ()", "language": "OCaml", "metadata": {"date": 1569935356, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s062551201.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s062551201", "user_id": "u732304692"}, "prompt_components": {"gold_output": "CODE FESTIVAL\n", "input_to_evaluate": "let s = read_line ()\nlet _ = String.iteri (fun i c -> if i = 4 then print_char ' '; print_char c) s; print_newline ()", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThis contest is CODE FESTIVAL.\nHowever, Mr. Takahashi always writes it CODEFESTIVAL, omitting the single space between CODE and FESTIVAL.\n\nSo he has decided to make a program that puts the single space he omitted.\n\nYou are given a string s with 12 letters.\nOutput the string putting a single space between the first 4 letters and last 8 letters in the string s.\n\nConstraints\n\ns contains exactly 12 letters.\n\nAll letters in s are uppercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string putting a single space between the first 4 letters and last 8 letters in the string s.\nPut a line break at the end.\n\nSample Input 1\n\nCODEFESTIVAL\n\nSample Output 1\n\nCODE FESTIVAL\n\nPutting a single space between the first 4 letters and last 8 letters in CODEFESTIVAL makes it CODE FESTIVAL.\n\nSample Input 2\n\nPOSTGRADUATE\n\nSample Output 2\n\nPOST GRADUATE\n\nSample Input 3\n\nABCDEFGHIJKL\n\nSample Output 3\n\nABCD EFGHIJKL", "sample_input": "CODEFESTIVAL\n"}, "reference_outputs": ["CODE FESTIVAL\n"], "source_document_id": "p03992", "source_text": "Score : 100 points\n\nProblem Statement\n\nThis contest is CODE FESTIVAL.\nHowever, Mr. Takahashi always writes it CODEFESTIVAL, omitting the single space between CODE and FESTIVAL.\n\nSo he has decided to make a program that puts the single space he omitted.\n\nYou are given a string s with 12 letters.\nOutput the string putting a single space between the first 4 letters and last 8 letters in the string s.\n\nConstraints\n\ns contains exactly 12 letters.\n\nAll letters in s are uppercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string putting a single space between the first 4 letters and last 8 letters in the string s.\nPut a line break at the end.\n\nSample Input 1\n\nCODEFESTIVAL\n\nSample Output 1\n\nCODE FESTIVAL\n\nPutting a single space between the first 4 letters and last 8 letters in CODEFESTIVAL makes it CODE FESTIVAL.\n\nSample Input 2\n\nPOSTGRADUATE\n\nSample Output 2\n\nPOST GRADUATE\n\nSample Input 3\n\nABCDEFGHIJKL\n\nSample Output 3\n\nABCD EFGHIJKL", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 117, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s875570076", "group_id": "codeNet:p03993", "input_text": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun i -> Scanf.scanf \" %d\" pred\nlet c = ref 0\nlet _ = Array.iteri (fun i a -> if a_s.(a) = i then incr c) a_s; Printf.printf \"%d\\n\" @@ !c / 2", "language": "OCaml", "metadata": {"date": 1570116430, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s875570076.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s875570076", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun i -> Scanf.scanf \" %d\" pred\nlet c = ref 0\nlet _ = Array.iteri (fun i a -> if a_s.(a) = i then incr c) a_s; Printf.printf \"%d\\n\" @@ !c / 2", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N rabbits, numbered 1 through N.\n\nThe i-th (1≤i≤N) rabbit likes rabbit a_i.\nNote that no rabbit can like itself, that is, a_i≠i.\n\nFor a pair of rabbits i and j (i＜j), we call the pair (i，j) a friendly pair if the following condition is met.\n\nRabbit i likes rabbit j and rabbit j likes rabbit i.\n\nCalculate the number of the friendly pairs.\n\nConstraints\n\n2≤N≤10^5\n\n1≤a_i≤N\n\na_i≠i\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the friendly pairs.\n\nSample Input 1\n\n4\n2 1 4 3\n\nSample Output 1\n\n2\n\nThere are two friendly pairs: (1，2) and (3，4).\n\nSample Input 2\n\n3\n2 3 1\n\nSample Output 2\n\n0\n\nThere are no friendly pairs.\n\nSample Input 3\n\n5\n5 5 5 5 1\n\nSample Output 3\n\n1\n\nThere is one friendly pair: (1，5).", "sample_input": "4\n2 1 4 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03993", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N rabbits, numbered 1 through N.\n\nThe i-th (1≤i≤N) rabbit likes rabbit a_i.\nNote that no rabbit can like itself, that is, a_i≠i.\n\nFor a pair of rabbits i and j (i＜j), we call the pair (i，j) a friendly pair if the following condition is met.\n\nRabbit i likes rabbit j and rabbit j likes rabbit i.\n\nCalculate the number of the friendly pairs.\n\nConstraints\n\n2≤N≤10^5\n\n1≤a_i≤N\n\na_i≠i\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the friendly pairs.\n\nSample Input 1\n\n4\n2 1 4 3\n\nSample Output 1\n\n2\n\nThere are two friendly pairs: (1，2) and (3，4).\n\nSample Input 2\n\n3\n2 3 1\n\nSample Output 2\n\n0\n\nThere are no friendly pairs.\n\nSample Input 3\n\n5\n5 5 5 5 1\n\nSample Output 3\n\n1\n\nThere is one friendly pair: (1，5).", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 26, "memory_kb": 5120}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s393825580", "group_id": "codeNet:p03993", "input_text": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" pred\nlet c = ref 0\nlet _ = Array.iteri (fun i a -> if a_s.(a) = i then incr c) a_s; Printf.printf \"%d\\n\" @@ !c / 2", "language": "OCaml", "metadata": {"date": 1564104422, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s393825580.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s393825580", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let n = Scanf.scanf \" %d\" (+) 0\nlet a_s = Array.init n @@ fun _ -> Scanf.scanf \" %d\" pred\nlet c = ref 0\nlet _ = Array.iteri (fun i a -> if a_s.(a) = i then incr c) a_s; Printf.printf \"%d\\n\" @@ !c / 2", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N rabbits, numbered 1 through N.\n\nThe i-th (1≤i≤N) rabbit likes rabbit a_i.\nNote that no rabbit can like itself, that is, a_i≠i.\n\nFor a pair of rabbits i and j (i＜j), we call the pair (i，j) a friendly pair if the following condition is met.\n\nRabbit i likes rabbit j and rabbit j likes rabbit i.\n\nCalculate the number of the friendly pairs.\n\nConstraints\n\n2≤N≤10^5\n\n1≤a_i≤N\n\na_i≠i\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the friendly pairs.\n\nSample Input 1\n\n4\n2 1 4 3\n\nSample Output 1\n\n2\n\nThere are two friendly pairs: (1，2) and (3，4).\n\nSample Input 2\n\n3\n2 3 1\n\nSample Output 2\n\n0\n\nThere are no friendly pairs.\n\nSample Input 3\n\n5\n5 5 5 5 1\n\nSample Output 3\n\n1\n\nThere is one friendly pair: (1，5).", "sample_input": "4\n2 1 4 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03993", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N rabbits, numbered 1 through N.\n\nThe i-th (1≤i≤N) rabbit likes rabbit a_i.\nNote that no rabbit can like itself, that is, a_i≠i.\n\nFor a pair of rabbits i and j (i＜j), we call the pair (i，j) a friendly pair if the following condition is met.\n\nRabbit i likes rabbit j and rabbit j likes rabbit i.\n\nCalculate the number of the friendly pairs.\n\nConstraints\n\n2≤N≤10^5\n\n1≤a_i≤N\n\na_i≠i\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the friendly pairs.\n\nSample Input 1\n\n4\n2 1 4 3\n\nSample Output 1\n\n2\n\nThere are two friendly pairs: (1，2) and (3，4).\n\nSample Input 2\n\n3\n2 3 1\n\nSample Output 2\n\n0\n\nThere are no friendly pairs.\n\nSample Input 3\n\n5\n5 5 5 5 1\n\nSample Output 3\n\n1\n\nThere is one friendly pair: (1，5).", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 26, "memory_kb": 5376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s875088282", "group_id": "codeNet:p03997", "input_text": "open Printf\nopen Scanf\n\nlet solve a b h = (a + b) * h / 2\n\nlet () =\n  scanf \"%d %d %d \" solve |> printf \"%d\\n\"\n", "language": "OCaml", "metadata": {"date": 1583356295, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s875088282.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s875088282", "user_id": "u388783188"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet solve a b h = (a + b) * h / 2\n\nlet () =\n  scanf \"%d %d %d \" solve |> printf \"%d\\n\"\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a trapezoid. The lengths of its upper base, lower base, and height are a, b, and h, respectively.\n\nAn example of a trapezoid\n\nFind the area of this trapezoid.\n\nConstraints\n\n1≦a≦100\n\n1≦b≦100\n\n1≦h≦100\n\nAll input values are integers.\n\nh is even.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na\nb\nh\n\nOutput\n\nPrint the area of the given trapezoid. It is guaranteed that the area is an integer.\n\nSample Input 1\n\n3\n4\n2\n\nSample Output 1\n\n7\n\nWhen the lengths of the upper base, lower base, and height are 3, 4, and 2, respectively, the area of the trapezoid is (3+4)×2/2 = 7.\n\nSample Input 2\n\n4\n4\n4\n\nSample Output 2\n\n16\n\nIn this case, a parallelogram is given, which is also a trapezoid.", "sample_input": "3\n4\n2\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03997", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a trapezoid. The lengths of its upper base, lower base, and height are a, b, and h, respectively.\n\nAn example of a trapezoid\n\nFind the area of this trapezoid.\n\nConstraints\n\n1≦a≦100\n\n1≦b≦100\n\n1≦h≦100\n\nAll input values are integers.\n\nh is even.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na\nb\nh\n\nOutput\n\nPrint the area of the given trapezoid. It is guaranteed that the area is an integer.\n\nSample Input 1\n\n3\n4\n2\n\nSample Output 1\n\n7\n\nWhen the lengths of the upper base, lower base, and height are 3, 4, and 2, respectively, the area of the trapezoid is (3+4)×2/2 = 7.\n\nSample Input 2\n\n4\n4\n4\n\nSample Output 2\n\n16\n\nIn this case, a parallelogram is given, which is also a trapezoid.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 111, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s585725862", "group_id": "codeNet:p03997", "input_text": "let a = read_int ()\nlet b = read_int ()\nlet h = read_int ()\n\nlet () = ((b - a) * h) / 2 + a * h |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1523000662, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s585725862.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s585725862", "user_id": "u987869509"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "let a = read_int ()\nlet b = read_int ()\nlet h = read_int ()\n\nlet () = ((b - a) * h) / 2 + a * h |> Printf.printf \"%d\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a trapezoid. The lengths of its upper base, lower base, and height are a, b, and h, respectively.\n\nAn example of a trapezoid\n\nFind the area of this trapezoid.\n\nConstraints\n\n1≦a≦100\n\n1≦b≦100\n\n1≦h≦100\n\nAll input values are integers.\n\nh is even.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na\nb\nh\n\nOutput\n\nPrint the area of the given trapezoid. It is guaranteed that the area is an integer.\n\nSample Input 1\n\n3\n4\n2\n\nSample Output 1\n\n7\n\nWhen the lengths of the upper base, lower base, and height are 3, 4, and 2, respectively, the area of the trapezoid is (3+4)×2/2 = 7.\n\nSample Input 2\n\n4\n4\n4\n\nSample Output 2\n\n16\n\nIn this case, a parallelogram is given, which is also a trapezoid.", "sample_input": "3\n4\n2\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03997", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a trapezoid. The lengths of its upper base, lower base, and height are a, b, and h, respectively.\n\nAn example of a trapezoid\n\nFind the area of this trapezoid.\n\nConstraints\n\n1≦a≦100\n\n1≦b≦100\n\n1≦h≦100\n\nAll input values are integers.\n\nh is even.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na\nb\nh\n\nOutput\n\nPrint the area of the given trapezoid. It is guaranteed that the area is an integer.\n\nSample Input 1\n\n3\n4\n2\n\nSample Output 1\n\n7\n\nWhen the lengths of the upper base, lower base, and height are 3, 4, and 2, respectively, the area of the trapezoid is (3+4)×2/2 = 7.\n\nSample Input 2\n\n4\n4\n4\n\nSample Output 2\n\n16\n\nIn this case, a parallelogram is given, which is also a trapezoid.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 119, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s762375200", "group_id": "codeNet:p03999", "input_text": "open Batteries\nlet rec collect acc sum = function\n  | [] -> (sum + acc)\n  | (x::xs) ->\n      collect (10*acc+x) sum xs +\n      collect x (sum+acc) xs\n\nlet (h::s) = Scanf.scanf \"%s\" String.to_list\n  |> List.map (fun d -> int_of_char d - 48)\n;;\n\ncollect h 0 s |> Printf.printf \"%d\\n\"\n\n", "language": "OCaml", "metadata": {"date": 1527924765, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p03999.html", "problem_id": "p03999", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03999/input.txt", "sample_output_relpath": "derived/input_output/data/p03999/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03999/OCaml/s762375200.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s762375200", "user_id": "u798181098"}, "prompt_components": {"gold_output": "176\n", "input_to_evaluate": "open Batteries\nlet rec collect acc sum = function\n  | [] -> (sum + acc)\n  | (x::xs) ->\n      collect (10*acc+x) sum xs +\n      collect x (sum+acc) xs\n\nlet (h::s) = Scanf.scanf \"%s\" String.to_list\n  |> List.map (fun d -> int_of_char d - 48)\n;;\n\ncollect h 0 s |> Printf.printf \"%d\\n\"\n\n", "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": "p03999", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 283, "cpu_time_ms": 2, "memory_kb": 1024}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s797850146", "group_id": "codeNet:p04000", "input_text": "module M = Map.Make(struct type t = int * int let compare = compare end)\n\nlet rec seq a b = if a > b then [] else a :: seq (a+1) b\nlet (>>=) xs f = List.map f xs |> List.concat\n\nlet inc x y m =\n  try M.add (x, y) (1 + M.find (x, y) m) m\n  with Not_found -> M.add (x, y) 1 m\n\nlet () =\n  Scanf.scanf \"%d %d %d\" @@ fun h w n ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x, y)) in\n  let ret = Array.make 10 0 in\n  a |> Array.fold_left (fun m1 (x, y) ->\n    seq (max 1 (x-2)) (min (h-2) x) >>= (fun i -> seq (max 1 (y-2)) (min (w-2) y) >>= (fun j -> [(i, j)]))\n    |> List.fold_left (fun m2 (i, j) -> inc i j m2) m1\n  ) M.empty\n  |> M.iter (fun (x, y) v ->\n      ret.(v) <- ret.(v) + 1);\n  \n  let cur = Array.fold_left (+) 0 ret in\n  ret.(0) <- (h-2)*(w-2) - cur;\n  Array.iter (Printf.printf \"%d\\n\") ret", "language": "OCaml", "metadata": {"date": 1531973733, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04000.html", "problem_id": "p04000", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04000/input.txt", "sample_output_relpath": "derived/input_output/data/p04000/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04000/OCaml/s797850146.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s797850146", "user_id": "u798181098"}, "prompt_components": {"gold_output": "0\n0\n0\n2\n4\n0\n0\n0\n0\n0\n", "input_to_evaluate": "module M = Map.Make(struct type t = int * int let compare = compare end)\n\nlet rec seq a b = if a > b then [] else a :: seq (a+1) b\nlet (>>=) xs f = List.map f xs |> List.concat\n\nlet inc x y m =\n  try M.add (x, y) (1 + M.find (x, y) m) m\n  with Not_found -> M.add (x, y) 1 m\n\nlet () =\n  Scanf.scanf \"%d %d %d\" @@ fun h w n ->\n  let a = Array.init n (fun _ -> Scanf.scanf \" %d %d\" (fun x y -> x, y)) in\n  let ret = Array.make 10 0 in\n  a |> Array.fold_left (fun m1 (x, y) ->\n    seq (max 1 (x-2)) (min (h-2) x) >>= (fun i -> seq (max 1 (y-2)) (min (w-2) y) >>= (fun j -> [(i, j)]))\n    |> List.fold_left (fun m2 (i, j) -> inc i j m2) m1\n  ) M.empty\n  |> M.iter (fun (x, y) v ->\n      ret.(v) <- ret.(v) + 1);\n  \n  let cur = Array.fold_left (+) 0 ret in\n  ret.(0) <- (h-2)*(w-2) - cur;\n  Array.iter (Printf.printf \"%d\\n\") ret", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns. At first, all cells were painted white.\n\nSnuke painted N of these cells. The i-th ( 1 \\leq i \\leq N ) cell he painted is the cell at the a_i-th row and b_i-th column.\n\nCompute the following:\n\nFor each integer j ( 0 \\leq j \\leq 9 ), how many subrectangles of size 3×3 of the grid contains exactly j black cells, after Snuke painted N cells?\n\nConstraints\n\n3 \\leq H \\leq 10^9\n\n3 \\leq W \\leq 10^9\n\n0 \\leq N \\leq min(10^5,H×W)\n\n1 \\leq a_i \\leq H (1 \\leq i \\leq N)\n\n1 \\leq b_i \\leq W (1 \\leq i \\leq N)\n\n(a_i, b_i) \\neq (a_j, b_j) (i \\neq j)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W N\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint 10 lines.\nThe (j+1)-th ( 0 \\leq j \\leq 9 ) line should contain the number of the subrectangles of size 3×3 of the grid that contains exactly j black cells.\n\nSample Input 1\n\n4 5 8\n1 1\n1 4\n1 5\n2 3\n3 1\n3 2\n3 4\n4 4\n\nSample Output 1\n\n0\n0\n0\n2\n4\n0\n0\n0\n0\n0\n\nThere are six subrectangles of size 3×3. Two of them contain three black cells each, and the remaining four contain four black cells each.\n\nSample Input 2\n\n10 10 20\n1 1\n1 4\n1 9\n2 5\n3 10\n4 2\n4 7\n5 9\n6 4\n6 6\n6 7\n7 1\n7 3\n7 7\n8 1\n8 5\n8 10\n9 2\n10 4\n10 9\n\nSample Output 2\n\n4\n26\n22\n10\n2\n0\n0\n0\n0\n0\n\nSample Input 3\n\n1000000000 1000000000 0\n\nSample Output 3\n\n999999996000000004\n0\n0\n0\n0\n0\n0\n0\n0\n0", "sample_input": "4 5 8\n1 1\n1 4\n1 5\n2 3\n3 1\n3 2\n3 4\n4 4\n"}, "reference_outputs": ["0\n0\n0\n2\n4\n0\n0\n0\n0\n0\n"], "source_document_id": "p04000", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns. At first, all cells were painted white.\n\nSnuke painted N of these cells. The i-th ( 1 \\leq i \\leq N ) cell he painted is the cell at the a_i-th row and b_i-th column.\n\nCompute the following:\n\nFor each integer j ( 0 \\leq j \\leq 9 ), how many subrectangles of size 3×3 of the grid contains exactly j black cells, after Snuke painted N cells?\n\nConstraints\n\n3 \\leq H \\leq 10^9\n\n3 \\leq W \\leq 10^9\n\n0 \\leq N \\leq min(10^5,H×W)\n\n1 \\leq a_i \\leq H (1 \\leq i \\leq N)\n\n1 \\leq b_i \\leq W (1 \\leq i \\leq N)\n\n(a_i, b_i) \\neq (a_j, b_j) (i \\neq j)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W N\na_1 b_1\n:\na_N b_N\n\nOutput\n\nPrint 10 lines.\nThe (j+1)-th ( 0 \\leq j \\leq 9 ) line should contain the number of the subrectangles of size 3×3 of the grid that contains exactly j black cells.\n\nSample Input 1\n\n4 5 8\n1 1\n1 4\n1 5\n2 3\n3 1\n3 2\n3 4\n4 4\n\nSample Output 1\n\n0\n0\n0\n2\n4\n0\n0\n0\n0\n0\n\nThere are six subrectangles of size 3×3. Two of them contain three black cells each, and the remaining four contain four black cells each.\n\nSample Input 2\n\n10 10 20\n1 1\n1 4\n1 9\n2 5\n3 10\n4 2\n4 7\n5 9\n6 4\n6 6\n6 7\n7 1\n7 3\n7 7\n8 1\n8 5\n8 10\n9 2\n10 4\n10 9\n\nSample Output 2\n\n4\n26\n22\n10\n2\n0\n0\n0\n0\n0\n\nSample Input 3\n\n1000000000 1000000000 0\n\nSample Output 3\n\n999999996000000004\n0\n0\n0\n0\n0\n0\n0\n0\n0", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 822, "cpu_time_ms": 2249, "memory_kb": 99960}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s113033503", "group_id": "codeNet:p04011", "input_text": "let n = read_int ()\nlet k = read_int ()\nlet x = read_int ()\nlet y = read_int ()\nlet _ = (if n > k then k * x + (n-k) * y else n * x) |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1584368134, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04011.html", "problem_id": "p04011", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04011/input.txt", "sample_output_relpath": "derived/input_output/data/p04011/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04011/OCaml/s113033503.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s113033503", "user_id": "u511870776"}, "prompt_components": {"gold_output": "48000\n", "input_to_evaluate": "let n = read_int ()\nlet k = read_int ()\nlet x = read_int ()\nlet y = read_int ()\nlet _ = (if n > k then k * x + (n-k) * y else n * x) |> Printf.printf \"%d\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a hotel with the following accommodation fee:\n\nX yen (the currency of Japan) per night, for the first K nights\n\nY yen per night, for the (K+1)-th and subsequent nights\n\nTak is staying at this hotel for N consecutive nights.\nFind his total accommodation fee.\n\nConstraints\n\n1 \\leq N, K \\leq 10000\n\n1 \\leq Y < X \\leq 10000\n\nN,\\,K,\\,X,\\,Y are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nK\nX\nY\n\nOutput\n\nPrint Tak's total accommodation fee.\n\nSample Input 1\n\n5\n3\n10000\n9000\n\nSample Output 1\n\n48000\n\nThe accommodation fee is as follows:\n\n10000 yen for the 1-st night\n\n10000 yen for the 2-nd night\n\n10000 yen for the 3-rd night\n\n9000 yen for the 4-th night\n\n9000 yen for the 5-th night\n\nThus, the total is 48000 yen.\n\nSample Input 2\n\n2\n3\n10000\n9000\n\nSample Output 2\n\n20000", "sample_input": "5\n3\n10000\n9000\n"}, "reference_outputs": ["48000\n"], "source_document_id": "p04011", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a hotel with the following accommodation fee:\n\nX yen (the currency of Japan) per night, for the first K nights\n\nY yen per night, for the (K+1)-th and subsequent nights\n\nTak is staying at this hotel for N consecutive nights.\nFind his total accommodation fee.\n\nConstraints\n\n1 \\leq N, K \\leq 10000\n\n1 \\leq Y < X \\leq 10000\n\nN,\\,K,\\,X,\\,Y are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nK\nX\nY\n\nOutput\n\nPrint Tak's total accommodation fee.\n\nSample Input 1\n\n5\n3\n10000\n9000\n\nSample Output 1\n\n48000\n\nThe accommodation fee is as follows:\n\n10000 yen for the 1-st night\n\n10000 yen for the 2-nd night\n\n10000 yen for the 3-rd night\n\n9000 yen for the 4-th night\n\n9000 yen for the 5-th night\n\nThus, the total is 48000 yen.\n\nSample Input 2\n\n2\n3\n10000\n9000\n\nSample Output 2\n\n20000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 156, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s875762744", "group_id": "codeNet:p04012", "input_text": "Scanf.scanf \"%s\" (fun w ->\n    let h = Array.make 26 0 in\n    String.iter (fun v -> let q = int_of_char v - 97 in h.(q) <- h.(q) + 1) w;\n    print_endline @@ if Array.fold_left (lor) 0 h mod 2 = 0 then \"Yes\" else \"No\"\n)", "language": "OCaml", "metadata": {"date": 1595302922, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s875762744.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s875762744", "user_id": "u342443598"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "Scanf.scanf \"%s\" (fun w ->\n    let h = Array.make 26 0 in\n    String.iter (fun v -> let q = int_of_char v - 97 in h.(q) <- h.(q) + 1) w;\n    print_endline @@ if Array.fold_left (lor) 0 h mod 2 = 0 then \"Yes\" else \"No\"\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 3672}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s989604107", "group_id": "codeNet:p04012", "input_text": "(*\nocamlfind ocamlopt -package batteries -linkpkg main.ml -o a.out\n*)\nopen Batteries\n\nlet lst = Str.split (Str.regexp \"\") (read_line ())\n          |> List.sort compare\nlet lst2 = List.sort_uniq compare lst\nlet lst3 = \n        List.map (fun elmnt1 ->\n                List.filter (fun elmnt2 ->\n                        elmnt1 = elmnt2\n                ) lst\n        ) lst2\nlet lst4 = List.map (fun elst ->\n        List.length elst\n) lst3\n\nlet () =\n        (\n                if List.exists (fun elmnt -> elmnt mod 2 = 1) lst4 then\n                        \"No\"\n                else\n                        \"Yes\"\n        ) |> Printf.printf \"%s\\n\"\n", "language": "OCaml", "metadata": {"date": 1590709874, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s989604107.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s989604107", "user_id": "u280335093"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "(*\nocamlfind ocamlopt -package batteries -linkpkg main.ml -o a.out\n*)\nopen Batteries\n\nlet lst = Str.split (Str.regexp \"\") (read_line ())\n          |> List.sort compare\nlet lst2 = List.sort_uniq compare lst\nlet lst3 = \n        List.map (fun elmnt1 ->\n                List.filter (fun elmnt2 ->\n                        elmnt1 = elmnt2\n                ) lst\n        ) lst2\nlet lst4 = List.map (fun elst ->\n        List.length elst\n) lst3\n\nlet () =\n        (\n                if List.exists (fun elmnt -> elmnt mod 2 = 1) lst4 then\n                        \"No\"\n                else\n                        \"Yes\"\n        ) |> Printf.printf \"%s\\n\"\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 641, "cpu_time_ms": 3, "memory_kb": 1152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s686060502", "group_id": "codeNet:p04013", "input_text": "open Printf\nlet input_int_array n =\n\tArray.init n (fun _ -> Scanf.scanf \" %d\" (fun v -> v))\n\nlet get_int () = Scanf.scanf \" %d\" (fun v -> v)\nlet get_2_ints () = Scanf.scanf \" %d %d\" (fun u v -> u,v)\nlet get_3_ints () = Scanf.scanf \" %d %d %d\" (fun u v w -> u,v,w)\nlet get_4_ints () = Scanf.scanf \" %d %d %d %d\" (fun u v w x -> u,v,w,x)\nlet get_5_ints () = Scanf.scanf \" %d %d %d %d %d\" (fun u v w x y -> u,v,w,x,y)\n\nlet dump_2darr f a =\n\tArray.fold_left (fun u v ->\n\t\tu ^ Array.fold_left (fun u v -> u ^ (f v) ^ \",\") \"\" v ^ \";\\n\"\n\t) \"\" a |> print_endline\n\nlet () =\n\tlet n,a = get_2_ints ()\n\tin let ar = input_int_array n\n\tin let mx = (Array.fold_left max 0 ar)*n\n\tin let open Bigarray\n\tin\n\tlet dp = Bigarray.Array3.create int c_layout (n+1) (n+1) (mx+1)\n\tin dp.{0,0,0} <- 1;\n\tfor i=0 to n-1 do\n\t\tfor j=0 to n-1 do\n\t\t\tfor k=0 to mx do\n\t\t\t\tdp.{i+1,j,k} <- dp.{i,j,k} + (if j>0 && k-ar.(i)>=0 then dp.{i,j-1,k-ar.(i)} else 0);\n\t\t\tdone\n\t\tdone\n\tdone;\n\tlet s = ref 0 in\n\tfor k=1 to n do\n\t\ts := !s + dp.{n,k,a*k}\n\tdone;\n\t!s |> printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1531216704, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04013.html", "problem_id": "p04013", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04013/input.txt", "sample_output_relpath": "derived/input_output/data/p04013/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04013/OCaml/s686060502.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s686060502", "user_id": "u481480055"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "open Printf\nlet input_int_array n =\n\tArray.init n (fun _ -> Scanf.scanf \" %d\" (fun v -> v))\n\nlet get_int () = Scanf.scanf \" %d\" (fun v -> v)\nlet get_2_ints () = Scanf.scanf \" %d %d\" (fun u v -> u,v)\nlet get_3_ints () = Scanf.scanf \" %d %d %d\" (fun u v w -> u,v,w)\nlet get_4_ints () = Scanf.scanf \" %d %d %d %d\" (fun u v w x -> u,v,w,x)\nlet get_5_ints () = Scanf.scanf \" %d %d %d %d %d\" (fun u v w x y -> u,v,w,x,y)\n\nlet dump_2darr f a =\n\tArray.fold_left (fun u v ->\n\t\tu ^ Array.fold_left (fun u v -> u ^ (f v) ^ \",\") \"\" v ^ \";\\n\"\n\t) \"\" a |> print_endline\n\nlet () =\n\tlet n,a = get_2_ints ()\n\tin let ar = input_int_array n\n\tin let mx = (Array.fold_left max 0 ar)*n\n\tin let open Bigarray\n\tin\n\tlet dp = Bigarray.Array3.create int c_layout (n+1) (n+1) (mx+1)\n\tin dp.{0,0,0} <- 1;\n\tfor i=0 to n-1 do\n\t\tfor j=0 to n-1 do\n\t\t\tfor k=0 to mx do\n\t\t\t\tdp.{i+1,j,k} <- dp.{i,j,k} + (if j>0 && k-ar.(i)>=0 then dp.{i,j-1,k-ar.(i)} else 0);\n\t\t\tdone\n\t\tdone\n\tdone;\n\tlet s = ref 0 in\n\tfor k=1 to n do\n\t\ts := !s + dp.{n,k,a*k}\n\tdone;\n\t!s |> printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTak has N cards. On the i-th (1 \\leq i \\leq N) card is written an integer x_i.\nHe is selecting one or more cards from these N cards, so that the average of the integers written on the selected cards is exactly A.\nIn how many ways can he make his selection?\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq A \\leq 50\n\n1 \\leq x_i \\leq 50\n\nN,\\,A,\\,x_i are integers.\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying 1 \\leq N \\leq 16.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN A\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the number of ways to select cards such that the average of the written integers is exactly A.\n\nSample Input 1\n\n4 8\n7 9 8 9\n\nSample Output 1\n\n5\n\nThe following are the 5 ways to select cards such that the average is 8:\n\nSelect the 3-rd card.\n\nSelect the 1-st and 2-nd cards.\n\nSelect the 1-st and 4-th cards.\n\nSelect the 1-st, 2-nd and 3-rd cards.\n\nSelect the 1-st, 3-rd and 4-th cards.\n\nSample Input 2\n\n3 8\n6 6 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n8 5\n3 6 2 8 7 6 5 9\n\nSample Output 3\n\n19\n\nSample Input 4\n\n33 3\n3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3\n\nSample Output 4\n\n8589934591\n\nThe answer may not fit into a 32-bit integer.", "sample_input": "4 8\n7 9 8 9\n"}, "reference_outputs": ["5\n"], "source_document_id": "p04013", "source_text": "Score : 300 points\n\nProblem Statement\n\nTak has N cards. On the i-th (1 \\leq i \\leq N) card is written an integer x_i.\nHe is selecting one or more cards from these N cards, so that the average of the integers written on the selected cards is exactly A.\nIn how many ways can he make his selection?\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq A \\leq 50\n\n1 \\leq x_i \\leq 50\n\nN,\\,A,\\,x_i are integers.\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying 1 \\leq N \\leq 16.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN A\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the number of ways to select cards such that the average of the written integers is exactly A.\n\nSample Input 1\n\n4 8\n7 9 8 9\n\nSample Output 1\n\n5\n\nThe following are the 5 ways to select cards such that the average is 8:\n\nSelect the 3-rd card.\n\nSelect the 1-st and 2-nd cards.\n\nSelect the 1-st and 4-th cards.\n\nSelect the 1-st, 2-nd and 3-rd cards.\n\nSelect the 1-st, 3-rd and 4-th cards.\n\nSample Input 2\n\n3 8\n6 6 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n8 5\n3 6 2 8 7 6 5 9\n\nSample Output 3\n\n19\n\nSample Input 4\n\n33 3\n3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3\n\nSample Output 4\n\n8589934591\n\nThe answer may not fit into a 32-bit integer.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1033, "cpu_time_ms": 61, "memory_kb": 50688}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s988999392", "group_id": "codeNet:p04013", "input_text": "let get_line () =\n    read_line ()\n    |> Str.split (Str.regexp \" \")\n\n(* use List.cons in 4.03.0 or later *)\nlet cons elem lst = elem :: lst\n\nlet get_sublists lst =\n    let rec loop lst acc =\n        match lst with\n        | [] -> acc\n        | x :: xs ->\n            loop xs \n                (List.append (List.map (cons x) acc) acc)\n    in\n    loop lst [[]]\n\nlet get_average lst =\n    let sum = List.fold_left ( +. ) 0.0 lst in\n    sum /. float_of_int (List.length lst)\n\nlet print_list lst =\n    List.map string_of_float lst\n    |> String.concat \" \"\n    |> print_endline\n\nlet () =\n    let a =\n        let [_; a] = get_line () in\n        float_of_string a\n    in\n    let cards =\n        get_line ()\n        |> List.map float_of_string\n    in\n    get_sublists cards\n    |> List.map get_average\n    |> List.filter (fun x -> x = a)\n    |> List.length\n    |> print_int\n    |> print_newline\n", "language": "OCaml", "metadata": {"date": 1475684297, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04013.html", "problem_id": "p04013", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04013/input.txt", "sample_output_relpath": "derived/input_output/data/p04013/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04013/OCaml/s988999392.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s988999392", "user_id": "u420267469"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let get_line () =\n    read_line ()\n    |> Str.split (Str.regexp \" \")\n\n(* use List.cons in 4.03.0 or later *)\nlet cons elem lst = elem :: lst\n\nlet get_sublists lst =\n    let rec loop lst acc =\n        match lst with\n        | [] -> acc\n        | x :: xs ->\n            loop xs \n                (List.append (List.map (cons x) acc) acc)\n    in\n    loop lst [[]]\n\nlet get_average lst =\n    let sum = List.fold_left ( +. ) 0.0 lst in\n    sum /. float_of_int (List.length lst)\n\nlet print_list lst =\n    List.map string_of_float lst\n    |> String.concat \" \"\n    |> print_endline\n\nlet () =\n    let a =\n        let [_; a] = get_line () in\n        float_of_string a\n    in\n    let cards =\n        get_line ()\n        |> List.map float_of_string\n    in\n    get_sublists cards\n    |> List.map get_average\n    |> List.filter (fun x -> x = a)\n    |> List.length\n    |> print_int\n    |> print_newline\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTak has N cards. On the i-th (1 \\leq i \\leq N) card is written an integer x_i.\nHe is selecting one or more cards from these N cards, so that the average of the integers written on the selected cards is exactly A.\nIn how many ways can he make his selection?\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq A \\leq 50\n\n1 \\leq x_i \\leq 50\n\nN,\\,A,\\,x_i are integers.\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying 1 \\leq N \\leq 16.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN A\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the number of ways to select cards such that the average of the written integers is exactly A.\n\nSample Input 1\n\n4 8\n7 9 8 9\n\nSample Output 1\n\n5\n\nThe following are the 5 ways to select cards such that the average is 8:\n\nSelect the 3-rd card.\n\nSelect the 1-st and 2-nd cards.\n\nSelect the 1-st and 4-th cards.\n\nSelect the 1-st, 2-nd and 3-rd cards.\n\nSelect the 1-st, 3-rd and 4-th cards.\n\nSample Input 2\n\n3 8\n6 6 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n8 5\n3 6 2 8 7 6 5 9\n\nSample Output 3\n\n19\n\nSample Input 4\n\n33 3\n3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3\n\nSample Output 4\n\n8589934591\n\nThe answer may not fit into a 32-bit integer.", "sample_input": "4 8\n7 9 8 9\n"}, "reference_outputs": ["5\n"], "source_document_id": "p04013", "source_text": "Score : 300 points\n\nProblem Statement\n\nTak has N cards. On the i-th (1 \\leq i \\leq N) card is written an integer x_i.\nHe is selecting one or more cards from these N cards, so that the average of the integers written on the selected cards is exactly A.\nIn how many ways can he make his selection?\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq A \\leq 50\n\n1 \\leq x_i \\leq 50\n\nN,\\,A,\\,x_i are integers.\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying 1 \\leq N \\leq 16.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN A\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the number of ways to select cards such that the average of the written integers is exactly A.\n\nSample Input 1\n\n4 8\n7 9 8 9\n\nSample Output 1\n\n5\n\nThe following are the 5 ways to select cards such that the average is 8:\n\nSelect the 3-rd card.\n\nSelect the 1-st and 2-nd cards.\n\nSelect the 1-st and 4-th cards.\n\nSelect the 1-st, 2-nd and 3-rd cards.\n\nSelect the 1-st, 3-rd and 4-th cards.\n\nSample Input 2\n\n3 8\n6 6 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n8 5\n3 6 2 8 7 6 5 9\n\nSample Output 3\n\n19\n\nSample Input 4\n\n33 3\n3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3\n\nSample Output 4\n\n8589934591\n\nThe answer may not fit into a 32-bit integer.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 887, "cpu_time_ms": 2123, "memory_kb": 325368}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s050400772", "group_id": "codeNet:p04015", "input_text": "let rec loop x fn =\n  match fn x with\n  | `Break x -> x\n  | `Continue x -> loop x fn\n\nmodule List = struct\n  include List\n  let take n lst =\n    loop (0, lst, []) begin fun (i, rest, r_acc) ->\n      match i < n, rest with\n      | true, []  | false, _ -> `Break (rev r_acc)\n      | true, x :: rest -> `Continue (i + 1, rest, x :: r_acc) end\n  let drop n lst =\n    loop (0, lst) begin fun (i, rest) ->\n      match i < n, rest with\n      | true, _ :: rest -> `Continue (i + 1, rest)\n      | true, []  | false, _ -> `Break rest end\nend\n\nlet () =\n  let open Scanf in\n  let read_ints () = let open Buffer in\n    let buf = create 10 in\n    let add = add_bytes buf and get () = contents buf in\n    loop () begin fun () ->\n      try read_line () ^ \" \" |> add; `Continue ()\n      with _ -> `Break (get ()) end\n    |> Str.(split (regexp \" \")) |> List.map int_of_string in\n\n  let rest = read_ints () in\n  let n :: rest = rest in\n  let xs = List.take n rest in\n  let l :: q :: qs = List.drop n rest in\n  let qs =\n    let qs = qs |> List.map (fun q -> q - 1) in\n    loop (qs, []) begin fun (rest, r_acc) ->\n      match rest with\n      | x:: y:: rest -> `Continue (rest, (x, y):: r_acc)\n      | []  | _:: [] -> `Break (List.rev r_acc) end in\n  (* input stage is finally finished *)\n\n  let xs = Array.of_list xs in\n  let bisect fn_shift fn_idx = fun l r x ->\n    loop (l, r) begin fun (l, r) ->\n      if r - l - 1 = 0 then `Break (fn_idx l r)\n      else let m = (l + r) / 2 in\n        match fn_shift x xs.(m) with\n        | `Left -> `Continue (l, m)\n        | `Right -> `Continue (m, r) end in\n  let bisect_l = bisect\n      (fun x m -> if x < m then `Left else `Right) (fun l r -> l)\n  and bisect_r = bisect\n      (fun x m -> if x > m then `Right else `Left) (fun l r -> r) in\n\n  let next = let open Hashtbl in\n    let memo = create 10 in\n    let cache = replace memo and get = find memo in\n    let calc init fn_bound direction fn_step fn_shift fn_bisect =\n      loop init begin fun here ->\n        match fn_bound here with\n        | false ->\n          cache (here, direction) (fn_step here); `Break ()\n        | true ->\n          let x' = fn_shift xs.(here) l in\n          let next = fn_bisect here x' in\n          cache (here, direction) next;\n          `Continue (fn_step here) end in\n    calc 0 (fun x -> x < n - 1) `Right succ ( + )\n      (fun here x -> bisect_l here n x);\n    calc (n - 1) (fun x -> x > 0) `Left pred ( - )\n      (fun here x -> bisect_r (-1) here x);\n    (* let fold init fn t = fold fn t init in *)\n    (* memo |> fold () begin fun k v () -> *)\n    (*   match k with *)\n    (*   | here, `Left -> *)\n    (*     Printf.printf \"`L, %d = %d;\" (succ here) (succ v) *)\n    (*   | here, `Right -> *)\n    (*     Printf.printf \"`R, %d = %d;\" (succ here) (succ v) end; *)\n    get in\n  \n  let add, get = let open Buffer in\n    let buf = create (q * 2) in\n    let add = add_string buf and get () = contents buf in\n    add, get in\n\n  let solve (a, b) =\n    let reached, next =\n      if a < b\n      then (fun x -> b <= x), (fun x -> next (x, `Right))\n      else (fun x -> b >= x), (fun x -> next (x, `Left)) in\n    loop (a, 0) begin fun (a, cnt) ->\n      let a' = next a in\n      (* add (Printf.sprintf \"(%d,%d), \" (a + 1) (a' + 1)); *)\n      if reached a' then `Break (cnt + 1)\n      else `Continue (a', cnt + 1) end in\n\n  qs |> List.map begin fun q ->\n    let open Printf in\n    (* printf \"q:(%d,%d)\" (fst q) (snd q); flush_all (); *)\n    add (sprintf \"%d\\n\" (solve q));\n  end |> ignore;\n  Printf.printf \"%s\" (get ());\n", "language": "OCaml", "metadata": {"date": 1474249058, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04015.html", "problem_id": "p04015", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04015/input.txt", "sample_output_relpath": "derived/input_output/data/p04015/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04015/OCaml/s050400772.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s050400772", "user_id": "u346726102"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "let rec loop x fn =\n  match fn x with\n  | `Break x -> x\n  | `Continue x -> loop x fn\n\nmodule List = struct\n  include List\n  let take n lst =\n    loop (0, lst, []) begin fun (i, rest, r_acc) ->\n      match i < n, rest with\n      | true, []  | false, _ -> `Break (rev r_acc)\n      | true, x :: rest -> `Continue (i + 1, rest, x :: r_acc) end\n  let drop n lst =\n    loop (0, lst) begin fun (i, rest) ->\n      match i < n, rest with\n      | true, _ :: rest -> `Continue (i + 1, rest)\n      | true, []  | false, _ -> `Break rest end\nend\n\nlet () =\n  let open Scanf in\n  let read_ints () = let open Buffer in\n    let buf = create 10 in\n    let add = add_bytes buf and get () = contents buf in\n    loop () begin fun () ->\n      try read_line () ^ \" \" |> add; `Continue ()\n      with _ -> `Break (get ()) end\n    |> Str.(split (regexp \" \")) |> List.map int_of_string in\n\n  let rest = read_ints () in\n  let n :: rest = rest in\n  let xs = List.take n rest in\n  let l :: q :: qs = List.drop n rest in\n  let qs =\n    let qs = qs |> List.map (fun q -> q - 1) in\n    loop (qs, []) begin fun (rest, r_acc) ->\n      match rest with\n      | x:: y:: rest -> `Continue (rest, (x, y):: r_acc)\n      | []  | _:: [] -> `Break (List.rev r_acc) end in\n  (* input stage is finally finished *)\n\n  let xs = Array.of_list xs in\n  let bisect fn_shift fn_idx = fun l r x ->\n    loop (l, r) begin fun (l, r) ->\n      if r - l - 1 = 0 then `Break (fn_idx l r)\n      else let m = (l + r) / 2 in\n        match fn_shift x xs.(m) with\n        | `Left -> `Continue (l, m)\n        | `Right -> `Continue (m, r) end in\n  let bisect_l = bisect\n      (fun x m -> if x < m then `Left else `Right) (fun l r -> l)\n  and bisect_r = bisect\n      (fun x m -> if x > m then `Right else `Left) (fun l r -> r) in\n\n  let next = let open Hashtbl in\n    let memo = create 10 in\n    let cache = replace memo and get = find memo in\n    let calc init fn_bound direction fn_step fn_shift fn_bisect =\n      loop init begin fun here ->\n        match fn_bound here with\n        | false ->\n          cache (here, direction) (fn_step here); `Break ()\n        | true ->\n          let x' = fn_shift xs.(here) l in\n          let next = fn_bisect here x' in\n          cache (here, direction) next;\n          `Continue (fn_step here) end in\n    calc 0 (fun x -> x < n - 1) `Right succ ( + )\n      (fun here x -> bisect_l here n x);\n    calc (n - 1) (fun x -> x > 0) `Left pred ( - )\n      (fun here x -> bisect_r (-1) here x);\n    (* let fold init fn t = fold fn t init in *)\n    (* memo |> fold () begin fun k v () -> *)\n    (*   match k with *)\n    (*   | here, `Left -> *)\n    (*     Printf.printf \"`L, %d = %d;\" (succ here) (succ v) *)\n    (*   | here, `Right -> *)\n    (*     Printf.printf \"`R, %d = %d;\" (succ here) (succ v) end; *)\n    get in\n  \n  let add, get = let open Buffer in\n    let buf = create (q * 2) in\n    let add = add_string buf and get () = contents buf in\n    add, get in\n\n  let solve (a, b) =\n    let reached, next =\n      if a < b\n      then (fun x -> b <= x), (fun x -> next (x, `Right))\n      else (fun x -> b >= x), (fun x -> next (x, `Left)) in\n    loop (a, 0) begin fun (a, cnt) ->\n      let a' = next a in\n      (* add (Printf.sprintf \"(%d,%d), \" (a + 1) (a' + 1)); *)\n      if reached a' then `Break (cnt + 1)\n      else `Continue (a', cnt + 1) end in\n\n  qs |> List.map begin fun q ->\n    let open Printf in\n    (* printf \"q:(%d,%d)\" (fst q) (snd q); flush_all (); *)\n    add (sprintf \"%d\\n\" (solve q));\n  end |> ignore;\n  Printf.printf \"%s\" (get ());\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTak has N cards. On the i-th (1 \\leq i \\leq N) card is written an integer x_i.\nHe is selecting one or more cards from these N cards, so that the average of the integers written on the selected cards is exactly A.\nIn how many ways can he make his selection?\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq A \\leq 50\n\n1 \\leq x_i \\leq 50\n\nN,\\,A,\\,x_i are integers.\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying 1 \\leq N \\leq 16.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN A\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the number of ways to select cards such that the average of the written integers is exactly A.\n\nSample Input 1\n\n4 8\n7 9 8 9\n\nSample Output 1\n\n5\n\nThe following are the 5 ways to select cards such that the average is 8:\n\nSelect the 3-rd card.\n\nSelect the 1-st and 2-nd cards.\n\nSelect the 1-st and 4-th cards.\n\nSelect the 1-st, 2-nd and 3-rd cards.\n\nSelect the 1-st, 3-rd and 4-th cards.\n\nSample Input 2\n\n3 8\n6 6 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n8 5\n3 6 2 8 7 6 5 9\n\nSample Output 3\n\n19\n\nSample Input 4\n\n33 3\n3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3\n\nSample Output 4\n\n8589934591\n\nThe answer may not fit into a 32-bit integer.", "sample_input": "4 8\n7 9 8 9\n"}, "reference_outputs": ["5\n"], "source_document_id": "p04015", "source_text": "Score : 300 points\n\nProblem Statement\n\nTak has N cards. On the i-th (1 \\leq i \\leq N) card is written an integer x_i.\nHe is selecting one or more cards from these N cards, so that the average of the integers written on the selected cards is exactly A.\nIn how many ways can he make his selection?\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq A \\leq 50\n\n1 \\leq x_i \\leq 50\n\nN,\\,A,\\,x_i are integers.\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying 1 \\leq N \\leq 16.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN A\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the number of ways to select cards such that the average of the written integers is exactly A.\n\nSample Input 1\n\n4 8\n7 9 8 9\n\nSample Output 1\n\n5\n\nThe following are the 5 ways to select cards such that the average is 8:\n\nSelect the 3-rd card.\n\nSelect the 1-st and 2-nd cards.\n\nSelect the 1-st and 4-th cards.\n\nSelect the 1-st, 2-nd and 3-rd cards.\n\nSelect the 1-st, 3-rd and 4-th cards.\n\nSample Input 2\n\n3 8\n6 6 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n8 5\n3 6 2 8 7 6 5 9\n\nSample Output 3\n\n19\n\nSample Input 4\n\n33 3\n3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3\n\nSample Output 4\n\n8589934591\n\nThe answer may not fit into a 32-bit integer.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3515, "cpu_time_ms": 4, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s768850834", "group_id": "codeNet:p04015", "input_text": "open Printf\nopen Scanf\n\nlet rec loop x fn =\n  match fn x with\n  | `Break x -> x\n  | `Continue x -> loop x fn\n\nlet ( |- ) x f = f x; x\nlet flip f a b = f b a\n\nmodule Int = struct\n  include Int64\n  module Infix = struct \n    let ( + ) = add and ( - ) = sub\n    and ( * ) = mul and ( / ) = div\n  end\nend\n\nlet () =\n  let read_ints () =\n    let str = loop (Buffer.create 10) begin fun buf ->\n        try \n          `Continue (buf |- (flip Buffer.add_bytes)\n                       (read_line () ^ \" \"))\n        with _ ->\n          `Break (buf |> Buffer.contents) end in\n    str |> Str.(split (regexp \" \")) |> List.map int_of_string in\n\n  let num:: avg:: xs = read_ints () in\n  let xs = xs |> Array.of_list in\n\n  let cache, cached, get = let open Hashtbl in\n    let memo = create 10 in\n    let cache = replace memo in\n    let cached = mem memo in\n    let get = find memo in\n    cache, cached, get in\n\n  let rec solve ~sum ~cnt ~idx : Int64.t =\n    if cached (sum, cnt, idx)\n    then get (sum, cnt, idx)\n    else if idx >= num\n    then if cnt != 0 && cnt * avg = sum then 1L else 0L\n    else\n      let idx' = idx + 1 in\n      let sum' = sum + xs.(idx) and cnt' = cnt + 1 in\n      let open Int.Infix in\n      let ans = solve ~sum ~cnt ~idx: idx'\n                + solve ~sum: sum' ~cnt: cnt' ~idx: idx' in\n      ans |- cache (sum, cnt, idx) in\n\n  let sum = 0 and cnt = 0 and idx = 0 in\n  let ans = solve ~sum ~cnt ~idx in\n  printf \"%Ld\\n\" ans\n", "language": "OCaml", "metadata": {"date": 1474167074, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04015.html", "problem_id": "p04015", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04015/input.txt", "sample_output_relpath": "derived/input_output/data/p04015/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04015/OCaml/s768850834.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s768850834", "user_id": "u346726102"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "open Printf\nopen Scanf\n\nlet rec loop x fn =\n  match fn x with\n  | `Break x -> x\n  | `Continue x -> loop x fn\n\nlet ( |- ) x f = f x; x\nlet flip f a b = f b a\n\nmodule Int = struct\n  include Int64\n  module Infix = struct \n    let ( + ) = add and ( - ) = sub\n    and ( * ) = mul and ( / ) = div\n  end\nend\n\nlet () =\n  let read_ints () =\n    let str = loop (Buffer.create 10) begin fun buf ->\n        try \n          `Continue (buf |- (flip Buffer.add_bytes)\n                       (read_line () ^ \" \"))\n        with _ ->\n          `Break (buf |> Buffer.contents) end in\n    str |> Str.(split (regexp \" \")) |> List.map int_of_string in\n\n  let num:: avg:: xs = read_ints () in\n  let xs = xs |> Array.of_list in\n\n  let cache, cached, get = let open Hashtbl in\n    let memo = create 10 in\n    let cache = replace memo in\n    let cached = mem memo in\n    let get = find memo in\n    cache, cached, get in\n\n  let rec solve ~sum ~cnt ~idx : Int64.t =\n    if cached (sum, cnt, idx)\n    then get (sum, cnt, idx)\n    else if idx >= num\n    then if cnt != 0 && cnt * avg = sum then 1L else 0L\n    else\n      let idx' = idx + 1 in\n      let sum' = sum + xs.(idx) and cnt' = cnt + 1 in\n      let open Int.Infix in\n      let ans = solve ~sum ~cnt ~idx: idx'\n                + solve ~sum: sum' ~cnt: cnt' ~idx: idx' in\n      ans |- cache (sum, cnt, idx) in\n\n  let sum = 0 and cnt = 0 and idx = 0 in\n  let ans = solve ~sum ~cnt ~idx in\n  printf \"%Ld\\n\" ans\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTak has N cards. On the i-th (1 \\leq i \\leq N) card is written an integer x_i.\nHe is selecting one or more cards from these N cards, so that the average of the integers written on the selected cards is exactly A.\nIn how many ways can he make his selection?\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq A \\leq 50\n\n1 \\leq x_i \\leq 50\n\nN,\\,A,\\,x_i are integers.\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying 1 \\leq N \\leq 16.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN A\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the number of ways to select cards such that the average of the written integers is exactly A.\n\nSample Input 1\n\n4 8\n7 9 8 9\n\nSample Output 1\n\n5\n\nThe following are the 5 ways to select cards such that the average is 8:\n\nSelect the 3-rd card.\n\nSelect the 1-st and 2-nd cards.\n\nSelect the 1-st and 4-th cards.\n\nSelect the 1-st, 2-nd and 3-rd cards.\n\nSelect the 1-st, 3-rd and 4-th cards.\n\nSample Input 2\n\n3 8\n6 6 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n8 5\n3 6 2 8 7 6 5 9\n\nSample Output 3\n\n19\n\nSample Input 4\n\n33 3\n3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3\n\nSample Output 4\n\n8589934591\n\nThe answer may not fit into a 32-bit integer.", "sample_input": "4 8\n7 9 8 9\n"}, "reference_outputs": ["5\n"], "source_document_id": "p04015", "source_text": "Score : 300 points\n\nProblem Statement\n\nTak has N cards. On the i-th (1 \\leq i \\leq N) card is written an integer x_i.\nHe is selecting one or more cards from these N cards, so that the average of the integers written on the selected cards is exactly A.\nIn how many ways can he make his selection?\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq A \\leq 50\n\n1 \\leq x_i \\leq 50\n\nN,\\,A,\\,x_i are integers.\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying 1 \\leq N \\leq 16.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN A\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the number of ways to select cards such that the average of the written integers is exactly A.\n\nSample Input 1\n\n4 8\n7 9 8 9\n\nSample Output 1\n\n5\n\nThe following are the 5 ways to select cards such that the average is 8:\n\nSelect the 3-rd card.\n\nSelect the 1-st and 2-nd cards.\n\nSelect the 1-st and 4-th cards.\n\nSelect the 1-st, 2-nd and 3-rd cards.\n\nSelect the 1-st, 3-rd and 4-th cards.\n\nSample Input 2\n\n3 8\n6 6 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n8 5\n3 6 2 8 7 6 5 9\n\nSample Output 3\n\n19\n\nSample Input 4\n\n33 3\n3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3\n\nSample Output 4\n\n8589934591\n\nThe answer may not fit into a 32-bit integer.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1434, "cpu_time_ms": 725, "memory_kb": 44028}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s986463284", "group_id": "codeNet:p04016", "input_text": "Scanf.scanf \"%d %d\" (fun n s ->\n    let rec f b n = if n < b then n else f b (n/b) + (n mod b) in\n\n    let step3 n =\n        if n = s then n + 1 else -1\n    in\n\n    let step2 n =\n        let ns = n - s in\n        let rec loop a =\n            if a = 0 then step3 n else\n                if ns mod a = 0 && s - a <= ns / a then ns / a + 1 else\n                    loop (a - 1)\n        in\n        loop (min s (int_of_float (floor (sqrt (float ns) +. 0.5))))\n    in\n\n    let rec loop i =\n        if i * i > n then step2 n else\n            if f i n = s then i else\n                loop (i + 1)\n    in\n    loop 2 |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1590712103, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s986463284.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s986463284", "user_id": "u342443598"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "Scanf.scanf \"%d %d\" (fun n s ->\n    let rec f b n = if n < b then n else f b (n/b) + (n mod b) in\n\n    let step3 n =\n        if n = s then n + 1 else -1\n    in\n\n    let step2 n =\n        let ns = n - s in\n        let rec loop a =\n            if a = 0 then step3 n else\n                if ns mod a = 0 && s - a <= ns / a then ns / a + 1 else\n                    loop (a - 1)\n        in\n        loop (min s (int_of_float (floor (sqrt (float ns) +. 0.5))))\n    in\n\n    let rec loop i =\n        if i * i > n then step2 n else\n            if f i n = s then i else\n                loop (i + 1)\n    in\n    loop 2 |> Printf.printf \"%d\\n\"\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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 631, "cpu_time_ms": 20, "memory_kb": 2432}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s195883031", "group_id": "codeNet:p04016", "input_text": "let rec f acc b = function\n  | 0 -> acc\n  | n -> f (n mod b + acc) b (n / b)\nlet f = f 0\n\nlet () = Scanf.scanf \"%d %d\" @@ fun n s ->\n  let r = int_of_float @@ sqrt @@ float_of_int n in\n  try\n    Array.init r (( + ) 2)\n    |> Array.to_list\n    |> List.find (fun b -> f b n = s)\n    |> Printf.printf \"%d\\n\"\n  with Not_found ->\n    try\n      Array.init (n / r) (( + ) 1)\n      |> Array.to_list\n      |> List.rev_map (fun p -> (n - 1) / p + 1)\n      |> List.filter (( <= ) 2)\n      |> List.find (fun b -> f b n = s)\n      |> Printf.printf \"%d\\n\"\n    with Not_found -> print_endline \"-1\"", "language": "OCaml", "metadata": {"date": 1530340612, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s195883031.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s195883031", "user_id": "u504158101"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "let rec f acc b = function\n  | 0 -> acc\n  | n -> f (n mod b + acc) b (n / b)\nlet f = f 0\n\nlet () = Scanf.scanf \"%d %d\" @@ fun n s ->\n  let r = int_of_float @@ sqrt @@ float_of_int n in\n  try\n    Array.init r (( + ) 2)\n    |> Array.to_list\n    |> List.find (fun b -> f b n = s)\n    |> Printf.printf \"%d\\n\"\n  with Not_found ->\n    try\n      Array.init (n / r) (( + ) 1)\n      |> Array.to_list\n      |> List.rev_map (fun p -> (n - 1) / p + 1)\n      |> List.filter (( <= ) 2)\n      |> List.find (fun b -> f b n = s)\n      |> Printf.printf \"%d\\n\"\n    with Not_found -> print_endline \"-1\"", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 582, "cpu_time_ms": 149, "memory_kb": 21152}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s145418084", "group_id": "codeNet:p04019", "input_text": "let s = read_line ()\nlet f c = try String.index s c |> ignore; 1 with _ -> 0\nlet _ = print_endline @@ if f 'N' - f 'S' + f 'E' - f 'W' = 0 then \"Yes\" else \"No\"", "language": "OCaml", "metadata": {"date": 1571725372, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04019.html", "problem_id": "p04019", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04019/input.txt", "sample_output_relpath": "derived/input_output/data/p04019/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04019/OCaml/s145418084.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s145418084", "user_id": "u732304692"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "let s = read_line ()\nlet f c = try String.index s c |> ignore; 1 with _ -> 0\nlet _ = print_endline @@ if f 'N' - f 'S' + f 'E' - f 'W' = 0 then \"Yes\" else \"No\"", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke lives on an infinite two-dimensional plane. He is going on an N-day trip.\nAt the beginning of Day 1, he is at home. His plan is described in a string S of length N.\nOn Day i(1 ≦ i ≦ N), he will travel a positive distance in the following direction:\n\nNorth if the i-th letter of S is N\n\nWest if the i-th letter of S is W\n\nSouth if the i-th letter of S is S\n\nEast if the i-th letter of S is E\n\nHe has not decided each day's travel distance. Determine whether it is possible to set each day's travel distance so that he will be back at home at the end of Day N.\n\nConstraints\n\n1 ≦ | S | ≦ 1000\n\nS consists of the letters N, W, S, E.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Yes if it is possible to set each day's travel distance so that he will be back at home at the end of Day N. Otherwise, print No.\n\nSample Input 1\n\nSENW\n\nSample Output 1\n\nYes\n\nIf Snuke travels a distance of 1 on each day, he will be back at home at the end of day 4.\n\nSample Input 2\n\nNSNNSNSN\n\nSample Output 2\n\nYes\n\nSample Input 3\n\nNNEW\n\nSample Output 3\n\nNo\n\nSample Input 4\n\nW\n\nSample Output 4\n\nNo", "sample_input": "SENW\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p04019", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke lives on an infinite two-dimensional plane. He is going on an N-day trip.\nAt the beginning of Day 1, he is at home. His plan is described in a string S of length N.\nOn Day i(1 ≦ i ≦ N), he will travel a positive distance in the following direction:\n\nNorth if the i-th letter of S is N\n\nWest if the i-th letter of S is W\n\nSouth if the i-th letter of S is S\n\nEast if the i-th letter of S is E\n\nHe has not decided each day's travel distance. Determine whether it is possible to set each day's travel distance so that he will be back at home at the end of Day N.\n\nConstraints\n\n1 ≦ | S | ≦ 1000\n\nS consists of the letters N, W, S, E.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Yes if it is possible to set each day's travel distance so that he will be back at home at the end of Day N. Otherwise, print No.\n\nSample Input 1\n\nSENW\n\nSample Output 1\n\nYes\n\nIf Snuke travels a distance of 1 on each day, he will be back at home at the end of day 4.\n\nSample Input 2\n\nNSNNSNSN\n\nSample Output 2\n\nYes\n\nSample Input 3\n\nNNEW\n\nSample Output 3\n\nNo\n\nSample Input 4\n\nW\n\nSample Output 4\n\nNo", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 159, "cpu_time_ms": 2, "memory_kb": 4480}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s186874192", "group_id": "codeNet:p04020", "input_text": "Scanf.scanf \"%d\" (fun n ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n\n    let f x = if x >= 0 then x / 2 else 0 in\n    \n    let rec loop i r0 r1 =\n        if i = n then max r0 r1 else\n            if a.(i) = 0 then loop (i + 1) r0 0 else\n                let r0a = max (r0 + f a.(i))       (r1 + f (a.(i) - 1)) in\n                let r1a = max (r0 + f (a.(i) - 1)) (r1 + f (a.(i) - 2)) in\n                loop (i + 1) r0a r1a\n    in\n    loop 1 (f a.(0)) (f (a.(0) - 1)) |> Printf.printf \"%d\\n\"\n)", "language": "OCaml", "metadata": {"date": 1588916510, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04020.html", "problem_id": "p04020", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04020/input.txt", "sample_output_relpath": "derived/input_output/data/p04020/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04020/OCaml/s186874192.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s186874192", "user_id": "u342443598"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "Scanf.scanf \"%d\" (fun n ->\n    let a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun a -> a)) in\n\n    let f x = if x >= 0 then x / 2 else 0 in\n    \n    let rec loop i r0 r1 =\n        if i = n then max r0 r1 else\n            if a.(i) = 0 then loop (i + 1) r0 0 else\n                let r0a = max (r0 + f a.(i))       (r1 + f (a.(i) - 1)) in\n                let r1a = max (r0 + f (a.(i) - 1)) (r1 + f (a.(i) - 2)) in\n                loop (i + 1) r0a r1a\n    in\n    loop 1 (f a.(0)) (f (a.(0) - 1)) |> Printf.printf \"%d\\n\"\n)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has a large collection of cards. Each card has an integer between 1 and N, inclusive, written on it.\nHe has A_i cards with an integer i.\n\nTwo cards can form a pair if the absolute value of the difference of the integers written on them is at most 1.\n\nSnuke wants to create the maximum number of pairs from his cards, on the condition that no card should be used in multiple pairs. Find the maximum number of pairs that he can create.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n0 ≦ A_i ≦ 10^9 (1 ≦ i ≦ N)\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint the maximum number of pairs that Snuke can create.\n\nSample Input 1\n\n4\n4\n0\n3\n2\n\nSample Output 1\n\n4\n\nFor example, Snuke can create the following four pairs: (1,1),(1,1),(3,4),(3,4).\n\nSample Input 2\n\n8\n2\n0\n1\n6\n0\n8\n2\n1\n\nSample Output 2\n\n9", "sample_input": "4\n4\n0\n3\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p04020", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has a large collection of cards. Each card has an integer between 1 and N, inclusive, written on it.\nHe has A_i cards with an integer i.\n\nTwo cards can form a pair if the absolute value of the difference of the integers written on them is at most 1.\n\nSnuke wants to create the maximum number of pairs from his cards, on the condition that no card should be used in multiple pairs. Find the maximum number of pairs that he can create.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n0 ≦ A_i ≦ 10^9 (1 ≦ i ≦ N)\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint the maximum number of pairs that Snuke can create.\n\nSample Input 1\n\n4\n4\n0\n3\n2\n\nSample Output 1\n\n4\n\nFor example, Snuke can create the following four pairs: (1,1),(1,1),(3,4),(3,4).\n\nSample Input 2\n\n8\n2\n0\n1\n6\n0\n8\n2\n1\n\nSample Output 2\n\n9", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 521, "cpu_time_ms": 35, "memory_kb": 5376}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s390561385", "group_id": "codeNet:p04020", "input_text": "let () =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let as_ = Array.init n (fun _ -> Scanf.scanf \"%d\\n\" (fun a -> a)) in\n  Array.fold_left (fun (acc, prev) a ->\n    if prev && 1 <= a then (acc + 1 + (a - 1) / 2, (a - 1) mod 2 = 1)\n    else (acc + a / 2, a mod 2 = 1)) (0, false) as_\n  |> fst\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1515476973, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04020.html", "problem_id": "p04020", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04020/input.txt", "sample_output_relpath": "derived/input_output/data/p04020/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04020/OCaml/s390561385.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s390561385", "user_id": "u504158101"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "let () =\n  let n = Scanf.scanf \"%d\\n\" (fun n -> n) in\n  let as_ = Array.init n (fun _ -> Scanf.scanf \"%d\\n\" (fun a -> a)) in\n  Array.fold_left (fun (acc, prev) a ->\n    if prev && 1 <= a then (acc + 1 + (a - 1) / 2, (a - 1) mod 2 = 1)\n    else (acc + a / 2, a mod 2 = 1)) (0, false) as_\n  |> fst\n  |> Printf.printf \"%d\\n\"", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has a large collection of cards. Each card has an integer between 1 and N, inclusive, written on it.\nHe has A_i cards with an integer i.\n\nTwo cards can form a pair if the absolute value of the difference of the integers written on them is at most 1.\n\nSnuke wants to create the maximum number of pairs from his cards, on the condition that no card should be used in multiple pairs. Find the maximum number of pairs that he can create.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n0 ≦ A_i ≦ 10^9 (1 ≦ i ≦ N)\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint the maximum number of pairs that Snuke can create.\n\nSample Input 1\n\n4\n4\n0\n3\n2\n\nSample Output 1\n\n4\n\nFor example, Snuke can create the following four pairs: (1,1),(1,1),(3,4),(3,4).\n\nSample Input 2\n\n8\n2\n0\n1\n6\n0\n8\n2\n1\n\nSample Output 2\n\n9", "sample_input": "4\n4\n0\n3\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p04020", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has a large collection of cards. Each card has an integer between 1 and N, inclusive, written on it.\nHe has A_i cards with an integer i.\n\nTwo cards can form a pair if the absolute value of the difference of the integers written on them is at most 1.\n\nSnuke wants to create the maximum number of pairs from his cards, on the condition that no card should be used in multiple pairs. Find the maximum number of pairs that he can create.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n0 ≦ A_i ≦ 10^9 (1 ≦ i ≦ N)\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1\n:\nA_N\n\nOutput\n\nPrint the maximum number of pairs that Snuke can create.\n\nSample Input 1\n\n4\n4\n0\n3\n2\n\nSample Output 1\n\n4\n\nFor example, Snuke can create the following four pairs: (1,1),(1,1),(3,4),(3,4).\n\nSample Input 2\n\n8\n2\n0\n1\n6\n0\n8\n2\n1\n\nSample Output 2\n\n9", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 33, "memory_kb": 5248}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s989281496", "group_id": "codeNet:p04026", "input_text": "Scanf.scanf \"%s\" (fun s ->\n    let n = String.length s in\n    let rec loop i =\n        if i = n - 1 then -1, -1 else\n            if i < n - 2 && s.[i] = s.[i + 2] then i + 1, i + 3 else\n                if s.[i] = s.[i + 1] then i + 1, i + 2 else\n                    loop (i + 1)\n    in\n    let a, b = loop 0 in\n    Printf.printf \"%d %d\\n\" a b\n)", "language": "OCaml", "metadata": {"date": 1593054847, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "problem_description_relpath": "problem_descriptions/p04026.html", "problem_id": "p04026", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04026/input.txt", "sample_output_relpath": "derived/input_output/data/p04026/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04026/OCaml/s989281496.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s989281496", "user_id": "u342443598"}, "prompt_components": {"gold_output": "2 5\n", "input_to_evaluate": "Scanf.scanf \"%s\" (fun s ->\n    let n = String.length s in\n    let rec loop i =\n        if i = n - 1 then -1, -1 else\n            if i < n - 2 && s.[i] = s.[i + 2] then i + 1, i + 3 else\n                if s.[i] = s.[i + 1] then i + 1, i + 2 else\n                    loop (i + 1)\n    in\n    let a, b = loop 0 in\n    Printf.printf \"%d %d\\n\" a b\n)", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven a string t, we will call it unbalanced if and only if the length of t is at least 2, and more than half of the letters in t are the same. For example, both voodoo and melee are unbalanced, while neither noon nor a is.\n\nYou are given a string s consisting of lowercase letters. Determine if there exists a (contiguous) substring of s that is unbalanced. If the answer is positive, show a position where such a substring occurs in s.\n\nConstraints\n\n2 ≦ |s| ≦ 10^5\n\ns consists of lowercase letters.\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying 2 ≦ N ≦ 100.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nIf there exists no unbalanced substring of s, print -1 -1.\n\nIf there exists an unbalanced substring of s, let one such substring be s_a s_{a+1} ... s_{b} (1 ≦ a < b ≦ |s|), and print a b. If there exists more than one such substring, any of them will be accepted.\n\nSample Input 1\n\nneeded\n\nSample Output 1\n\n2 5\n\nThe string s_2 s_3 s_4 s_5 = eede is unbalanced. There are also other unbalanced substrings. For example, the output 2 6 will also be accepted.\n\nSample Input 2\n\natcoder\n\nSample Output 2\n\n-1 -1\n\nThe string atcoder contains no unbalanced substring.", "sample_input": "needed\n"}, "reference_outputs": ["2 5\n"], "source_document_id": "p04026", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven a string t, we will call it unbalanced if and only if the length of t is at least 2, and more than half of the letters in t are the same. For example, both voodoo and melee are unbalanced, while neither noon nor a is.\n\nYou are given a string s consisting of lowercase letters. Determine if there exists a (contiguous) substring of s that is unbalanced. If the answer is positive, show a position where such a substring occurs in s.\n\nConstraints\n\n2 ≦ |s| ≦ 10^5\n\ns consists of lowercase letters.\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying 2 ≦ N ≦ 100.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nIf there exists no unbalanced substring of s, print -1 -1.\n\nIf there exists an unbalanced substring of s, let one such substring be s_a s_{a+1} ... s_{b} (1 ≦ a < b ≦ |s|), and print a b. If there exists more than one such substring, any of them will be accepted.\n\nSample Input 1\n\nneeded\n\nSample Output 1\n\n2 5\n\nThe string s_2 s_3 s_4 s_5 = eede is unbalanced. There are also other unbalanced substrings. For example, the output 2 6 will also be accepted.\n\nSample Input 2\n\natcoder\n\nSample Output 2\n\n-1 -1\n\nThe string atcoder contains no unbalanced substring.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 344, "cpu_time_ms": 9, "memory_kb": 4204}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s174298073", "group_id": "codeNet:p04031", "input_text": "let n = Scanf.scanf \"%d\" (fun x -> x)\nlet a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x))\nlet calc c = a\n  |> Array.map (fun v -> (v - c) * (v - c))\n  |> Array.fold_left (+) 0\nlet () = Array.init 210 (fun v -> calc (v-105))\n  |> Array.fold_left min 10101010101010\n  |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1527922032, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04031.html", "problem_id": "p04031", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04031/input.txt", "sample_output_relpath": "derived/input_output/data/p04031/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04031/OCaml/s174298073.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s174298073", "user_id": "u798181098"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "let n = Scanf.scanf \"%d\" (fun x -> x)\nlet a = Array.init n (fun _ -> Scanf.scanf \" %d\" (fun x -> x))\nlet calc c = a\n  |> Array.map (fun v -> (v - c) * (v - c))\n  |> Array.fold_left (+) 0\nlet () = Array.init 210 (fun v -> calc (v-105))\n  |> Array.fold_left min 10101010101010\n  |> Printf.printf \"%d\\n\"", "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": "p04031", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 640}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s596604822", "group_id": "codeNet:p04034", "input_text": "let n, m = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet xys = Array.init m @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> a - 1, b - 1\nlet rs, bs = Array.(make n false, make n 1)\nlet _ = rs.(0) <- true; Array.(iteri (fun i (x, y) -> rs.(y) <- rs.(y) || rs.(x); bs.(x) <- bs.(x) - 1; if bs.(x) = 0 then rs.(x) <- false; bs.\n(y) <- bs.(y) + 1) xys; Printf.printf \"%d\\n\" @@ fold_left (fun c b -> c + if b then 1 else 0) 0 rs)", "language": "OCaml", "metadata": {"date": 1577971361, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04034.html", "problem_id": "p04034", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04034/input.txt", "sample_output_relpath": "derived/input_output/data/p04034/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04034/OCaml/s596604822.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s596604822", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let n, m = Scanf.scanf \" %d %d\" @@ fun a b -> a, b\nlet xys = Array.init m @@ fun _ -> Scanf.scanf \" %d %d\" @@ fun a b -> a - 1, b - 1\nlet rs, bs = Array.(make n false, make n 1)\nlet _ = rs.(0) <- true; Array.(iteri (fun i (x, y) -> rs.(y) <- rs.(y) || rs.(x); bs.(x) <- bs.(x) - 1; if bs.(x) = 0 then rs.(x) <- false; bs.\n(y) <- bs.(y) + 1) xys; Printf.printf \"%d\\n\" @@ fold_left (fun c b -> c + if b then 1 else 0) 0 rs)", "problem_context": "Problem Statement\n\nWe have N boxes, numbered 1 through N. At first, box 1 contains one red ball, and each of the other boxes contains one white ball.\n\nSnuke will perform the following M operations, one by one. In the i-th operation, he randomly picks one ball from box x_i, then he puts it into box y_i.\n\nFind the number of boxes that may contain the red ball after all operations are performed.\n\nConstraints\n\n2≤N≤10^5\n\n1≤M≤10^5\n\n1≤x_i,y_i≤N\n\nx_i≠y_i\n\nJust before the i-th operation is performed, box x_i contains at least 1 ball.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nx_1 y_1\n:\nx_M y_M\n\nOutput\n\nPrint the number of boxes that may contain the red ball after all operations are performed.\n\nSample Input 1\n\n3 2\n1 2\n2 3\n\nSample Output 1\n\n2\n\nJust after the first operation, box 1 is empty, box 2 contains one red ball and one white ball, and box 3 contains one white ball.\n\nNow, consider the second operation. If Snuke picks the red ball from box 2, the red ball will go into box 3. If he picks the white ball instead, the red ball will stay in box 2.\nThus, the number of boxes that may contain the red ball after all operations, is 2.\n\nSample Input 2\n\n3 3\n1 2\n2 3\n2 3\n\nSample Output 2\n\n1\n\nAll balls will go into box 3.\n\nSample Input 3\n\n4 4\n1 2\n2 3\n4 1\n3 4\n\nSample Output 3\n\n3", "sample_input": "3 2\n1 2\n2 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p04034", "source_text": "Problem Statement\n\nWe have N boxes, numbered 1 through N. At first, box 1 contains one red ball, and each of the other boxes contains one white ball.\n\nSnuke will perform the following M operations, one by one. In the i-th operation, he randomly picks one ball from box x_i, then he puts it into box y_i.\n\nFind the number of boxes that may contain the red ball after all operations are performed.\n\nConstraints\n\n2≤N≤10^5\n\n1≤M≤10^5\n\n1≤x_i,y_i≤N\n\nx_i≠y_i\n\nJust before the i-th operation is performed, box x_i contains at least 1 ball.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nx_1 y_1\n:\nx_M y_M\n\nOutput\n\nPrint the number of boxes that may contain the red ball after all operations are performed.\n\nSample Input 1\n\n3 2\n1 2\n2 3\n\nSample Output 1\n\n2\n\nJust after the first operation, box 1 is empty, box 2 contains one red ball and one white ball, and box 3 contains one white ball.\n\nNow, consider the second operation. If Snuke picks the red ball from box 2, the red ball will go into box 3. If he picks the white ball instead, the red ball will stay in box 2.\nThus, the number of boxes that may contain the red ball after all operations, is 2.\n\nSample Input 2\n\n3 3\n1 2\n2 3\n2 3\n\nSample Output 2\n\n1\n\nAll balls will go into box 3.\n\nSample Input 3\n\n4 4\n1 2\n2 3\n4 1\n3 4\n\nSample Output 3\n\n3", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 421, "cpu_time_ms": 53, "memory_kb": 7680}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s343832225", "group_id": "codeNet:p04035", "input_text": "module A = Array\nmodule C = Char\nmodule I = Int64\nmodule L = List\nmodule Q = Queue\n\nlet pf = Printf.printf\nlet sf = Scanf.scanf\nlet ssf = Scanf.sscanf\n\nlet read_int () = sf \"%d \" (fun x -> x)\nlet read_float () = sf \"%f \" (fun x -> x)\nlet read_array read n = A.init n (fun _ -> read ())\nlet err s = raise (Failure s)\n\nlet inf = int_of_float 1e18\nlet eps = 1e-11\n\nmodule S = struct\n  include String\n  let of_array a = String.init (A.length a) (A.get a)\n  let to_array s = A.init (String.length s) (String.get s)\nend;;\n\nlet _ =\n  let n = read_int () in\n  let len = read_int () in\n  let a = read_array read_int n in\n  let (max_len, pos) = A.init (n - 1) (fun x -> x) |>\n                         A.map (fun i -> (a.(i) + a.(i + 1), i)) |>\n                         A.fold_left max (0, 0) in\n  if max_len >= len\n  then A.append (A.init pos (fun x -> x+1)) (A.init (n-pos-1) (fun x -> n-x-1)) |>\n         ( print_endline \"Possible\";\n           A.iter (fun x -> string_of_int x |> print_endline) )\n  else print_endline \"Impossible\"\n", "language": "OCaml", "metadata": {"date": 1493496139, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04035.html", "problem_id": "p04035", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04035/input.txt", "sample_output_relpath": "derived/input_output/data/p04035/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04035/OCaml/s343832225.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s343832225", "user_id": "u748871552"}, "prompt_components": {"gold_output": "Possible\n2\n1\n", "input_to_evaluate": "module A = Array\nmodule C = Char\nmodule I = Int64\nmodule L = List\nmodule Q = Queue\n\nlet pf = Printf.printf\nlet sf = Scanf.scanf\nlet ssf = Scanf.sscanf\n\nlet read_int () = sf \"%d \" (fun x -> x)\nlet read_float () = sf \"%f \" (fun x -> x)\nlet read_array read n = A.init n (fun _ -> read ())\nlet err s = raise (Failure s)\n\nlet inf = int_of_float 1e18\nlet eps = 1e-11\n\nmodule S = struct\n  include String\n  let of_array a = String.init (A.length a) (A.get a)\n  let to_array s = A.init (String.length s) (String.get s)\nend;;\n\nlet _ =\n  let n = read_int () in\n  let len = read_int () in\n  let a = read_array read_int n in\n  let (max_len, pos) = A.init (n - 1) (fun x -> x) |>\n                         A.map (fun i -> (a.(i) + a.(i + 1), i)) |>\n                         A.fold_left max (0, 0) in\n  if max_len >= len\n  then A.append (A.init pos (fun x -> x+1)) (A.init (n-pos-1) (fun x -> n-x-1)) |>\n         ( print_endline \"Possible\";\n           A.iter (fun x -> string_of_int x |> print_endline) )\n  else print_endline \"Impossible\"\n", "problem_context": "Problem Statement\n\nWe have N pieces of ropes, numbered 1 through N. The length of piece i is a_i.\n\nAt first, for each i (1≤i≤N-1), piece i and piece i+1 are tied at the ends, forming one long rope with N-1 knots. Snuke will try to untie all of the knots by performing the following operation repeatedly:\n\nChoose a (connected) rope with a total length of at least L, then untie one of its knots.\n\nIs it possible to untie all of the N-1 knots by properly applying this operation? If the answer is positive, find one possible order to untie the knots.\n\nConstraints\n\n2≤N≤10^5\n\n1≤L≤10^9\n\n1≤a_i≤10^9\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\na_1 a_2 ... a_n\n\nOutput\n\nIf it is not possible to untie all of the N-1 knots, print Impossible.\n\nIf it is possible to untie all of the knots, print Possible, then print another N-1 lines that describe a possible order to untie the knots. The j-th of those N-1 lines should contain the index of the knot that is untied in the j-th operation. Here, the index of the knot connecting piece i and piece i+1 is i.\n\nIf there is more than one solution, output any.\n\nSample Input 1\n\n3 50\n30 20 10\n\nSample Output 1\n\nPossible\n2\n1\n\nIf the knot 1 is untied first, the knot 2 will become impossible to untie.\n\nSample Input 2\n\n2 21\n10 10\n\nSample Output 2\n\nImpossible\n\nSample Input 3\n\n5 50\n10 20 30 40 50\n\nSample Output 3\n\nPossible\n1\n2\n3\n4\n\nAnother example of a possible solution is 3, 4, 1, 2.", "sample_input": "3 50\n30 20 10\n"}, "reference_outputs": ["Possible\n2\n1\n"], "source_document_id": "p04035", "source_text": "Problem Statement\n\nWe have N pieces of ropes, numbered 1 through N. The length of piece i is a_i.\n\nAt first, for each i (1≤i≤N-1), piece i and piece i+1 are tied at the ends, forming one long rope with N-1 knots. Snuke will try to untie all of the knots by performing the following operation repeatedly:\n\nChoose a (connected) rope with a total length of at least L, then untie one of its knots.\n\nIs it possible to untie all of the N-1 knots by properly applying this operation? If the answer is positive, find one possible order to untie the knots.\n\nConstraints\n\n2≤N≤10^5\n\n1≤L≤10^9\n\n1≤a_i≤10^9\n\nAll input values are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN L\na_1 a_2 ... a_n\n\nOutput\n\nIf it is not possible to untie all of the N-1 knots, print Impossible.\n\nIf it is possible to untie all of the knots, print Possible, then print another N-1 lines that describe a possible order to untie the knots. The j-th of those N-1 lines should contain the index of the knot that is untied in the j-th operation. Here, the index of the knot connecting piece i and piece i+1 is i.\n\nIf there is more than one solution, output any.\n\nSample Input 1\n\n3 50\n30 20 10\n\nSample Output 1\n\nPossible\n2\n1\n\nIf the knot 1 is untied first, the knot 2 will become impossible to untie.\n\nSample Input 2\n\n2 21\n10 10\n\nSample Output 2\n\nImpossible\n\nSample Input 3\n\n5 50\n10 20 30 40 50\n\nSample Output 3\n\nPossible\n1\n2\n3\n4\n\nAnother example of a possible solution is 3, 4, 1, 2.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1023, "cpu_time_ms": 222, "memory_kb": 9984}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s676750790", "group_id": "codeNet:p04037", "input_text": "let n = Scanf.scanf \"%d\\n\" (fun x -> x)\n\nlet rec read_ints acc = function\n  | 0 ->  acc\n  | k -> read_ints (Scanf.scanf \" %d\" (fun x -> x) :: acc) (k-1)\n\nlet al = List.sort (fun x y -> compare y x) (read_ints [] n)\n\nlet parity k =\n  let rec aux acc = function\n    | [] -> acc\n    | hd :: tl -> if hd != k then acc else aux (not acc) tl in\n  aux false\n\nlet rec solve i k = function\n  | [] -> true\n  | hd :: tl -> if hd > i then solve (i+1) (hd - i) tl else\n  k mod 2 = 1 || hd != i || parity k tl\n\nlet () = print_endline (if solve 1 0 al then \"First\" else \"Second\")", "language": "OCaml", "metadata": {"date": 1470265449, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04037.html", "problem_id": "p04037", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04037/input.txt", "sample_output_relpath": "derived/input_output/data/p04037/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04037/OCaml/s676750790.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s676750790", "user_id": "u367021138"}, "prompt_components": {"gold_output": "First\n", "input_to_evaluate": "let n = Scanf.scanf \"%d\\n\" (fun x -> x)\n\nlet rec read_ints acc = function\n  | 0 ->  acc\n  | k -> read_ints (Scanf.scanf \" %d\" (fun x -> x) :: acc) (k-1)\n\nlet al = List.sort (fun x y -> compare y x) (read_ints [] n)\n\nlet parity k =\n  let rec aux acc = function\n    | [] -> acc\n    | hd :: tl -> if hd != k then acc else aux (not acc) tl in\n  aux false\n\nlet rec solve i k = function\n  | [] -> true\n  | hd :: tl -> if hd > i then solve (i+1) (hd - i) tl else\n  k mod 2 = 1 || hd != i || parity k tl\n\nlet () = print_endline (if solve 1 0 al then \"First\" else \"Second\")", "problem_context": "Problem Statement\n\nThere are N piles of candies on the table. The piles are numbered 1 through N. At first, pile i contains a_i candies.\n\nSnuke and Ciel are playing a game. They take alternating turns. Snuke goes first. In each turn, the current player must perform one of the following two operations:\n\nChoose a pile with the largest number of candies remaining, then eat all candies of that pile.\n\nFrom each pile with one or more candies remaining, eat one candy.\n\nThe player who eats the last candy on the table, loses the game. Determine which player will win if both players play the game optimally.\n\nConstraints\n\n1≤N≤10^5\n\n1≤a_i≤10^9\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 Snuke will win, print First. If Ciel will win, print Second.\n\nSample Input 1\n\n2\n1 3\n\nSample Output 1\n\nFirst\n\nAt the beginning of the game, pile 2 contains the most candies. If Snuke eats all candies of this pile, Ciel has no choice but to eat the last candy.\n\nSample Input 2\n\n3\n1 2 1\n\nSample Output 2\n\nFirst\n\nIf Snuke eats one candy from each pile, Ciel is again left with the last candy.\n\nSample Input 3\n\n3\n1 2 3\n\nSample Output 3\n\nSecond", "sample_input": "2\n1 3\n"}, "reference_outputs": ["First\n"], "source_document_id": "p04037", "source_text": "Problem Statement\n\nThere are N piles of candies on the table. The piles are numbered 1 through N. At first, pile i contains a_i candies.\n\nSnuke and Ciel are playing a game. They take alternating turns. Snuke goes first. In each turn, the current player must perform one of the following two operations:\n\nChoose a pile with the largest number of candies remaining, then eat all candies of that pile.\n\nFrom each pile with one or more candies remaining, eat one candy.\n\nThe player who eats the last candy on the table, loses the game. Determine which player will win if both players play the game optimally.\n\nConstraints\n\n1≤N≤10^5\n\n1≤a_i≤10^9\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 Snuke will win, print First. If Ciel will win, print Second.\n\nSample Input 1\n\n2\n1 3\n\nSample Output 1\n\nFirst\n\nAt the beginning of the game, pile 2 contains the most candies. If Snuke eats all candies of this pile, Ciel has no choice but to eat the last candy.\n\nSample Input 2\n\n3\n1 2 1\n\nSample Output 2\n\nFirst\n\nIf Snuke eats one candy from each pile, Ciel is again left with the last candy.\n\nSample Input 3\n\n3\n1 2 3\n\nSample Output 3\n\nSecond", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 131, "memory_kb": 9344}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s893297515", "group_id": "codeNet:p04039", "input_text": "module IntSet = Set.Make (struct type t = int let compare = compare end)\n\nlet rec tabulate n f = \n  let rec loop acc m =\n    if m < n then loop (f m :: acc) (m + 1)\n    else List.rev acc in\n  loop [] 0\n\nlet rec solve ds = function\n  | 0 -> (0, false)\n  | n ->\n      let m, n = n mod 10, n / 10 in\n      if IntSet.mem m ds then\n        match solve ds n with\n        | (n, false) -> (10 * n + m, false)\n        | (n, true) -> (10 * n + IntSet.min_elt ds, true)\n      else\n        tabulate 10 (fun n -> n)\n        |> List.filter (fun n -> IntSet.mem n ds && m < n)\n        |> (function\n            | [] -> (10 * fst (solve ds (n + 1)) + IntSet.min_elt ds, true)\n            | m :: _ ->\n                match solve ds n with\n                | (n, false) -> (10 * n + m, true)\n                | (n, true) -> (10 * n + IntSet.min_elt ds, true))\n\nlet () =\n  let n, k = Scanf.scanf \"%d %d\\n\" (fun n k -> n, k) in\n  let ds =\n    IntSet.diff\n      (IntSet.of_list (tabulate 10 (fun k -> k)))\n      (IntSet.of_list (tabulate k (fun _ -> Scanf.scanf \"%d \" (fun d -> d)))) in\n  Printf.printf \"%d\\n\" (fst (solve ds n))\n", "language": "OCaml", "metadata": {"date": 1469325369, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04039.html", "problem_id": "p04039", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04039/input.txt", "sample_output_relpath": "derived/input_output/data/p04039/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04039/OCaml/s893297515.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s893297515", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2000\n", "input_to_evaluate": "module IntSet = Set.Make (struct type t = int let compare = compare end)\n\nlet rec tabulate n f = \n  let rec loop acc m =\n    if m < n then loop (f m :: acc) (m + 1)\n    else List.rev acc in\n  loop [] 0\n\nlet rec solve ds = function\n  | 0 -> (0, false)\n  | n ->\n      let m, n = n mod 10, n / 10 in\n      if IntSet.mem m ds then\n        match solve ds n with\n        | (n, false) -> (10 * n + m, false)\n        | (n, true) -> (10 * n + IntSet.min_elt ds, true)\n      else\n        tabulate 10 (fun n -> n)\n        |> List.filter (fun n -> IntSet.mem n ds && m < n)\n        |> (function\n            | [] -> (10 * fst (solve ds (n + 1)) + IntSet.min_elt ds, true)\n            | m :: _ ->\n                match solve ds n with\n                | (n, false) -> (10 * n + m, true)\n                | (n, true) -> (10 * n + IntSet.min_elt ds, true))\n\nlet () =\n  let n, k = Scanf.scanf \"%d %d\\n\" (fun n k -> n, k) in\n  let ds =\n    IntSet.diff\n      (IntSet.of_list (tabulate 10 (fun k -> k)))\n      (IntSet.of_list (tabulate k (fun _ -> Scanf.scanf \"%d \" (fun d -> d)))) in\n  Printf.printf \"%d\\n\" (fst (solve ds n))\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIroha is very particular about numbers. There are K digits that she dislikes: D_1, D_2, ..., D_K.\n\nShe is shopping, and now paying at the cashier.\nHer total is N yen (the currency of Japan), thus she has to hand at least N yen to the cashier (and possibly receive the change).\n\nHowever, as mentioned before, she is very particular about numbers. When she hands money to the cashier, the decimal notation of the amount must not contain any digits that she dislikes. Under this condition, she will hand the minimum amount of money.\n\nFind the amount of money that she will hand to the cashier.\n\nConstraints\n\n1 ≦ N < 10000\n\n1 ≦ K < 10\n\n0 ≦ D_1 < D_2 < … < D_K≦9\n\n\\{D_1,D_2,...,D_K\\} ≠ \\{1,2,3,4,5,6,7,8,9\\}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\nD_1 D_2 … D_K\n\nOutput\n\nPrint the amount of money that Iroha will hand to the cashier.\n\nSample Input 1\n\n1000 8\n1 3 4 5 6 7 8 9\n\nSample Output 1\n\n2000\n\nShe dislikes all digits except 0 and 2.\n\nThe smallest integer equal to or greater than N=1000 whose decimal notation contains only 0 and 2, is 2000.\n\nSample Input 2\n\n9999 1\n0\n\nSample Output 2\n\n9999", "sample_input": "1000 8\n1 3 4 5 6 7 8 9\n"}, "reference_outputs": ["2000\n"], "source_document_id": "p04039", "source_text": "Score : 300 points\n\nProblem Statement\n\nIroha is very particular about numbers. There are K digits that she dislikes: D_1, D_2, ..., D_K.\n\nShe is shopping, and now paying at the cashier.\nHer total is N yen (the currency of Japan), thus she has to hand at least N yen to the cashier (and possibly receive the change).\n\nHowever, as mentioned before, she is very particular about numbers. When she hands money to the cashier, the decimal notation of the amount must not contain any digits that she dislikes. Under this condition, she will hand the minimum amount of money.\n\nFind the amount of money that she will hand to the cashier.\n\nConstraints\n\n1 ≦ N < 10000\n\n1 ≦ K < 10\n\n0 ≦ D_1 < D_2 < … < D_K≦9\n\n\\{D_1,D_2,...,D_K\\} ≠ \\{1,2,3,4,5,6,7,8,9\\}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\nD_1 D_2 … D_K\n\nOutput\n\nPrint the amount of money that Iroha will hand to the cashier.\n\nSample Input 1\n\n1000 8\n1 3 4 5 6 7 8 9\n\nSample Output 1\n\n2000\n\nShe dislikes all digits except 0 and 2.\n\nThe smallest integer equal to or greater than N=1000 whose decimal notation contains only 0 and 2, is 2000.\n\nSample Input 2\n\n9999 1\n0\n\nSample Output 2\n\n9999", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s003711761", "group_id": "codeNet:p04043", "input_text": "open Scanf\nopen Printf\n\nlet () = scanf \"%d %d %d\" (fun a b c ->\n  if a = 7 || b = 5 || c = 5 then \"YES\"\n  else if a = 5 || b = 7 || c = 5 then \"YES\"\n  else if a = 5 || b = 5 || c = 7 then \"YES\"\n  else \"NO\"\n  ) |> printf \"%s\\n\"", "language": "OCaml", "metadata": {"date": 1595997607, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s003711761.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s003711761", "user_id": "u272377260"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "open Scanf\nopen Printf\n\nlet () = scanf \"%d %d %d\" (fun a b c ->\n  if a = 7 || b = 5 || c = 5 then \"YES\"\n  else if a = 5 || b = 7 || c = 5 then \"YES\"\n  else if a = 5 || b = 5 || c = 7 then \"YES\"\n  else \"NO\"\n  ) |> printf \"%s\\n\"", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIroha loves Haiku. Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.\n\nTo create a Haiku, Iroha has come up with three different phrases. These phrases have A, B and C syllables, respectively. Determine whether she can construct a Haiku by using each of the phrases once, in some order.\n\nConstraints\n\n1≦A,B,C≦10\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf it is possible to construct a Haiku by using each of the phrases once, print YES (case-sensitive). Otherwise, print NO.\n\nSample Input 1\n\n5 5 7\n\nSample Output 1\n\nYES\n\nUsing three phrases of length 5, 5 and 7, it is possible to construct a Haiku.\n\nSample Input 2\n\n7 7 5\n\nSample Output 2\n\nNO", "sample_input": "5 5 7\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p04043", "source_text": "Score : 100 points\n\nProblem Statement\n\nIroha loves Haiku. Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.\n\nTo create a Haiku, Iroha has come up with three different phrases. These phrases have A, B and C syllables, respectively. Determine whether she can construct a Haiku by using each of the phrases once, in some order.\n\nConstraints\n\n1≦A,B,C≦10\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf it is possible to construct a Haiku by using each of the phrases once, print YES (case-sensitive). Otherwise, print NO.\n\nSample Input 1\n\n5 5 7\n\nSample Output 1\n\nYES\n\nUsing three phrases of length 5, 5 and 7, it is possible to construct a Haiku.\n\nSample Input 2\n\n7 7 5\n\nSample Output 2\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 226, "cpu_time_ms": 6, "memory_kb": 3632}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s535988067", "group_id": "codeNet:p04043", "input_text": "let r_long () = Int64.of_int (Scanf.scanf \" %d\" (fun x -> x)) ;;\nlet r_int () = Scanf.scanf \" %d\" (fun x -> x) ;;\nlet a=r_int() in\nlet b=r_int() in\nlet c=r_int() in\nif (a=7 && b=5 && c=5) || (a=5 && b=7 && c=5) || (a=5 && b=5 && c=7) then\nbegin\nprint_string \"YES\";\nend\nelse\nbegin\nprint_string \"NO\";\nend\n;\nprint_newline();\n", "language": "OCaml", "metadata": {"date": 1592975216, "filename_ext": "ml", "original_language": "OCaml (4.10.0)", "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/OCaml/s535988067.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s535988067", "user_id": "u633497951"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let r_long () = Int64.of_int (Scanf.scanf \" %d\" (fun x -> x)) ;;\nlet r_int () = Scanf.scanf \" %d\" (fun x -> x) ;;\nlet a=r_int() in\nlet b=r_int() in\nlet c=r_int() in\nif (a=7 && b=5 && c=5) || (a=5 && b=7 && c=5) || (a=5 && b=5 && c=7) then\nbegin\nprint_string \"YES\";\nend\nelse\nbegin\nprint_string \"NO\";\nend\n;\nprint_newline();\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIroha loves Haiku. Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.\n\nTo create a Haiku, Iroha has come up with three different phrases. These phrases have A, B and C syllables, respectively. Determine whether she can construct a Haiku by using each of the phrases once, in some order.\n\nConstraints\n\n1≦A,B,C≦10\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf it is possible to construct a Haiku by using each of the phrases once, print YES (case-sensitive). Otherwise, print NO.\n\nSample Input 1\n\n5 5 7\n\nSample Output 1\n\nYES\n\nUsing three phrases of length 5, 5 and 7, it is possible to construct a Haiku.\n\nSample Input 2\n\n7 7 5\n\nSample Output 2\n\nNO", "sample_input": "5 5 7\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p04043", "source_text": "Score : 100 points\n\nProblem Statement\n\nIroha loves Haiku. Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.\n\nTo create a Haiku, Iroha has come up with three different phrases. These phrases have A, B and C syllables, respectively. Determine whether she can construct a Haiku by using each of the phrases once, in some order.\n\nConstraints\n\n1≦A,B,C≦10\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf it is possible to construct a Haiku by using each of the phrases once, print YES (case-sensitive). Otherwise, print NO.\n\nSample Input 1\n\n5 5 7\n\nSample Output 1\n\nYES\n\nUsing three phrases of length 5, 5 and 7, it is possible to construct a Haiku.\n\nSample Input 2\n\n7 7 5\n\nSample Output 2\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 322, "cpu_time_ms": 9, "memory_kb": 3692}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s768777448", "group_id": "codeNet:p04043", "input_text": "let _ =\n    let p = Scanf.scanf \"%d %d %d\\n\" (fun a b c ->\n        List.sort compare [a;b;c]) in\n    let f = function\n        true -> print_endline \"YES\"\n        | false -> print_endline \"NO\" in\n    f ((List.nth p 0) == 5 && (List.nth p 1) == 5 && (List.nth p 2) == 7)\n\n\n", "language": "OCaml", "metadata": {"date": 1478895120, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s768777448.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s768777448", "user_id": "u330133819"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let _ =\n    let p = Scanf.scanf \"%d %d %d\\n\" (fun a b c ->\n        List.sort compare [a;b;c]) in\n    let f = function\n        true -> print_endline \"YES\"\n        | false -> print_endline \"NO\" in\n    f ((List.nth p 0) == 5 && (List.nth p 1) == 5 && (List.nth p 2) == 7)\n\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIroha loves Haiku. Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.\n\nTo create a Haiku, Iroha has come up with three different phrases. These phrases have A, B and C syllables, respectively. Determine whether she can construct a Haiku by using each of the phrases once, in some order.\n\nConstraints\n\n1≦A,B,C≦10\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf it is possible to construct a Haiku by using each of the phrases once, print YES (case-sensitive). Otherwise, print NO.\n\nSample Input 1\n\n5 5 7\n\nSample Output 1\n\nYES\n\nUsing three phrases of length 5, 5 and 7, it is possible to construct a Haiku.\n\nSample Input 2\n\n7 7 5\n\nSample Output 2\n\nNO", "sample_input": "5 5 7\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p04043", "source_text": "Score : 100 points\n\nProblem Statement\n\nIroha loves Haiku. Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.\n\nTo create a Haiku, Iroha has come up with three different phrases. These phrases have A, B and C syllables, respectively. Determine whether she can construct a Haiku by using each of the phrases once, in some order.\n\nConstraints\n\n1≦A,B,C≦10\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf it is possible to construct a Haiku by using each of the phrases once, print YES (case-sensitive). Otherwise, print NO.\n\nSample Input 1\n\n5 5 7\n\nSample Output 1\n\nYES\n\nUsing three phrases of length 5, 5 and 7, it is possible to construct a Haiku.\n\nSample Input 2\n\n7 7 5\n\nSample Output 2\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 271, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s526125190", "group_id": "codeNet:p04043", "input_text": "let main = Scanf.sscanf (read_line()) \"%d %d %d\" (fun a b c ->\n    if a * b * c = 175\n    then print_string \"YES\\n\"\n    else print_string \"NO\\n\"\n)", "language": "OCaml", "metadata": {"date": 1469403262, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s526125190.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s526125190", "user_id": "u779353743"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "let main = Scanf.sscanf (read_line()) \"%d %d %d\" (fun a b c ->\n    if a * b * c = 175\n    then print_string \"YES\\n\"\n    else print_string \"NO\\n\"\n)", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIroha loves Haiku. Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.\n\nTo create a Haiku, Iroha has come up with three different phrases. These phrases have A, B and C syllables, respectively. Determine whether she can construct a Haiku by using each of the phrases once, in some order.\n\nConstraints\n\n1≦A,B,C≦10\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf it is possible to construct a Haiku by using each of the phrases once, print YES (case-sensitive). Otherwise, print NO.\n\nSample Input 1\n\n5 5 7\n\nSample Output 1\n\nYES\n\nUsing three phrases of length 5, 5 and 7, it is possible to construct a Haiku.\n\nSample Input 2\n\n7 7 5\n\nSample Output 2\n\nNO", "sample_input": "5 5 7\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p04043", "source_text": "Score : 100 points\n\nProblem Statement\n\nIroha loves Haiku. Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.\n\nTo create a Haiku, Iroha has come up with three different phrases. These phrases have A, B and C syllables, respectively. Determine whether she can construct a Haiku by using each of the phrases once, in some order.\n\nConstraints\n\n1≦A,B,C≦10\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nIf it is possible to construct a Haiku by using each of the phrases once, print YES (case-sensitive). Otherwise, print NO.\n\nSample Input 1\n\n5 5 7\n\nSample Output 1\n\nYES\n\nUsing three phrases of length 5, 5 and 7, it is possible to construct a Haiku.\n\nSample Input 2\n\n7 7 5\n\nSample Output 2\n\nNO", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 146, "cpu_time_ms": 5, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s124795604", "group_id": "codeNet:p04045", "input_text": "let rec h n a = if n = 0 then a else h (n / 10) (n mod 10 :: a)\nlet ns, ds = Scanf.(scanf \" %d %d\" @@ fun n k -> h n [], Array.(to_list @@ init k @@ fun _ -> scanf \" %d\" (+) 0))\nlet rec f n = if n > 9 then 10 * f 1 + if f 0 = 0 then 0 else f 1 else if List.mem n ds then f (n + 1) else n\nlet rec g b a = function [] -> a | n :: ns -> g (b || f n > n) ((if b then f 0 else f n) :: a) ns\nlet rec k b a = function [] -> a | n :: ns -> let m = if b then f (n + 1) else n in k (m > 9) ((if m > 9 && ns <> [] then f 0 else m) :: a) ns\nlet ns = g false [] ns |> k false [] |> List.fold_left (fun a n -> 10 * a + n) 0 |> Printf.printf \"%d\\n\"", "language": "OCaml", "metadata": {"date": 1577058334, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04045.html", "problem_id": "p04045", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04045/input.txt", "sample_output_relpath": "derived/input_output/data/p04045/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04045/OCaml/s124795604.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s124795604", "user_id": "u732304692"}, "prompt_components": {"gold_output": "2000\n", "input_to_evaluate": "let rec h n a = if n = 0 then a else h (n / 10) (n mod 10 :: a)\nlet ns, ds = Scanf.(scanf \" %d %d\" @@ fun n k -> h n [], Array.(to_list @@ init k @@ fun _ -> scanf \" %d\" (+) 0))\nlet rec f n = if n > 9 then 10 * f 1 + if f 0 = 0 then 0 else f 1 else if List.mem n ds then f (n + 1) else n\nlet rec g b a = function [] -> a | n :: ns -> g (b || f n > n) ((if b then f 0 else f n) :: a) ns\nlet rec k b a = function [] -> a | n :: ns -> let m = if b then f (n + 1) else n in k (m > 9) ((if m > 9 && ns <> [] then f 0 else m) :: a) ns\nlet ns = g false [] ns |> k false [] |> List.fold_left (fun a n -> 10 * a + n) 0 |> Printf.printf \"%d\\n\"", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIroha is very particular about numbers. There are K digits that she dislikes: D_1, D_2, ..., D_K.\n\nShe is shopping, and now paying at the cashier.\nHer total is N yen (the currency of Japan), thus she has to hand at least N yen to the cashier (and possibly receive the change).\n\nHowever, as mentioned before, she is very particular about numbers. When she hands money to the cashier, the decimal notation of the amount must not contain any digits that she dislikes. Under this condition, she will hand the minimum amount of money.\n\nFind the amount of money that she will hand to the cashier.\n\nConstraints\n\n1 ≦ N < 10000\n\n1 ≦ K < 10\n\n0 ≦ D_1 < D_2 < … < D_K≦9\n\n\\{D_1,D_2,...,D_K\\} ≠ \\{1,2,3,4,5,6,7,8,9\\}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\nD_1 D_2 … D_K\n\nOutput\n\nPrint the amount of money that Iroha will hand to the cashier.\n\nSample Input 1\n\n1000 8\n1 3 4 5 6 7 8 9\n\nSample Output 1\n\n2000\n\nShe dislikes all digits except 0 and 2.\n\nThe smallest integer equal to or greater than N=1000 whose decimal notation contains only 0 and 2, is 2000.\n\nSample Input 2\n\n9999 1\n0\n\nSample Output 2\n\n9999", "sample_input": "1000 8\n1 3 4 5 6 7 8 9\n"}, "reference_outputs": ["2000\n"], "source_document_id": "p04045", "source_text": "Score : 300 points\n\nProblem Statement\n\nIroha is very particular about numbers. There are K digits that she dislikes: D_1, D_2, ..., D_K.\n\nShe is shopping, and now paying at the cashier.\nHer total is N yen (the currency of Japan), thus she has to hand at least N yen to the cashier (and possibly receive the change).\n\nHowever, as mentioned before, she is very particular about numbers. When she hands money to the cashier, the decimal notation of the amount must not contain any digits that she dislikes. Under this condition, she will hand the minimum amount of money.\n\nFind the amount of money that she will hand to the cashier.\n\nConstraints\n\n1 ≦ N < 10000\n\n1 ≦ K < 10\n\n0 ≦ D_1 < D_2 < … < D_K≦9\n\n\\{D_1,D_2,...,D_K\\} ≠ \\{1,2,3,4,5,6,7,8,9\\}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\nD_1 D_2 … D_K\n\nOutput\n\nPrint the amount of money that Iroha will hand to the cashier.\n\nSample Input 1\n\n1000 8\n1 3 4 5 6 7 8 9\n\nSample Output 1\n\n2000\n\nShe dislikes all digits except 0 and 2.\n\nThe smallest integer equal to or greater than N=1000 whose decimal notation contains only 0 and 2, is 2000.\n\nSample Input 2\n\n9999 1\n0\n\nSample Output 2\n\n9999", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 384}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s047607926", "group_id": "codeNet:p04047", "input_text": "let split_nums str =\n  Str.split (Str.regexp \" \") str\n  |> List.map int_of_string\n\nlet odd_indexed xs =\n  let os, es = List.fold_left (fun (l,r) x -> x :: r, l) ([], []) xs\n  in es\n\nlet sum_list = List.fold_left (+) 0\n       \nlet answer xs =\n  List.sort (-) xs\n  |> odd_indexed\n  |> sum_list\n\nlet () =\n  let _ = read_int () in\n  read_line ()\n  |> split_nums\n  |> answer\n  |> Printf.printf \"%d\\n\";\n", "language": "OCaml", "metadata": {"date": 1468718782, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04047.html", "problem_id": "p04047", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04047/input.txt", "sample_output_relpath": "derived/input_output/data/p04047/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04047/OCaml/s047607926.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s047607926", "user_id": "u702189202"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "let split_nums str =\n  Str.split (Str.regexp \" \") str\n  |> List.map int_of_string\n\nlet odd_indexed xs =\n  let os, es = List.fold_left (fun (l,r) x -> x :: r, l) ([], []) xs\n  in es\n\nlet sum_list = List.fold_left (+) 0\n       \nlet answer xs =\n  List.sort (-) xs\n  |> odd_indexed\n  |> sum_list\n\nlet () =\n  let _ = read_int () in\n  read_line ()\n  |> split_nums\n  |> answer\n  |> Printf.printf \"%d\\n\";\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke is having a barbeque party.\n\nAt the party, he will make N servings of Skewer Meal.\n\nExample of a serving of Skewer Meal\n\nHe has a stock of 2N skewers, all of which will be used in Skewer Meal. The length of the i-th skewer is L_i.\nAlso, he has an infinite supply of ingredients.\n\nTo make a serving of Skewer Meal, he picks 2 skewers and threads ingredients onto those skewers.\nLet the length of the shorter skewer be x, then the serving can hold the maximum of x ingredients.\n\nWhat is the maximum total number of ingredients that his N servings of Skewer Meal can hold, if he uses the skewers optimally?\n\nConstraints\n\n1≦N≦100\n\n1≦L_i≦100\n\nFor each i, L_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_{2N}\n\nOutput\n\nPrint the maximum total number of ingredients that Snuke's N servings of Skewer Meal can hold.\n\nSample Input 1\n\n2\n1 3 1 2\n\nSample Output 1\n\n3\n\nIf he makes a serving using the first and third skewers, and another using the second and fourth skewers, each serving will hold 1 and 2 ingredients, for the total of 3.\n\nSample Input 2\n\n5\n100 1 2 3 14 15 58 58 58 29\n\nSample Output 2\n\n135", "sample_input": "2\n1 3 1 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p04047", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke is having a barbeque party.\n\nAt the party, he will make N servings of Skewer Meal.\n\nExample of a serving of Skewer Meal\n\nHe has a stock of 2N skewers, all of which will be used in Skewer Meal. The length of the i-th skewer is L_i.\nAlso, he has an infinite supply of ingredients.\n\nTo make a serving of Skewer Meal, he picks 2 skewers and threads ingredients onto those skewers.\nLet the length of the shorter skewer be x, then the serving can hold the maximum of x ingredients.\n\nWhat is the maximum total number of ingredients that his N servings of Skewer Meal can hold, if he uses the skewers optimally?\n\nConstraints\n\n1≦N≦100\n\n1≦L_i≦100\n\nFor each i, L_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_{2N}\n\nOutput\n\nPrint the maximum total number of ingredients that Snuke's N servings of Skewer Meal can hold.\n\nSample Input 1\n\n2\n1 3 1 2\n\nSample Output 1\n\n3\n\nIf he makes a serving using the first and third skewers, and another using the second and fourth skewers, each serving will hold 1 and 2 ingredients, for the total of 3.\n\nSample Input 2\n\n5\n100 1 2 3 14 15 58 58 58 29\n\nSample Output 2\n\n135", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 397, "cpu_time_ms": 4, "memory_kb": 512}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s247760863", "group_id": "codeNet:p04049", "input_text": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let es = Array.make n [] in\n  for i = 0 to n - 2 do\n    Scanf.scanf \"%d %d\\n\" @@ fun a b ->\n      es.(a - 1) <- b - 1 :: es.(a - 1);\n      es.(b - 1) <- a - 1 :: es.(b - 1);\n  done;\n  let d = Array.make_matrix n n min_int in\n  for s = 0 to n - 1 do\n    let rec dfs v =\n      List.iter (fun u ->\n        if d.(s).(u) < 0 then \n          (d.(s).(u) <- 1 + d.(s).(v); dfs u)) es.(v) in\n    d.(s).(s) <- 0; dfs s\n  done;\n  Printf.printf \"%d\\n\" @@ ( - ) n @@ Array.fold_left max min_int @@ Array.init n @@ fun u ->\n    let (vs, ws) = Array.fold_left (fun (vs, ws) v ->\n      (if d.(u).(v) = k then v :: vs else vs),\n      (if d.(u).(v) <= k then v :: ws else ws)) ([], []) @@\n      Array.init n @@ fun v -> v in\n    if\n      List.for_all (fun v ->\n        List.for_all (fun w ->\n          d.(v).(w) <= k) ws) vs\n    then List.length ws\n    else min_int\n", "language": "OCaml", "metadata": {"date": 1535950600, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "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/OCaml/s247760863.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s247760863", "user_id": "u504158101"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "let () = Scanf.scanf \"%d %d\\n\" @@ fun n k ->\n  let es = Array.make n [] in\n  for i = 0 to n - 2 do\n    Scanf.scanf \"%d %d\\n\" @@ fun a b ->\n      es.(a - 1) <- b - 1 :: es.(a - 1);\n      es.(b - 1) <- a - 1 :: es.(b - 1);\n  done;\n  let d = Array.make_matrix n n min_int in\n  for s = 0 to n - 1 do\n    let rec dfs v =\n      List.iter (fun u ->\n        if d.(s).(u) < 0 then \n          (d.(s).(u) <- 1 + d.(s).(v); dfs u)) es.(v) in\n    d.(s).(s) <- 0; dfs s\n  done;\n  Printf.printf \"%d\\n\" @@ ( - ) n @@ Array.fold_left max min_int @@ Array.init n @@ fun u ->\n    let (vs, ws) = Array.fold_left (fun (vs, ws) v ->\n      (if d.(u).(v) = k then v :: vs else vs),\n      (if d.(u).(v) <= k then v :: ws else ws)) ([], []) @@\n      Array.init n @@ fun v -> v in\n    if\n      List.for_all (fun v ->\n        List.for_all (fun w ->\n          d.(v).(w) <= k) ws) vs\n    then List.length ws\n    else min_int\n", "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": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 895, "cpu_time_ms": 2105, "memory_kb": 57920}, "variant": "low_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:OCaml:s176339063", "group_id": "codeNet:p04051", "input_text": "let id x = x\n\nlet s = 1000000007\nlet inv2 = 500000004\n\nlet repeat f =\n  let rec aux accu = function\n    | 0 -> accu\n    | n -> aux (f () :: accu) (n - 1) in\n  aux []\n\nlet pow k =\n  let rec aux accu k = function\n  | 0 -> accu\n  | n when n mod 2 == 0 -> aux accu (k*k mod s) (n/2)\n  | n -> aux (accu*k mod s) (k*k mod s) (n/2) in\n  aux 1 k\n\nlet inv k = pow k (s-2)\n\nlet () =\n  let n = Scanf.scanf \"%d\\n\" id in\n  let l = repeat (fun () -> Scanf.scanf \"%d %d\\n\" (fun a b -> (a,b))) n in\n  let (maxa, maxb) = List.fold_left (fun (c,d) (a,b) -> (max a c, max d b)) (0, 0) l in\n  let factbl = Array.make (2*maxa+2*maxb+1) 1 in\n    for i = 1 to 2*maxa+2*maxb do Array.unsafe_set factbl i ((Array.unsafe_get factbl (i-1)) * i mod s) done;\n  let ifactbl = Array.make (2*maxa+2*maxb+1) 0 in\n    ifactbl.(2*maxa+2*maxb) <- inv factbl.(2*maxa+2*maxb);\n    for i = 2*maxa+2*maxb-1 downto 0 do Array.unsafe_set ifactbl i ((Array.unsafe_get ifactbl (i+1)) * (i+1) mod s) done;\n  let bc n k = ((factbl.(n)*ifactbl.(k) mod s) * ifactbl.(n-k) mod s) in\n  let sal = List.sort (fun (a,b) (c,d) -> compare c a) l in\n  let dp = Array.make (1 + 2 * maxb) 0 in\n  let update () = for i = 1 to 2 * maxb do Array.unsafe_set dp i ((Array.unsafe_get dp i + Array.unsafe_get dp (i-1)) mod s) done in\n  let rec solve sl m =\n    if m > maxa then ()\n      else match sl with\n           | (a, b) :: tl when a = maxa-m -> dp.(maxb-b) <- ((dp.(maxb-b) +1) mod s); solve tl m\n           | _ -> update (); solve sl (m+1) in\n  solve sal 0;\n  let rec accum accu = function\n    | 0 -> accu + dp.(0)*dp.(2*maxb) mod s\n    | k -> accum ((accu + ((s+dp.(k)-dp.(k-1)) mod s)*dp.(2*maxb-k) mod s) mod s) (k-1) in\n  let sum = accum 0 (2*maxb) in\n  let x = List.fold_left (fun x (a,b) -> (x + bc (2*a+2*b) (2*a)) mod s) 0 l in\n    print_int ((s+sum - x)*inv2 mod s)", "language": "OCaml", "metadata": {"date": 1468836111, "filename_ext": "ml", "original_language": "OCaml (4.02.3)", "problem_description_relpath": "problem_descriptions/p04051.html", "problem_id": "p04051", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04051/input.txt", "sample_output_relpath": "derived/input_output/data/p04051/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04051/OCaml/s176339063.ml", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s176339063", "user_id": "u367021138"}, "prompt_components": {"gold_output": "26\n", "input_to_evaluate": "let id x = x\n\nlet s = 1000000007\nlet inv2 = 500000004\n\nlet repeat f =\n  let rec aux accu = function\n    | 0 -> accu\n    | n -> aux (f () :: accu) (n - 1) in\n  aux []\n\nlet pow k =\n  let rec aux accu k = function\n  | 0 -> accu\n  | n when n mod 2 == 0 -> aux accu (k*k mod s) (n/2)\n  | n -> aux (accu*k mod s) (k*k mod s) (n/2) in\n  aux 1 k\n\nlet inv k = pow k (s-2)\n\nlet () =\n  let n = Scanf.scanf \"%d\\n\" id in\n  let l = repeat (fun () -> Scanf.scanf \"%d %d\\n\" (fun a b -> (a,b))) n in\n  let (maxa, maxb) = List.fold_left (fun (c,d) (a,b) -> (max a c, max d b)) (0, 0) l in\n  let factbl = Array.make (2*maxa+2*maxb+1) 1 in\n    for i = 1 to 2*maxa+2*maxb do Array.unsafe_set factbl i ((Array.unsafe_get factbl (i-1)) * i mod s) done;\n  let ifactbl = Array.make (2*maxa+2*maxb+1) 0 in\n    ifactbl.(2*maxa+2*maxb) <- inv factbl.(2*maxa+2*maxb);\n    for i = 2*maxa+2*maxb-1 downto 0 do Array.unsafe_set ifactbl i ((Array.unsafe_get ifactbl (i+1)) * (i+1) mod s) done;\n  let bc n k = ((factbl.(n)*ifactbl.(k) mod s) * ifactbl.(n-k) mod s) in\n  let sal = List.sort (fun (a,b) (c,d) -> compare c a) l in\n  let dp = Array.make (1 + 2 * maxb) 0 in\n  let update () = for i = 1 to 2 * maxb do Array.unsafe_set dp i ((Array.unsafe_get dp i + Array.unsafe_get dp (i-1)) mod s) done in\n  let rec solve sl m =\n    if m > maxa then ()\n      else match sl with\n           | (a, b) :: tl when a = maxa-m -> dp.(maxb-b) <- ((dp.(maxb-b) +1) mod s); solve tl m\n           | _ -> update (); solve sl (m+1) in\n  solve sal 0;\n  let rec accum accu = function\n    | 0 -> accu + dp.(0)*dp.(2*maxb) mod s\n    | k -> accum ((accu + ((s+dp.(k)-dp.(k-1)) mod s)*dp.(2*maxb-k) mod s) mod s) (k-1) in\n  let sum = accum 0 (2*maxb) in\n  let x = List.fold_left (fun x (a,b) -> (x + bc (2*a+2*b) (2*a)) mod s) 0 l in\n    print_int ((s+sum - x)*inv2 mod s)", "problem_context": "Score : 1400 points\n\nProblem Statement\n\nSnuke is having another barbeque party.\n\nThis time, he will make one serving of Skewer Meal.\n\nHe has a stock of N Skewer Meal Packs. The i-th Skewer Meal Pack contains one skewer, A_i pieces of beef and B_i pieces of green pepper.\nAll skewers in these packs are different and distinguishable, while all pieces of beef and all pieces of green pepper are, respectively, indistinguishable.\n\nTo make a Skewer Meal, he chooses two of his Skewer Meal Packs, and takes out all of the contents from the chosen packs, that is, two skewers and some pieces of beef or green pepper.\n(Remaining Skewer Meal Packs will not be used.)\nThen, all those pieces of food are threaded onto both skewers, one by one, in any order.\n\n(See the image in the Sample section for better understanding.)\n\nIn how many different ways can he make a Skewer Meal? Two ways of making a Skewer Meal is different if and only if the sets of the used skewers are different, or the orders of the pieces of food are different.\nSince this number can be extremely large, find it modulo 10^9+7.\n\nConstraints\n\n2≦N≦200,000\n\n1≦A_i≦2000, 1≦B_i≦2000\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 B_1\nA_2 B_2\n:\nA_N B_N\n\nOutput\n\nPrint the number of the different ways Snuke can make a serving of Skewer Meal, modulo 10^9+7.\n\nSample Input 1\n\n3\n1 1\n1 1\n2 1\n\nSample Output 1\n\n26\n\nThe 26 ways of making a Skewer Meal are shown below.\nGray bars represent skewers, each with a number denoting the Skewer Meal Set that contained the skewer.\nBrown and green rectangles represent pieces of beef and green pepper, respectively.", "sample_input": "3\n1 1\n1 1\n2 1\n"}, "reference_outputs": ["26\n"], "source_document_id": "p04051", "source_text": "Score : 1400 points\n\nProblem Statement\n\nSnuke is having another barbeque party.\n\nThis time, he will make one serving of Skewer Meal.\n\nHe has a stock of N Skewer Meal Packs. The i-th Skewer Meal Pack contains one skewer, A_i pieces of beef and B_i pieces of green pepper.\nAll skewers in these packs are different and distinguishable, while all pieces of beef and all pieces of green pepper are, respectively, indistinguishable.\n\nTo make a Skewer Meal, he chooses two of his Skewer Meal Packs, and takes out all of the contents from the chosen packs, that is, two skewers and some pieces of beef or green pepper.\n(Remaining Skewer Meal Packs will not be used.)\nThen, all those pieces of food are threaded onto both skewers, one by one, in any order.\n\n(See the image in the Sample section for better understanding.)\n\nIn how many different ways can he make a Skewer Meal? Two ways of making a Skewer Meal is different if and only if the sets of the used skewers are different, or the orders of the pieces of food are different.\nSince this number can be extremely large, find it modulo 10^9+7.\n\nConstraints\n\n2≦N≦200,000\n\n1≦A_i≦2000, 1≦B_i≦2000\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 B_1\nA_2 B_2\n:\nA_N B_N\n\nOutput\n\nPrint the number of the different ways Snuke can make a serving of Skewer Meal, modulo 10^9+7.\n\nSample Input 1\n\n3\n1 1\n1 1\n2 1\n\nSample Output 1\n\n26\n\nThe 26 ways of making a Skewer Meal are shown below.\nGray bars represent skewers, each with a number denoting the Skewer Meal Set that contained the skewer.\nBrown and green rectangles represent pieces of beef and green pepper, respectively.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1816, "cpu_time_ms": 590, "memory_kb": 30080}, "variant": "low_resource"}